diff --git a/doc/index.html b/doc/index.html
index 000c1c0..bfa6034 100644
--- a/doc/index.html
+++ b/doc/index.html
@@ -108,7 +108,7 @@ <h3>Modules</h3>
           <div class="col-xs-6 col-sm-3">
             <div>
               <h3>Procedures</h3>
-              <ul><li><a href='proc\adjusted_r_squared.html'>adjusted_r_squared</a></li><li><a href='proc\allan_variance.html'>allan_variance</a></li><li><a href='interface\anova.html'>anova</a></li><li><a href='proc\beta.html'>beta</a></li><li><a href='proc\bootstrap.html'>bootstrap</a></li><li><a href='proc\bootstrap_linear_least_squares.html'>bootstrap_linear_least_squares</a></li><li><a href='proc\bootstrap_nonlinear_least_squares.html'>bootstrap_nonlinear_least_squares</a></li><li><a href='interface\bootstrap_resampling_routine.html'>bootstrap_resampling_routine</a></li><li><a href='interface\bootstrap_statistic_routine.html'>bootstrap_statistic_routine</a></li><li><a href='interface\box_muller_sample.html'>box_muller_sample</a></li></ul>
+              <ul><li><a href='proc\adjusted_r_squared.html'>adjusted_r_squared</a></li><li><a href='proc\allan_variance.html'>allan_variance</a></li><li><a href='interface\anova.html'>anova</a></li><li><a href='proc\bartletts_test.html'>bartletts_test</a></li><li><a href='proc\beta.html'>beta</a></li><li><a href='proc\bootstrap.html'>bootstrap</a></li><li><a href='proc\bootstrap_linear_least_squares.html'>bootstrap_linear_least_squares</a></li><li><a href='proc\bootstrap_nonlinear_least_squares.html'>bootstrap_nonlinear_least_squares</a></li><li><a href='interface\bootstrap_resampling_routine.html'>bootstrap_resampling_routine</a></li><li><a href='interface\bootstrap_statistic_routine.html'>bootstrap_statistic_routine</a></li></ul>
             </div>
             <div>
               <ul>
@@ -119,7 +119,7 @@ <h3>Procedures</h3>
           <div class="col-xs-6 col-sm-3">
             <div>
               <h3>Derived Types</h3>
-              <ul><li><a href='type\anova_factor.html'>anova_factor</a></li><li><a href='type\binomial_distribution.html'>binomial_distribution</a></li><li><a href='type\bootstrap_regression_statistics.html'>bootstrap_regression_statistics</a></li><li><a href='type\bootstrap_statistics.html'>bootstrap_statistics</a></li><li><a href='type\chi_squared_distribution.html'>chi_squared_distribution</a></li><li><a href='type\convergence_info.html'>convergence_info</a></li><li><a href='type\distribution.html'>distribution</a></li><li><a href='type\f_distribution.html'>f_distribution</a></li><li><a href='type\iteration_controls.html'>iteration_controls</a></li><li><a href='type\lm_solver_options.html'>lm_solver_options</a></li></ul>
+              <ul><li><a href='type\anova_factor.html'>anova_factor</a></li><li><a href='type\array_container.html'>array_container</a></li><li><a href='type\binomial_distribution.html'>binomial_distribution</a></li><li><a href='type\bootstrap_regression_statistics.html'>bootstrap_regression_statistics</a></li><li><a href='type\bootstrap_statistics.html'>bootstrap_statistics</a></li><li><a href='type\chi_squared_distribution.html'>chi_squared_distribution</a></li><li><a href='type\convergence_info.html'>convergence_info</a></li><li><a href='type\distribution.html'>distribution</a></li><li><a href='type\f_distribution.html'>f_distribution</a></li><li><a href='type\iteration_controls.html'>iteration_controls</a></li></ul>
             </div>
             <div>
               <ul>
@@ -140,7 +140,7 @@ <h3>Derived Types</h3>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/interface/anova.html b/doc/interface/anova.html
index c6e73c4..5b435e1 100644
--- a/doc/interface/anova.html
+++ b/doc/interface/anova.html
@@ -74,7 +74,7 @@ <h1>anova
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title="<p> 0.3% of total for procedures.</p>Including implementation: 146 statements,  9.3% of total for procedures.">5 statements</a>
+                 title="<p> 0.3% of total for procedures.</p>Including implementation: 146 statements,  9.1% of total for procedures.">5 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -237,7 +237,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~51"></span>
+              <span class="anchor" id="variable-x~16"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -282,7 +282,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~52"></span>
+              <span class="anchor" id="variable-x~17"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -357,7 +357,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-ymod~5"></span>
+              <span class="anchor" id="variable-ymod~3"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -372,7 +372,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~24"></span>
+              <span class="anchor" id="variable-err~5"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -416,7 +416,7 @@ <h4>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/interface/bootstrap_resampling_routine.html b/doc/interface/bootstrap_resampling_routine.html
index ca8832e..242eb70 100644
--- a/doc/interface/bootstrap_resampling_routine.html
+++ b/doc/interface/bootstrap_resampling_routine.html
@@ -74,7 +74,7 @@ <h1>bootstrap_resampling_routine
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 0.8% of total for procedures.">12 statements</a>
+                 title=" 0.7% of total for procedures.">12 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -153,7 +153,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x"></span>
+              <span class="anchor" id="variable-x~8"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -205,7 +205,7 @@ <h3>Description</h3>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/interface/bootstrap_statistic_routine.html b/doc/interface/bootstrap_statistic_routine.html
index 2996269..0f37d2d 100644
--- a/doc/interface/bootstrap_statistic_routine.html
+++ b/doc/interface/bootstrap_statistic_routine.html
@@ -74,7 +74,7 @@ <h1>bootstrap_statistic_routine
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 0.8% of total for procedures.">12 statements</a>
+                 title=" 0.7% of total for procedures.">12 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -153,7 +153,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~2"></span>
+              <span class="anchor" id="variable-x~9"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -169,7 +169,7 @@ <h3>Arguments</h3>
     </tbody>
   </table>
 
-      <h3>Return Value <span class="anchor" id="variable-rst"></span><small>real(kind=real64)</small></h3>
+      <h3>Return Value <span class="anchor" id="variable-rst~10"></span><small>real(kind=real64)</small></h3>
     <p>The resulting statistic.</p>
     <h3>Description</h3>
     <p>Defines the signature of a function for computing the desired
@@ -191,7 +191,7 @@ <h3>Description</h3>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/interface/box_muller_sample.html b/doc/interface/box_muller_sample.html
index 65df087..6527f6e 100644
--- a/doc/interface/box_muller_sample.html
+++ b/doc/interface/box_muller_sample.html
@@ -74,7 +74,7 @@ <h1>box_muller_sample
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title="<p> 0.3% of total for procedures.</p>Including implementation: 31 statements,  2.0% of total for procedures.">4 statements</a>
+                 title="<p> 0.2% of total for procedures.</p>Including implementation: 31 statements,  1.9% of total for procedures.">4 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -262,7 +262,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-n~13"></span>
+              <span class="anchor" id="variable-n"></span>
               integer(kind=int32),
             </td>
 <td>intent(in)</td>
@@ -301,7 +301,7 @@ <h4>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/interface/confidence_interval.html b/doc/interface/confidence_interval.html
index 88550af..795cc69 100644
--- a/doc/interface/confidence_interval.html
+++ b/doc/interface/confidence_interval.html
@@ -74,7 +74,7 @@ <h1>confidence_interval
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title="<p> 0.3% of total for procedures.</p>Including implementation: 34 statements,  2.2% of total for procedures.">4 statements</a>
+                 title="<p> 0.2% of total for procedures.</p>Including implementation: 34 statements,  2.1% of total for procedures.">4 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -190,7 +190,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-alpha~11"></span>
+              <span class="anchor" id="variable-alpha~12"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -221,7 +221,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-n~27"></span>
+              <span class="anchor" id="variable-n~36"></span>
               integer(kind=int32),
             </td>
 <td>intent(in)</td>
@@ -281,7 +281,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-alpha~12"></span>
+              <span class="anchor" id="variable-alpha~13"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -297,7 +297,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~44"></span>
+              <span class="anchor" id="variable-x~51"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -336,7 +336,7 @@ <h4>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/interface/distribution_function.html b/doc/interface/distribution_function.html
index 732ed6e..37fa9ff 100644
--- a/doc/interface/distribution_function.html
+++ b/doc/interface/distribution_function.html
@@ -74,7 +74,7 @@ <h1>distribution_function
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 1.0% of total for procedures.">15 statements</a>
+                 title=" 0.9% of total for procedures.">15 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -168,7 +168,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~15"></span>
+              <span class="anchor" id="variable-x~39"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -184,7 +184,7 @@ <h3>Arguments</h3>
     </tbody>
   </table>
 
-      <h3>Return Value <span class="anchor" id="variable-rst~10"></span><small>real(kind=real64)</small></h3>
+      <h3>Return Value <span class="anchor" id="variable-rst~32"></span><small>real(kind=real64)</small></h3>
     <p>The value of the function.</p>
     <h3>Description</h3>
     <p>Defines the interface for a probability distribution function.</p>
@@ -205,7 +205,7 @@ <h3>Description</h3>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/interface/distribution_property.html b/doc/interface/distribution_property.html
index 1a6a5cb..78cceeb 100644
--- a/doc/interface/distribution_property.html
+++ b/doc/interface/distribution_property.html
@@ -74,7 +74,7 @@ <h1>distribution_property
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 1.0% of total for procedures.">15 statements</a>
+                 title=" 0.9% of total for procedures.">15 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -169,7 +169,7 @@ <h3>Arguments</h3>
     </tbody>
   </table>
 
-      <h3>Return Value <span class="anchor" id="variable-rst~11"></span><small>real(kind=real64)</small></h3>
+      <h3>Return Value <span class="anchor" id="variable-rst~33"></span><small>real(kind=real64)</small></h3>
     <p>The property value.</p>
     <h3>Description</h3>
     <p>Computes the value of a distribution property.</p>
@@ -190,7 +190,7 @@ <h3>Description</h3>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/interface/iteration_update.html b/doc/interface/iteration_update.html
index ecc1d5d..81b9389 100644
--- a/doc/interface/iteration_update.html
+++ b/doc/interface/iteration_update.html
@@ -153,7 +153,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-iter"></span>
+              <span class="anchor" id="variable-iter~2"></span>
               integer(kind=int32),
             </td>
 <td>intent(in)</td>
@@ -183,7 +183,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-resid~4"></span>
+              <span class="anchor" id="variable-resid~5"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -246,7 +246,7 @@ <h3>Arguments</h3>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/interface/pooled_variance.html b/doc/interface/pooled_variance.html
new file mode 100644
index 0000000..80eeea2
--- /dev/null
+++ b/doc/interface/pooled_variance.html
@@ -0,0 +1,302 @@
+<!-- -*- mode: jinja2 -*- -->
+
+<!DOCTYPE html>
+<html lang="en">
+  <head>
+    <meta charset="utf-8">
+    <meta http-equiv="X-UA-Compatible" content="IE=edge">
+    <meta name="viewport" content="width=device-width, initial-scale=1">
+      <meta name="description" content="FSTATS is a modern Fortran statistical library containing routines for computing basic statistical properties, hypothesis testing, regression, special functions, and experimental design.">
+    <meta name="author" content="Jason Christopherson" >
+    <link rel="icon" href="../favicon.png">
+
+    <title>pooled_variance &ndash; FSTATS</title>
+
+    <link href="https://cdn.jsdelivr.net/npm/bootstrap@5.1.3/dist/css/bootstrap.min.css" rel="stylesheet"
+          integrity="sha384-1BmE4kWBq78iYhFldvKuhfTAU6auU8tT94WrHftjDbrCEXSU1oBoqyl2QvZ6jIW3" crossorigin="anonymous">
+    <link href="../css/pygments.css" rel="stylesheet">
+    <link href="../css/font-awesome.min.css" rel="stylesheet">
+    <link href="../css/local.css" rel="stylesheet">
+      <link  href="../tipuesearch/tipuesearch.css" rel="stylesheet">
+
+    <script src="https://code.jquery.com/jquery-3.7.1.min.js" integrity="sha256-/JqT3SQfawRcv/BIHPThkBvs0OEvtFFmqPF/lYI/Cxo=" crossorigin="anonymous"></script>
+    <script src="../js/svg-pan-zoom.min.js"></script>
+  </head>
+
+  <body>
+
+    <!-- Fixed navbar -->
+    <div class="container-fluid mb-sm-4 mb-xl-2">
+      <nav class="navbar navbar-expand-lg navbar-dark bg-dark fixed-top">
+        <div class="container">
+          <a class="navbar-brand" href="../index.html">FSTATS </a>
+          <button type="button" class="navbar-toggler" data-bs-toggle="collapse" data-bs-target="#navbar"
+                  aria-expanded="false" aria-controls="navbar" aria-label="Toggle navigation">
+                  <span class="navbar-toggler-icon">
+          </button>
+
+          <div id="navbar" class="navbar-collapse collapse">
+            <ul class="navbar-nav">
+                  <li class="nav-item">
+                    <a class="nav-link" href="../lists/files.html">Source Files</a>
+                  </li>
+                <li class="nav-item">
+                  <a class="nav-link" href="../lists/modules.html">Modules</a>
+                </li>
+                <li class="nav-item">
+                  <a class="nav-link" href="../lists/procedures.html">Procedures</a>
+                </li>
+                <li class="nav-item">
+                  <a class="nav-link" href="../lists/types.html">Derived Types</a>
+                </li>
+            </ul>
+              <div class="d-flex align-items-end flex-grow-1">
+                <form action="../search.html" role="search" class="ms-auto">
+                  <input type="text" class="form-control" aria-label="Search" placeholder="Search" name="q" id="tipue_search_input" autocomplete="off" required>
+                </form>
+              </div>
+          </div><!--/.nav-collapse -->
+        </div>
+      </nav>
+    </div>
+
+    <div class="container">
+  <div class="row">
+    <h1>pooled_variance
+      <small>Interface</small>
+      
+    </h1>
+      <div class="container p-2 mb-4 bg-light border rounded-3">
+    <div class="row align-items-center justify-content-between" id="info-bar">
+      <div class="col">
+        <ul class="list-inline" style="margin-bottom:0px;display:inline">
+
+            <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
+              <a data-bs-toggle="tooltip"
+                 data-bs-placement="bottom" data-html="true"
+                 title="<p> 0.2% of total for procedures.</p>Including implementation: 32 statements,  2.0% of total for procedures.">4 statements</a>
+            </li>
+
+            <li class="list-inline-item" id="source-file">
+              <i class="fa fa-code"></i>
+              <a href="../src/fstats_descriptive_statistics.f90"> Source File</a>
+            </li>
+        </ul>
+      </div>
+      <div class="col">
+        <nav aria-label="breadcrumb">
+          <ol class="breadcrumb justify-content-end mb-0">
+                <li class="breadcrumb-item"><a href='..\sourcefile\fstats_descriptive_statistics.f90.html'>fstats_descriptive_statistics.f90</a></li>
+                <li class="breadcrumb-item"><a href='..\module\fstats_descriptive_statistics.html'>fstats_descriptive_statistics</a></li>
+            <li class="breadcrumb-item active" aria-current="page">pooled_variance</li>
+          </ol>
+        </nav>
+      </div>
+    </div>
+  </div>
+  <script>
+    $(function () {
+    $('[data-bs-toggle="tooltip"]').tooltip()
+    })
+  </script>
+
+  </div>
+
+  <div class="row">
+    <div class="col-md-3 hidden-xs hidden-sm visible-md visible-lg">
+        <div id="sidebar">
+      <h3>Contents</h3>
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+      <div class="card mb-4">
+      <a data-bs-toggle="collapse" href="#modprocs-0"
+         aria-expanded="false" aria-controls="modprocs-0">
+         <h4 class="card-header bg-primary text-white">Module Procedures</h4>
+      </a>
+      <div id="modprocs-0" class="collapse">
+        <div class="list-group list-group-flush">
+            <a class="list-group-item" href="../interface/pooled_variance.html#moduleprocedure-pooled_variance_1">pooled_variance_1</a>
+            <a class="list-group-item" href="../interface/pooled_variance.html#moduleprocedure-pooled_variance_2">pooled_variance_2</a>
+        </div>
+      </div>
+    </div>
+
+  
+
+
+  </div>
+
+    </div>
+
+    <div class="col-md-9" id='text'>
+      <h2>public interface pooled_variance</h2>
+      <p>Computes the pooled estimate of variance.</p>
+<br>
+
+
+        <h2>Module Procedures</h2>
+            <div class="card">
+    <div class="card-header codesum"><span class="anchor" id="proc-pooled_variance_1"></span> <h3>private pure function pooled_variance_1(si, ni) result(rst)  
+</h3></div>
+    <div class="card-body">
+        <p>Computes the pooled estimate of variance.</p>
+
+  <h4>Arguments</h4>
+      <table class="table table-striped varlist">
+    <thead>
+      <tr>
+        <th scope="col">Type</th>
+<th scope="col">Intent</th><th scope="col">Optional</th>        <th scope="col">Attributes</th>
+        <th scope="col"></th>
+        <th scope="col">Name</th>
+        <th scope="col"></th>
+    </thead>
+    <tbody>
+        <tr>
+            <td>
+              <span class="anchor" id="variable-si"></span>
+              real(kind=real64),
+            </td>
+<td>intent(in),</td>
+              <td></td>            <td>
+              dimension(:)
+            </td>
+            <td>::</td>
+            <td><strong>si</strong></td>
+            <td>
+                <p>An N-element array containing the estimates for each of the N
+variances.</p>
+            </td>
+        </tr>
+        <tr>
+            <td>
+              <span class="anchor" id="variable-ni"></span>
+              integer(kind=int32),
+            </td>
+<td>intent(in),</td>
+              <td></td>            <td>
+              dimension(size(si))
+            </td>
+            <td>::</td>
+            <td><strong>ni</strong></td>
+            <td>
+                <p>An N-element array containing the number of data points in each
+of the data sets used to compute the variances in si.</p>
+            </td>
+        </tr>
+    </tbody>
+  </table>
+
+    <h4>
+    Return Value
+    <small>real(kind=real64)</small>
+    </h4>
+    <p>The pooled variance.</p>
+
+    </div>
+  </div>
+
+            <div class="card">
+    <div class="card-header codesum"><span class="anchor" id="proc-pooled_variance_2"></span> <h3>private pure function pooled_variance_2(x) result(rst)  
+</h3></div>
+    <div class="card-body">
+        <p>Computes the pooled estimate of variance.</p>
+
+  <h4>Arguments</h4>
+      <table class="table table-striped varlist">
+    <thead>
+      <tr>
+        <th scope="col">Type</th>
+<th scope="col">Intent</th><th scope="col">Optional</th>        <th scope="col">Attributes</th>
+        <th scope="col"></th>
+        <th scope="col">Name</th>
+        <th scope="col"></th>
+    </thead>
+    <tbody>
+        <tr>
+            <td>
+              <span class="anchor" id="variable-x~28"></span>
+              type(<a href='..\type\array_container.html'>array_container</a>),
+            </td>
+<td>intent(in),</td>
+              <td></td>            <td>
+              dimension(:)
+            </td>
+            <td>::</td>
+            <td><strong>x</strong></td>
+            <td>
+                <p>An array of arrays of data.</p>
+            </td>
+        </tr>
+    </tbody>
+  </table>
+
+    <h4>
+    Return Value
+    <small>real(kind=real64)</small>
+    </h4>
+    <p>The pooled variance.</p>
+
+    </div>
+  </div>
+
+</div>
+  </div>
+      <hr>
+    </div> <!-- /container -->
+    <footer>
+      <div class="container">
+        <div class="row justify-content-between">
+          <div class="col"><p>FSTATS was developed by Jason Christopherson<br>&copy; 2024 
+</p>
+          </div>
+          <div class="col">
+            <p class="text-end">
+              Documentation generated by
+              <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
+ on 2024-04-16 13:46              </p>
+          </div>
+        </div>
+        <br>
+      </div> <!-- /container -->
+    </footer>
+
+    <!-- Bootstrap core JavaScript -->
+    <!-- Placed at the end of the document so the pages load faster -->
+    <script src="https://cdn.jsdelivr.net/npm/bootstrap@5.1.3/dist/js/bootstrap.bundle.min.js"
+            integrity="sha384-ka7Sk0Gln4gmtz2MlQnikT1wXgYsOg+OMhuP+IlRH9sENBO0LRn5q+8nbTov4+1p" crossorigin="anonymous"></script>    
+
+    <!-- MathJax JavaScript
+             ================================================== -->
+             <!-- Placed at the end of the document so the pages load faster -->
+        <script type="text/x-mathjax-config">
+          MathJax.Hub.Config({
+          TeX: { extensions: ['AMSmath.js','AMSsymbols.js','noErrors.js','noUndefined.js'], equationNumbers: { autoNumber: 'AMS' } },
+          jax: ['input/TeX','input/MathML','output/HTML-CSS'],
+          extensions: ['tex2jax.js','mml2jax.js','MathMenu.js','MathZoom.js']
+          });
+        </script>
+        <script src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML"></script>
+
+          <script src="../tipuesearch/tipuesearch_content.js"></script>
+          <script src="../tipuesearch/tipuesearch_set.js"></script>
+          <script src="../tipuesearch/tipuesearch.js"></script>
+
+  </body>
+</html>
\ No newline at end of file
diff --git a/doc/interface/regression_function.html b/doc/interface/regression_function.html
index 43f71cb..7fa3e5c 100644
--- a/doc/interface/regression_function.html
+++ b/doc/interface/regression_function.html
@@ -183,7 +183,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-resid~3"></span>
+              <span class="anchor" id="variable-resid~4"></span>
               real(kind=real64),
             </td>
 <td>intent(out),</td>
@@ -231,7 +231,7 @@ <h3>Arguments</h3>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/lists/files.html b/doc/lists/files.html
index e213cf5..75c14e8 100644
--- a/doc/lists/files.html
+++ b/doc/lists/files.html
@@ -123,6 +123,10 @@ <h1>Source Files</h1>
 			   <tr>
                  <td><a href='..\sourcefile\fstats_special_functions.f90.html'>fstats_special_functions.f90</a></td>
                  <td></td>
+               </tr>
+			   <tr>
+                 <td><a href='..\sourcefile\fstats_types.f90.html'>fstats_types.f90</a></td>
+                 <td></td>
                </tr>
 			 </tbody></table>
 			 
@@ -140,7 +144,7 @@ <h1>Source Files</h1>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/lists/modules.html b/doc/lists/modules.html
index 93c63de..a973e3a 100644
--- a/doc/lists/modules.html
+++ b/doc/lists/modules.html
@@ -140,7 +140,12 @@ <h1>Modules</h1>
                  <td><a href='..\sourcefile\fstats_special_functions.f90.html'>fstats_special_functions.f90</a></td>
                  <td></td>
                </tr>
-<!---->			 </tbody></table>
+<!---->			   <tr class="active">
+                 <td><a href='..\module\fstats_types.html'>fstats_types</a></td>
+                 <td><a href='..\sourcefile\fstats_types.f90.html'>fstats_types.f90</a></td>
+                 <td></td>
+               </tr>
+<!--active-->			 </tbody></table>
              
         </div>
       </div>
@@ -156,7 +161,7 @@ <h1>Modules</h1>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/lists/procedures.html b/doc/lists/procedures.html
index a382b14..c93d081 100644
--- a/doc/lists/procedures.html
+++ b/doc/lists/procedures.html
@@ -86,6 +86,12 @@ <h1>Procedures</h1>
                  <td>Interface</td>
                  <td><p>Performs an analysis of variance (ANOVA) on the supplied data 
 set.</p><a href="../interface/anova.html" class="pull-right"><emph>Read more&hellip;</emph></a></td>
+               </tr>
+			   <tr>
+                 <td><a href='..\proc\bartletts_test.html'>bartletts_test</a></td>
+                 <td><a href='..\module\fstats_hypothesis.html'>fstats_hypothesis</a></td>
+                 <td>Subroutine</td>
+                 <td><p>Computes Bartlett's test statistic as follows.</p><a href="../proc/bartletts_test.html" class="pull-right"><emph>Read more&hellip;</emph></a></td>
                </tr>
 			   <tr>
                  <td><a href='..\proc\beta.html'>beta</a></td>
@@ -148,16 +154,6 @@ <h1>Procedures</h1>
                  <td>Function</td>
                  <td><p>Computes statistics for the quality of fit for a regression 
 model.</p></td>
-               </tr>
-			   <tr>
-                 <td><a href='..\proc\coefficient_matrix.html'>coefficient_matrix</a></td>
-                 <td><a href='..\module\fstats_regression.html'>fstats_regression</a></td>
-                 <td>Subroutine</td>
-                 <td><p>Computes the coefficient matrix <script type="math/tex"> X </script> to the linear 
-least-squares regression problem of <script type="math/tex"> X \beta = y </script>, where 
-<script type="math/tex"> X </script> is the coefficient matrix computed here, <script type="math/tex"> \beta </script> is 
-the vector of coefficients to be determined, and <script type="math/tex"> y </script> is the 
-vector of measured dependent variables.</p><a href="../proc/coefficient_matrix.html" class="pull-right"><emph>Read more&hellip;</emph></a></td>
                </tr>
 			   <tr>
                  <td><a href='..\interface\confidence_interval.html'>confidence_interval</a></td>
@@ -184,7 +180,17 @@ <h1>Procedures</h1>
                  <td>Subroutine</td>
                  <td><p>Computes the covariance matrix <script type="math/tex"> C </script> where 
 <script type="math/tex"> C = \left( X^{T} X \right)^{-1} </script> and <script type="math/tex"> X </script> is computed
-by coefficient_matrix.</p><a href="../proc/covariance_matrix.html" class="pull-right"><emph>Read more&hellip;</emph></a></td>
+by design_matrix.</p><a href="../proc/covariance_matrix.html" class="pull-right"><emph>Read more&hellip;</emph></a></td>
+               </tr>
+			   <tr>
+                 <td><a href='..\proc\design_matrix.html'>design_matrix</a></td>
+                 <td><a href='..\module\fstats_regression.html'>fstats_regression</a></td>
+                 <td>Subroutine</td>
+                 <td><p>Computes the design matrix <script type="math/tex"> X </script> for the linear 
+least-squares regression problem of <script type="math/tex"> X \beta = y </script>, where 
+<script type="math/tex"> X </script> is the matrix computed here, <script type="math/tex"> \beta </script> is 
+the vector of coefficients to be determined, and <script type="math/tex"> y </script> is the 
+vector of measured dependent variables.</p><a href="../proc/design_matrix.html" class="pull-right"><emph>Read more&hellip;</emph></a></td>
                </tr>
 			   <tr>
                  <td><a href='..\proc\difference.html'>difference</a></td>
@@ -298,6 +304,12 @@ <h1>Procedures</h1>
                  <td>Subroutine</td>
                  <td><p>Performs a nonlinear regression to fit a model using a version
 of the Levenberg-Marquardt algorithm.</p></td>
+               </tr>
+			   <tr>
+                 <td><a href='..\interface\pooled_variance.html'>pooled_variance</a></td>
+                 <td><a href='..\module\fstats_descriptive_statistics.html'>fstats_descriptive_statistics</a></td>
+                 <td>Interface</td>
+                 <td><p>Computes the pooled estimate of variance.</p></td>
                </tr>
 			   <tr>
                  <td><a href='..\proc\quantile.html'>quantile</a></td>
@@ -434,7 +446,7 @@ <h1>Procedures</h1>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/lists/types.html b/doc/lists/types.html
index 035443b..ddfce42 100644
--- a/doc/lists/types.html
+++ b/doc/lists/types.html
@@ -74,6 +74,13 @@ <h1>Derived Types</h1>
                  <td><a href='..\module\fstats_anova.html'>fstats_anova</a></td>
                  <td>None</td>
                  <td><p>Defines an ANOVA factor result.</p></td>
+               </tr>
+			   <tr>
+                 <td><a href='..\type\array_container.html'>array_container</a></td>
+                 <td><a href='..\module\fstats_types.html'>fstats_types</a></td>
+                 <td>None</td>
+                 <td><p>Provides a container for a real-valued array.  A practical use of
+this construct is in the construction of jagged arrays.</p></td>
                </tr>
 			   <tr>
                  <td><a href='..\type\binomial_distribution.html'>binomial_distribution</a></td>
@@ -177,7 +184,7 @@ <h1>Derived Types</h1>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/module/fstats.html b/doc/module/fstats.html
index 5a659e0..8c309ed 100644
--- a/doc/module/fstats.html
+++ b/doc/module/fstats.html
@@ -74,7 +74,7 @@ <h1>fstats
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 2.9% of total for modules and submodules.">81 statements</a>
+                 title=" 2.9% of total for modules and submodules.">83 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -142,19 +142,19 @@ <h3 class="card-header card-title bg-light">Uses</h3>
         <ul class="list-group list-group-flush">
             <li class="list-group-item">
               <ul class="list-inline">
-                  <li class="list-inline-item"><a href='fstats_anova.html'>fstats_anova</a></li>
                   <li class="list-inline-item"><a href='fstats_distributions.html'>fstats_distributions</a></li>
-                  <li class="list-inline-item"><a href='fstats_allan.html'>fstats_allan</a></li>
-                  <li class="list-inline-item"><a href='fstats_bootstrap.html'>fstats_bootstrap</a></li>
+                  <li class="list-inline-item"><a href='fstats_descriptive_statistics.html'>fstats_descriptive_statistics</a></li>
+                  <li class="list-inline-item"><a href='fstats_anova.html'>fstats_anova</a></li>
                   <li class="list-inline-item"><a href='fstats_regression.html'>fstats_regression</a></li>
+                  <li class="list-inline-item"><a href='fstats_bootstrap.html'>fstats_bootstrap</a></li>
                   <li class="list-inline-item"><a href='fstats_experimental_design.html'>fstats_experimental_design</a></li>
-                  <li class="list-inline-item"><a href='fstats_smoothing.html'>fstats_smoothing</a></li>
-                  <li class="list-inline-item"><a href='fstats_descriptive_statistics.html'>fstats_descriptive_statistics</a></li>
-                  <li class="list-inline-item"><a href='http://fortranwiki.org/fortran/show/iso_fortran_env'>iso_fortran_env</a></li>
                   <li class="list-inline-item"><a href='fstats_special_functions.html'>fstats_special_functions</a></li>
-                  <li class="list-inline-item"><a href='fstats_sampling.html'>fstats_sampling</a></li>
                   <li class="list-inline-item"><a href='fstats_helper_routines.html'>fstats_helper_routines</a></li>
+                  <li class="list-inline-item"><a href='fstats_smoothing.html'>fstats_smoothing</a></li>
+                  <li class="list-inline-item"><a href='fstats_sampling.html'>fstats_sampling</a></li>
+                  <li class="list-inline-item"><a href='http://fortranwiki.org/fortran/show/iso_fortran_env'>iso_fortran_env</a></li>
                   <li class="list-inline-item"><a href='fstats_hypothesis.html'>fstats_hypothesis</a></li>
+                  <li class="list-inline-item"><a href='fstats_allan.html'>fstats_allan</a></li>
               </ul>
             </li>
         </ul>
@@ -189,7 +189,7 @@ <h3 class="card-header card-title bg-light">Uses</h3>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/module/fstats_allan.html b/doc/module/fstats_allan.html
index ed84b50..100f9a7 100644
--- a/doc/module/fstats_allan.html
+++ b/doc/module/fstats_allan.html
@@ -150,8 +150,8 @@ <h3 class="card-header card-title bg-light">Uses</h3>
         <ul class="list-group list-group-flush">
             <li class="list-group-item">
               <ul class="list-inline">
-                  <li class="list-inline-item"><a href='fstats_errors.html'>fstats_errors</a></li>
                   <li class="list-inline-item"><a href='http://fortranwiki.org/fortran/show/iso_fortran_env'>iso_fortran_env</a></li>
+                  <li class="list-inline-item"><a href='fstats_errors.html'>fstats_errors</a></li>
               </ul>
             </li>
         </ul>
@@ -189,7 +189,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~40"></span>
+              <span class="anchor" id="variable-x~15"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -220,7 +220,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~13"></span>
+              <span class="anchor" id="variable-err~4"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -273,7 +273,7 @@ <h4>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/module/fstats_anova.html b/doc/module/fstats_anova.html
index 59a96af..4923b47 100644
--- a/doc/module/fstats_anova.html
+++ b/doc/module/fstats_anova.html
@@ -74,7 +74,7 @@ <h1>fstats_anova
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 7.2% of total for modules and submodules.">201 statements</a>
+                 title=" 7.0% of total for modules and submodules.">201 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -163,12 +163,12 @@ <h3 class="card-header card-title bg-light">Uses</h3>
         <ul class="list-group list-group-flush">
             <li class="list-group-item">
               <ul class="list-inline">
-                  <li class="list-inline-item"><a href='fstats_errors.html'>fstats_errors</a></li>
                   <li class="list-inline-item"><a href='fstats_descriptive_statistics.html'>fstats_descriptive_statistics</a></li>
-                  <li class="list-inline-item"><a href='http://fortranwiki.org/fortran/show/iso_fortran_env'>iso_fortran_env</a></li>
+                  <li class="list-inline-item"><a href='fstats_errors.html'>fstats_errors</a></li>
                   <li class="list-inline-item"><a href='fstats_special_functions.html'>fstats_special_functions</a></li>
                   <li class="list-inline-item"><a href='http://fortranwiki.org/fortran/show/ieee_arithmetic'>ieee_arithmetic</a></li>
                   <li class="list-inline-item">ferror</li>
+                  <li class="list-inline-item"><a href='http://fortranwiki.org/fortran/show/iso_fortran_env'>iso_fortran_env</a></li>
               </ul>
             </li>
         </ul>
@@ -279,7 +279,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~51"></span>
+              <span class="anchor" id="variable-x~16"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -323,7 +323,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~52"></span>
+              <span class="anchor" id="variable-x~17"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -397,7 +397,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-ymod~5"></span>
+              <span class="anchor" id="variable-ymod~3"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -412,7 +412,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~24"></span>
+              <span class="anchor" id="variable-err~5"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -474,7 +474,7 @@ <h4>Components</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-dof~9"></span>
+              <span class="anchor" id="variable-dof"></span>
               real(kind=real64),
             </td>
               <td>public</td>
@@ -508,7 +508,7 @@ <h4>Components</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-probability~3"></span>
+              <span class="anchor" id="variable-probability~2"></span>
               real(kind=real64),
             </td>
               <td>public</td>
@@ -542,7 +542,7 @@ <h4>Components</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-variance~7"></span>
+              <span class="anchor" id="variable-variance"></span>
               real(kind=real64),
             </td>
               <td>public</td>
@@ -890,7 +890,7 @@ <h4>Components</h4>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/module/fstats_bootstrap.html b/doc/module/fstats_bootstrap.html
index 6497349..131828b 100644
--- a/doc/module/fstats_bootstrap.html
+++ b/doc/module/fstats_bootstrap.html
@@ -74,7 +74,7 @@ <h1>fstats_bootstrap
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title="12.6% of total for modules and submodules.">351 statements</a>
+                 title="12.3% of total for modules and submodules.">351 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -188,14 +188,14 @@ <h3 class="card-header card-title bg-light">Uses</h3>
         <ul class="list-group list-group-flush">
             <li class="list-group-item">
               <ul class="list-inline">
-                  <li class="list-inline-item"><a href='https://www.openmp.org/spec-html/5.1/openmpch3.html#x156-1890003'>omp_lib</a></li>
-                  <li class="list-inline-item">linalg</li>
-                  <li class="list-inline-item"><a href='fstats_errors.html'>fstats_errors</a></li>
                   <li class="list-inline-item"><a href='fstats_distributions.html'>fstats_distributions</a></li>
-                  <li class="list-inline-item"><a href='fstats_regression.html'>fstats_regression</a></li>
+                  <li class="list-inline-item"><a href='https://www.openmp.org/spec-html/5.1/openmpch3.html#x156-1890003'>omp_lib</a></li>
                   <li class="list-inline-item"><a href='fstats_descriptive_statistics.html'>fstats_descriptive_statistics</a></li>
-                  <li class="list-inline-item"><a href='http://fortranwiki.org/fortran/show/iso_fortran_env'>iso_fortran_env</a></li>
+                  <li class="list-inline-item"><a href='fstats_regression.html'>fstats_regression</a></li>
+                  <li class="list-inline-item"><a href='fstats_errors.html'>fstats_errors</a></li>
                   <li class="list-inline-item"><a href='fstats_special_functions.html'>fstats_special_functions</a></li>
+                  <li class="list-inline-item">linalg</li>
+                  <li class="list-inline-item"><a href='http://fortranwiki.org/fortran/show/iso_fortran_env'>iso_fortran_env</a></li>
               </ul>
             </li>
         </ul>
@@ -238,7 +238,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x"></span>
+              <span class="anchor" id="variable-x~8"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -303,7 +303,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~2"></span>
+              <span class="anchor" id="variable-x~9"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -636,7 +636,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~5"></span>
+              <span class="anchor" id="variable-x~12"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -683,7 +683,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-alpha"></span>
+              <span class="anchor" id="variable-alpha~2"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -772,7 +772,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~6"></span>
+              <span class="anchor" id="variable-x~13"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -788,7 +788,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-y"></span>
+              <span class="anchor" id="variable-y~3"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -835,7 +835,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-resid"></span>
+              <span class="anchor" id="variable-resid~2"></span>
               real(kind=real64),
             </td>
 <td>intent(out),</td>
@@ -902,7 +902,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-alpha~2"></span>
+              <span class="anchor" id="variable-alpha~3"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -952,7 +952,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err"></span>
+              <span class="anchor" id="variable-err~2"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -1019,7 +1019,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~7"></span>
+              <span class="anchor" id="variable-x~14"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -1034,7 +1034,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-y~2"></span>
+              <span class="anchor" id="variable-y~4"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -1082,7 +1082,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-resid~2"></span>
+              <span class="anchor" id="variable-resid~3"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -1182,7 +1182,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-alpha~3"></span>
+              <span class="anchor" id="variable-alpha~4"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -1298,7 +1298,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~2"></span>
+              <span class="anchor" id="variable-err~3"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -1350,7 +1350,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~3"></span>
+              <span class="anchor" id="variable-x~10"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -1406,7 +1406,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~4"></span>
+              <span class="anchor" id="variable-x~11"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -1461,7 +1461,7 @@ <h4>Arguments</h4>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/module/fstats_descriptive_statistics.html b/doc/module/fstats_descriptive_statistics.html
index 247cc51..ae6625c 100644
--- a/doc/module/fstats_descriptive_statistics.html
+++ b/doc/module/fstats_descriptive_statistics.html
@@ -74,7 +74,7 @@ <h1>fstats_descriptive_statistics
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 4.7% of total for modules and submodules.">130 statements</a>
+                 title=" 5.7% of total for modules and submodules.">164 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -113,7 +113,18 @@ <h3>Contents</h3>
   
   
   
-  
+      <div class="card mb-4">
+      <a data-bs-toggle="collapse" href="#inters-0"
+         aria-expanded="false" aria-controls="inters-0">
+         <h4 class="card-header bg-primary text-white">Interfaces</h4>
+      </a>
+      <div id="inters-0" class="collapse">
+        <div class="list-group list-group-flush">
+            <a class="list-group-item" href="../module/fstats_descriptive_statistics.html#interface-pooled_variance">pooled_variance</a>
+        </div>
+      </div>
+    </div>
+
   
   
       <div class="card mb-4">
@@ -156,10 +167,11 @@ <h3 class="card-header card-title bg-light">Uses</h3>
         <ul class="list-group list-group-flush">
             <li class="list-group-item">
               <ul class="list-inline">
-                  <li class="list-inline-item">linalg</li>
                   <li class="list-inline-item"><a href='fstats_errors.html'>fstats_errors</a></li>
+                  <li class="list-inline-item">linalg</li>
                   <li class="list-inline-item">ferror</li>
                   <li class="list-inline-item"><a href='http://fortranwiki.org/fortran/show/iso_fortran_env'>iso_fortran_env</a></li>
+                  <li class="list-inline-item"><a href='fstats_types.html'>fstats_types</a></li>
               </ul>
             </li>
         </ul>
@@ -172,6 +184,126 @@ <h3 class="card-header card-title bg-light">Uses</h3>
 
 
 
+        <section>
+          <h2>Interfaces</h2>
+              <div class="card">
+    <div class="card-header bg-light codesum">
+      <span class="anchor" id="interface-pooled_variance"></span>
+      <h3>public        interface <a href='..\interface\pooled_variance.html'>pooled_variance</a> 
+      </h3>
+    </div>
+      <div class="card-body">
+        <p>Computes the pooled estimate of variance.</p>
+      </div>
+    <ul class="list-group">
+          <li class="list-group-item">
+                <h3>
+    private pure function pooled_variance_1(si, ni) result(rst)  
+
+    </h3>
+  <p>Computes the pooled estimate of variance.</p>
+
+  <h4>Arguments</h4>
+      <table class="table table-striped varlist">
+    <thead>
+      <tr>
+        <th scope="col">Type</th>
+<th scope="col">Intent</th><th scope="col">Optional</th>        <th scope="col">Attributes</th>
+        <th scope="col"></th>
+        <th scope="col">Name</th>
+        <th scope="col"></th>
+    </thead>
+    <tbody>
+        <tr>
+            <td>
+              <span class="anchor" id="variable-si"></span>
+              real(kind=real64),
+            </td>
+<td>intent(in),</td>
+              <td></td>            <td>
+              dimension(:)
+            </td>
+            <td>::</td>
+            <td><strong>si</strong></td>
+            <td>
+                <p>An N-element array containing the estimates for each of the N
+variances.</p>
+            </td>
+        </tr>
+        <tr>
+            <td>
+              <span class="anchor" id="variable-ni"></span>
+              integer(kind=int32),
+            </td>
+<td>intent(in),</td>
+              <td></td>            <td>
+              dimension(size(si))
+            </td>
+            <td>::</td>
+            <td><strong>ni</strong></td>
+            <td>
+                <p>An N-element array containing the number of data points in each
+of the data sets used to compute the variances in si.</p>
+            </td>
+        </tr>
+    </tbody>
+  </table>
+
+    <h4>
+    Return Value
+    <small>real(kind=real64)</small>
+    </h4>
+    <p>The pooled variance.</p>
+
+          </li>
+          <li class="list-group-item">
+                <h3>
+    private pure function pooled_variance_2(x) result(rst)  
+
+    </h3>
+  <p>Computes the pooled estimate of variance.</p>
+
+  <h4>Arguments</h4>
+      <table class="table table-striped varlist">
+    <thead>
+      <tr>
+        <th scope="col">Type</th>
+<th scope="col">Intent</th><th scope="col">Optional</th>        <th scope="col">Attributes</th>
+        <th scope="col"></th>
+        <th scope="col">Name</th>
+        <th scope="col"></th>
+    </thead>
+    <tbody>
+        <tr>
+            <td>
+              <span class="anchor" id="variable-x~28"></span>
+              type(<a href='..\type\array_container.html'>array_container</a>),
+            </td>
+<td>intent(in),</td>
+              <td></td>            <td>
+              dimension(:)
+            </td>
+            <td>::</td>
+            <td><strong>x</strong></td>
+            <td>
+                <p>An array of arrays of data.</p>
+            </td>
+        </tr>
+    </tbody>
+  </table>
+
+    <h4>
+    Return Value
+    <small>real(kind=real64)</small>
+    </h4>
+    <p>The pooled variance.</p>
+
+          </li>
+    </ul>
+  </div>
+
+        </section>
+        <br>
 
 
 
@@ -197,7 +329,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~14"></span>
+              <span class="anchor" id="variable-x~27"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -212,7 +344,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-y~3"></span>
+              <span class="anchor" id="variable-y~5"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -257,7 +389,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~8"></span>
+              <span class="anchor" id="variable-x~21"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -302,7 +434,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~11"></span>
+              <span class="anchor" id="variable-x~24"></span>
               real(kind=real64),
             </td>
 <td>intent(inout)</td>
@@ -349,7 +481,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~12"></span>
+              <span class="anchor" id="variable-x~25"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -409,7 +541,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~10"></span>
+              <span class="anchor" id="variable-x~23"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -454,7 +586,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~13"></span>
+              <span class="anchor" id="variable-x~26"></span>
               real(kind=real64),
             </td>
 <td>intent(inout),</td>
@@ -470,7 +602,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-p"></span>
+              <span class="anchor" id="variable-p~2"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -517,7 +649,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~9"></span>
+              <span class="anchor" id="variable-x~22"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -563,7 +695,7 @@ <h4>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/module/fstats_distributions.html b/doc/module/fstats_distributions.html
index 8457860..2b9fcb1 100644
--- a/doc/module/fstats_distributions.html
+++ b/doc/module/fstats_distributions.html
@@ -74,7 +74,7 @@ <h1>fstats_distributions
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title="10.9% of total for modules and submodules.">303 statements</a>
+                 title="10.6% of total for modules and submodules.">303 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -167,10 +167,10 @@ <h3 class="card-header card-title bg-light">Uses</h3>
         <ul class="list-group list-group-flush">
             <li class="list-group-item">
               <ul class="list-inline">
-                  <li class="list-inline-item"><a href='fstats_special_functions.html'>fstats_special_functions</a></li>
+                  <li class="list-inline-item"><a href='http://fortranwiki.org/fortran/show/iso_fortran_env'>iso_fortran_env</a></li>
                   <li class="list-inline-item"><a href='fstats_helper_routines.html'>fstats_helper_routines</a></li>
                   <li class="list-inline-item"><a href='http://fortranwiki.org/fortran/show/ieee_arithmetic'>ieee_arithmetic</a></li>
-                  <li class="list-inline-item"><a href='http://fortranwiki.org/fortran/show/iso_fortran_env'>iso_fortran_env</a></li>
+                  <li class="list-inline-item"><a href='fstats_special_functions.html'>fstats_special_functions</a></li>
               </ul>
             </li>
         </ul>
@@ -227,7 +227,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~15"></span>
+              <span class="anchor" id="variable-x~39"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -338,7 +338,7 @@ <h4>Components</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-n~12"></span>
+              <span class="anchor" id="variable-n~35"></span>
               integer(kind=int32),
             </td>
               <td>public</td>
@@ -355,7 +355,7 @@ <h4>Components</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-p~2"></span>
+              <span class="anchor" id="variable-p~10"></span>
               real(kind=real64),
             </td>
               <td>public</td>
@@ -407,7 +407,7 @@ <h4>Type-Bound Procedures</h4>
               </tr>
               <tr>
                 <td>  procedure, public ::
-  <strong><a href='..\type\binomial_distribution.html#boundprocedure-variance~6'>variance</a></strong> => bd_variance</td>
+  <strong><a href='..\type\binomial_distribution.html#boundprocedure-variance~7'>variance</a></strong> => bd_variance</td>
                 <td></td>
               </tr>
           </tbody>
@@ -440,7 +440,7 @@ <h4>Components</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-dof~2"></span>
+              <span class="anchor" id="variable-dof~6"></span>
               integer(kind=int32),
             </td>
               <td>public</td>
@@ -491,7 +491,7 @@ <h4>Type-Bound Procedures</h4>
               </tr>
               <tr>
                 <td>  procedure, public ::
-  <strong><a href='..\type\chi_squared_distribution.html#boundprocedure-variance~5'>variance</a></strong> => cs_variance</td>
+  <strong><a href='..\type\chi_squared_distribution.html#boundprocedure-variance~6'>variance</a></strong> => cs_variance</td>
                 <td></td>
               </tr>
           </tbody>
@@ -544,7 +544,7 @@ <h4>Type-Bound Procedures</h4>
               </tr>
               <tr>
                 <td>  procedure(<a href='..\interface\distribution_property.html'>distribution_property</a>), public, deferred, pass ::
-  <strong><a href='..\type\distribution.html#boundprocedure-variance'>variance</a></strong></td>
+  <strong><a href='..\type\distribution.html#boundprocedure-variance~2'>variance</a></strong></td>
                 <td>..\..\<p>Computes the variance of the distribution.<\p></td>
               </tr>
           </tbody>
@@ -577,7 +577,7 @@ <h4>Components</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-d1"></span>
+              <span class="anchor" id="variable-d1~3"></span>
               real(kind=real64),
             </td>
               <td>public</td>
@@ -594,7 +594,7 @@ <h4>Components</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-d2"></span>
+              <span class="anchor" id="variable-d2~3"></span>
               real(kind=real64),
             </td>
               <td>public</td>
@@ -645,7 +645,7 @@ <h4>Type-Bound Procedures</h4>
               </tr>
               <tr>
                 <td>  procedure, public ::
-  <strong><a href='..\type\f_distribution.html#boundprocedure-variance~4'>variance</a></strong> => fd_variance</td>
+  <strong><a href='..\type\f_distribution.html#boundprocedure-variance~5'>variance</a></strong> => fd_variance</td>
                 <td></td>
               </tr>
           </tbody>
@@ -751,7 +751,7 @@ <h4>Type-Bound Procedures</h4>
               </tr>
               <tr>
                 <td>  procedure, public ::
-  <strong><a href='..\type\normal_distribution.html#boundprocedure-variance~3'>variance</a></strong> => nd_variance</td>
+  <strong><a href='..\type\normal_distribution.html#boundprocedure-variance~4'>variance</a></strong> => nd_variance</td>
                 <td></td>
               </tr>
           </tbody>
@@ -784,7 +784,7 @@ <h4>Components</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-dof"></span>
+              <span class="anchor" id="variable-dof~5"></span>
               real(kind=real64),
             </td>
               <td>public</td>
@@ -835,7 +835,7 @@ <h4>Type-Bound Procedures</h4>
               </tr>
               <tr>
                 <td>  procedure, public ::
-  <strong><a href='..\type\t_distribution.html#boundprocedure-variance~2'>variance</a></strong> => td_variance</td>
+  <strong><a href='..\type\t_distribution.html#boundprocedure-variance~3'>variance</a></strong> => td_variance</td>
                 <td></td>
               </tr>
           </tbody>
@@ -865,7 +865,7 @@ <h4>Type-Bound Procedures</h4>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/module/fstats_errors.html b/doc/module/fstats_errors.html
index df7db54..7106266 100644
--- a/doc/module/fstats_errors.html
+++ b/doc/module/fstats_errors.html
@@ -74,7 +74,7 @@ <h1>fstats_errors
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 2.9% of total for modules and submodules.">80 statements</a>
+                 title=" 2.8% of total for modules and submodules.">80 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -173,8 +173,8 @@ <h3 class="card-header card-title bg-light">Uses</h3>
         <ul class="list-group list-group-flush">
             <li class="list-group-item">
               <ul class="list-inline">
-                  <li class="list-inline-item">ferror</li>
                   <li class="list-inline-item"><a href='http://fortranwiki.org/fortran/show/iso_fortran_env'>iso_fortran_env</a></li>
+                  <li class="list-inline-item">ferror</li>
               </ul>
             </li>
         </ul>
@@ -366,7 +366,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~16"></span>
+              <span class="anchor" id="variable-err~19"></span>
               class(errors),
             </td>
 <td>intent(inout)</td>
@@ -467,7 +467,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~18"></span>
+              <span class="anchor" id="variable-err~21"></span>
               class(errors),
             </td>
 <td>intent(inout)</td>
@@ -582,7 +582,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~20"></span>
+              <span class="anchor" id="variable-err~23"></span>
               class(errors),
             </td>
 <td>intent(inout)</td>
@@ -667,7 +667,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~17"></span>
+              <span class="anchor" id="variable-err~20"></span>
               class(errors),
             </td>
 <td>intent(inout)</td>
@@ -797,7 +797,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~15"></span>
+              <span class="anchor" id="variable-err~18"></span>
               class(errors),
             </td>
 <td>intent(inout)</td>
@@ -867,7 +867,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~19"></span>
+              <span class="anchor" id="variable-err~22"></span>
               class(errors),
             </td>
 <td>intent(inout)</td>
@@ -952,7 +952,7 @@ <h4>Arguments</h4>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/module/fstats_experimental_design.html b/doc/module/fstats_experimental_design.html
index 52eb3d1..9c5f8ce 100644
--- a/doc/module/fstats_experimental_design.html
+++ b/doc/module/fstats_experimental_design.html
@@ -74,7 +74,7 @@ <h1>fstats_experimental_design
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 2.4% of total for modules and submodules.">66 statements</a>
+                 title=" 2.3% of total for modules and submodules.">66 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -151,8 +151,8 @@ <h3 class="card-header card-title bg-light">Uses</h3>
         <ul class="list-group list-group-flush">
             <li class="list-group-item">
               <ul class="list-inline">
-                  <li class="list-inline-item"><a href='fstats_errors.html'>fstats_errors</a></li>
                   <li class="list-inline-item"><a href='http://fortranwiki.org/fortran/show/iso_fortran_env'>iso_fortran_env</a></li>
+                  <li class="list-inline-item"><a href='fstats_errors.html'>fstats_errors</a></li>
               </ul>
             </li>
         </ul>
@@ -227,7 +227,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~23"></span>
+              <span class="anchor" id="variable-err~7"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -290,7 +290,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-m~7"></span>
+              <span class="anchor" id="variable-m~2"></span>
               integer(kind=int32),
             </td>
 <td>intent(out)</td>
@@ -305,7 +305,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-n~31"></span>
+              <span class="anchor" id="variable-n~23"></span>
               integer(kind=int32),
             </td>
 <td>intent(out)</td>
@@ -320,7 +320,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~22"></span>
+              <span class="anchor" id="variable-err~6"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -364,7 +364,7 @@ <h4>Arguments</h4>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/module/fstats_helper_routines.html b/doc/module/fstats_helper_routines.html
index 6c1fd95..badc1bd 100644
--- a/doc/module/fstats_helper_routines.html
+++ b/doc/module/fstats_helper_routines.html
@@ -189,7 +189,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~41"></span>
+              <span class="anchor" id="variable-x~19"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -235,7 +235,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~42"></span>
+              <span class="anchor" id="variable-x~20"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -281,7 +281,7 @@ <h4>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/module/fstats_hypothesis.html b/doc/module/fstats_hypothesis.html
index 3a36896..3c8f3d0 100644
--- a/doc/module/fstats_hypothesis.html
+++ b/doc/module/fstats_hypothesis.html
@@ -74,7 +74,7 @@ <h1>fstats_hypothesis
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 6.3% of total for modules and submodules.">175 statements</a>
+                 title=" 7.1% of total for modules and submodules.">204 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -135,6 +135,7 @@ <h4 class="card-header bg-primary text-white">Subroutines</h4>
       </a>
       <div id="subs-0" class="collapse">
         <div class="list-group list-group-flush">
+            <a class="list-group-item" href="../module/fstats_hypothesis.html#proc-bartletts_test">bartletts_test</a>
             <a class="list-group-item" href="../module/fstats_hypothesis.html#proc-f_test">f_test</a>
             <a class="list-group-item" href="../module/fstats_hypothesis.html#proc-t_test_equal_variance">t_test_equal_variance</a>
             <a class="list-group-item" href="../module/fstats_hypothesis.html#proc-t_test_paired">t_test_paired</a>
@@ -164,12 +165,13 @@ <h3 class="card-header card-title bg-light">Uses</h3>
         <ul class="list-group list-group-flush">
             <li class="list-group-item">
               <ul class="list-inline">
-                  <li class="list-inline-item"><a href='fstats_errors.html'>fstats_errors</a></li>
                   <li class="list-inline-item"><a href='fstats_distributions.html'>fstats_distributions</a></li>
                   <li class="list-inline-item"><a href='fstats_descriptive_statistics.html'>fstats_descriptive_statistics</a></li>
-                  <li class="list-inline-item"><a href='http://fortranwiki.org/fortran/show/iso_fortran_env'>iso_fortran_env</a></li>
+                  <li class="list-inline-item"><a href='fstats_errors.html'>fstats_errors</a></li>
                   <li class="list-inline-item"><a href='fstats_special_functions.html'>fstats_special_functions</a></li>
                   <li class="list-inline-item"><a href='http://fortranwiki.org/fortran/show/ieee_arithmetic'>ieee_arithmetic</a></li>
+                  <li class="list-inline-item"><a href='http://fortranwiki.org/fortran/show/iso_fortran_env'>iso_fortran_env</a></li>
+                  <li class="list-inline-item"><a href='fstats_types.html'>fstats_types</a></li>
               </ul>
             </li>
         </ul>
@@ -234,7 +236,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-alpha~11"></span>
+              <span class="anchor" id="variable-alpha~12"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -265,7 +267,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-n~27"></span>
+              <span class="anchor" id="variable-n~36"></span>
               integer(kind=int32),
             </td>
 <td>intent(in)</td>
@@ -324,7 +326,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-alpha~12"></span>
+              <span class="anchor" id="variable-alpha~13"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -340,7 +342,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~44"></span>
+              <span class="anchor" id="variable-x~51"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -374,6 +376,78 @@ <h4>
 
         <section>
           <h2>Subroutines</h2>
+              <div class="card">
+    <div class="card-header codesum"><span class="anchor" id="proc-bartletts_test"></span> <h3>public  subroutine <a href='..\proc\bartletts_test.html'>bartletts_test</a>(x, stat, p)  
+</h3></div>
+    <div class="card-body">
+          
+  <p>Computes Bartlett's test statistic as follows.</p><a href="../proc/bartletts_test.html" class="pull-right"><emph>Read more&hellip;</emph></a>
+
+  <h4>Arguments</h4>
+      <table class="table table-striped varlist">
+    <thead>
+      <tr>
+        <th scope="col">Type</th>
+<th scope="col">Intent</th><th scope="col">Optional</th>        <th scope="col">Attributes</th>
+        <th scope="col"></th>
+        <th scope="col">Name</th>
+        <th scope="col"></th>
+    </thead>
+    <tbody>
+        <tr>
+            <td>
+              <span class="anchor" id="variable-x~55"></span>
+              type(<a href='..\type\array_container.html'>array_container</a>),
+            </td>
+<td>intent(in),</td>
+              <td></td>            <td>
+              dimension(:)
+            </td>
+            <td>::</td>
+            <td><strong>x</strong></td>
+            <td>
+<p>The arrays of data to analyze.</p>
+            </td>
+        </tr>
+        <tr>
+            <td>
+              <span class="anchor" id="variable-stat~6"></span>
+              real(kind=real64),
+            </td>
+<td>intent(out)</td>
+              <td></td>            <td>
+              
+            </td>
+            <td>::</td>
+            <td><strong>stat</strong></td>
+            <td>
+<p>The Bartlett's test statistic.</p>
+            </td>
+        </tr>
+        <tr>
+            <td>
+              <span class="anchor" id="variable-p~15"></span>
+              real(kind=real64),
+            </td>
+<td>intent(out)</td>
+              <td></td>            <td>
+              
+            </td>
+            <td>::</td>
+            <td><strong>p</strong></td>
+            <td>
+<p>The probability value that the variances of each data set are
+equivalent.  A low p-value, less than some significance level,
+indicates a non-equivalance of variances.</p>
+            </td>
+        </tr>
+    </tbody>
+  </table>
+
+
+    </div>
+  </div>
+
               <div class="card">
     <div class="card-header codesum"><span class="anchor" id="proc-f_test"></span> <h3>public  subroutine <a href='..\proc\f_test.html'>f_test</a>(x1, x2, stat, p, dof1, dof2)  
 </h3></div>
@@ -440,7 +514,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-p~13"></span>
+              <span class="anchor" id="variable-p~14"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -457,7 +531,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-dof1"></span>
+              <span class="anchor" id="variable-dof1~2"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -472,7 +546,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-dof2"></span>
+              <span class="anchor" id="variable-dof2~2"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -558,7 +632,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-p~10"></span>
+              <span class="anchor" id="variable-p~11"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -575,7 +649,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-dof~6"></span>
+              <span class="anchor" id="variable-dof~7"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -660,7 +734,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-p~12"></span>
+              <span class="anchor" id="variable-p~13"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -677,7 +751,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-dof~8"></span>
+              <span class="anchor" id="variable-dof~9"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -692,7 +766,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~14"></span>
+              <span class="anchor" id="variable-err~24"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -782,7 +856,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-p~11"></span>
+              <span class="anchor" id="variable-p~12"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -799,7 +873,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-dof~7"></span>
+              <span class="anchor" id="variable-dof~8"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -839,7 +913,7 @@ <h4>Arguments</h4>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/module/fstats_regression.html b/doc/module/fstats_regression.html
index 773cfa0..e9f70ee 100644
--- a/doc/module/fstats_regression.html
+++ b/doc/module/fstats_regression.html
@@ -74,7 +74,7 @@ <h1>fstats_regression
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title="30.9% of total for modules and submodules.">861 statements</a>
+                 title="30.1% of total for modules and submodules.">861 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -177,8 +177,8 @@ <h4 class="card-header bg-primary text-white">Subroutines</h4>
       </a>
       <div id="subs-0" class="collapse">
         <div class="list-group list-group-flush">
-            <a class="list-group-item" href="../module/fstats_regression.html#proc-coefficient_matrix">coefficient_matrix</a>
             <a class="list-group-item" href="../module/fstats_regression.html#proc-covariance_matrix">covariance_matrix</a>
+            <a class="list-group-item" href="../module/fstats_regression.html#proc-design_matrix">design_matrix</a>
             <a class="list-group-item" href="../module/fstats_regression.html#proc-jacobian">jacobian</a>
             <a class="list-group-item" href="../module/fstats_regression.html#proc-linear_least_squares">linear_least_squares</a>
             <a class="list-group-item" href="../module/fstats_regression.html#proc-nonlinear_least_squares">nonlinear_least_squares</a>
@@ -207,15 +207,15 @@ <h3 class="card-header card-title bg-light">Uses</h3>
         <ul class="list-group list-group-flush">
             <li class="list-group-item">
               <ul class="list-inline">
-                  <li class="list-inline-item">linalg</li>
-                  <li class="list-inline-item"><a href='fstats_errors.html'>fstats_errors</a></li>
                   <li class="list-inline-item"><a href='fstats_distributions.html'>fstats_distributions</a></li>
-                  <li class="list-inline-item">blas</li>
                   <li class="list-inline-item"><a href='fstats_descriptive_statistics.html'>fstats_descriptive_statistics</a></li>
-                  <li class="list-inline-item"><a href='http://fortranwiki.org/fortran/show/iso_fortran_env'>iso_fortran_env</a></li>
+                  <li class="list-inline-item">blas</li>
+                  <li class="list-inline-item"><a href='fstats_errors.html'>fstats_errors</a></li>
                   <li class="list-inline-item"><a href='fstats_special_functions.html'>fstats_special_functions</a></li>
-                  <li class="list-inline-item"><a href='fstats_hypothesis.html'>fstats_hypothesis</a></li>
+                  <li class="list-inline-item">linalg</li>
                   <li class="list-inline-item">ferror</li>
+                  <li class="list-inline-item"><a href='http://fortranwiki.org/fortran/show/iso_fortran_env'>iso_fortran_env</a></li>
+                  <li class="list-inline-item"><a href='fstats_hypothesis.html'>fstats_hypothesis</a></li>
               </ul>
             </li>
         </ul>
@@ -325,7 +325,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-iter"></span>
+              <span class="anchor" id="variable-iter~2"></span>
               integer(kind=int32),
             </td>
 <td>intent(in)</td>
@@ -355,7 +355,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-resid~4"></span>
+              <span class="anchor" id="variable-resid~5"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -463,7 +463,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-resid~3"></span>
+              <span class="anchor" id="variable-resid~4"></span>
               real(kind=real64),
             </td>
 <td>intent(out),</td>
@@ -1049,7 +1049,7 @@ <h4>Components</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-probability~2"></span>
+              <span class="anchor" id="variable-probability~3"></span>
               real(kind=real64),
             </td>
               <td>public</td>
@@ -1066,7 +1066,7 @@ <h4>Components</h4>
 low probability (p-value), typically 0.05 or lower; however, a 
 p-value of up to ~0.2 may be acceptable dependent upon the 
 problem.  Typically any p-value larger than ~0.2 indicates the 
-parameter is not statistically important for the model.</p><a href="../type/regression_statistics.html#variable-probability~2" class="pull-right"><emph>Read more&hellip;</emph></a>
+parameter is not statistically important for the model.</p><a href="../type/regression_statistics.html#variable-probability~3" class="pull-right"><emph>Read more&hellip;</emph></a>
             </td>
         </tr>
         <tr>
@@ -1152,7 +1152,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~32"></span>
+              <span class="anchor" id="variable-x~30"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -1184,7 +1184,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~4"></span>
+              <span class="anchor" id="variable-err~9"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -1235,7 +1235,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-resid~6"></span>
+              <span class="anchor" id="variable-resid~7"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -1265,7 +1265,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-c~7"></span>
+              <span class="anchor" id="variable-c~8"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -1280,7 +1280,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-alpha~6"></span>
+              <span class="anchor" id="variable-alpha~7"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -1297,7 +1297,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~8"></span>
+              <span class="anchor" id="variable-err~13"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -1349,7 +1349,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~33"></span>
+              <span class="anchor" id="variable-x~31"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -1364,7 +1364,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-y~4"></span>
+              <span class="anchor" id="variable-y~6"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -1409,7 +1409,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~31"></span>
+              <span class="anchor" id="variable-x~29"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -1441,7 +1441,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~3"></span>
+              <span class="anchor" id="variable-err~8"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -1477,15 +1477,13 @@ <h4>
         <section>
           <h2>Subroutines</h2>
               <div class="card">
-    <div class="card-header codesum"><span class="anchor" id="proc-coefficient_matrix"></span> <h3>public  subroutine <a href='..\proc\coefficient_matrix.html'>coefficient_matrix</a>(order, intercept, x, c, err)  
+    <div class="card-header codesum"><span class="anchor" id="proc-covariance_matrix"></span> <h3>public  subroutine <a href='..\proc\covariance_matrix.html'>covariance_matrix</a>(x, c, err)  
 </h3></div>
     <div class="card-body">
           
-  <p>Computes the coefficient matrix <script type="math/tex"> X </script> to the linear 
-least-squares regression problem of <script type="math/tex"> X \beta = y </script>, where 
-<script type="math/tex"> X </script> is the coefficient matrix computed here, <script type="math/tex"> \beta </script> is 
-the vector of coefficients to be determined, and <script type="math/tex"> y </script> is the 
-vector of measured dependent variables.</p><a href="../proc/coefficient_matrix.html" class="pull-right"><emph>Read more&hellip;</emph></a>
+  <p>Computes the covariance matrix <script type="math/tex"> C </script> where 
+<script type="math/tex"> C = \left( X^{T} X \right)^{-1} </script> and <script type="math/tex"> X </script> is computed
+by design_matrix.</p><a href="../proc/covariance_matrix.html" class="pull-right"><emph>Read more&hellip;</emph></a>
 
   <h4>Arguments</h4>
       <table class="table table-striped varlist">
@@ -1500,39 +1498,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-order~2"></span>
-              integer(kind=int32),
-            </td>
-<td>intent(in)</td>
-              <td></td>            <td>
-              
-            </td>
-            <td>::</td>
-            <td><strong>order</strong></td>
-            <td>
-<p>The order of the equation to fit.  This value must be
-at least one (linear equation), but can be higher as desired.</p>
-            </td>
-        </tr>
-        <tr>
-            <td>
-              <span class="anchor" id="variable-intercept~3"></span>
-              logical,
-            </td>
-<td>intent(in)</td>
-              <td></td>            <td>
-              
-            </td>
-            <td>::</td>
-            <td><strong>intercept</strong></td>
-            <td>
-<p>Set to true if the intercept is being computed
-as part of the regression; else, false.</p>
-            </td>
-        </tr>
-        <tr>
-            <td>
-              <span class="anchor" id="variable-x~34"></span>
+              <span class="anchor" id="variable-x~33"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -1540,15 +1506,15 @@ <h4>Arguments</h4>
               
             </td>
             <td>::</td>
-            <td><strong>x</strong>(:)</td>
+            <td><strong>x</strong>(:,:)</td>
             <td>
-<p>An N-element array containing the independent variable
-measurement points.</p>
+<p>An M-by-N matrix containing the formatted independent data
+ matrix <script type="math/tex"> X </script> as computed by design_matrix.</p>
             </td>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-c~4"></span>
+              <span class="anchor" id="variable-c~6"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -1558,14 +1524,12 @@ <h4>Arguments</h4>
             <td>::</td>
             <td><strong>c</strong>(:,:)</td>
             <td>
-<p>An N-by-K matrix where the results will be written.  K
-must equal order + 1 in the event intercept is true; 
-however, if intercept is false, K must equal order.</p>
+<p>The N-by-N covariance matrix.</p>
             </td>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~5"></span>
+              <span class="anchor" id="variable-err~11"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -1578,8 +1542,10 @@ <h4>Arguments</h4>
 <p>A mechanism for communicating errors and warnings to the 
 caller.  Possible warning and error codes are as follows.
 - FS_NO_ERROR: No errors encountered.
-- FS_ARRAY_SIZE_ERROR: Occurs if c is not properly sized.
-- FS_INVALID_INPUT_ERROR: Occurs if order is less than 1.</p>
+- FS_ARRAY_SIZE_ERROR: Occurs if any of the matrices are not 
+     sized correctly.
+- FS_MEMORY_ERROR: Occurs if there is a memory allocation 
+     error.</p>
             </td>
         </tr>
     </tbody>
@@ -1590,13 +1556,15 @@ <h4>Arguments</h4>
   </div>
 
               <div class="card">
-    <div class="card-header codesum"><span class="anchor" id="proc-covariance_matrix"></span> <h3>public  subroutine <a href='..\proc\covariance_matrix.html'>covariance_matrix</a>(x, c, err)  
+    <div class="card-header codesum"><span class="anchor" id="proc-design_matrix"></span> <h3>public  subroutine <a href='..\proc\design_matrix.html'>design_matrix</a>(order, intercept, x, c, err)  
 </h3></div>
     <div class="card-body">
           
-  <p>Computes the covariance matrix <script type="math/tex"> C </script> where 
-<script type="math/tex"> C = \left( X^{T} X \right)^{-1} </script> and <script type="math/tex"> X </script> is computed
-by coefficient_matrix.</p><a href="../proc/covariance_matrix.html" class="pull-right"><emph>Read more&hellip;</emph></a>
+  <p>Computes the design matrix <script type="math/tex"> X </script> for the linear 
+least-squares regression problem of <script type="math/tex"> X \beta = y </script>, where 
+<script type="math/tex"> X </script> is the matrix computed here, <script type="math/tex"> \beta </script> is 
+the vector of coefficients to be determined, and <script type="math/tex"> y </script> is the 
+vector of measured dependent variables.</p><a href="../proc/design_matrix.html" class="pull-right"><emph>Read more&hellip;</emph></a>
 
   <h4>Arguments</h4>
       <table class="table table-striped varlist">
@@ -1611,7 +1579,39 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~35"></span>
+              <span class="anchor" id="variable-order~2"></span>
+              integer(kind=int32),
+            </td>
+<td>intent(in)</td>
+              <td></td>            <td>
+              
+            </td>
+            <td>::</td>
+            <td><strong>order</strong></td>
+            <td>
+<p>The order of the equation to fit.  This value must be
+at least one (linear equation), but can be higher as desired.</p>
+            </td>
+        </tr>
+        <tr>
+            <td>
+              <span class="anchor" id="variable-intercept~3"></span>
+              logical,
+            </td>
+<td>intent(in)</td>
+              <td></td>            <td>
+              
+            </td>
+            <td>::</td>
+            <td><strong>intercept</strong></td>
+            <td>
+<p>Set to true if the intercept is being computed
+as part of the regression; else, false.</p>
+            </td>
+        </tr>
+        <tr>
+            <td>
+              <span class="anchor" id="variable-x~32"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -1619,10 +1619,10 @@ <h4>Arguments</h4>
               
             </td>
             <td>::</td>
-            <td><strong>x</strong>(:,:)</td>
+            <td><strong>x</strong>(:)</td>
             <td>
-<p>An M-by-N matrix containing the formatted independent data
- matrix <script type="math/tex"> X </script> as computed by coefficient_matrix.</p>
+<p>An N-element array containing the independent variable
+measurement points.</p>
             </td>
         </tr>
         <tr>
@@ -1637,12 +1637,14 @@ <h4>Arguments</h4>
             <td>::</td>
             <td><strong>c</strong>(:,:)</td>
             <td>
-<p>The N-by-N covariance matrix.</p>
+<p>An N-by-K matrix where the results will be written.  K
+must equal order + 1 in the event intercept is true; 
+however, if intercept is false, K must equal order.</p>
             </td>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~6"></span>
+              <span class="anchor" id="variable-err~10"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -1655,10 +1657,8 @@ <h4>Arguments</h4>
 <p>A mechanism for communicating errors and warnings to the 
 caller.  Possible warning and error codes are as follows.
 - FS_NO_ERROR: No errors encountered.
-- FS_ARRAY_SIZE_ERROR: Occurs if any of the matrices are not 
-     sized correctly.
-- FS_MEMORY_ERROR: Occurs if there is a memory allocation 
-     error.</p>
+- FS_ARRAY_SIZE_ERROR: Occurs if c is not properly sized.
+- FS_INVALID_INPUT_ERROR: Occurs if order is less than 1.</p>
             </td>
         </tr>
     </tbody>
@@ -1815,7 +1815,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~9"></span>
+              <span class="anchor" id="variable-err~14"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -1894,7 +1894,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~36"></span>
+              <span class="anchor" id="variable-x~34"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -1910,7 +1910,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-y~5"></span>
+              <span class="anchor" id="variable-y~7"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -1941,7 +1941,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-ymod~3"></span>
+              <span class="anchor" id="variable-ymod~4"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -1956,7 +1956,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-resid~5"></span>
+              <span class="anchor" id="variable-resid~6"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -1989,7 +1989,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-alpha~5"></span>
+              <span class="anchor" id="variable-alpha~6"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -2006,7 +2006,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~7"></span>
+              <span class="anchor" id="variable-err~12"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -2069,7 +2069,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~37"></span>
+              <span class="anchor" id="variable-x~35"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -2084,7 +2084,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-y~6"></span>
+              <span class="anchor" id="variable-y~8"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -2116,7 +2116,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-ymod~4"></span>
+              <span class="anchor" id="variable-ymod~5"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -2132,7 +2132,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-resid~7"></span>
+              <span class="anchor" id="variable-resid~8"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -2217,7 +2217,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-alpha~7"></span>
+              <span class="anchor" id="variable-alpha~8"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -2296,7 +2296,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~10"></span>
+              <span class="anchor" id="variable-err~15"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -2348,7 +2348,7 @@ <h4>Arguments</h4>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/module/fstats_sampling.html b/doc/module/fstats_sampling.html
index a231bf8..5b698b7 100644
--- a/doc/module/fstats_sampling.html
+++ b/doc/module/fstats_sampling.html
@@ -74,7 +74,7 @@ <h1>fstats_sampling
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 2.8% of total for modules and submodules.">78 statements</a>
+                 title=" 2.7% of total for modules and submodules.">78 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -161,9 +161,9 @@ <h3 class="card-header card-title bg-light">Uses</h3>
         <ul class="list-group list-group-flush">
             <li class="list-group-item">
               <ul class="list-inline">
+                  <li class="list-inline-item"><a href='http://fortranwiki.org/fortran/show/iso_fortran_env'>iso_fortran_env</a></li>
                   <li class="list-inline-item">linalg</li>
                   <li class="list-inline-item"><a href='fstats_distributions.html'>fstats_distributions</a></li>
-                  <li class="list-inline-item"><a href='http://fortranwiki.org/fortran/show/iso_fortran_env'>iso_fortran_env</a></li>
               </ul>
             </li>
         </ul>
@@ -299,7 +299,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-n~13"></span>
+              <span class="anchor" id="variable-n"></span>
               integer(kind=int32),
             </td>
 <td>intent(in)</td>
@@ -367,7 +367,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-n~14"></span>
+              <span class="anchor" id="variable-n~2"></span>
               integer(kind=int32),
             </td>
 <td>intent(in)</td>
@@ -382,7 +382,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-xmin~2"></span>
+              <span class="anchor" id="variable-xmin"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -397,7 +397,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-xmax~2"></span>
+              <span class="anchor" id="variable-xmax"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -444,7 +444,7 @@ <h4>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/module/fstats_smoothing.html b/doc/module/fstats_smoothing.html
index bf608f1..fa207ef 100644
--- a/doc/module/fstats_smoothing.html
+++ b/doc/module/fstats_smoothing.html
@@ -74,7 +74,7 @@ <h1>fstats_smoothing
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 7.7% of total for modules and submodules.">215 statements</a>
+                 title=" 7.5% of total for modules and submodules.">215 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -150,10 +150,10 @@ <h3 class="card-header card-title bg-light">Uses</h3>
         <ul class="list-group list-group-flush">
             <li class="list-group-item">
               <ul class="list-inline">
-                  <li class="list-inline-item">linalg</li>
+                  <li class="list-inline-item"><a href='http://fortranwiki.org/fortran/show/iso_fortran_env'>iso_fortran_env</a></li>
                   <li class="list-inline-item"><a href='fstats_errors.html'>fstats_errors</a></li>
+                  <li class="list-inline-item">linalg</li>
                   <li class="list-inline-item">ferror</li>
-                  <li class="list-inline-item"><a href='http://fortranwiki.org/fortran/show/iso_fortran_env'>iso_fortran_env</a></li>
               </ul>
             </li>
         </ul>
@@ -194,7 +194,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~49"></span>
+              <span class="anchor" id="variable-x~6"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -210,7 +210,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-y~10"></span>
+              <span class="anchor" id="variable-y"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -306,7 +306,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-resid~10"></span>
+              <span class="anchor" id="variable-resid"></span>
               real(kind=real64),
             </td>
 <td>intent(out),</td>
@@ -322,7 +322,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~21"></span>
+              <span class="anchor" id="variable-err"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -367,7 +367,7 @@ <h4>Arguments</h4>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/module/fstats_special_functions.html b/doc/module/fstats_special_functions.html
index 2254b59..ff3cf5c 100644
--- a/doc/module/fstats_special_functions.html
+++ b/doc/module/fstats_special_functions.html
@@ -74,7 +74,7 @@ <h1>fstats_special_functions
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 6.1% of total for modules and submodules.">169 statements</a>
+                 title=" 5.9% of total for modules and submodules.">169 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -155,8 +155,8 @@ <h3 class="card-header card-title bg-light">Uses</h3>
         <ul class="list-group list-group-flush">
             <li class="list-group-item">
               <ul class="list-inline">
-                  <li class="list-inline-item"><a href='http://fortranwiki.org/fortran/show/ieee_arithmetic'>ieee_arithmetic</a></li>
                   <li class="list-inline-item"><a href='http://fortranwiki.org/fortran/show/iso_fortran_env'>iso_fortran_env</a></li>
+                  <li class="list-inline-item"><a href='http://fortranwiki.org/fortran/show/ieee_arithmetic'>ieee_arithmetic</a></li>
               </ul>
             </li>
         </ul>
@@ -194,7 +194,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-a~3"></span>
+              <span class="anchor" id="variable-a"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -209,7 +209,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-b~2"></span>
+              <span class="anchor" id="variable-b"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -254,7 +254,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~30"></span>
+              <span class="anchor" id="variable-x~5"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -299,7 +299,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-a~5"></span>
+              <span class="anchor" id="variable-a~3"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -314,7 +314,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-b~4"></span>
+              <span class="anchor" id="variable-b~3"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -329,7 +329,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~27"></span>
+              <span class="anchor" id="variable-x~2"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -374,7 +374,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-a~7"></span>
+              <span class="anchor" id="variable-a~5"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -389,7 +389,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~29"></span>
+              <span class="anchor" id="variable-x~4"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -434,7 +434,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-a~6"></span>
+              <span class="anchor" id="variable-a~4"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -449,7 +449,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~28"></span>
+              <span class="anchor" id="variable-x~3"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -494,7 +494,7 @@ <h4>Arguments</h4>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-a~4"></span>
+              <span class="anchor" id="variable-a~2"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -509,7 +509,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-b~3"></span>
+              <span class="anchor" id="variable-b~2"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -524,7 +524,7 @@ <h4>Arguments</h4>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~26"></span>
+              <span class="anchor" id="variable-x"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -570,7 +570,7 @@ <h4>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/module/fstats_types.html b/doc/module/fstats_types.html
new file mode 100644
index 0000000..5c9e609
--- /dev/null
+++ b/doc/module/fstats_types.html
@@ -0,0 +1,271 @@
+<!-- -*- mode: jinja2 -*- -->
+
+<!DOCTYPE html>
+<html lang="en">
+  <head>
+    <meta charset="utf-8">
+    <meta http-equiv="X-UA-Compatible" content="IE=edge">
+    <meta name="viewport" content="width=device-width, initial-scale=1">
+      <meta name="description" content="FSTATS is a modern Fortran statistical library containing routines for computing basic statistical properties, hypothesis testing, regression, special functions, and experimental design.">
+    <meta name="author" content="Jason Christopherson" >
+    <link rel="icon" href="../favicon.png">
+
+    <title>fstats_types &ndash; FSTATS</title>
+
+    <link href="https://cdn.jsdelivr.net/npm/bootstrap@5.1.3/dist/css/bootstrap.min.css" rel="stylesheet"
+          integrity="sha384-1BmE4kWBq78iYhFldvKuhfTAU6auU8tT94WrHftjDbrCEXSU1oBoqyl2QvZ6jIW3" crossorigin="anonymous">
+    <link href="../css/pygments.css" rel="stylesheet">
+    <link href="../css/font-awesome.min.css" rel="stylesheet">
+    <link href="../css/local.css" rel="stylesheet">
+      <link  href="../tipuesearch/tipuesearch.css" rel="stylesheet">
+
+    <script src="https://code.jquery.com/jquery-3.7.1.min.js" integrity="sha256-/JqT3SQfawRcv/BIHPThkBvs0OEvtFFmqPF/lYI/Cxo=" crossorigin="anonymous"></script>
+    <script src="../js/svg-pan-zoom.min.js"></script>
+  </head>
+
+  <body>
+
+    <!-- Fixed navbar -->
+    <div class="container-fluid mb-sm-4 mb-xl-2">
+      <nav class="navbar navbar-expand-lg navbar-dark bg-dark fixed-top">
+        <div class="container">
+          <a class="navbar-brand" href="../index.html">FSTATS </a>
+          <button type="button" class="navbar-toggler" data-bs-toggle="collapse" data-bs-target="#navbar"
+                  aria-expanded="false" aria-controls="navbar" aria-label="Toggle navigation">
+                  <span class="navbar-toggler-icon">
+          </button>
+
+          <div id="navbar" class="navbar-collapse collapse">
+            <ul class="navbar-nav">
+                  <li class="nav-item">
+                    <a class="nav-link" href="../lists/files.html">Source Files</a>
+                  </li>
+                <li class="nav-item">
+                  <a class="nav-link" href="../lists/modules.html">Modules</a>
+                </li>
+                <li class="nav-item">
+                  <a class="nav-link" href="../lists/procedures.html">Procedures</a>
+                </li>
+                <li class="nav-item">
+                  <a class="nav-link" href="../lists/types.html">Derived Types</a>
+                </li>
+            </ul>
+              <div class="d-flex align-items-end flex-grow-1">
+                <form action="../search.html" role="search" class="ms-auto">
+                  <input type="text" class="form-control" aria-label="Search" placeholder="Search" name="q" id="tipue_search_input" autocomplete="off" required>
+                </form>
+              </div>
+          </div><!--/.nav-collapse -->
+        </div>
+      </nav>
+    </div>
+
+    <div class="container">
+  <div class="row">
+    <h1>fstats_types
+      <small>Module</small>
+      
+    </h1>
+      <div class="container p-2 mb-4 bg-light border rounded-3">
+    <div class="row align-items-center justify-content-between" id="info-bar">
+      <div class="col">
+        <ul class="list-inline" style="margin-bottom:0px;display:inline">
+
+            <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
+              <a data-bs-toggle="tooltip"
+                 data-bs-placement="bottom" data-html="true"
+                 title=" 0.2% of total for modules and submodules.">7 statements</a>
+            </li>
+
+            <li class="list-inline-item" id="source-file">
+              <i class="fa fa-code"></i>
+              <a href="../src/fstats_types.f90"> Source File</a>
+            </li>
+        </ul>
+      </div>
+      <div class="col">
+        <nav aria-label="breadcrumb">
+          <ol class="breadcrumb justify-content-end mb-0">
+                <li class="breadcrumb-item"><a href='..\sourcefile\fstats_types.f90.html'>fstats_types.f90</a></li>
+            <li class="breadcrumb-item active" aria-current="page">fstats_types</li>
+          </ol>
+        </nav>
+      </div>
+    </div>
+  </div>
+  <script>
+    $(function () {
+    $('[data-bs-toggle="tooltip"]').tooltip()
+    })
+  </script>
+
+  </div>
+
+  <div class="row">
+    <div class="col-md-3">
+        <div id="sidebar">
+      <h3>Contents</h3>
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+      <div class="card mb-4">
+      <a data-bs-toggle="collapse" href="#types-0"
+         aria-expanded="false" aria-controls="types-0">
+         <h4 class="card-header bg-primary text-white">Derived Types</h4>
+      </a>
+      <div id="types-0" class="collapse">
+        <div class="list-group list-group-flush">
+            <a class="list-group-item" href="../module/fstats_types.html#type-array_container">array_container</a>
+        </div>
+      </div>
+    </div>
+
+  
+  
+  
+  
+  
+  
+  
+  
+  
+
+
+  </div>
+
+    </div>
+
+    <div class="col-md-9" id='text'>
+      
+<br>          <div class="card mb-4">
+      <h3 class="card-header card-title bg-light">Uses</h3>
+      <div class="card-body">
+        <ul class="list-group list-group-flush">
+            <li class="list-group-item">
+              <ul class="list-inline">
+                  <li class="list-inline-item"><a href='http://fortranwiki.org/fortran/show/iso_fortran_env'>iso_fortran_env</a></li>
+              </ul>
+            </li>
+        </ul>
+      </div>
+    </div>
+
+      
+      <br>
+
+
+
+
+
+
+        <section>
+          <h2>Derived Types</h2>
+              <div class="card">
+    <div class="card-header codesum">
+      <span class="anchor" id="type-array_container"></span>
+      <h3>
+        type, public&nbsp;::&nbsp;
+        <a href='..\type\array_container.html'>array_container</a>
+        
+      </h3>
+    </div>
+    <div class="card-body">
+      <p>Provides a container for a real-valued array.  A practical use of
+this construct is in the construction of jagged arrays.</p>
+
+        <h4>Components</h4>
+          <table class="table table-striped varlist">
+    <thead>
+      <tr>
+        <th scope="col">Type</th>
+<th scope="col">Visibility</th>        <th scope="col">Attributes</th>
+        <th scope="col"></th>
+        <th scope="col">Name</th>
+<th></th><th scope="col">Initial</th>        <th scope="col"></th>
+    </thead>
+    <tbody>
+        <tr>
+            <td>
+              <span class="anchor" id="variable-x~38"></span>
+              real(kind=real64),
+            </td>
+              <td>public,</td>
+            <td>
+              allocatable, dimension(:)
+            </td>
+            <td>::</td>
+            <td><strong>x</strong></td>
+                <td></td>
+                <td></td>
+            <td>
+<p>The array.</p>
+            </td>
+        </tr>
+    </tbody>
+  </table>
+
+
+
+
+    </div>
+  </div>
+
+        </section>
+        <br>
+
+
+
+
+
+    </div>
+  </div>
+
+      <hr>
+    </div> <!-- /container -->
+    <footer>
+      <div class="container">
+        <div class="row justify-content-between">
+          <div class="col"><p>FSTATS was developed by Jason Christopherson<br>&copy; 2024 
+</p>
+          </div>
+          <div class="col">
+            <p class="text-end">
+              Documentation generated by
+              <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
+ on 2024-04-16 13:46              </p>
+          </div>
+        </div>
+        <br>
+      </div> <!-- /container -->
+    </footer>
+
+    <!-- Bootstrap core JavaScript -->
+    <!-- Placed at the end of the document so the pages load faster -->
+    <script src="https://cdn.jsdelivr.net/npm/bootstrap@5.1.3/dist/js/bootstrap.bundle.min.js"
+            integrity="sha384-ka7Sk0Gln4gmtz2MlQnikT1wXgYsOg+OMhuP+IlRH9sENBO0LRn5q+8nbTov4+1p" crossorigin="anonymous"></script>    
+
+    <!-- MathJax JavaScript
+             ================================================== -->
+             <!-- Placed at the end of the document so the pages load faster -->
+        <script type="text/x-mathjax-config">
+          MathJax.Hub.Config({
+          TeX: { extensions: ['AMSmath.js','AMSsymbols.js','noErrors.js','noUndefined.js'], equationNumbers: { autoNumber: 'AMS' } },
+          jax: ['input/TeX','input/MathML','output/HTML-CSS'],
+          extensions: ['tex2jax.js','mml2jax.js','MathMenu.js','MathZoom.js']
+          });
+        </script>
+        <script src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML"></script>
+
+          <script src="../tipuesearch/tipuesearch_content.js"></script>
+          <script src="../tipuesearch/tipuesearch_set.js"></script>
+          <script src="../tipuesearch/tipuesearch.js"></script>
+
+  </body>
+</html>
\ No newline at end of file
diff --git a/doc/proc/adjusted_r_squared.html b/doc/proc/adjusted_r_squared.html
index 2c322e9..aead06f 100644
--- a/doc/proc/adjusted_r_squared.html
+++ b/doc/proc/adjusted_r_squared.html
@@ -177,7 +177,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~32"></span>
+              <span class="anchor" id="variable-x~30"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -209,7 +209,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~4"></span>
+              <span class="anchor" id="variable-err~9"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -232,7 +232,7 @@ <h3>Arguments</h3>
 
       <h3>Return Value
         <small>
-          <span class="anchor" id="variable-rst~52"></span>
+          <span class="anchor" id="variable-rst~28"></span>
           real(kind=real64)
         </small>
       </h3>
@@ -265,7 +265,7 @@ <h3>Return Value
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/allan_variance.html b/doc/proc/allan_variance.html
index 47733ab..b661e08 100644
--- a/doc/proc/allan_variance.html
+++ b/doc/proc/allan_variance.html
@@ -161,7 +161,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~40"></span>
+              <span class="anchor" id="variable-x~15"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -192,7 +192,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~13"></span>
+              <span class="anchor" id="variable-err~4"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -214,7 +214,7 @@ <h3>Arguments</h3>
 
       <h3>Return Value
         <small>
-          <span class="anchor" id="variable-rst~56"></span>
+          <span class="anchor" id="variable-rst~12"></span>
           real(kind=real64), allocatable, dimension(:,:)
         </small>
       </h3>
@@ -250,7 +250,7 @@ <h3>Return Value
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/bartletts_test.html b/doc/proc/bartletts_test.html
new file mode 100644
index 0000000..cd64772
--- /dev/null
+++ b/doc/proc/bartletts_test.html
@@ -0,0 +1,269 @@
+<!-- -*- mode: jinja2 -*- -->
+
+<!DOCTYPE html>
+<html lang="en">
+  <head>
+    <meta charset="utf-8">
+    <meta http-equiv="X-UA-Compatible" content="IE=edge">
+    <meta name="viewport" content="width=device-width, initial-scale=1">
+      <meta name="description" content="FSTATS is a modern Fortran statistical library containing routines for computing basic statistical properties, hypothesis testing, regression, special functions, and experimental design.">
+    <meta name="author" content="Jason Christopherson" >
+    <link rel="icon" href="../favicon.png">
+
+    <title>bartletts_test &ndash; FSTATS</title>
+
+    <link href="https://cdn.jsdelivr.net/npm/bootstrap@5.1.3/dist/css/bootstrap.min.css" rel="stylesheet"
+          integrity="sha384-1BmE4kWBq78iYhFldvKuhfTAU6auU8tT94WrHftjDbrCEXSU1oBoqyl2QvZ6jIW3" crossorigin="anonymous">
+    <link href="../css/pygments.css" rel="stylesheet">
+    <link href="../css/font-awesome.min.css" rel="stylesheet">
+    <link href="../css/local.css" rel="stylesheet">
+      <link  href="../tipuesearch/tipuesearch.css" rel="stylesheet">
+
+    <script src="https://code.jquery.com/jquery-3.7.1.min.js" integrity="sha256-/JqT3SQfawRcv/BIHPThkBvs0OEvtFFmqPF/lYI/Cxo=" crossorigin="anonymous"></script>
+    <script src="../js/svg-pan-zoom.min.js"></script>
+  </head>
+
+  <body>
+
+    <!-- Fixed navbar -->
+    <div class="container-fluid mb-sm-4 mb-xl-2">
+      <nav class="navbar navbar-expand-lg navbar-dark bg-dark fixed-top">
+        <div class="container">
+          <a class="navbar-brand" href="../index.html">FSTATS </a>
+          <button type="button" class="navbar-toggler" data-bs-toggle="collapse" data-bs-target="#navbar"
+                  aria-expanded="false" aria-controls="navbar" aria-label="Toggle navigation">
+                  <span class="navbar-toggler-icon">
+          </button>
+
+          <div id="navbar" class="navbar-collapse collapse">
+            <ul class="navbar-nav">
+                  <li class="nav-item">
+                    <a class="nav-link" href="../lists/files.html">Source Files</a>
+                  </li>
+                <li class="nav-item">
+                  <a class="nav-link" href="../lists/modules.html">Modules</a>
+                </li>
+                <li class="nav-item">
+                  <a class="nav-link" href="../lists/procedures.html">Procedures</a>
+                </li>
+                <li class="nav-item">
+                  <a class="nav-link" href="../lists/types.html">Derived Types</a>
+                </li>
+            </ul>
+              <div class="d-flex align-items-end flex-grow-1">
+                <form action="../search.html" role="search" class="ms-auto">
+                  <input type="text" class="form-control" aria-label="Search" placeholder="Search" name="q" id="tipue_search_input" autocomplete="off" required>
+                </form>
+              </div>
+          </div><!--/.nav-collapse -->
+        </div>
+      </nav>
+    </div>
+
+    <div class="container">
+  <div class="row">
+    <h1>bartletts_test
+      <small>Subroutine</small>
+      
+    </h1>
+      <div class="container p-2 mb-4 bg-light border rounded-3">
+    <div class="row align-items-center justify-content-between" id="info-bar">
+      <div class="col">
+        <ul class="list-inline" style="margin-bottom:0px;display:inline">
+
+            <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
+              <a data-bs-toggle="tooltip"
+                 data-bs-placement="bottom" data-html="true"
+                 title=" 1.8% of total for procedures.">29 statements</a>
+            </li>
+
+            <li class="list-inline-item" id="source-file">
+              <i class="fa fa-code"></i>
+              <a href="../src/fstats_hypothesis.f90"> Source File</a>
+            </li>
+        </ul>
+      </div>
+      <div class="col">
+        <nav aria-label="breadcrumb">
+          <ol class="breadcrumb justify-content-end mb-0">
+                <li class="breadcrumb-item"><a href='..\sourcefile\fstats_hypothesis.f90.html'>fstats_hypothesis.f90</a></li>
+                <li class="breadcrumb-item"><a href='..\module\fstats_hypothesis.html'>fstats_hypothesis</a></li>
+            <li class="breadcrumb-item active" aria-current="page">bartletts_test</li>
+          </ol>
+        </nav>
+      </div>
+    </div>
+  </div>
+  <script>
+    $(function () {
+    $('[data-bs-toggle="tooltip"]').tooltip()
+    })
+  </script>
+
+  </div>
+  
+  <div class="row">
+    <div class="col-md-3 hidden-xs hidden-sm visible-md visible-lg">
+      <div id="sidebar">
+      <h3>Contents</h3>
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+
+
+  </div>
+
+    </div>
+    
+    <div class="col-md-9" id='text'>
+    <h2>public  subroutine bartletts_test(x, stat, p)  
+</h2>
+    
+
+    <p>Computes Bartlett's test statistic as follows.</p>
+<p>
+<script type="math/tex; mode=display"> \chi^{2} = \frac{(N - k) \ln(S_{p}^{2}) \sum_{i = 1}^{k} 
+\left(n_{i} - 1 \right) \ln(S_{i}^{2})}{1 + 
+\frac{1}{3 \left( k - 1 \right)} \left( \sum_{i = 1}^{k} 
+\left( \frac{1}{n_{i} - 1} \right) - \frac{1}{N - k} \right)} </script>
+</p>
+<p>Where <script type="math/tex"> N = \sum_{i = 1}^{k} n_{i} </script> and <script type="math/tex"> S_{p}^{2} </script> is the pooled
+variance.</p>
+
+
+    <h3>Arguments</h3>
+        <table class="table table-striped varlist">
+    <thead>
+      <tr>
+        <th scope="col">Type</th>
+<th scope="col">Intent</th><th scope="col">Optional</th>        <th scope="col">Attributes</th>
+        <th scope="col"></th>
+        <th scope="col">Name</th>
+        <th scope="col"></th>
+    </thead>
+    <tbody>
+        <tr>
+            <td>
+              <span class="anchor" id="variable-x~55"></span>
+              type(<a href='..\type\array_container.html'>array_container</a>),
+            </td>
+<td>intent(in),</td>
+              <td></td>            <td>
+              dimension(:)
+            </td>
+            <td>::</td>
+            <td><strong>x</strong></td>
+            <td>
+                <p>The arrays of data to analyze.</p>
+            </td>
+        </tr>
+        <tr>
+            <td>
+              <span class="anchor" id="variable-stat~6"></span>
+              real(kind=real64),
+            </td>
+<td>intent(out)</td>
+              <td></td>            <td>
+              
+            </td>
+            <td>::</td>
+            <td><strong>stat</strong></td>
+            <td>
+                <p>The Bartlett's test statistic.</p>
+            </td>
+        </tr>
+        <tr>
+            <td>
+              <span class="anchor" id="variable-p~15"></span>
+              real(kind=real64),
+            </td>
+<td>intent(out)</td>
+              <td></td>            <td>
+              
+            </td>
+            <td>::</td>
+            <td><strong>p</strong></td>
+            <td>
+                <p>The probability value that the variances of each data set are
+equivalent.  A low p-value, less than some significance level,
+indicates a non-equivalance of variances.</p>
+            </td>
+        </tr>
+    </tbody>
+  </table>
+
+    <br>
+
+
+    
+    
+
+    
+    
+
+
+
+    
+    
+    </div>
+  </div>
+
+      <hr>
+    </div> <!-- /container -->
+    <footer>
+      <div class="container">
+        <div class="row justify-content-between">
+          <div class="col"><p>FSTATS was developed by Jason Christopherson<br>&copy; 2024 
+</p>
+          </div>
+          <div class="col">
+            <p class="text-end">
+              Documentation generated by
+              <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
+ on 2024-04-16 13:46              </p>
+          </div>
+        </div>
+        <br>
+      </div> <!-- /container -->
+    </footer>
+
+    <!-- Bootstrap core JavaScript -->
+    <!-- Placed at the end of the document so the pages load faster -->
+    <script src="https://cdn.jsdelivr.net/npm/bootstrap@5.1.3/dist/js/bootstrap.bundle.min.js"
+            integrity="sha384-ka7Sk0Gln4gmtz2MlQnikT1wXgYsOg+OMhuP+IlRH9sENBO0LRn5q+8nbTov4+1p" crossorigin="anonymous"></script>    
+
+    <!-- MathJax JavaScript
+             ================================================== -->
+             <!-- Placed at the end of the document so the pages load faster -->
+        <script type="text/x-mathjax-config">
+          MathJax.Hub.Config({
+          TeX: { extensions: ['AMSmath.js','AMSsymbols.js','noErrors.js','noUndefined.js'], equationNumbers: { autoNumber: 'AMS' } },
+          jax: ['input/TeX','input/MathML','output/HTML-CSS'],
+          extensions: ['tex2jax.js','mml2jax.js','MathMenu.js','MathZoom.js']
+          });
+        </script>
+        <script src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML"></script>
+
+          <script src="../tipuesearch/tipuesearch_content.js"></script>
+          <script src="../tipuesearch/tipuesearch_set.js"></script>
+          <script src="../tipuesearch/tipuesearch.js"></script>
+
+  </body>
+</html>
\ No newline at end of file
diff --git a/doc/proc/beta.html b/doc/proc/beta.html
index 86f8c8e..eb0759b 100644
--- a/doc/proc/beta.html
+++ b/doc/proc/beta.html
@@ -160,7 +160,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-a~3"></span>
+              <span class="anchor" id="variable-a"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -175,7 +175,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-b~2"></span>
+              <span class="anchor" id="variable-b"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -193,7 +193,7 @@ <h3>Arguments</h3>
 
       <h3>Return Value
         <small>
-          <span class="anchor" id="variable-rst~45"></span>
+          <span class="anchor" id="variable-rst"></span>
           real(kind=real64)
         </small>
       </h3>
@@ -226,7 +226,7 @@ <h3>Return Value
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/bootstrap.html b/doc/proc/bootstrap.html
index 34db7c6..98f13ec 100644
--- a/doc/proc/bootstrap.html
+++ b/doc/proc/bootstrap.html
@@ -74,7 +74,7 @@ <h1>bootstrap
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 3.2% of total for procedures.">50 statements</a>
+                 title=" 3.1% of total for procedures.">50 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -171,7 +171,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~5"></span>
+              <span class="anchor" id="variable-x~12"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -218,7 +218,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-alpha"></span>
+              <span class="anchor" id="variable-alpha~2"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -237,7 +237,7 @@ <h3>Arguments</h3>
 
       <h3>Return Value
         <small>
-          <span class="anchor" id="variable-rst~2"></span>
+          <span class="anchor" id="variable-rst~11"></span>
           type(<a href='..\type\bootstrap_statistics.html'>bootstrap_statistics</a>)
         </small>
       </h3>
@@ -271,7 +271,7 @@ <h3>Return Value
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/bootstrap_linear_least_squares.html b/doc/proc/bootstrap_linear_least_squares.html
index c8f08a9..23162e1 100644
--- a/doc/proc/bootstrap_linear_least_squares.html
+++ b/doc/proc/bootstrap_linear_least_squares.html
@@ -74,7 +74,7 @@ <h1>bootstrap_linear_least_squares
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 6.0% of total for procedures.">94 statements</a>
+                 title=" 5.9% of total for procedures.">94 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -190,7 +190,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~6"></span>
+              <span class="anchor" id="variable-x~13"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -206,7 +206,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-y"></span>
+              <span class="anchor" id="variable-y~3"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -253,7 +253,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-resid"></span>
+              <span class="anchor" id="variable-resid~2"></span>
               real(kind=real64),
             </td>
 <td>intent(out),</td>
@@ -320,7 +320,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-alpha~2"></span>
+              <span class="anchor" id="variable-alpha~3"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -370,7 +370,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err"></span>
+              <span class="anchor" id="variable-err~2"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -421,7 +421,7 @@ <h3>Arguments</h3>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/bootstrap_nonlinear_least_squares.html b/doc/proc/bootstrap_nonlinear_least_squares.html
index 2302fbc..a489d8b 100644
--- a/doc/proc/bootstrap_nonlinear_least_squares.html
+++ b/doc/proc/bootstrap_nonlinear_least_squares.html
@@ -74,7 +74,7 @@ <h1>bootstrap_nonlinear_least_squares
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 6.4% of total for procedures.">101 statements</a>
+                 title=" 6.3% of total for procedures.">101 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -173,7 +173,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~7"></span>
+              <span class="anchor" id="variable-x~14"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -188,7 +188,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-y~2"></span>
+              <span class="anchor" id="variable-y~4"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -236,7 +236,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-resid~2"></span>
+              <span class="anchor" id="variable-resid~3"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -336,7 +336,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-alpha~3"></span>
+              <span class="anchor" id="variable-alpha~4"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -452,7 +452,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~2"></span>
+              <span class="anchor" id="variable-err~3"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -508,7 +508,7 @@ <h3>Arguments</h3>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/calculate_regression_statistics.html b/doc/proc/calculate_regression_statistics.html
index 8820fba..1fe367d 100644
--- a/doc/proc/calculate_regression_statistics.html
+++ b/doc/proc/calculate_regression_statistics.html
@@ -74,7 +74,7 @@ <h1>calculate_regression_statistics
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 2.8% of total for procedures.">44 statements</a>
+                 title=" 2.7% of total for procedures.">44 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -154,7 +154,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-resid~6"></span>
+              <span class="anchor" id="variable-resid~7"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -184,7 +184,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-c~7"></span>
+              <span class="anchor" id="variable-c~8"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -199,7 +199,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-alpha~6"></span>
+              <span class="anchor" id="variable-alpha~7"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -216,7 +216,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~8"></span>
+              <span class="anchor" id="variable-err~13"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -240,7 +240,7 @@ <h3>Arguments</h3>
 
       <h3>Return Value
         <small>
-          <span class="anchor" id="variable-rst~54"></span>
+          <span class="anchor" id="variable-rst~30"></span>
           type(<a href='..\type\regression_statistics.html'>regression_statistics</a>), allocatable, (:)
         </small>
       </h3>
@@ -273,7 +273,7 @@ <h3>Return Value
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/correlation.html b/doc/proc/correlation.html
index 9823591..5fdc3cc 100644
--- a/doc/proc/correlation.html
+++ b/doc/proc/correlation.html
@@ -158,7 +158,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~33"></span>
+              <span class="anchor" id="variable-x~31"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -173,7 +173,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-y~4"></span>
+              <span class="anchor" id="variable-y~6"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -191,7 +191,7 @@ <h3>Arguments</h3>
 
       <h3>Return Value
         <small>
-          <span class="anchor" id="variable-rst~53"></span>
+          <span class="anchor" id="variable-rst~29"></span>
           real(kind=real64)
         </small>
       </h3>
@@ -224,7 +224,7 @@ <h3>Return Value
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/covariance.html b/doc/proc/covariance.html
index 1cf0cc8..fa2bc28 100644
--- a/doc/proc/covariance.html
+++ b/doc/proc/covariance.html
@@ -156,7 +156,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~14"></span>
+              <span class="anchor" id="variable-x~27"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -171,7 +171,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-y~3"></span>
+              <span class="anchor" id="variable-y~5"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -189,7 +189,7 @@ <h3>Arguments</h3>
 
       <h3>Return Value
         <small>
-          <span class="anchor" id="variable-rst~9"></span>
+          <span class="anchor" id="variable-rst~24"></span>
           real(kind=real64)
         </small>
       </h3>
@@ -222,7 +222,7 @@ <h3>Return Value
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/covariance_matrix.html b/doc/proc/covariance_matrix.html
index 68d0f00..fc34e31 100644
--- a/doc/proc/covariance_matrix.html
+++ b/doc/proc/covariance_matrix.html
@@ -139,7 +139,7 @@ <h2>public  subroutine covariance_matrix(x, c, err)
 
     <p>Computes the covariance matrix <script type="math/tex"> C </script> where 
 <script type="math/tex"> C = \left( X^{T} X \right)^{-1} </script> and <script type="math/tex"> X </script> is computed
-by coefficient_matrix.</p>
+by design_matrix.</p>
 <p>See Also</p>
 <ul>
 <li><a href="https://en.wikipedia.org/wiki/Covariance_matrix">Wikipedia</a></li>
@@ -160,7 +160,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~35"></span>
+              <span class="anchor" id="variable-x~33"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -171,12 +171,12 @@ <h3>Arguments</h3>
             <td><strong>x</strong>(:,:)</td>
             <td>
                 <p>An M-by-N matrix containing the formatted independent data
- matrix <script type="math/tex"> X </script> as computed by coefficient_matrix.</p>
+ matrix <script type="math/tex"> X </script> as computed by design_matrix.</p>
             </td>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-c~5"></span>
+              <span class="anchor" id="variable-c~6"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -191,7 +191,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~6"></span>
+              <span class="anchor" id="variable-err~11"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -241,7 +241,7 @@ <h3>Arguments</h3>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/coefficient_matrix.html b/doc/proc/design_matrix.html
similarity index 92%
rename from doc/proc/coefficient_matrix.html
rename to doc/proc/design_matrix.html
index 45e8aa1..aee1a85 100644
--- a/doc/proc/coefficient_matrix.html
+++ b/doc/proc/design_matrix.html
@@ -10,7 +10,7 @@
     <meta name="author" content="Jason Christopherson" >
     <link rel="icon" href="../favicon.png">
 
-    <title>coefficient_matrix &ndash; FSTATS</title>
+    <title>design_matrix &ndash; FSTATS</title>
 
     <link href="https://cdn.jsdelivr.net/npm/bootstrap@5.1.3/dist/css/bootstrap.min.css" rel="stylesheet"
           integrity="sha384-1BmE4kWBq78iYhFldvKuhfTAU6auU8tT94WrHftjDbrCEXSU1oBoqyl2QvZ6jIW3" crossorigin="anonymous">
@@ -62,7 +62,7 @@
 
     <div class="container">
   <div class="row">
-    <h1>coefficient_matrix
+    <h1>design_matrix
       <small>Subroutine</small>
       
     </h1>
@@ -74,7 +74,7 @@ <h1>coefficient_matrix
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 2.5% of total for procedures.">39 statements</a>
+                 title=" 2.4% of total for procedures.">39 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -88,7 +88,7 @@ <h1>coefficient_matrix
           <ol class="breadcrumb justify-content-end mb-0">
                 <li class="breadcrumb-item"><a href='..\sourcefile\fstats_regression.f90.html'>fstats_regression.f90</a></li>
                 <li class="breadcrumb-item"><a href='..\module\fstats_regression.html'>fstats_regression</a></li>
-            <li class="breadcrumb-item active" aria-current="page">coefficient_matrix</li>
+            <li class="breadcrumb-item active" aria-current="page">design_matrix</li>
           </ol>
         </nav>
       </div>
@@ -133,18 +133,20 @@ <h3>Contents</h3>
     </div>
     
     <div class="col-md-9" id='text'>
-    <h2>public  subroutine coefficient_matrix(order, intercept, x, c, err)  
+    <h2>public  subroutine design_matrix(order, intercept, x, c, err)  
 </h2>
     
 
-    <p>Computes the coefficient matrix <script type="math/tex"> X </script> to the linear 
+    <p>Computes the design matrix <script type="math/tex"> X </script> for the linear 
 least-squares regression problem of <script type="math/tex"> X \beta = y </script>, where 
-<script type="math/tex"> X </script> is the coefficient matrix computed here, <script type="math/tex"> \beta </script> is 
+<script type="math/tex"> X </script> is the matrix computed here, <script type="math/tex"> \beta </script> is 
 the vector of coefficients to be determined, and <script type="math/tex"> y </script> is the 
 vector of measured dependent variables.</p>
 <p>See Also</p>
 <ul>
 <li><a href="https://en.wikipedia.org/wiki/Linear_regression">Wikipedia</a></li>
+<li><a href="https://en.wikipedia.org/wiki/Vandermonde_matrix">Wikipedia</a></li>
+<li><a href="https://en.wikipedia.org/wiki/Design_matrix">Wikipedia</a></li>
 </ul>
 
 
@@ -193,7 +195,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~34"></span>
+              <span class="anchor" id="variable-x~32"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -209,7 +211,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-c~4"></span>
+              <span class="anchor" id="variable-c~5"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -226,7 +228,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~5"></span>
+              <span class="anchor" id="variable-err~10"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -274,7 +276,7 @@ <h3>Arguments</h3>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/difference.html b/doc/proc/difference.html
index bad6cfa..1ec2dd5 100644
--- a/doc/proc/difference.html
+++ b/doc/proc/difference.html
@@ -153,7 +153,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~41"></span>
+              <span class="anchor" id="variable-x~19"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -171,7 +171,7 @@ <h3>Arguments</h3>
 
       <h3>Return Value
         <small>
-          <span class="anchor" id="variable-rst~57"></span>
+          <span class="anchor" id="variable-rst~16"></span>
           real(kind=real64), allocatable, dimension(:)
         </small>
       </h3>
@@ -205,7 +205,7 @@ <h3>Return Value
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/digamma.html b/doc/proc/digamma.html
index d446207..07eb592 100644
--- a/doc/proc/digamma.html
+++ b/doc/proc/digamma.html
@@ -74,7 +74,7 @@ <h1>digamma
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 1.7% of total for procedures.">26 statements</a>
+                 title=" 1.6% of total for procedures.">26 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -162,7 +162,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~30"></span>
+              <span class="anchor" id="variable-x~5"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -180,7 +180,7 @@ <h3>Arguments</h3>
 
       <h3>Return Value
         <small>
-          <span class="anchor" id="variable-rst~50"></span>
+          <span class="anchor" id="variable-rst~6"></span>
           real(kind=real64)
         </small>
       </h3>
@@ -213,7 +213,7 @@ <h3>Return Value
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/f_test.html b/doc/proc/f_test.html
index 1b39f67..dc09e62 100644
--- a/doc/proc/f_test.html
+++ b/doc/proc/f_test.html
@@ -74,7 +74,7 @@ <h1>f_test
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 2.1% of total for procedures.">33 statements</a>
+                 title=" 1.9% of total for procedures.">31 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -203,7 +203,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-p~13"></span>
+              <span class="anchor" id="variable-p~14"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -220,7 +220,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-dof1"></span>
+              <span class="anchor" id="variable-dof1~2"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -235,7 +235,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-dof2"></span>
+              <span class="anchor" id="variable-dof2~2"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -279,7 +279,7 @@ <h3>Arguments</h3>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/factorial.html b/doc/proc/factorial.html
index 552ff76..7823201 100644
--- a/doc/proc/factorial.html
+++ b/doc/proc/factorial.html
@@ -153,7 +153,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~42"></span>
+              <span class="anchor" id="variable-x~20"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -171,7 +171,7 @@ <h3>Arguments</h3>
 
       <h3>Return Value
         <small>
-          <span class="anchor" id="variable-rst~58"></span>
+          <span class="anchor" id="variable-rst~17"></span>
           real(kind=real64)
         </small>
       </h3>
@@ -204,7 +204,7 @@ <h3>Return Value
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/full_factorial.html b/doc/proc/full_factorial.html
index 15f284c..fa9e167 100644
--- a/doc/proc/full_factorial.html
+++ b/doc/proc/full_factorial.html
@@ -236,7 +236,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~23"></span>
+              <span class="anchor" id="variable-err~7"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -285,7 +285,7 @@ <h3>Arguments</h3>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/get_full_factorial_matrix_size.html b/doc/proc/get_full_factorial_matrix_size.html
index 337411c..4ec6604 100644
--- a/doc/proc/get_full_factorial_matrix_size.html
+++ b/doc/proc/get_full_factorial_matrix_size.html
@@ -171,7 +171,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-m~7"></span>
+              <span class="anchor" id="variable-m~2"></span>
               integer(kind=int32),
             </td>
 <td>intent(out)</td>
@@ -186,7 +186,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-n~31"></span>
+              <span class="anchor" id="variable-n~23"></span>
               integer(kind=int32),
             </td>
 <td>intent(out)</td>
@@ -201,7 +201,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~22"></span>
+              <span class="anchor" id="variable-err~6"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -249,7 +249,7 @@ <h3>Arguments</h3>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/incomplete_beta.html b/doc/proc/incomplete_beta.html
index e99c920..9e1f5b8 100644
--- a/doc/proc/incomplete_beta.html
+++ b/doc/proc/incomplete_beta.html
@@ -159,7 +159,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-a~5"></span>
+              <span class="anchor" id="variable-a~3"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -174,7 +174,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-b~4"></span>
+              <span class="anchor" id="variable-b~3"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -189,7 +189,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~27"></span>
+              <span class="anchor" id="variable-x~2"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -207,7 +207,7 @@ <h3>Arguments</h3>
 
       <h3>Return Value
         <small>
-          <span class="anchor" id="variable-rst~47"></span>
+          <span class="anchor" id="variable-rst~3"></span>
           real(kind=real64)
         </small>
       </h3>
@@ -240,7 +240,7 @@ <h3>Return Value
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/incomplete_gamma_lower.html b/doc/proc/incomplete_gamma_lower.html
index b4263c2..1537cd6 100644
--- a/doc/proc/incomplete_gamma_lower.html
+++ b/doc/proc/incomplete_gamma_lower.html
@@ -160,7 +160,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-a~7"></span>
+              <span class="anchor" id="variable-a~5"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -175,7 +175,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~29"></span>
+              <span class="anchor" id="variable-x~4"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -193,7 +193,7 @@ <h3>Arguments</h3>
 
       <h3>Return Value
         <small>
-          <span class="anchor" id="variable-rst~49"></span>
+          <span class="anchor" id="variable-rst~5"></span>
           real(kind=real64)
         </small>
       </h3>
@@ -226,7 +226,7 @@ <h3>Return Value
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/incomplete_gamma_upper.html b/doc/proc/incomplete_gamma_upper.html
index 19724c7..49adeeb 100644
--- a/doc/proc/incomplete_gamma_upper.html
+++ b/doc/proc/incomplete_gamma_upper.html
@@ -74,7 +74,7 @@ <h1>incomplete_gamma_upper
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 2.5% of total for procedures.">39 statements</a>
+                 title=" 2.4% of total for procedures.">39 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -160,7 +160,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-a~6"></span>
+              <span class="anchor" id="variable-a~4"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -175,7 +175,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~28"></span>
+              <span class="anchor" id="variable-x~3"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -193,7 +193,7 @@ <h3>Arguments</h3>
 
       <h3>Return Value
         <small>
-          <span class="anchor" id="variable-rst~48"></span>
+          <span class="anchor" id="variable-rst~4"></span>
           real(kind=real64)
         </small>
       </h3>
@@ -226,7 +226,7 @@ <h3>Return Value
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/jacobian.html b/doc/proc/jacobian.html
index 45d2d02..83baec7 100644
--- a/doc/proc/jacobian.html
+++ b/doc/proc/jacobian.html
@@ -74,7 +74,7 @@ <h1>jacobian
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 4.1% of total for procedures.">64 statements</a>
+                 title=" 4.0% of total for procedures.">64 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -280,7 +280,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~9"></span>
+              <span class="anchor" id="variable-err~14"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -330,7 +330,7 @@ <h3>Arguments</h3>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/linear_least_squares.html b/doc/proc/linear_least_squares.html
index 510d923..4787083 100644
--- a/doc/proc/linear_least_squares.html
+++ b/doc/proc/linear_least_squares.html
@@ -74,7 +74,7 @@ <h1>linear_least_squares
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 5.0% of total for procedures.">78 statements</a>
+                 title=" 4.9% of total for procedures.">78 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -191,7 +191,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~36"></span>
+              <span class="anchor" id="variable-x~34"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -207,7 +207,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-y~5"></span>
+              <span class="anchor" id="variable-y~7"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -238,7 +238,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-ymod~3"></span>
+              <span class="anchor" id="variable-ymod~4"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -253,7 +253,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-resid~5"></span>
+              <span class="anchor" id="variable-resid~6"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -286,7 +286,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-alpha~5"></span>
+              <span class="anchor" id="variable-alpha~6"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -303,7 +303,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~7"></span>
+              <span class="anchor" id="variable-err~12"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -354,7 +354,7 @@ <h3>Arguments</h3>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/lowess.html b/doc/proc/lowess.html
index 9daee95..3ded4aa 100644
--- a/doc/proc/lowess.html
+++ b/doc/proc/lowess.html
@@ -74,7 +74,7 @@ <h1>lowess
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 9.0% of total for procedures.">141 statements</a>
+                 title=" 8.8% of total for procedures.">141 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -160,7 +160,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~49"></span>
+              <span class="anchor" id="variable-x~6"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -176,7 +176,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-y~10"></span>
+              <span class="anchor" id="variable-y"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -272,7 +272,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-resid~10"></span>
+              <span class="anchor" id="variable-resid"></span>
               real(kind=real64),
             </td>
 <td>intent(out),</td>
@@ -288,7 +288,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~21"></span>
+              <span class="anchor" id="variable-err"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -337,7 +337,7 @@ <h3>Arguments</h3>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/mean.html b/doc/proc/mean.html
index 0e29516..e5c825b 100644
--- a/doc/proc/mean.html
+++ b/doc/proc/mean.html
@@ -74,7 +74,7 @@ <h1>mean
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 1.0% of total for procedures.">15 statements</a>
+                 title=" 0.9% of total for procedures.">15 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -153,7 +153,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~8"></span>
+              <span class="anchor" id="variable-x~21"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -171,7 +171,7 @@ <h3>Arguments</h3>
 
       <h3>Return Value
         <small>
-          <span class="anchor" id="variable-rst~3"></span>
+          <span class="anchor" id="variable-rst~18"></span>
           real(kind=real64)
         </small>
       </h3>
@@ -204,7 +204,7 @@ <h3>Return Value
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/median.html b/doc/proc/median.html
index a421eab..96b11cd 100644
--- a/doc/proc/median.html
+++ b/doc/proc/median.html
@@ -153,7 +153,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~11"></span>
+              <span class="anchor" id="variable-x~24"></span>
               real(kind=real64),
             </td>
 <td>intent(inout)</td>
@@ -172,7 +172,7 @@ <h3>Arguments</h3>
 
       <h3>Return Value
         <small>
-          <span class="anchor" id="variable-rst~6"></span>
+          <span class="anchor" id="variable-rst~21"></span>
           real(kind=real64)
         </small>
       </h3>
@@ -205,7 +205,7 @@ <h3>Return Value
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/nonlinear_least_squares.html b/doc/proc/nonlinear_least_squares.html
index 4a35ce7..1706c20 100644
--- a/doc/proc/nonlinear_least_squares.html
+++ b/doc/proc/nonlinear_least_squares.html
@@ -74,7 +74,7 @@ <h1>nonlinear_least_squares
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 9.5% of total for procedures.">149 statements</a>
+                 title=" 9.3% of total for procedures.">149 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -169,7 +169,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~37"></span>
+              <span class="anchor" id="variable-x~35"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -184,7 +184,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-y~6"></span>
+              <span class="anchor" id="variable-y~8"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -216,7 +216,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-ymod~4"></span>
+              <span class="anchor" id="variable-ymod~5"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -232,7 +232,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-resid~7"></span>
+              <span class="anchor" id="variable-resid~8"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -317,7 +317,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-alpha~7"></span>
+              <span class="anchor" id="variable-alpha~8"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -396,7 +396,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~10"></span>
+              <span class="anchor" id="variable-err~15"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -452,7 +452,7 @@ <h3>Arguments</h3>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/quantile.html b/doc/proc/quantile.html
index 9f5339f..5cdc933 100644
--- a/doc/proc/quantile.html
+++ b/doc/proc/quantile.html
@@ -158,7 +158,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~12"></span>
+              <span class="anchor" id="variable-x~25"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -191,7 +191,7 @@ <h3>Arguments</h3>
 
       <h3>Return Value
         <small>
-          <span class="anchor" id="variable-rst~7"></span>
+          <span class="anchor" id="variable-rst~22"></span>
           real(kind=real64)
         </small>
       </h3>
@@ -224,7 +224,7 @@ <h3>Return Value
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/r_squared.html b/doc/proc/r_squared.html
index b2f6dca..17b73d3 100644
--- a/doc/proc/r_squared.html
+++ b/doc/proc/r_squared.html
@@ -74,7 +74,7 @@ <h1>r_squared
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 1.8% of total for procedures.">28 statements</a>
+                 title=" 1.7% of total for procedures.">28 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -164,7 +164,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~31"></span>
+              <span class="anchor" id="variable-x~29"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -196,7 +196,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~3"></span>
+              <span class="anchor" id="variable-err~8"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -219,7 +219,7 @@ <h3>Arguments</h3>
 
       <h3>Return Value
         <small>
-          <span class="anchor" id="variable-rst~51"></span>
+          <span class="anchor" id="variable-rst~27"></span>
           real(kind=real64)
         </small>
       </h3>
@@ -252,7 +252,7 @@ <h3>Return Value
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/random_resample.html b/doc/proc/random_resample.html
index e9c358b..a183352 100644
--- a/doc/proc/random_resample.html
+++ b/doc/proc/random_resample.html
@@ -153,7 +153,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~3"></span>
+              <span class="anchor" id="variable-x~10"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -212,7 +212,7 @@ <h3>Arguments</h3>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/regularized_beta.html b/doc/proc/regularized_beta.html
index f74c9c3..3104bc4 100644
--- a/doc/proc/regularized_beta.html
+++ b/doc/proc/regularized_beta.html
@@ -160,7 +160,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-a~4"></span>
+              <span class="anchor" id="variable-a~2"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -175,7 +175,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-b~3"></span>
+              <span class="anchor" id="variable-b~2"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -190,7 +190,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~26"></span>
+              <span class="anchor" id="variable-x"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -208,7 +208,7 @@ <h3>Arguments</h3>
 
       <h3>Return Value
         <small>
-          <span class="anchor" id="variable-rst~46"></span>
+          <span class="anchor" id="variable-rst~2"></span>
           real(kind=real64)
         </small>
       </h3>
@@ -241,7 +241,7 @@ <h3>Return Value
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/rejection_sample.html b/doc/proc/rejection_sample.html
index a720e4b..7dcc346 100644
--- a/doc/proc/rejection_sample.html
+++ b/doc/proc/rejection_sample.html
@@ -168,7 +168,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-n~14"></span>
+              <span class="anchor" id="variable-n~2"></span>
               integer(kind=int32),
             </td>
 <td>intent(in)</td>
@@ -183,7 +183,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-xmin~2"></span>
+              <span class="anchor" id="variable-xmin"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -198,7 +198,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-xmax~2"></span>
+              <span class="anchor" id="variable-xmax"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -216,7 +216,7 @@ <h3>Arguments</h3>
 
       <h3>Return Value
         <small>
-          <span class="anchor" id="variable-rst~44"></span>
+          <span class="anchor" id="variable-rst~9"></span>
           real(kind=real64), allocatable, dimension(:)
         </small>
       </h3>
@@ -250,7 +250,7 @@ <h3>Return Value
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/report_array_size_error.html b/doc/proc/report_array_size_error.html
index 19bdd09..5e8465d 100644
--- a/doc/proc/report_array_size_error.html
+++ b/doc/proc/report_array_size_error.html
@@ -164,7 +164,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~16"></span>
+              <span class="anchor" id="variable-err~19"></span>
               class(errors),
             </td>
 <td>intent(inout)</td>
@@ -302,7 +302,7 @@ <h2>Variables</h2>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/report_arrays_not_same_size_error.html b/doc/proc/report_arrays_not_same_size_error.html
index 2cf3bd6..0790567 100644
--- a/doc/proc/report_arrays_not_same_size_error.html
+++ b/doc/proc/report_arrays_not_same_size_error.html
@@ -74,7 +74,7 @@ <h1>report_arrays_not_same_size_error
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 0.8% of total for procedures.">12 statements</a>
+                 title=" 0.7% of total for procedures.">12 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -165,7 +165,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~18"></span>
+              <span class="anchor" id="variable-err~21"></span>
               class(errors),
             </td>
 <td>intent(inout)</td>
@@ -318,7 +318,7 @@ <h2>Variables</h2>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/report_iteration_count_error.html b/doc/proc/report_iteration_count_error.html
index c9f641c..9a3d2b4 100644
--- a/doc/proc/report_iteration_count_error.html
+++ b/doc/proc/report_iteration_count_error.html
@@ -164,7 +164,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~20"></span>
+              <span class="anchor" id="variable-err~23"></span>
               class(errors),
             </td>
 <td>intent(inout)</td>
@@ -287,7 +287,7 @@ <h2>Variables</h2>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/report_matrix_size_error.html b/doc/proc/report_matrix_size_error.html
index 54ed898..0aaa9e6 100644
--- a/doc/proc/report_matrix_size_error.html
+++ b/doc/proc/report_matrix_size_error.html
@@ -164,7 +164,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~17"></span>
+              <span class="anchor" id="variable-err~20"></span>
               class(errors),
             </td>
 <td>intent(inout)</td>
@@ -332,7 +332,7 @@ <h2>Variables</h2>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/report_memory_error.html b/doc/proc/report_memory_error.html
index 125a801..4ca7054 100644
--- a/doc/proc/report_memory_error.html
+++ b/doc/proc/report_memory_error.html
@@ -164,7 +164,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~15"></span>
+              <span class="anchor" id="variable-err~18"></span>
               class(errors),
             </td>
 <td>intent(inout)</td>
@@ -272,7 +272,7 @@ <h2>Variables</h2>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/report_underdefined_error.html b/doc/proc/report_underdefined_error.html
index e74f925..750c2e3 100644
--- a/doc/proc/report_underdefined_error.html
+++ b/doc/proc/report_underdefined_error.html
@@ -164,7 +164,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~19"></span>
+              <span class="anchor" id="variable-err~22"></span>
               class(errors),
             </td>
 <td>intent(inout)</td>
@@ -287,7 +287,7 @@ <h2>Variables</h2>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/scaled_random_resample.html b/doc/proc/scaled_random_resample.html
index e3f0adb..c27d68a 100644
--- a/doc/proc/scaled_random_resample.html
+++ b/doc/proc/scaled_random_resample.html
@@ -154,7 +154,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~4"></span>
+              <span class="anchor" id="variable-x~11"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -213,7 +213,7 @@ <h3>Arguments</h3>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/standard_deviation.html b/doc/proc/standard_deviation.html
index 1e7646c..839d805 100644
--- a/doc/proc/standard_deviation.html
+++ b/doc/proc/standard_deviation.html
@@ -156,7 +156,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~10"></span>
+              <span class="anchor" id="variable-x~23"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -174,7 +174,7 @@ <h3>Arguments</h3>
 
       <h3>Return Value
         <small>
-          <span class="anchor" id="variable-rst~5"></span>
+          <span class="anchor" id="variable-rst~20"></span>
           real(kind=real64)
         </small>
       </h3>
@@ -207,7 +207,7 @@ <h3>Return Value
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/t_test_equal_variance.html b/doc/proc/t_test_equal_variance.html
index dc5c024..d4c8a34 100644
--- a/doc/proc/t_test_equal_variance.html
+++ b/doc/proc/t_test_equal_variance.html
@@ -203,7 +203,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-p~10"></span>
+              <span class="anchor" id="variable-p~11"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -220,7 +220,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-dof~6"></span>
+              <span class="anchor" id="variable-dof~7"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -264,7 +264,7 @@ <h3>Arguments</h3>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/t_test_paired.html b/doc/proc/t_test_paired.html
index 5060677..1fcce6c 100644
--- a/doc/proc/t_test_paired.html
+++ b/doc/proc/t_test_paired.html
@@ -74,7 +74,7 @@ <h1>t_test_paired
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 2.8% of total for procedures.">44 statements</a>
+                 title=" 2.7% of total for procedures.">44 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -202,7 +202,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-p~12"></span>
+              <span class="anchor" id="variable-p~13"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -219,7 +219,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-dof~8"></span>
+              <span class="anchor" id="variable-dof~9"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -234,7 +234,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-err~14"></span>
+              <span class="anchor" id="variable-err~24"></span>
               class(errors),
             </td>
 <td>intent(inout),</td>
@@ -282,7 +282,7 @@ <h3>Arguments</h3>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/t_test_unequal_variance.html b/doc/proc/t_test_unequal_variance.html
index fd141fa..46ba9a1 100644
--- a/doc/proc/t_test_unequal_variance.html
+++ b/doc/proc/t_test_unequal_variance.html
@@ -203,7 +203,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-p~11"></span>
+              <span class="anchor" id="variable-p~12"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -220,7 +220,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-dof~7"></span>
+              <span class="anchor" id="variable-dof~8"></span>
               real(kind=real64),
             </td>
 <td>intent(out)</td>
@@ -264,7 +264,7 @@ <h3>Arguments</h3>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/trimmed_mean.html b/doc/proc/trimmed_mean.html
index e78d9ae..6428e44 100644
--- a/doc/proc/trimmed_mean.html
+++ b/doc/proc/trimmed_mean.html
@@ -153,7 +153,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~13"></span>
+              <span class="anchor" id="variable-x~26"></span>
               real(kind=real64),
             </td>
 <td>intent(inout),</td>
@@ -169,7 +169,7 @@ <h3>Arguments</h3>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-p"></span>
+              <span class="anchor" id="variable-p~2"></span>
               real(kind=real64),
             </td>
 <td>intent(in),</td>
@@ -189,7 +189,7 @@ <h3>Arguments</h3>
 
       <h3>Return Value
         <small>
-          <span class="anchor" id="variable-rst~8"></span>
+          <span class="anchor" id="variable-rst~23"></span>
           real(kind=real64)
         </small>
       </h3>
@@ -222,7 +222,7 @@ <h3>Return Value
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/proc/variance.html b/doc/proc/variance.html
index a507e8c..8c5f249 100644
--- a/doc/proc/variance.html
+++ b/doc/proc/variance.html
@@ -155,7 +155,7 @@ <h3>Arguments</h3>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-x~9"></span>
+              <span class="anchor" id="variable-x~22"></span>
               real(kind=real64),
             </td>
 <td>intent(in)</td>
@@ -173,7 +173,7 @@ <h3>Arguments</h3>
 
       <h3>Return Value
         <small>
-          <span class="anchor" id="variable-rst~4"></span>
+          <span class="anchor" id="variable-rst~19"></span>
           real(kind=real64)
         </small>
       </h3>
@@ -206,7 +206,7 @@ <h3>Return Value
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/search.html b/doc/search.html
index 999ebb8..2ee611f 100644
--- a/doc/search.html
+++ b/doc/search.html
@@ -95,7 +95,7 @@ <h1>Search Results</h1>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/sourcefile/fstats.f90.html b/doc/sourcefile/fstats.f90.html
index 58a8a56..9b66697 100644
--- a/doc/sourcefile/fstats.f90.html
+++ b/doc/sourcefile/fstats.f90.html
@@ -74,7 +74,7 @@ <h1>fstats.f90
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 2.9% of total for source files.">81 statements</a>
+                 title=" 2.9% of total for source files.">83 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -202,7 +202,7 @@ <h2><span class="anchor" id="src"></span>Source Code</h2>
 <a id="ln-49" name="ln-49" href="#ln-49"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">digamma</span>
 <a id="ln-50" name="ln-50" href="#ln-50"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">incomplete_gamma_upper</span>
 <a id="ln-51" name="ln-51" href="#ln-51"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">incomplete_gamma_lower</span>
-<a id="ln-52" name="ln-52" href="#ln-52"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">coefficient_matrix</span>
+<a id="ln-52" name="ln-52" href="#ln-52"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">design_matrix</span>
 <a id="ln-53" name="ln-53" href="#ln-53"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">covariance_matrix</span>
 <a id="ln-54" name="ln-54" href="#ln-54"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">linear_least_squares</span>
 <a id="ln-55" name="ln-55" href="#ln-55"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">regression_statistics</span>
@@ -231,11 +231,13 @@ <h2><span class="anchor" id="src"></span>Source Code</h2>
 <a id="ln-78" name="ln-78" href="#ln-78"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">box_muller_sample</span>
 <a id="ln-79" name="ln-79" href="#ln-79"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">rejection_sample</span>
 <a id="ln-80" name="ln-80" href="#ln-80"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">lowess</span>
-<a id="ln-81" name="ln-81" href="#ln-81"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">FS_LEVENBERG_MARQUARDT_UPDATE</span>
-<a id="ln-82" name="ln-82" href="#ln-82"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">FS_QUADRATIC_UPDATE</span>
-<a id="ln-83" name="ln-83" href="#ln-83"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">FS_NIELSEN_UPDATE</span>
-<a id="ln-84" name="ln-84" href="#ln-84"></a><span class="w">   </span>
-<a id="ln-85" name="ln-85" href="#ln-85"></a><span class="k">end module</span>
+<a id="ln-81" name="ln-81" href="#ln-81"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">pooled_variance</span>
+<a id="ln-82" name="ln-82" href="#ln-82"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">bartletts_test</span>
+<a id="ln-83" name="ln-83" href="#ln-83"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">FS_LEVENBERG_MARQUARDT_UPDATE</span>
+<a id="ln-84" name="ln-84" href="#ln-84"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">FS_QUADRATIC_UPDATE</span>
+<a id="ln-85" name="ln-85" href="#ln-85"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">FS_NIELSEN_UPDATE</span>
+<a id="ln-86" name="ln-86" href="#ln-86"></a><span class="w">   </span>
+<a id="ln-87" name="ln-87" href="#ln-87"></a><span class="k">end module</span>
 </pre></div>
 
       </section>
@@ -254,7 +256,7 @@ <h2><span class="anchor" id="src"></span>Source Code</h2>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/sourcefile/fstats_allan.f90.html b/doc/sourcefile/fstats_allan.f90.html
index f4a3d8a..40534f2 100644
--- a/doc/sourcefile/fstats_allan.f90.html
+++ b/doc/sourcefile/fstats_allan.f90.html
@@ -269,7 +269,7 @@ <h2><span class="anchor" id="src"></span>Source Code</h2>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/sourcefile/fstats_anova.f90.html b/doc/sourcefile/fstats_anova.f90.html
index 9f9e986..0142488 100644
--- a/doc/sourcefile/fstats_anova.f90.html
+++ b/doc/sourcefile/fstats_anova.f90.html
@@ -74,7 +74,7 @@ <h1>fstats_anova.f90
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 7.2% of total for source files.">201 statements</a>
+                 title=" 7.0% of total for source files.">201 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -617,7 +617,7 @@ <h2><span class="anchor" id="src"></span>Source Code</h2>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/sourcefile/fstats_bootstrap.f90.html b/doc/sourcefile/fstats_bootstrap.f90.html
index 76845d3..f1636d3 100644
--- a/doc/sourcefile/fstats_bootstrap.f90.html
+++ b/doc/sourcefile/fstats_bootstrap.f90.html
@@ -74,7 +74,7 @@ <h1>fstats_bootstrap.f90
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title="12.6% of total for source files.">351 statements</a>
+                 title="12.3% of total for source files.">351 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -869,7 +869,7 @@ <h2><span class="anchor" id="src"></span>Source Code</h2>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/sourcefile/fstats_descriptive_statistics.f90.html b/doc/sourcefile/fstats_descriptive_statistics.f90.html
index 1aee557..e455427 100644
--- a/doc/sourcefile/fstats_descriptive_statistics.f90.html
+++ b/doc/sourcefile/fstats_descriptive_statistics.f90.html
@@ -74,7 +74,7 @@ <h1>fstats_descriptive_statistics.f90
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 4.7% of total for source files.">130 statements</a>
+                 title=" 5.7% of total for source files.">164 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -156,242 +156,297 @@ <h2><span class="anchor" id="src"></span>Source Code</h2>
 <a id="ln-3" name="ln-3" href="#ln-3"></a><span class="w">    </span><span class="k">use </span><span class="n">linalg</span><span class="p">,</span><span class="w"> </span><span class="k">only</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="n">sort</span>
 <a id="ln-4" name="ln-4" href="#ln-4"></a><span class="w">    </span><span class="k">use </span><span class="n">ferror</span>
 <a id="ln-5" name="ln-5" href="#ln-5"></a><span class="w">    </span><span class="k">use </span><span class="n">fstats_errors</span>
-<a id="ln-6" name="ln-6" href="#ln-6"></a><span class="w">    </span><span class="k">implicit none</span>
-<a id="ln-7" name="ln-7" href="#ln-7"></a><span class="k">    private</span>
-<a id="ln-8" name="ln-8" href="#ln-8"></a><span class="k">    public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">mean</span>
-<a id="ln-9" name="ln-9" href="#ln-9"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">variance</span>
-<a id="ln-10" name="ln-10" href="#ln-10"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">standard_deviation</span>
-<a id="ln-11" name="ln-11" href="#ln-11"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">median</span>
-<a id="ln-12" name="ln-12" href="#ln-12"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">quantile</span>
-<a id="ln-13" name="ln-13" href="#ln-13"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">trimmed_mean</span>
-<a id="ln-14" name="ln-14" href="#ln-14"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">covariance</span>
-<a id="ln-15" name="ln-15" href="#ln-15"></a><span class="w">    </span>
-<a id="ln-16" name="ln-16" href="#ln-16"></a><span class="k">contains</span>
-<a id="ln-17" name="ln-17" href="#ln-17"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-18" name="ln-18" href="#ln-18"></a><span class="k">pure function </span><span class="n">mean</span><span class="p">(</span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="k">result</span><span class="p">(</span><span class="n">rst</span><span class="p">)</span>
-<a id="ln-19" name="ln-19" href="#ln-19"></a><span class="w">    </span><span class="c">!! Computes the mean of the values in an array.</span>
-<a id="ln-20" name="ln-20" href="#ln-20"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span><span class="p">(:)</span>
-<a id="ln-21" name="ln-21" href="#ln-21"></a><span class="w">        </span><span class="c">!! The array of values to analyze.</span>
-<a id="ln-22" name="ln-22" href="#ln-22"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">rst</span>
-<a id="ln-23" name="ln-23" href="#ln-23"></a><span class="w">        </span><span class="c">!! The result.</span>
-<a id="ln-24" name="ln-24" href="#ln-24"></a>
-<a id="ln-25" name="ln-25" href="#ln-25"></a><span class="w">    </span><span class="c">! Parameters</span>
-<a id="ln-26" name="ln-26" href="#ln-26"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">zero</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.0d0</span>
-<a id="ln-27" name="ln-27" href="#ln-27"></a>
-<a id="ln-28" name="ln-28" href="#ln-28"></a><span class="w">    </span><span class="c">! Local Variables</span>
-<a id="ln-29" name="ln-29" href="#ln-29"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">i</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
-<a id="ln-30" name="ln-30" href="#ln-30"></a>
-<a id="ln-31" name="ln-31" href="#ln-31"></a><span class="w">    </span><span class="c">! Process</span>
-<a id="ln-32" name="ln-32" href="#ln-32"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
-<a id="ln-33" name="ln-33" href="#ln-33"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-34" name="ln-34" href="#ln-34"></a><span class="k">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">zero</span>
-<a id="ln-35" name="ln-35" href="#ln-35"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-36" name="ln-36" href="#ln-36"></a><span class="k">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
-<a id="ln-37" name="ln-37" href="#ln-37"></a><span class="w">        </span><span class="k">do </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">2</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
-<a id="ln-38" name="ln-38" href="#ln-38"></a><span class="w">            </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">rst</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">rst</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">i</span>
-<a id="ln-39" name="ln-39" href="#ln-39"></a><span class="w">        </span><span class="k">end do</span>
-<a id="ln-40" name="ln-40" href="#ln-40"></a><span class="k">    end if</span>
-<a id="ln-41" name="ln-41" href="#ln-41"></a><span class="k">end function</span>
-<a id="ln-42" name="ln-42" href="#ln-42"></a>
-<a id="ln-43" name="ln-43" href="#ln-43"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-44" name="ln-44" href="#ln-44"></a><span class="k">pure function </span><span class="n">variance</span><span class="p">(</span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="k">result</span><span class="p">(</span><span class="n">rst</span><span class="p">)</span>
-<a id="ln-45" name="ln-45" href="#ln-45"></a><span class="w">    </span><span class="c">!! Computes the sample variance of the values in an array.</span>
-<a id="ln-46" name="ln-46" href="#ln-46"></a><span class="w">    </span><span class="c">!!</span>
-<a id="ln-47" name="ln-47" href="#ln-47"></a><span class="w">    </span><span class="c">!! The variance computed is the sample variance such that </span>
-<a id="ln-48" name="ln-48" href="#ln-48"></a><span class="w">    </span><span class="c">!! $$ s^2 = \frac{\Sigma \left( x_{i} - \bar{x} \right)^2}{n - 1} $$.</span>
-<a id="ln-49" name="ln-49" href="#ln-49"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span><span class="p">(:)</span>
-<a id="ln-50" name="ln-50" href="#ln-50"></a><span class="w">        </span><span class="c">!! The array of values to analyze.</span>
-<a id="ln-51" name="ln-51" href="#ln-51"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">rst</span>
-<a id="ln-52" name="ln-52" href="#ln-52"></a>
-<a id="ln-53" name="ln-53" href="#ln-53"></a><span class="w">    </span><span class="c">! Parameters</span>
-<a id="ln-54" name="ln-54" href="#ln-54"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">zero</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.0d0</span>
-<a id="ln-55" name="ln-55" href="#ln-55"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">one</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d0</span>
-<a id="ln-56" name="ln-56" href="#ln-56"></a>
-<a id="ln-57" name="ln-57" href="#ln-57"></a><span class="w">    </span><span class="c">! Local Variables</span>
-<a id="ln-58" name="ln-58" href="#ln-58"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">i</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
-<a id="ln-59" name="ln-59" href="#ln-59"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">oldMean</span><span class="p">,</span><span class="w"> </span><span class="n">newMean</span>
-<a id="ln-60" name="ln-60" href="#ln-60"></a>
-<a id="ln-61" name="ln-61" href="#ln-61"></a><span class="w">    </span><span class="c">! Process</span>
-<a id="ln-62" name="ln-62" href="#ln-62"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
-<a id="ln-63" name="ln-63" href="#ln-63"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-64" name="ln-64" href="#ln-64"></a><span class="k">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">zero</span>
-<a id="ln-65" name="ln-65" href="#ln-65"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-66" name="ln-66" href="#ln-66"></a><span class="k">        </span><span class="n">oldMean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
-<a id="ln-67" name="ln-67" href="#ln-67"></a><span class="w">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">zero</span>
-<a id="ln-68" name="ln-68" href="#ln-68"></a><span class="w">        </span><span class="k">do </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">2</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
-<a id="ln-69" name="ln-69" href="#ln-69"></a><span class="w">            </span><span class="n">newMean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">oldMean</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">oldMean</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">i</span>
-<a id="ln-70" name="ln-70" href="#ln-70"></a><span class="w">            </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">rst</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">oldMean</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">newMean</span><span class="p">)</span>
-<a id="ln-71" name="ln-71" href="#ln-71"></a><span class="w">            </span><span class="n">oldMean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">newMean</span>
-<a id="ln-72" name="ln-72" href="#ln-72"></a><span class="w">        </span><span class="k">end do</span>
-<a id="ln-73" name="ln-73" href="#ln-73"></a><span class="k">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">rst</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">one</span><span class="p">)</span>
-<a id="ln-74" name="ln-74" href="#ln-74"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-75" name="ln-75" href="#ln-75"></a><span class="k">end function</span>
-<a id="ln-76" name="ln-76" href="#ln-76"></a>
-<a id="ln-77" name="ln-77" href="#ln-77"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-78" name="ln-78" href="#ln-78"></a><span class="k">pure function </span><span class="n">standard_deviation</span><span class="p">(</span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="k">result</span><span class="p">(</span><span class="n">rst</span><span class="p">)</span>
-<a id="ln-79" name="ln-79" href="#ln-79"></a><span class="w">    </span><span class="c">!! Computes the sample standard deviation of the values in an array.</span>
-<a id="ln-80" name="ln-80" href="#ln-80"></a><span class="w">    </span><span class="c">!! </span>
-<a id="ln-81" name="ln-81" href="#ln-81"></a><span class="w">    </span><span class="c">!! The value computed is the sample standard deviation.</span>
-<a id="ln-82" name="ln-82" href="#ln-82"></a><span class="w">    </span><span class="c">!! $$ s = \sqrt{ \frac{\Sigma \left( x_{i} - \bar{x} \right)^2}{n - 1} } $$</span>
-<a id="ln-83" name="ln-83" href="#ln-83"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span><span class="p">(:)</span>
-<a id="ln-84" name="ln-84" href="#ln-84"></a><span class="w">        </span><span class="c">!! The array of values to analyze.</span>
-<a id="ln-85" name="ln-85" href="#ln-85"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">rst</span>
-<a id="ln-86" name="ln-86" href="#ln-86"></a><span class="w">        </span><span class="c">!! The result.</span>
-<a id="ln-87" name="ln-87" href="#ln-87"></a>
-<a id="ln-88" name="ln-88" href="#ln-88"></a><span class="w">    </span><span class="c">! Process</span>
-<a id="ln-89" name="ln-89" href="#ln-89"></a><span class="w">    </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">sqrt</span><span class="p">(</span><span class="n">variance</span><span class="p">(</span><span class="n">x</span><span class="p">))</span>
-<a id="ln-90" name="ln-90" href="#ln-90"></a><span class="k">end function</span>
-<a id="ln-91" name="ln-91" href="#ln-91"></a>
-<a id="ln-92" name="ln-92" href="#ln-92"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-93" name="ln-93" href="#ln-93"></a><span class="k">function </span><span class="n">median</span><span class="p">(</span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="k">result</span><span class="p">(</span><span class="n">rst</span><span class="p">)</span>
-<a id="ln-94" name="ln-94" href="#ln-94"></a><span class="w">    </span><span class="c">!! Computes the median of the values in an array.</span>
-<a id="ln-95" name="ln-95" href="#ln-95"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span><span class="p">(:)</span>
-<a id="ln-96" name="ln-96" href="#ln-96"></a><span class="w">        </span><span class="c">!! The array of values to analyze.  On output, this array is sorted into</span>
-<a id="ln-97" name="ln-97" href="#ln-97"></a><span class="w">        </span><span class="c">!! ascending order.</span>
-<a id="ln-98" name="ln-98" href="#ln-98"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">rst</span>
-<a id="ln-99" name="ln-99" href="#ln-99"></a><span class="w">        </span><span class="c">!! The result.</span>
-<a id="ln-100" name="ln-100" href="#ln-100"></a>
-<a id="ln-101" name="ln-101" href="#ln-101"></a><span class="w">    </span><span class="c">! Parameters</span>
-<a id="ln-102" name="ln-102" href="#ln-102"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">half</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.5d0</span>
-<a id="ln-103" name="ln-103" href="#ln-103"></a>
-<a id="ln-104" name="ln-104" href="#ln-104"></a><span class="w">    </span><span class="c">! Local Variables</span>
-<a id="ln-105" name="ln-105" href="#ln-105"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">nmid</span><span class="p">,</span><span class="w"> </span><span class="n">nmidp1</span><span class="p">,</span><span class="w"> </span><span class="n">flag</span><span class="p">,</span><span class="w"> </span><span class="n">iflag</span>
-<a id="ln-106" name="ln-106" href="#ln-106"></a>
-<a id="ln-107" name="ln-107" href="#ln-107"></a><span class="w">    </span><span class="c">! Initialization</span>
-<a id="ln-108" name="ln-108" href="#ln-108"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
-<a id="ln-109" name="ln-109" href="#ln-109"></a><span class="w">    </span><span class="n">nmid</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="mi">2</span>
-<a id="ln-110" name="ln-110" href="#ln-110"></a><span class="w">    </span><span class="n">nmidp1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">nmid</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span>
-<a id="ln-111" name="ln-111" href="#ln-111"></a><span class="w">    </span><span class="n">iflag</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">nmid</span>
-<a id="ln-112" name="ln-112" href="#ln-112"></a><span class="w">    </span>
-<a id="ln-113" name="ln-113" href="#ln-113"></a><span class="w">    </span><span class="c">! Sort the array in ascending order</span>
-<a id="ln-114" name="ln-114" href="#ln-114"></a><span class="w">    </span><span class="k">call </span><span class="n">sort</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.)</span>
-<a id="ln-115" name="ln-115" href="#ln-115"></a>
-<a id="ln-116" name="ln-116" href="#ln-116"></a><span class="w">    </span><span class="c">! Find the median</span>
-<a id="ln-117" name="ln-117" href="#ln-117"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">iflag</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-118" name="ln-118" href="#ln-118"></a><span class="k">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">half</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="p">(</span><span class="n">nmid</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">x</span><span class="p">(</span><span class="n">nmidp1</span><span class="p">))</span>
-<a id="ln-119" name="ln-119" href="#ln-119"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-120" name="ln-120" href="#ln-120"></a><span class="k">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span><span class="p">(</span><span class="n">nmidp1</span><span class="p">)</span>
-<a id="ln-121" name="ln-121" href="#ln-121"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-122" name="ln-122" href="#ln-122"></a><span class="k">end function</span>
-<a id="ln-123" name="ln-123" href="#ln-123"></a>
-<a id="ln-124" name="ln-124" href="#ln-124"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-125" name="ln-125" href="#ln-125"></a><span class="c">! REF: https://fortranwiki.org/fortran/show/Quartiles</span>
-<a id="ln-126" name="ln-126" href="#ln-126"></a><span class="c">!</span>
-<a id="ln-127" name="ln-127" href="#ln-127"></a><span class="c">! This is the method used by Minitab</span>
-<a id="ln-128" name="ln-128" href="#ln-128"></a><span class="k">pure function </span><span class="n">quantile</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">q</span><span class="p">)</span><span class="w"> </span><span class="k">result</span><span class="p">(</span><span class="n">rst</span><span class="p">)</span>
-<a id="ln-129" name="ln-129" href="#ln-129"></a><span class="w">    </span><span class="c">!! Computes the specified quantile of a data set using the SAS </span>
-<a id="ln-130" name="ln-130" href="#ln-130"></a><span class="w">    </span><span class="c">!! Method 4.</span>
-<a id="ln-131" name="ln-131" href="#ln-131"></a><span class="w">    </span><span class="c">!!</span>
-<a id="ln-132" name="ln-132" href="#ln-132"></a><span class="w">    </span><span class="c">!! See Also</span>
-<a id="ln-133" name="ln-133" href="#ln-133"></a><span class="w">    </span><span class="c">!!</span>
-<a id="ln-134" name="ln-134" href="#ln-134"></a><span class="w">    </span><span class="c">!! - [Wikipedia](https://en.wikipedia.org/wiki/Quantile)</span>
-<a id="ln-135" name="ln-135" href="#ln-135"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span><span class="p">(:)</span>
-<a id="ln-136" name="ln-136" href="#ln-136"></a><span class="w">        </span><span class="c">!! An N-element array containing the data.</span>
-<a id="ln-137" name="ln-137" href="#ln-137"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">q</span>
-<a id="ln-138" name="ln-138" href="#ln-138"></a><span class="w">        </span><span class="c">!! The quantile to compute (e.g. 0.25 computes the 25% quantile).</span>
-<a id="ln-139" name="ln-139" href="#ln-139"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">rst</span>
-<a id="ln-140" name="ln-140" href="#ln-140"></a><span class="w">        </span><span class="c">!! The result.</span>
-<a id="ln-141" name="ln-141" href="#ln-141"></a>
-<a id="ln-142" name="ln-142" href="#ln-142"></a><span class="w">    </span><span class="c">! Parameters</span>
-<a id="ln-143" name="ln-143" href="#ln-143"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">one</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d0</span>
-<a id="ln-144" name="ln-144" href="#ln-144"></a>
-<a id="ln-145" name="ln-145" href="#ln-145"></a><span class="w">    </span><span class="c">! Local Variables</span>
-<a id="ln-146" name="ln-146" href="#ln-146"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">b</span><span class="p">,</span><span class="w"> </span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="n">tol</span>
-<a id="ln-147" name="ln-147" href="#ln-147"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">ib</span>
+<a id="ln-6" name="ln-6" href="#ln-6"></a><span class="w">    </span><span class="k">use </span><span class="n">fstats_types</span>
+<a id="ln-7" name="ln-7" href="#ln-7"></a><span class="w">    </span><span class="k">implicit none</span>
+<a id="ln-8" name="ln-8" href="#ln-8"></a><span class="k">    private</span>
+<a id="ln-9" name="ln-9" href="#ln-9"></a><span class="k">    public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">mean</span>
+<a id="ln-10" name="ln-10" href="#ln-10"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">variance</span>
+<a id="ln-11" name="ln-11" href="#ln-11"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">standard_deviation</span>
+<a id="ln-12" name="ln-12" href="#ln-12"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">median</span>
+<a id="ln-13" name="ln-13" href="#ln-13"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">quantile</span>
+<a id="ln-14" name="ln-14" href="#ln-14"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">trimmed_mean</span>
+<a id="ln-15" name="ln-15" href="#ln-15"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">covariance</span>
+<a id="ln-16" name="ln-16" href="#ln-16"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">pooled_variance</span>
+<a id="ln-17" name="ln-17" href="#ln-17"></a><span class="w">    </span>
+<a id="ln-18" name="ln-18" href="#ln-18"></a><span class="w">    </span><span class="k">interface </span><span class="n">pooled_variance</span>
+<a id="ln-19" name="ln-19" href="#ln-19"></a><span class="w">        </span><span class="c">!! Computes the pooled estimate of variance.</span>
+<a id="ln-20" name="ln-20" href="#ln-20"></a><span class="w">        </span><span class="k">module procedure</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">pooled_variance_1</span>
+<a id="ln-21" name="ln-21" href="#ln-21"></a><span class="w">        </span><span class="k">module procedure</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">pooled_variance_2</span>
+<a id="ln-22" name="ln-22" href="#ln-22"></a><span class="w">    </span><span class="k">end interface</span>
+<a id="ln-23" name="ln-23" href="#ln-23"></a><span class="k">contains</span>
+<a id="ln-24" name="ln-24" href="#ln-24"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-25" name="ln-25" href="#ln-25"></a><span class="k">pure function </span><span class="n">mean</span><span class="p">(</span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="k">result</span><span class="p">(</span><span class="n">rst</span><span class="p">)</span>
+<a id="ln-26" name="ln-26" href="#ln-26"></a><span class="w">    </span><span class="c">!! Computes the mean of the values in an array.</span>
+<a id="ln-27" name="ln-27" href="#ln-27"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span><span class="p">(:)</span>
+<a id="ln-28" name="ln-28" href="#ln-28"></a><span class="w">        </span><span class="c">!! The array of values to analyze.</span>
+<a id="ln-29" name="ln-29" href="#ln-29"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">rst</span>
+<a id="ln-30" name="ln-30" href="#ln-30"></a><span class="w">        </span><span class="c">!! The result.</span>
+<a id="ln-31" name="ln-31" href="#ln-31"></a>
+<a id="ln-32" name="ln-32" href="#ln-32"></a><span class="w">    </span><span class="c">! Parameters</span>
+<a id="ln-33" name="ln-33" href="#ln-33"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">zero</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.0d0</span>
+<a id="ln-34" name="ln-34" href="#ln-34"></a>
+<a id="ln-35" name="ln-35" href="#ln-35"></a><span class="w">    </span><span class="c">! Local Variables</span>
+<a id="ln-36" name="ln-36" href="#ln-36"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">i</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
+<a id="ln-37" name="ln-37" href="#ln-37"></a>
+<a id="ln-38" name="ln-38" href="#ln-38"></a><span class="w">    </span><span class="c">! Process</span>
+<a id="ln-39" name="ln-39" href="#ln-39"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
+<a id="ln-40" name="ln-40" href="#ln-40"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-41" name="ln-41" href="#ln-41"></a><span class="k">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">zero</span>
+<a id="ln-42" name="ln-42" href="#ln-42"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-43" name="ln-43" href="#ln-43"></a><span class="k">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
+<a id="ln-44" name="ln-44" href="#ln-44"></a><span class="w">        </span><span class="k">do </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">2</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
+<a id="ln-45" name="ln-45" href="#ln-45"></a><span class="w">            </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">rst</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">rst</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">i</span>
+<a id="ln-46" name="ln-46" href="#ln-46"></a><span class="w">        </span><span class="k">end do</span>
+<a id="ln-47" name="ln-47" href="#ln-47"></a><span class="k">    end if</span>
+<a id="ln-48" name="ln-48" href="#ln-48"></a><span class="k">end function</span>
+<a id="ln-49" name="ln-49" href="#ln-49"></a>
+<a id="ln-50" name="ln-50" href="#ln-50"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-51" name="ln-51" href="#ln-51"></a><span class="k">pure function </span><span class="n">variance</span><span class="p">(</span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="k">result</span><span class="p">(</span><span class="n">rst</span><span class="p">)</span>
+<a id="ln-52" name="ln-52" href="#ln-52"></a><span class="w">    </span><span class="c">!! Computes the sample variance of the values in an array.</span>
+<a id="ln-53" name="ln-53" href="#ln-53"></a><span class="w">    </span><span class="c">!!</span>
+<a id="ln-54" name="ln-54" href="#ln-54"></a><span class="w">    </span><span class="c">!! The variance computed is the sample variance such that </span>
+<a id="ln-55" name="ln-55" href="#ln-55"></a><span class="w">    </span><span class="c">!! $$ s^2 = \frac{\Sigma \left( x_{i} - \bar{x} \right)^2}{n - 1} $$.</span>
+<a id="ln-56" name="ln-56" href="#ln-56"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span><span class="p">(:)</span>
+<a id="ln-57" name="ln-57" href="#ln-57"></a><span class="w">        </span><span class="c">!! The array of values to analyze.</span>
+<a id="ln-58" name="ln-58" href="#ln-58"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">rst</span>
+<a id="ln-59" name="ln-59" href="#ln-59"></a>
+<a id="ln-60" name="ln-60" href="#ln-60"></a><span class="w">    </span><span class="c">! Parameters</span>
+<a id="ln-61" name="ln-61" href="#ln-61"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">zero</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.0d0</span>
+<a id="ln-62" name="ln-62" href="#ln-62"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">one</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d0</span>
+<a id="ln-63" name="ln-63" href="#ln-63"></a>
+<a id="ln-64" name="ln-64" href="#ln-64"></a><span class="w">    </span><span class="c">! Local Variables</span>
+<a id="ln-65" name="ln-65" href="#ln-65"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">i</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
+<a id="ln-66" name="ln-66" href="#ln-66"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">oldMean</span><span class="p">,</span><span class="w"> </span><span class="n">newMean</span>
+<a id="ln-67" name="ln-67" href="#ln-67"></a>
+<a id="ln-68" name="ln-68" href="#ln-68"></a><span class="w">    </span><span class="c">! Process</span>
+<a id="ln-69" name="ln-69" href="#ln-69"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
+<a id="ln-70" name="ln-70" href="#ln-70"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-71" name="ln-71" href="#ln-71"></a><span class="k">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">zero</span>
+<a id="ln-72" name="ln-72" href="#ln-72"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-73" name="ln-73" href="#ln-73"></a><span class="k">        </span><span class="n">oldMean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
+<a id="ln-74" name="ln-74" href="#ln-74"></a><span class="w">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">zero</span>
+<a id="ln-75" name="ln-75" href="#ln-75"></a><span class="w">        </span><span class="k">do </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">2</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
+<a id="ln-76" name="ln-76" href="#ln-76"></a><span class="w">            </span><span class="n">newMean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">oldMean</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">oldMean</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">i</span>
+<a id="ln-77" name="ln-77" href="#ln-77"></a><span class="w">            </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">rst</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">oldMean</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">newMean</span><span class="p">)</span>
+<a id="ln-78" name="ln-78" href="#ln-78"></a><span class="w">            </span><span class="n">oldMean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">newMean</span>
+<a id="ln-79" name="ln-79" href="#ln-79"></a><span class="w">        </span><span class="k">end do</span>
+<a id="ln-80" name="ln-80" href="#ln-80"></a><span class="k">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">rst</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">one</span><span class="p">)</span>
+<a id="ln-81" name="ln-81" href="#ln-81"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-82" name="ln-82" href="#ln-82"></a><span class="k">end function</span>
+<a id="ln-83" name="ln-83" href="#ln-83"></a>
+<a id="ln-84" name="ln-84" href="#ln-84"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-85" name="ln-85" href="#ln-85"></a><span class="k">pure function </span><span class="n">standard_deviation</span><span class="p">(</span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="k">result</span><span class="p">(</span><span class="n">rst</span><span class="p">)</span>
+<a id="ln-86" name="ln-86" href="#ln-86"></a><span class="w">    </span><span class="c">!! Computes the sample standard deviation of the values in an array.</span>
+<a id="ln-87" name="ln-87" href="#ln-87"></a><span class="w">    </span><span class="c">!! </span>
+<a id="ln-88" name="ln-88" href="#ln-88"></a><span class="w">    </span><span class="c">!! The value computed is the sample standard deviation.</span>
+<a id="ln-89" name="ln-89" href="#ln-89"></a><span class="w">    </span><span class="c">!! $$ s = \sqrt{ \frac{\Sigma \left( x_{i} - \bar{x} \right)^2}{n - 1} } $$</span>
+<a id="ln-90" name="ln-90" href="#ln-90"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span><span class="p">(:)</span>
+<a id="ln-91" name="ln-91" href="#ln-91"></a><span class="w">        </span><span class="c">!! The array of values to analyze.</span>
+<a id="ln-92" name="ln-92" href="#ln-92"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">rst</span>
+<a id="ln-93" name="ln-93" href="#ln-93"></a><span class="w">        </span><span class="c">!! The result.</span>
+<a id="ln-94" name="ln-94" href="#ln-94"></a>
+<a id="ln-95" name="ln-95" href="#ln-95"></a><span class="w">    </span><span class="c">! Process</span>
+<a id="ln-96" name="ln-96" href="#ln-96"></a><span class="w">    </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">sqrt</span><span class="p">(</span><span class="n">variance</span><span class="p">(</span><span class="n">x</span><span class="p">))</span>
+<a id="ln-97" name="ln-97" href="#ln-97"></a><span class="k">end function</span>
+<a id="ln-98" name="ln-98" href="#ln-98"></a>
+<a id="ln-99" name="ln-99" href="#ln-99"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-100" name="ln-100" href="#ln-100"></a><span class="k">function </span><span class="n">median</span><span class="p">(</span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="k">result</span><span class="p">(</span><span class="n">rst</span><span class="p">)</span>
+<a id="ln-101" name="ln-101" href="#ln-101"></a><span class="w">    </span><span class="c">!! Computes the median of the values in an array.</span>
+<a id="ln-102" name="ln-102" href="#ln-102"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span><span class="p">(:)</span>
+<a id="ln-103" name="ln-103" href="#ln-103"></a><span class="w">        </span><span class="c">!! The array of values to analyze.  On output, this array is sorted into</span>
+<a id="ln-104" name="ln-104" href="#ln-104"></a><span class="w">        </span><span class="c">!! ascending order.</span>
+<a id="ln-105" name="ln-105" href="#ln-105"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">rst</span>
+<a id="ln-106" name="ln-106" href="#ln-106"></a><span class="w">        </span><span class="c">!! The result.</span>
+<a id="ln-107" name="ln-107" href="#ln-107"></a>
+<a id="ln-108" name="ln-108" href="#ln-108"></a><span class="w">    </span><span class="c">! Parameters</span>
+<a id="ln-109" name="ln-109" href="#ln-109"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">half</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.5d0</span>
+<a id="ln-110" name="ln-110" href="#ln-110"></a>
+<a id="ln-111" name="ln-111" href="#ln-111"></a><span class="w">    </span><span class="c">! Local Variables</span>
+<a id="ln-112" name="ln-112" href="#ln-112"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">nmid</span><span class="p">,</span><span class="w"> </span><span class="n">nmidp1</span><span class="p">,</span><span class="w"> </span><span class="n">flag</span><span class="p">,</span><span class="w"> </span><span class="n">iflag</span>
+<a id="ln-113" name="ln-113" href="#ln-113"></a>
+<a id="ln-114" name="ln-114" href="#ln-114"></a><span class="w">    </span><span class="c">! Initialization</span>
+<a id="ln-115" name="ln-115" href="#ln-115"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
+<a id="ln-116" name="ln-116" href="#ln-116"></a><span class="w">    </span><span class="n">nmid</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="mi">2</span>
+<a id="ln-117" name="ln-117" href="#ln-117"></a><span class="w">    </span><span class="n">nmidp1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">nmid</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span>
+<a id="ln-118" name="ln-118" href="#ln-118"></a><span class="w">    </span><span class="n">iflag</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">nmid</span>
+<a id="ln-119" name="ln-119" href="#ln-119"></a><span class="w">    </span>
+<a id="ln-120" name="ln-120" href="#ln-120"></a><span class="w">    </span><span class="c">! Sort the array in ascending order</span>
+<a id="ln-121" name="ln-121" href="#ln-121"></a><span class="w">    </span><span class="k">call </span><span class="n">sort</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.)</span>
+<a id="ln-122" name="ln-122" href="#ln-122"></a>
+<a id="ln-123" name="ln-123" href="#ln-123"></a><span class="w">    </span><span class="c">! Find the median</span>
+<a id="ln-124" name="ln-124" href="#ln-124"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">iflag</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-125" name="ln-125" href="#ln-125"></a><span class="k">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">half</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="p">(</span><span class="n">nmid</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">x</span><span class="p">(</span><span class="n">nmidp1</span><span class="p">))</span>
+<a id="ln-126" name="ln-126" href="#ln-126"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-127" name="ln-127" href="#ln-127"></a><span class="k">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span><span class="p">(</span><span class="n">nmidp1</span><span class="p">)</span>
+<a id="ln-128" name="ln-128" href="#ln-128"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-129" name="ln-129" href="#ln-129"></a><span class="k">end function</span>
+<a id="ln-130" name="ln-130" href="#ln-130"></a>
+<a id="ln-131" name="ln-131" href="#ln-131"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-132" name="ln-132" href="#ln-132"></a><span class="c">! REF: https://fortranwiki.org/fortran/show/Quartiles</span>
+<a id="ln-133" name="ln-133" href="#ln-133"></a><span class="c">!</span>
+<a id="ln-134" name="ln-134" href="#ln-134"></a><span class="c">! This is the method used by Minitab</span>
+<a id="ln-135" name="ln-135" href="#ln-135"></a><span class="k">pure function </span><span class="n">quantile</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">q</span><span class="p">)</span><span class="w"> </span><span class="k">result</span><span class="p">(</span><span class="n">rst</span><span class="p">)</span>
+<a id="ln-136" name="ln-136" href="#ln-136"></a><span class="w">    </span><span class="c">!! Computes the specified quantile of a data set using the SAS </span>
+<a id="ln-137" name="ln-137" href="#ln-137"></a><span class="w">    </span><span class="c">!! Method 4.</span>
+<a id="ln-138" name="ln-138" href="#ln-138"></a><span class="w">    </span><span class="c">!!</span>
+<a id="ln-139" name="ln-139" href="#ln-139"></a><span class="w">    </span><span class="c">!! See Also</span>
+<a id="ln-140" name="ln-140" href="#ln-140"></a><span class="w">    </span><span class="c">!!</span>
+<a id="ln-141" name="ln-141" href="#ln-141"></a><span class="w">    </span><span class="c">!! - [Wikipedia](https://en.wikipedia.org/wiki/Quantile)</span>
+<a id="ln-142" name="ln-142" href="#ln-142"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span><span class="p">(:)</span>
+<a id="ln-143" name="ln-143" href="#ln-143"></a><span class="w">        </span><span class="c">!! An N-element array containing the data.</span>
+<a id="ln-144" name="ln-144" href="#ln-144"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">q</span>
+<a id="ln-145" name="ln-145" href="#ln-145"></a><span class="w">        </span><span class="c">!! The quantile to compute (e.g. 0.25 computes the 25% quantile).</span>
+<a id="ln-146" name="ln-146" href="#ln-146"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">rst</span>
+<a id="ln-147" name="ln-147" href="#ln-147"></a><span class="w">        </span><span class="c">!! The result.</span>
 <a id="ln-148" name="ln-148" href="#ln-148"></a>
-<a id="ln-149" name="ln-149" href="#ln-149"></a><span class="w">    </span><span class="c">! Initialization</span>
-<a id="ln-150" name="ln-150" href="#ln-150"></a><span class="w">    </span><span class="n">tol</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">sqrt</span><span class="p">(</span><span class="nb">epsilon</span><span class="p">(</span><span class="n">tol</span><span class="p">))</span>
-<a id="ln-151" name="ln-151" href="#ln-151"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
-<a id="ln-152" name="ln-152" href="#ln-152"></a>
-<a id="ln-153" name="ln-153" href="#ln-153"></a><span class="w">    </span><span class="c">! Process</span>
-<a id="ln-154" name="ln-154" href="#ln-154"></a><span class="w">    </span><span class="n">a</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">one</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">q</span>
-<a id="ln-155" name="ln-155" href="#ln-155"></a><span class="w">    </span><span class="n">b</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">mod</span><span class="p">(</span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">one</span><span class="p">)</span>
-<a id="ln-156" name="ln-156" href="#ln-156"></a><span class="w">    </span><span class="n">c</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">b</span>
-<a id="ln-157" name="ln-157" href="#ln-157"></a>
-<a id="ln-158" name="ln-158" href="#ln-158"></a><span class="w">    </span><span class="n">ib</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">int</span><span class="p">(</span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="n">int32</span><span class="p">)</span>
-<a id="ln-159" name="ln-159" href="#ln-159"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">((</span><span class="n">ib</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-160" name="ln-160" href="#ln-160"></a><span class="k">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">one</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">b</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">x</span><span class="p">(</span><span class="n">ib</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">x</span><span class="p">(</span><span class="n">n</span><span class="p">)</span>
-<a id="ln-161" name="ln-161" href="#ln-161"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-162" name="ln-162" href="#ln-162"></a><span class="k">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">one</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">b</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">x</span><span class="p">(</span><span class="n">ib</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">x</span><span class="p">(</span><span class="n">ib</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
-<a id="ln-163" name="ln-163" href="#ln-163"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-164" name="ln-164" href="#ln-164"></a><span class="k">end function</span>
-<a id="ln-165" name="ln-165" href="#ln-165"></a>
-<a id="ln-166" name="ln-166" href="#ln-166"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-167" name="ln-167" href="#ln-167"></a><span class="k">function </span><span class="n">trimmed_mean</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">)</span><span class="w"> </span><span class="k">result</span><span class="p">(</span><span class="n">rst</span><span class="p">)</span>
-<a id="ln-168" name="ln-168" href="#ln-168"></a><span class="w">    </span><span class="c">!! Computes the trimmed mean of a data set.</span>
-<a id="ln-169" name="ln-169" href="#ln-169"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">),</span><span class="w"> </span><span class="k">dimension</span><span class="p">(:)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span>
-<a id="ln-170" name="ln-170" href="#ln-170"></a><span class="w">        </span><span class="c">!! An N-element array containing the data.  On output, the</span>
-<a id="ln-171" name="ln-171" href="#ln-171"></a><span class="w">        </span><span class="c">!! array is sorted into ascending order.</span>
-<a id="ln-172" name="ln-172" href="#ln-172"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">p</span>
-<a id="ln-173" name="ln-173" href="#ln-173"></a><span class="w">        </span><span class="c">!! An optional parameter specifying the percentage of values</span>
-<a id="ln-174" name="ln-174" href="#ln-174"></a><span class="w">        </span><span class="c">!! from either end of the distribution to remove.  The default</span>
-<a id="ln-175" name="ln-175" href="#ln-175"></a><span class="w">        </span><span class="c">!! is 0.05 such that the bottom 5% and top 5% are removed.</span>
-<a id="ln-176" name="ln-176" href="#ln-176"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">rst</span>
-<a id="ln-177" name="ln-177" href="#ln-177"></a><span class="w">        </span><span class="c">!! The trimmed mean.</span>
-<a id="ln-178" name="ln-178" href="#ln-178"></a>
-<a id="ln-179" name="ln-179" href="#ln-179"></a><span class="w">    </span><span class="c">! Local Variables</span>
-<a id="ln-180" name="ln-180" href="#ln-180"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">i1</span><span class="p">,</span><span class="w"> </span><span class="n">i2</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
-<a id="ln-181" name="ln-181" href="#ln-181"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">pv</span>
-<a id="ln-182" name="ln-182" href="#ln-182"></a>
-<a id="ln-183" name="ln-183" href="#ln-183"></a><span class="w">    </span><span class="c">! Initialization</span>
-<a id="ln-184" name="ln-184" href="#ln-184"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">p</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-185" name="ln-185" href="#ln-185"></a><span class="k">        </span><span class="n">pv</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">abs</span><span class="p">(</span><span class="n">p</span><span class="p">)</span>
-<a id="ln-186" name="ln-186" href="#ln-186"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-187" name="ln-187" href="#ln-187"></a><span class="k">        </span><span class="n">pv</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.05d0</span>
-<a id="ln-188" name="ln-188" href="#ln-188"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-149" name="ln-149" href="#ln-149"></a><span class="w">    </span><span class="c">! Parameters</span>
+<a id="ln-150" name="ln-150" href="#ln-150"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">one</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d0</span>
+<a id="ln-151" name="ln-151" href="#ln-151"></a>
+<a id="ln-152" name="ln-152" href="#ln-152"></a><span class="w">    </span><span class="c">! Local Variables</span>
+<a id="ln-153" name="ln-153" href="#ln-153"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">b</span><span class="p">,</span><span class="w"> </span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="n">tol</span>
+<a id="ln-154" name="ln-154" href="#ln-154"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">ib</span>
+<a id="ln-155" name="ln-155" href="#ln-155"></a>
+<a id="ln-156" name="ln-156" href="#ln-156"></a><span class="w">    </span><span class="c">! Initialization</span>
+<a id="ln-157" name="ln-157" href="#ln-157"></a><span class="w">    </span><span class="n">tol</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">sqrt</span><span class="p">(</span><span class="nb">epsilon</span><span class="p">(</span><span class="n">tol</span><span class="p">))</span>
+<a id="ln-158" name="ln-158" href="#ln-158"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
+<a id="ln-159" name="ln-159" href="#ln-159"></a>
+<a id="ln-160" name="ln-160" href="#ln-160"></a><span class="w">    </span><span class="c">! Process</span>
+<a id="ln-161" name="ln-161" href="#ln-161"></a><span class="w">    </span><span class="n">a</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">one</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">q</span>
+<a id="ln-162" name="ln-162" href="#ln-162"></a><span class="w">    </span><span class="n">b</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">mod</span><span class="p">(</span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">one</span><span class="p">)</span>
+<a id="ln-163" name="ln-163" href="#ln-163"></a><span class="w">    </span><span class="n">c</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">b</span>
+<a id="ln-164" name="ln-164" href="#ln-164"></a>
+<a id="ln-165" name="ln-165" href="#ln-165"></a><span class="w">    </span><span class="n">ib</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">int</span><span class="p">(</span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="n">int32</span><span class="p">)</span>
+<a id="ln-166" name="ln-166" href="#ln-166"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">((</span><span class="n">ib</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-167" name="ln-167" href="#ln-167"></a><span class="k">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">one</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">b</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">x</span><span class="p">(</span><span class="n">ib</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">x</span><span class="p">(</span><span class="n">n</span><span class="p">)</span>
+<a id="ln-168" name="ln-168" href="#ln-168"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-169" name="ln-169" href="#ln-169"></a><span class="k">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">one</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">b</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">x</span><span class="p">(</span><span class="n">ib</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">x</span><span class="p">(</span><span class="n">ib</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
+<a id="ln-170" name="ln-170" href="#ln-170"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-171" name="ln-171" href="#ln-171"></a><span class="k">end function</span>
+<a id="ln-172" name="ln-172" href="#ln-172"></a>
+<a id="ln-173" name="ln-173" href="#ln-173"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-174" name="ln-174" href="#ln-174"></a><span class="k">function </span><span class="n">trimmed_mean</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">)</span><span class="w"> </span><span class="k">result</span><span class="p">(</span><span class="n">rst</span><span class="p">)</span>
+<a id="ln-175" name="ln-175" href="#ln-175"></a><span class="w">    </span><span class="c">!! Computes the trimmed mean of a data set.</span>
+<a id="ln-176" name="ln-176" href="#ln-176"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">),</span><span class="w"> </span><span class="k">dimension</span><span class="p">(:)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span>
+<a id="ln-177" name="ln-177" href="#ln-177"></a><span class="w">        </span><span class="c">!! An N-element array containing the data.  On output, the</span>
+<a id="ln-178" name="ln-178" href="#ln-178"></a><span class="w">        </span><span class="c">!! array is sorted into ascending order.</span>
+<a id="ln-179" name="ln-179" href="#ln-179"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">p</span>
+<a id="ln-180" name="ln-180" href="#ln-180"></a><span class="w">        </span><span class="c">!! An optional parameter specifying the percentage of values</span>
+<a id="ln-181" name="ln-181" href="#ln-181"></a><span class="w">        </span><span class="c">!! from either end of the distribution to remove.  The default</span>
+<a id="ln-182" name="ln-182" href="#ln-182"></a><span class="w">        </span><span class="c">!! is 0.05 such that the bottom 5% and top 5% are removed.</span>
+<a id="ln-183" name="ln-183" href="#ln-183"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">rst</span>
+<a id="ln-184" name="ln-184" href="#ln-184"></a><span class="w">        </span><span class="c">!! The trimmed mean.</span>
+<a id="ln-185" name="ln-185" href="#ln-185"></a>
+<a id="ln-186" name="ln-186" href="#ln-186"></a><span class="w">    </span><span class="c">! Local Variables</span>
+<a id="ln-187" name="ln-187" href="#ln-187"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">i1</span><span class="p">,</span><span class="w"> </span><span class="n">i2</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
+<a id="ln-188" name="ln-188" href="#ln-188"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">pv</span>
 <a id="ln-189" name="ln-189" href="#ln-189"></a>
-<a id="ln-190" name="ln-190" href="#ln-190"></a><span class="w">    </span><span class="c">! Sort the array into ascending order</span>
-<a id="ln-191" name="ln-191" href="#ln-191"></a><span class="w">    </span><span class="k">call </span><span class="n">sort</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.)</span>
-<a id="ln-192" name="ln-192" href="#ln-192"></a>
-<a id="ln-193" name="ln-193" href="#ln-193"></a><span class="w">    </span><span class="c">! Find the limiting indices</span>
-<a id="ln-194" name="ln-194" href="#ln-194"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
-<a id="ln-195" name="ln-195" href="#ln-195"></a><span class="w">    </span><span class="n">i1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">max</span><span class="p">(</span><span class="nb">floor</span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">pv</span><span class="p">,</span><span class="w"> </span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
-<a id="ln-196" name="ln-196" href="#ln-196"></a><span class="w">    </span><span class="n">i2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">min</span><span class="p">(</span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">i1</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
-<a id="ln-197" name="ln-197" href="#ln-197"></a><span class="w">    </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">mean</span><span class="p">(</span><span class="n">x</span><span class="p">(</span><span class="n">i1</span><span class="p">:</span><span class="n">i2</span><span class="p">))</span>
-<a id="ln-198" name="ln-198" href="#ln-198"></a><span class="k">end function</span>
+<a id="ln-190" name="ln-190" href="#ln-190"></a><span class="w">    </span><span class="c">! Initialization</span>
+<a id="ln-191" name="ln-191" href="#ln-191"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">p</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-192" name="ln-192" href="#ln-192"></a><span class="k">        </span><span class="n">pv</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">abs</span><span class="p">(</span><span class="n">p</span><span class="p">)</span>
+<a id="ln-193" name="ln-193" href="#ln-193"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-194" name="ln-194" href="#ln-194"></a><span class="k">        </span><span class="n">pv</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.05d0</span>
+<a id="ln-195" name="ln-195" href="#ln-195"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-196" name="ln-196" href="#ln-196"></a>
+<a id="ln-197" name="ln-197" href="#ln-197"></a><span class="w">    </span><span class="c">! Sort the array into ascending order</span>
+<a id="ln-198" name="ln-198" href="#ln-198"></a><span class="w">    </span><span class="k">call </span><span class="n">sort</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.)</span>
 <a id="ln-199" name="ln-199" href="#ln-199"></a>
-<a id="ln-200" name="ln-200" href="#ln-200"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-201" name="ln-201" href="#ln-201"></a><span class="k">pure function </span><span class="n">covariance</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">)</span><span class="w"> </span><span class="k">result</span><span class="p">(</span><span class="n">rst</span><span class="p">)</span>
-<a id="ln-202" name="ln-202" href="#ln-202"></a><span class="w">    </span><span class="c">!! Computes the sample covariance of two data sets.</span>
-<a id="ln-203" name="ln-203" href="#ln-203"></a><span class="w">    </span><span class="c">!!</span>
-<a id="ln-204" name="ln-204" href="#ln-204"></a><span class="w">    </span><span class="c">!! The covariance computed is the sample covariance such that </span>
-<a id="ln-205" name="ln-205" href="#ln-205"></a><span class="w">    </span><span class="c">!! $$ q_{jk} = \frac{\Sigma \left( x_{i} - \bar{x} \right) </span>
-<a id="ln-206" name="ln-206" href="#ln-206"></a><span class="w">    </span><span class="c">!! \left( y_{i} - \bar{y} \right)}{n - 1} $$.</span>
-<a id="ln-207" name="ln-207" href="#ln-207"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">dimension</span><span class="p">(:)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span>
-<a id="ln-208" name="ln-208" href="#ln-208"></a><span class="w">        </span><span class="c">!! The first N-element data set.</span>
-<a id="ln-209" name="ln-209" href="#ln-209"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">dimension</span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">))</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">y</span>
-<a id="ln-210" name="ln-210" href="#ln-210"></a><span class="w">        </span><span class="c">!! The second N-element data set.</span>
-<a id="ln-211" name="ln-211" href="#ln-211"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">rst</span>
-<a id="ln-212" name="ln-212" href="#ln-212"></a><span class="w">        </span><span class="c">!! The covariance.</span>
-<a id="ln-213" name="ln-213" href="#ln-213"></a>
-<a id="ln-214" name="ln-214" href="#ln-214"></a><span class="w">    </span><span class="c">! Parameters</span>
-<a id="ln-215" name="ln-215" href="#ln-215"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">zero</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.0d0</span>
-<a id="ln-216" name="ln-216" href="#ln-216"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">one</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d0</span>
-<a id="ln-217" name="ln-217" href="#ln-217"></a>
-<a id="ln-218" name="ln-218" href="#ln-218"></a><span class="w">    </span><span class="c">! Local Variables</span>
-<a id="ln-219" name="ln-219" href="#ln-219"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">i</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
-<a id="ln-220" name="ln-220" href="#ln-220"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">meanX</span><span class="p">,</span><span class="w"> </span><span class="n">meanY</span>
-<a id="ln-221" name="ln-221" href="#ln-221"></a>
-<a id="ln-222" name="ln-222" href="#ln-222"></a><span class="w">    </span><span class="c">! Process</span>
-<a id="ln-223" name="ln-223" href="#ln-223"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
-<a id="ln-224" name="ln-224" href="#ln-224"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-225" name="ln-225" href="#ln-225"></a><span class="k">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">zero</span>
-<a id="ln-226" name="ln-226" href="#ln-226"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-227" name="ln-227" href="#ln-227"></a><span class="w">        </span><span class="c">! Compute the means</span>
-<a id="ln-228" name="ln-228" href="#ln-228"></a><span class="w">        </span><span class="n">meanX</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
-<a id="ln-229" name="ln-229" href="#ln-229"></a><span class="w">        </span><span class="n">meanY</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">y</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
-<a id="ln-230" name="ln-230" href="#ln-230"></a><span class="w">        </span><span class="k">do </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">2</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
-<a id="ln-231" name="ln-231" href="#ln-231"></a><span class="w">            </span><span class="n">meanX</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">meanX</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">meanX</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">i</span>
-<a id="ln-232" name="ln-232" href="#ln-232"></a><span class="w">            </span><span class="n">meanY</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">meanY</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">(</span><span class="n">y</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">meanY</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">i</span>
-<a id="ln-233" name="ln-233" href="#ln-233"></a><span class="w">        </span><span class="k">end do</span>
-<a id="ln-234" name="ln-234" href="#ln-234"></a>
-<a id="ln-235" name="ln-235" href="#ln-235"></a><span class="w">        </span><span class="c">! Compute the covariance</span>
-<a id="ln-236" name="ln-236" href="#ln-236"></a><span class="w">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">sum</span><span class="p">((</span><span class="n">x</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">meanX</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="p">(</span><span class="n">y</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">meanY</span><span class="p">))</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">one</span><span class="p">)</span>
-<a id="ln-237" name="ln-237" href="#ln-237"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-238" name="ln-238" href="#ln-238"></a><span class="k">end function</span>
-<a id="ln-239" name="ln-239" href="#ln-239"></a>
-<a id="ln-240" name="ln-240" href="#ln-240"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-241" name="ln-241" href="#ln-241"></a><span class="k">end module</span>
+<a id="ln-200" name="ln-200" href="#ln-200"></a><span class="w">    </span><span class="c">! Find the limiting indices</span>
+<a id="ln-201" name="ln-201" href="#ln-201"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
+<a id="ln-202" name="ln-202" href="#ln-202"></a><span class="w">    </span><span class="n">i1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">max</span><span class="p">(</span><span class="nb">floor</span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">pv</span><span class="p">,</span><span class="w"> </span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
+<a id="ln-203" name="ln-203" href="#ln-203"></a><span class="w">    </span><span class="n">i2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">min</span><span class="p">(</span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">i1</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
+<a id="ln-204" name="ln-204" href="#ln-204"></a><span class="w">    </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">mean</span><span class="p">(</span><span class="n">x</span><span class="p">(</span><span class="n">i1</span><span class="p">:</span><span class="n">i2</span><span class="p">))</span>
+<a id="ln-205" name="ln-205" href="#ln-205"></a><span class="k">end function</span>
+<a id="ln-206" name="ln-206" href="#ln-206"></a>
+<a id="ln-207" name="ln-207" href="#ln-207"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-208" name="ln-208" href="#ln-208"></a><span class="k">pure function </span><span class="n">covariance</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">)</span><span class="w"> </span><span class="k">result</span><span class="p">(</span><span class="n">rst</span><span class="p">)</span>
+<a id="ln-209" name="ln-209" href="#ln-209"></a><span class="w">    </span><span class="c">!! Computes the sample covariance of two data sets.</span>
+<a id="ln-210" name="ln-210" href="#ln-210"></a><span class="w">    </span><span class="c">!!</span>
+<a id="ln-211" name="ln-211" href="#ln-211"></a><span class="w">    </span><span class="c">!! The covariance computed is the sample covariance such that </span>
+<a id="ln-212" name="ln-212" href="#ln-212"></a><span class="w">    </span><span class="c">!! $$ q_{jk} = \frac{\Sigma \left( x_{i} - \bar{x} \right) </span>
+<a id="ln-213" name="ln-213" href="#ln-213"></a><span class="w">    </span><span class="c">!! \left( y_{i} - \bar{y} \right)}{n - 1} $$.</span>
+<a id="ln-214" name="ln-214" href="#ln-214"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">dimension</span><span class="p">(:)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span>
+<a id="ln-215" name="ln-215" href="#ln-215"></a><span class="w">        </span><span class="c">!! The first N-element data set.</span>
+<a id="ln-216" name="ln-216" href="#ln-216"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">dimension</span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">))</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">y</span>
+<a id="ln-217" name="ln-217" href="#ln-217"></a><span class="w">        </span><span class="c">!! The second N-element data set.</span>
+<a id="ln-218" name="ln-218" href="#ln-218"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">rst</span>
+<a id="ln-219" name="ln-219" href="#ln-219"></a><span class="w">        </span><span class="c">!! The covariance.</span>
+<a id="ln-220" name="ln-220" href="#ln-220"></a>
+<a id="ln-221" name="ln-221" href="#ln-221"></a><span class="w">    </span><span class="c">! Parameters</span>
+<a id="ln-222" name="ln-222" href="#ln-222"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">zero</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.0d0</span>
+<a id="ln-223" name="ln-223" href="#ln-223"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">one</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d0</span>
+<a id="ln-224" name="ln-224" href="#ln-224"></a>
+<a id="ln-225" name="ln-225" href="#ln-225"></a><span class="w">    </span><span class="c">! Local Variables</span>
+<a id="ln-226" name="ln-226" href="#ln-226"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">i</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
+<a id="ln-227" name="ln-227" href="#ln-227"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">meanX</span><span class="p">,</span><span class="w"> </span><span class="n">meanY</span>
+<a id="ln-228" name="ln-228" href="#ln-228"></a>
+<a id="ln-229" name="ln-229" href="#ln-229"></a><span class="w">    </span><span class="c">! Process</span>
+<a id="ln-230" name="ln-230" href="#ln-230"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
+<a id="ln-231" name="ln-231" href="#ln-231"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-232" name="ln-232" href="#ln-232"></a><span class="k">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">zero</span>
+<a id="ln-233" name="ln-233" href="#ln-233"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-234" name="ln-234" href="#ln-234"></a><span class="w">        </span><span class="c">! Compute the means</span>
+<a id="ln-235" name="ln-235" href="#ln-235"></a><span class="w">        </span><span class="n">meanX</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
+<a id="ln-236" name="ln-236" href="#ln-236"></a><span class="w">        </span><span class="n">meanY</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">y</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
+<a id="ln-237" name="ln-237" href="#ln-237"></a><span class="w">        </span><span class="k">do </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">2</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
+<a id="ln-238" name="ln-238" href="#ln-238"></a><span class="w">            </span><span class="n">meanX</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">meanX</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">meanX</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">i</span>
+<a id="ln-239" name="ln-239" href="#ln-239"></a><span class="w">            </span><span class="n">meanY</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">meanY</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">(</span><span class="n">y</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">meanY</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">i</span>
+<a id="ln-240" name="ln-240" href="#ln-240"></a><span class="w">        </span><span class="k">end do</span>
+<a id="ln-241" name="ln-241" href="#ln-241"></a>
+<a id="ln-242" name="ln-242" href="#ln-242"></a><span class="w">        </span><span class="c">! Compute the covariance</span>
+<a id="ln-243" name="ln-243" href="#ln-243"></a><span class="w">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">sum</span><span class="p">((</span><span class="n">x</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">meanX</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="p">(</span><span class="n">y</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">meanY</span><span class="p">))</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">one</span><span class="p">)</span>
+<a id="ln-244" name="ln-244" href="#ln-244"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-245" name="ln-245" href="#ln-245"></a><span class="k">end function</span>
+<a id="ln-246" name="ln-246" href="#ln-246"></a>
+<a id="ln-247" name="ln-247" href="#ln-247"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-248" name="ln-248" href="#ln-248"></a><span class="k">pure function </span><span class="n">pooled_variance_1</span><span class="p">(</span><span class="n">si</span><span class="p">,</span><span class="w"> </span><span class="n">ni</span><span class="p">)</span><span class="w"> </span><span class="k">result</span><span class="p">(</span><span class="n">rst</span><span class="p">)</span>
+<a id="ln-249" name="ln-249" href="#ln-249"></a><span class="w">    </span><span class="c">!! Computes the pooled estimate of variance.</span>
+<a id="ln-250" name="ln-250" href="#ln-250"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">dimension</span><span class="p">(:)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">si</span>
+<a id="ln-251" name="ln-251" href="#ln-251"></a><span class="w">        </span><span class="c">!! An N-element array containing the estimates for each of the N</span>
+<a id="ln-252" name="ln-252" href="#ln-252"></a><span class="w">        </span><span class="c">!! variances.</span>
+<a id="ln-253" name="ln-253" href="#ln-253"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">dimension</span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">si</span><span class="p">))</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">ni</span>
+<a id="ln-254" name="ln-254" href="#ln-254"></a><span class="w">        </span><span class="c">!! An N-element array containing the number of data points in each</span>
+<a id="ln-255" name="ln-255" href="#ln-255"></a><span class="w">        </span><span class="c">!! of the data sets used to compute the variances in si.</span>
+<a id="ln-256" name="ln-256" href="#ln-256"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">rst</span>
+<a id="ln-257" name="ln-257" href="#ln-257"></a><span class="w">        </span><span class="c">!! The pooled variance.</span>
+<a id="ln-258" name="ln-258" href="#ln-258"></a>
+<a id="ln-259" name="ln-259" href="#ln-259"></a><span class="w">    </span><span class="c">! Local Variables</span>
+<a id="ln-260" name="ln-260" href="#ln-260"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">i</span><span class="p">,</span><span class="w"> </span><span class="n">k</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
+<a id="ln-261" name="ln-261" href="#ln-261"></a>
+<a id="ln-262" name="ln-262" href="#ln-262"></a><span class="w">    </span><span class="c">! Process</span>
+<a id="ln-263" name="ln-263" href="#ln-263"></a><span class="w">    </span><span class="n">k</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">si</span><span class="p">)</span>
+<a id="ln-264" name="ln-264" href="#ln-264"></a><span class="w">    </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.0d0</span>
+<a id="ln-265" name="ln-265" href="#ln-265"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span>
+<a id="ln-266" name="ln-266" href="#ln-266"></a><span class="w">    </span><span class="k">do </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="n">k</span>
+<a id="ln-267" name="ln-267" href="#ln-267"></a><span class="w">        </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">ni</span><span class="p">(</span><span class="n">i</span><span class="p">)</span>
+<a id="ln-268" name="ln-268" href="#ln-268"></a><span class="w">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">rst</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">(</span><span class="n">ni</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mf">1.0d0</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">si</span><span class="p">(</span><span class="n">i</span><span class="p">)</span>
+<a id="ln-269" name="ln-269" href="#ln-269"></a><span class="w">    </span><span class="k">end do</span>
+<a id="ln-270" name="ln-270" href="#ln-270"></a><span class="k">    </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">rst</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="kt">real</span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">k</span><span class="p">,</span><span class="w"> </span><span class="n">real64</span><span class="p">)</span>
+<a id="ln-271" name="ln-271" href="#ln-271"></a><span class="k">end function</span>
+<a id="ln-272" name="ln-272" href="#ln-272"></a>
+<a id="ln-273" name="ln-273" href="#ln-273"></a><span class="k">pure function </span><span class="n">pooled_variance_2</span><span class="p">(</span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="k">result</span><span class="p">(</span><span class="n">rst</span><span class="p">)</span>
+<a id="ln-274" name="ln-274" href="#ln-274"></a><span class="w">    </span><span class="c">!! Computes the pooled estimate of variance.</span>
+<a id="ln-275" name="ln-275" href="#ln-275"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">array_container</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">dimension</span><span class="p">(:)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span>
+<a id="ln-276" name="ln-276" href="#ln-276"></a><span class="w">        </span><span class="c">!! An array of arrays of data.</span>
+<a id="ln-277" name="ln-277" href="#ln-277"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">rst</span>
+<a id="ln-278" name="ln-278" href="#ln-278"></a><span class="w">        </span><span class="c">!! The pooled variance.</span>
+<a id="ln-279" name="ln-279" href="#ln-279"></a>
+<a id="ln-280" name="ln-280" href="#ln-280"></a><span class="w">    </span><span class="c">! Local Variables</span>
+<a id="ln-281" name="ln-281" href="#ln-281"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">i</span><span class="p">,</span><span class="w"> </span><span class="n">k</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">ni</span>
+<a id="ln-282" name="ln-282" href="#ln-282"></a>
+<a id="ln-283" name="ln-283" href="#ln-283"></a><span class="w">    </span><span class="c">! Process</span>
+<a id="ln-284" name="ln-284" href="#ln-284"></a><span class="w">    </span><span class="n">k</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
+<a id="ln-285" name="ln-285" href="#ln-285"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span>
+<a id="ln-286" name="ln-286" href="#ln-286"></a><span class="w">    </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.0d0</span>
+<a id="ln-287" name="ln-287" href="#ln-287"></a><span class="w">    </span><span class="k">do </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="n">k</span>
+<a id="ln-288" name="ln-288" href="#ln-288"></a><span class="w">        </span><span class="n">ni</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">(</span><span class="n">i</span><span class="p">)%</span><span class="n">x</span><span class="p">)</span>
+<a id="ln-289" name="ln-289" href="#ln-289"></a><span class="w">        </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">ni</span>
+<a id="ln-290" name="ln-290" href="#ln-290"></a><span class="w">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">rst</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">variance</span><span class="p">(</span><span class="n">x</span><span class="p">(</span><span class="n">i</span><span class="p">)%</span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="p">(</span><span class="n">ni</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mf">1.0</span><span class="p">)</span>
+<a id="ln-291" name="ln-291" href="#ln-291"></a><span class="w">    </span><span class="k">end do</span>
+<a id="ln-292" name="ln-292" href="#ln-292"></a><span class="k">    </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">rst</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="kt">real</span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">k</span><span class="p">,</span><span class="w"> </span><span class="n">real64</span><span class="p">)</span>
+<a id="ln-293" name="ln-293" href="#ln-293"></a><span class="k">end function</span>
+<a id="ln-294" name="ln-294" href="#ln-294"></a>
+<a id="ln-295" name="ln-295" href="#ln-295"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-296" name="ln-296" href="#ln-296"></a><span class="k">end module</span>
 </pre></div>
 
       </section>
@@ -410,7 +465,7 @@ <h2><span class="anchor" id="src"></span>Source Code</h2>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/sourcefile/fstats_distributions.f90.html b/doc/sourcefile/fstats_distributions.f90.html
index 03695d2..a34cd42 100644
--- a/doc/sourcefile/fstats_distributions.f90.html
+++ b/doc/sourcefile/fstats_distributions.f90.html
@@ -74,7 +74,7 @@ <h1>fstats_distributions.f90
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title="10.9% of total for source files.">303 statements</a>
+                 title="10.6% of total for source files.">303 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -797,7 +797,7 @@ <h2><span class="anchor" id="src"></span>Source Code</h2>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/sourcefile/fstats_errors.f90.html b/doc/sourcefile/fstats_errors.f90.html
index 6fe63fa..96b2af3 100644
--- a/doc/sourcefile/fstats_errors.f90.html
+++ b/doc/sourcefile/fstats_errors.f90.html
@@ -74,7 +74,7 @@ <h1>fstats_errors.f90
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 2.9% of total for source files.">80 statements</a>
+                 title=" 2.8% of total for source files.">80 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -353,7 +353,7 @@ <h2><span class="anchor" id="src"></span>Source Code</h2>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/sourcefile/fstats_experimental_design.f90.html b/doc/sourcefile/fstats_experimental_design.f90.html
index 3ef3ca7..7a34ee1 100644
--- a/doc/sourcefile/fstats_experimental_design.f90.html
+++ b/doc/sourcefile/fstats_experimental_design.f90.html
@@ -74,7 +74,7 @@ <h1>fstats_experimental_design.f90
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 2.4% of total for source files.">66 statements</a>
+                 title=" 2.3% of total for source files.">66 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -338,7 +338,7 @@ <h2><span class="anchor" id="src"></span>Source Code</h2>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/sourcefile/fstats_helper_routines.f90.html b/doc/sourcefile/fstats_helper_routines.f90.html
index 8aa5f93..4700608 100644
--- a/doc/sourcefile/fstats_helper_routines.f90.html
+++ b/doc/sourcefile/fstats_helper_routines.f90.html
@@ -209,7 +209,7 @@ <h2><span class="anchor" id="src"></span>Source Code</h2>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/sourcefile/fstats_hypothesis.f90.html b/doc/sourcefile/fstats_hypothesis.f90.html
index 0d23f32..747e0ac 100644
--- a/doc/sourcefile/fstats_hypothesis.f90.html
+++ b/doc/sourcefile/fstats_hypothesis.f90.html
@@ -74,7 +74,7 @@ <h1>fstats_hypothesis.f90
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 6.3% of total for source files.">175 statements</a>
+                 title=" 7.1% of total for source files.">204 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -158,315 +158,369 @@ <h2><span class="anchor" id="src"></span>Source Code</h2>
 <a id="ln-5" name="ln-5" href="#ln-5"></a><span class="w">    </span><span class="k">use </span><span class="n">fstats_special_functions</span>
 <a id="ln-6" name="ln-6" href="#ln-6"></a><span class="w">    </span><span class="k">use </span><span class="n">fstats_distributions</span>
 <a id="ln-7" name="ln-7" href="#ln-7"></a><span class="w">    </span><span class="k">use </span><span class="n">fstats_descriptive_statistics</span>
-<a id="ln-8" name="ln-8" href="#ln-8"></a><span class="w">    </span><span class="k">private</span>
-<a id="ln-9" name="ln-9" href="#ln-9"></a><span class="k">    public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">confidence_interval</span>
-<a id="ln-10" name="ln-10" href="#ln-10"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">t_test_equal_variance</span>
-<a id="ln-11" name="ln-11" href="#ln-11"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">t_test_unequal_variance</span>
-<a id="ln-12" name="ln-12" href="#ln-12"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">t_test_paired</span>
-<a id="ln-13" name="ln-13" href="#ln-13"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">f_test</span>
-<a id="ln-14" name="ln-14" href="#ln-14"></a>
-<a id="ln-15" name="ln-15" href="#ln-15"></a><span class="w">    </span><span class="k">interface </span><span class="n">confidence_interval</span>
-<a id="ln-16" name="ln-16" href="#ln-16"></a><span class="w">        </span><span class="c">!! Computes the confidence interval for the specified distribution.</span>
-<a id="ln-17" name="ln-17" href="#ln-17"></a><span class="w">        </span><span class="c">!!</span>
-<a id="ln-18" name="ln-18" href="#ln-18"></a><span class="w">        </span><span class="c">!! See Also</span>
+<a id="ln-8" name="ln-8" href="#ln-8"></a><span class="w">    </span><span class="k">use </span><span class="n">fstats_types</span>
+<a id="ln-9" name="ln-9" href="#ln-9"></a><span class="w">    </span><span class="k">private</span>
+<a id="ln-10" name="ln-10" href="#ln-10"></a><span class="k">    public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">confidence_interval</span>
+<a id="ln-11" name="ln-11" href="#ln-11"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">t_test_equal_variance</span>
+<a id="ln-12" name="ln-12" href="#ln-12"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">t_test_unequal_variance</span>
+<a id="ln-13" name="ln-13" href="#ln-13"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">t_test_paired</span>
+<a id="ln-14" name="ln-14" href="#ln-14"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">f_test</span>
+<a id="ln-15" name="ln-15" href="#ln-15"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">bartletts_test</span>
+<a id="ln-16" name="ln-16" href="#ln-16"></a>
+<a id="ln-17" name="ln-17" href="#ln-17"></a><span class="w">    </span><span class="k">interface </span><span class="n">confidence_interval</span>
+<a id="ln-18" name="ln-18" href="#ln-18"></a><span class="w">        </span><span class="c">!! Computes the confidence interval for the specified distribution.</span>
 <a id="ln-19" name="ln-19" href="#ln-19"></a><span class="w">        </span><span class="c">!!</span>
-<a id="ln-20" name="ln-20" href="#ln-20"></a><span class="w">        </span><span class="c">!! - [Wikipedia](https://en.wikipedia.org/wiki/Confidence_interval)</span>
-<a id="ln-21" name="ln-21" href="#ln-21"></a><span class="w">        </span><span class="k">module procedure</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">confidence_interval_scalar</span>
-<a id="ln-22" name="ln-22" href="#ln-22"></a><span class="w">        </span><span class="k">module procedure</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">confidence_interval_array</span>
-<a id="ln-23" name="ln-23" href="#ln-23"></a><span class="w">    </span><span class="k">end interface</span>
-<a id="ln-24" name="ln-24" href="#ln-24"></a><span class="k">contains</span>
-<a id="ln-25" name="ln-25" href="#ln-25"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-26" name="ln-26" href="#ln-26"></a><span class="k">pure function </span><span class="n">confidence_interval_scalar</span><span class="p">(</span><span class="n">dist</span><span class="p">,</span><span class="w"> </span><span class="n">alpha</span><span class="p">,</span><span class="w"> </span><span class="n">s</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="k">result</span><span class="p">(</span><span class="n">rst</span><span class="p">)</span>
-<a id="ln-27" name="ln-27" href="#ln-27"></a><span class="w">    </span><span class="c">!! Computes the confidence interval for the specified distribution.</span>
-<a id="ln-28" name="ln-28" href="#ln-28"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">distribution</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dist</span>
-<a id="ln-29" name="ln-29" href="#ln-29"></a><span class="w">        </span><span class="c">!! The distribution object defining the probability distribution</span>
-<a id="ln-30" name="ln-30" href="#ln-30"></a><span class="w">        </span><span class="c">!! to establish the confidence level.</span>
-<a id="ln-31" name="ln-31" href="#ln-31"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">alpha</span>
-<a id="ln-32" name="ln-32" href="#ln-32"></a><span class="w">        </span><span class="c">!! The probability value of interest.  For instance, use a value of 0.05</span>
-<a id="ln-33" name="ln-33" href="#ln-33"></a><span class="w">        </span><span class="c">!! for a confidence level of 95%.</span>
-<a id="ln-34" name="ln-34" href="#ln-34"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">s</span>
-<a id="ln-35" name="ln-35" href="#ln-35"></a><span class="w">        </span><span class="c">!! The sample standard deviation.</span>
-<a id="ln-36" name="ln-36" href="#ln-36"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">n</span>
-<a id="ln-37" name="ln-37" href="#ln-37"></a><span class="w">        </span><span class="c">!! The number of samples in the data set.</span>
-<a id="ln-38" name="ln-38" href="#ln-38"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">rst</span>
-<a id="ln-39" name="ln-39" href="#ln-39"></a><span class="w">        </span><span class="c">!! The result.</span>
-<a id="ln-40" name="ln-40" href="#ln-40"></a>
-<a id="ln-41" name="ln-41" href="#ln-41"></a><span class="w">    </span><span class="c">! Local Variables</span>
-<a id="ln-42" name="ln-42" href="#ln-42"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">maxiter</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">100</span>
-<a id="ln-43" name="ln-43" href="#ln-43"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">tol</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d-6</span>
-<a id="ln-44" name="ln-44" href="#ln-44"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">i</span>
-<a id="ln-45" name="ln-45" href="#ln-45"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">f</span><span class="p">,</span><span class="w"> </span><span class="n">df</span><span class="p">,</span><span class="w"> </span><span class="n">h</span><span class="p">,</span><span class="w"> </span><span class="n">twoh</span><span class="p">,</span><span class="w"> </span><span class="n">dy</span>
-<a id="ln-46" name="ln-46" href="#ln-46"></a>
-<a id="ln-47" name="ln-47" href="#ln-47"></a><span class="w">    </span><span class="c">! Process</span>
-<a id="ln-48" name="ln-48" href="#ln-48"></a><span class="w">    </span><span class="c">!</span>
-<a id="ln-49" name="ln-49" href="#ln-49"></a><span class="w">    </span><span class="c">! We use a simplified Newton&#39;s method to solve for the independent variable</span>
-<a id="ln-50" name="ln-50" href="#ln-50"></a><span class="w">    </span><span class="c">! of the CDF function where it equals 1 - alpha / 2.</span>
-<a id="ln-51" name="ln-51" href="#ln-51"></a><span class="w">    </span><span class="n">h</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d-6</span>
-<a id="ln-52" name="ln-52" href="#ln-52"></a><span class="w">    </span><span class="n">twoh</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">2.0d0</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">h</span>
-<a id="ln-53" name="ln-53" href="#ln-53"></a><span class="w">    </span><span class="n">x</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d0</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">alpha</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="mf">2.0d0</span>
-<a id="ln-54" name="ln-54" href="#ln-54"></a><span class="w">    </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.5d0</span>
-<a id="ln-55" name="ln-55" href="#ln-55"></a><span class="w">    </span><span class="k">do </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="n">maxiter</span><span class="w"> </span>
-<a id="ln-56" name="ln-56" href="#ln-56"></a><span class="w">        </span><span class="c">! Compute the CDF and its derivative at y</span>
-<a id="ln-57" name="ln-57" href="#ln-57"></a><span class="w">        </span><span class="n">f</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">dist</span><span class="p">%</span><span class="n">cdf</span><span class="p">(</span><span class="n">rst</span><span class="p">)</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">x</span>
-<a id="ln-58" name="ln-58" href="#ln-58"></a><span class="w">        </span><span class="n">df</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">dist</span><span class="p">%</span><span class="n">cdf</span><span class="p">(</span><span class="n">rst</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">h</span><span class="p">)</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">dist</span><span class="p">%</span><span class="n">cdf</span><span class="p">(</span><span class="n">rst</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">h</span><span class="p">))</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">twoh</span>
-<a id="ln-59" name="ln-59" href="#ln-59"></a><span class="w">        </span><span class="n">dy</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">f</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">df</span>
-<a id="ln-60" name="ln-60" href="#ln-60"></a><span class="w">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">rst</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">dy</span>
-<a id="ln-61" name="ln-61" href="#ln-61"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">abs</span><span class="p">(</span><span class="n">dy</span><span class="p">)</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">tol</span><span class="p">)</span><span class="w"> </span><span class="k">exit</span>
-<a id="ln-62" name="ln-62" href="#ln-62"></a><span class="k">    end do</span>
-<a id="ln-63" name="ln-63" href="#ln-63"></a>
-<a id="ln-64" name="ln-64" href="#ln-64"></a><span class="w">    </span><span class="c">! Determine the actual interval</span>
-<a id="ln-65" name="ln-65" href="#ln-65"></a><span class="w">    </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">rst</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">s</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="nb">sqrt</span><span class="p">(</span><span class="kt">real</span><span class="p">(</span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">real64</span><span class="p">))</span>
-<a id="ln-66" name="ln-66" href="#ln-66"></a><span class="k">end function</span>
-<a id="ln-67" name="ln-67" href="#ln-67"></a>
-<a id="ln-68" name="ln-68" href="#ln-68"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-69" name="ln-69" href="#ln-69"></a><span class="k">pure function </span><span class="n">confidence_interval_array</span><span class="p">(</span><span class="n">dist</span><span class="p">,</span><span class="w"> </span><span class="n">alpha</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="k">result</span><span class="p">(</span><span class="n">rst</span><span class="p">)</span>
-<a id="ln-70" name="ln-70" href="#ln-70"></a><span class="w">    </span><span class="c">!! Computes the confidence interval for the specified distribution.</span>
-<a id="ln-71" name="ln-71" href="#ln-71"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">distribution</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dist</span>
-<a id="ln-72" name="ln-72" href="#ln-72"></a><span class="w">        </span><span class="c">!! The distribution object defining the probability distribution</span>
-<a id="ln-73" name="ln-73" href="#ln-73"></a><span class="w">        </span><span class="c">!! to establish the confidence level.</span>
-<a id="ln-74" name="ln-74" href="#ln-74"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">alpha</span>
-<a id="ln-75" name="ln-75" href="#ln-75"></a><span class="w">        </span><span class="c">!! The probability value of interest.  For instance, use a value of 0.05</span>
-<a id="ln-76" name="ln-76" href="#ln-76"></a><span class="w">        </span><span class="c">!! for a confidence level of 95%.</span>
-<a id="ln-77" name="ln-77" href="#ln-77"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span><span class="p">(:)</span>
-<a id="ln-78" name="ln-78" href="#ln-78"></a><span class="w">        </span><span class="c">!! An N-element array containing the data to analyze.</span>
-<a id="ln-79" name="ln-79" href="#ln-79"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">rst</span>
-<a id="ln-80" name="ln-80" href="#ln-80"></a><span class="w">        </span><span class="c">!! The result.</span>
-<a id="ln-81" name="ln-81" href="#ln-81"></a>
-<a id="ln-82" name="ln-82" href="#ln-82"></a><span class="w">    </span><span class="c">! Process</span>
-<a id="ln-83" name="ln-83" href="#ln-83"></a><span class="w">    </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">confidence_interval</span><span class="p">(</span><span class="n">dist</span><span class="p">,</span><span class="w"> </span><span class="n">alpha</span><span class="p">,</span><span class="w"> </span><span class="n">standard_deviation</span><span class="p">(</span><span class="n">x</span><span class="p">),</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">))</span>
-<a id="ln-84" name="ln-84" href="#ln-84"></a><span class="k">end function</span>
-<a id="ln-85" name="ln-85" href="#ln-85"></a>
-<a id="ln-86" name="ln-86" href="#ln-86"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-87" name="ln-87" href="#ln-87"></a><span class="k">subroutine </span><span class="n">t_test_equal_variance</span><span class="p">(</span><span class="n">x1</span><span class="p">,</span><span class="w"> </span><span class="n">x2</span><span class="p">,</span><span class="w"> </span><span class="nb">stat</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">dof</span><span class="p">)</span>
-<a id="ln-88" name="ln-88" href="#ln-88"></a><span class="w">    </span><span class="c">!! Computes the 2-tailed Student&#39;s T-Test for two data sets of </span>
-<a id="ln-89" name="ln-89" href="#ln-89"></a><span class="w">    </span><span class="c">!! assumed equivalent variances.</span>
-<a id="ln-90" name="ln-90" href="#ln-90"></a><span class="w">    </span><span class="c">!!</span>
-<a id="ln-91" name="ln-91" href="#ln-91"></a><span class="w">    </span><span class="c">!! See Also</span>
+<a id="ln-20" name="ln-20" href="#ln-20"></a><span class="w">        </span><span class="c">!! See Also</span>
+<a id="ln-21" name="ln-21" href="#ln-21"></a><span class="w">        </span><span class="c">!!</span>
+<a id="ln-22" name="ln-22" href="#ln-22"></a><span class="w">        </span><span class="c">!! - [Wikipedia](https://en.wikipedia.org/wiki/Confidence_interval)</span>
+<a id="ln-23" name="ln-23" href="#ln-23"></a><span class="w">        </span><span class="k">module procedure</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">confidence_interval_scalar</span>
+<a id="ln-24" name="ln-24" href="#ln-24"></a><span class="w">        </span><span class="k">module procedure</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">confidence_interval_array</span>
+<a id="ln-25" name="ln-25" href="#ln-25"></a><span class="w">    </span><span class="k">end interface</span>
+<a id="ln-26" name="ln-26" href="#ln-26"></a><span class="k">contains</span>
+<a id="ln-27" name="ln-27" href="#ln-27"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-28" name="ln-28" href="#ln-28"></a><span class="k">pure function </span><span class="n">confidence_interval_scalar</span><span class="p">(</span><span class="n">dist</span><span class="p">,</span><span class="w"> </span><span class="n">alpha</span><span class="p">,</span><span class="w"> </span><span class="n">s</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="k">result</span><span class="p">(</span><span class="n">rst</span><span class="p">)</span>
+<a id="ln-29" name="ln-29" href="#ln-29"></a><span class="w">    </span><span class="c">!! Computes the confidence interval for the specified distribution.</span>
+<a id="ln-30" name="ln-30" href="#ln-30"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">distribution</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dist</span>
+<a id="ln-31" name="ln-31" href="#ln-31"></a><span class="w">        </span><span class="c">!! The distribution object defining the probability distribution</span>
+<a id="ln-32" name="ln-32" href="#ln-32"></a><span class="w">        </span><span class="c">!! to establish the confidence level.</span>
+<a id="ln-33" name="ln-33" href="#ln-33"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">alpha</span>
+<a id="ln-34" name="ln-34" href="#ln-34"></a><span class="w">        </span><span class="c">!! The probability value of interest.  For instance, use a value of 0.05</span>
+<a id="ln-35" name="ln-35" href="#ln-35"></a><span class="w">        </span><span class="c">!! for a confidence level of 95%.</span>
+<a id="ln-36" name="ln-36" href="#ln-36"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">s</span>
+<a id="ln-37" name="ln-37" href="#ln-37"></a><span class="w">        </span><span class="c">!! The sample standard deviation.</span>
+<a id="ln-38" name="ln-38" href="#ln-38"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">n</span>
+<a id="ln-39" name="ln-39" href="#ln-39"></a><span class="w">        </span><span class="c">!! The number of samples in the data set.</span>
+<a id="ln-40" name="ln-40" href="#ln-40"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">rst</span>
+<a id="ln-41" name="ln-41" href="#ln-41"></a><span class="w">        </span><span class="c">!! The result.</span>
+<a id="ln-42" name="ln-42" href="#ln-42"></a>
+<a id="ln-43" name="ln-43" href="#ln-43"></a><span class="w">    </span><span class="c">! Local Variables</span>
+<a id="ln-44" name="ln-44" href="#ln-44"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">maxiter</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">100</span>
+<a id="ln-45" name="ln-45" href="#ln-45"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">tol</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d-6</span>
+<a id="ln-46" name="ln-46" href="#ln-46"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">i</span>
+<a id="ln-47" name="ln-47" href="#ln-47"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">f</span><span class="p">,</span><span class="w"> </span><span class="n">df</span><span class="p">,</span><span class="w"> </span><span class="n">h</span><span class="p">,</span><span class="w"> </span><span class="n">twoh</span><span class="p">,</span><span class="w"> </span><span class="n">dy</span>
+<a id="ln-48" name="ln-48" href="#ln-48"></a>
+<a id="ln-49" name="ln-49" href="#ln-49"></a><span class="w">    </span><span class="c">! Process</span>
+<a id="ln-50" name="ln-50" href="#ln-50"></a><span class="w">    </span><span class="c">!</span>
+<a id="ln-51" name="ln-51" href="#ln-51"></a><span class="w">    </span><span class="c">! We use a simplified Newton&#39;s method to solve for the independent variable</span>
+<a id="ln-52" name="ln-52" href="#ln-52"></a><span class="w">    </span><span class="c">! of the CDF function where it equals 1 - alpha / 2.</span>
+<a id="ln-53" name="ln-53" href="#ln-53"></a><span class="w">    </span><span class="n">h</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d-6</span>
+<a id="ln-54" name="ln-54" href="#ln-54"></a><span class="w">    </span><span class="n">twoh</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">2.0d0</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">h</span>
+<a id="ln-55" name="ln-55" href="#ln-55"></a><span class="w">    </span><span class="n">x</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d0</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">alpha</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="mf">2.0d0</span>
+<a id="ln-56" name="ln-56" href="#ln-56"></a><span class="w">    </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.5d0</span>
+<a id="ln-57" name="ln-57" href="#ln-57"></a><span class="w">    </span><span class="k">do </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="n">maxiter</span><span class="w"> </span>
+<a id="ln-58" name="ln-58" href="#ln-58"></a><span class="w">        </span><span class="c">! Compute the CDF and its derivative at y</span>
+<a id="ln-59" name="ln-59" href="#ln-59"></a><span class="w">        </span><span class="n">f</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">dist</span><span class="p">%</span><span class="n">cdf</span><span class="p">(</span><span class="n">rst</span><span class="p">)</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">x</span>
+<a id="ln-60" name="ln-60" href="#ln-60"></a><span class="w">        </span><span class="n">df</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">dist</span><span class="p">%</span><span class="n">cdf</span><span class="p">(</span><span class="n">rst</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">h</span><span class="p">)</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">dist</span><span class="p">%</span><span class="n">cdf</span><span class="p">(</span><span class="n">rst</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">h</span><span class="p">))</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">twoh</span>
+<a id="ln-61" name="ln-61" href="#ln-61"></a><span class="w">        </span><span class="n">dy</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">f</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">df</span>
+<a id="ln-62" name="ln-62" href="#ln-62"></a><span class="w">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">rst</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">dy</span>
+<a id="ln-63" name="ln-63" href="#ln-63"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">abs</span><span class="p">(</span><span class="n">dy</span><span class="p">)</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">tol</span><span class="p">)</span><span class="w"> </span><span class="k">exit</span>
+<a id="ln-64" name="ln-64" href="#ln-64"></a><span class="k">    end do</span>
+<a id="ln-65" name="ln-65" href="#ln-65"></a>
+<a id="ln-66" name="ln-66" href="#ln-66"></a><span class="w">    </span><span class="c">! Determine the actual interval</span>
+<a id="ln-67" name="ln-67" href="#ln-67"></a><span class="w">    </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">rst</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">s</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="nb">sqrt</span><span class="p">(</span><span class="kt">real</span><span class="p">(</span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">real64</span><span class="p">))</span>
+<a id="ln-68" name="ln-68" href="#ln-68"></a><span class="k">end function</span>
+<a id="ln-69" name="ln-69" href="#ln-69"></a>
+<a id="ln-70" name="ln-70" href="#ln-70"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-71" name="ln-71" href="#ln-71"></a><span class="k">pure function </span><span class="n">confidence_interval_array</span><span class="p">(</span><span class="n">dist</span><span class="p">,</span><span class="w"> </span><span class="n">alpha</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="k">result</span><span class="p">(</span><span class="n">rst</span><span class="p">)</span>
+<a id="ln-72" name="ln-72" href="#ln-72"></a><span class="w">    </span><span class="c">!! Computes the confidence interval for the specified distribution.</span>
+<a id="ln-73" name="ln-73" href="#ln-73"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">distribution</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dist</span>
+<a id="ln-74" name="ln-74" href="#ln-74"></a><span class="w">        </span><span class="c">!! The distribution object defining the probability distribution</span>
+<a id="ln-75" name="ln-75" href="#ln-75"></a><span class="w">        </span><span class="c">!! to establish the confidence level.</span>
+<a id="ln-76" name="ln-76" href="#ln-76"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">alpha</span>
+<a id="ln-77" name="ln-77" href="#ln-77"></a><span class="w">        </span><span class="c">!! The probability value of interest.  For instance, use a value of 0.05</span>
+<a id="ln-78" name="ln-78" href="#ln-78"></a><span class="w">        </span><span class="c">!! for a confidence level of 95%.</span>
+<a id="ln-79" name="ln-79" href="#ln-79"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span><span class="p">(:)</span>
+<a id="ln-80" name="ln-80" href="#ln-80"></a><span class="w">        </span><span class="c">!! An N-element array containing the data to analyze.</span>
+<a id="ln-81" name="ln-81" href="#ln-81"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">rst</span>
+<a id="ln-82" name="ln-82" href="#ln-82"></a><span class="w">        </span><span class="c">!! The result.</span>
+<a id="ln-83" name="ln-83" href="#ln-83"></a>
+<a id="ln-84" name="ln-84" href="#ln-84"></a><span class="w">    </span><span class="c">! Process</span>
+<a id="ln-85" name="ln-85" href="#ln-85"></a><span class="w">    </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">confidence_interval</span><span class="p">(</span><span class="n">dist</span><span class="p">,</span><span class="w"> </span><span class="n">alpha</span><span class="p">,</span><span class="w"> </span><span class="n">standard_deviation</span><span class="p">(</span><span class="n">x</span><span class="p">),</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">))</span>
+<a id="ln-86" name="ln-86" href="#ln-86"></a><span class="k">end function</span>
+<a id="ln-87" name="ln-87" href="#ln-87"></a>
+<a id="ln-88" name="ln-88" href="#ln-88"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-89" name="ln-89" href="#ln-89"></a><span class="k">subroutine </span><span class="n">t_test_equal_variance</span><span class="p">(</span><span class="n">x1</span><span class="p">,</span><span class="w"> </span><span class="n">x2</span><span class="p">,</span><span class="w"> </span><span class="nb">stat</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">dof</span><span class="p">)</span>
+<a id="ln-90" name="ln-90" href="#ln-90"></a><span class="w">    </span><span class="c">!! Computes the 2-tailed Student&#39;s T-Test for two data sets of </span>
+<a id="ln-91" name="ln-91" href="#ln-91"></a><span class="w">    </span><span class="c">!! assumed equivalent variances.</span>
 <a id="ln-92" name="ln-92" href="#ln-92"></a><span class="w">    </span><span class="c">!!</span>
-<a id="ln-93" name="ln-93" href="#ln-93"></a><span class="w">    </span><span class="c">!! - [Wikipedia](https://en.wikipedia.org/wiki/Student%27s_t-test)</span>
-<a id="ln-94" name="ln-94" href="#ln-94"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x1</span><span class="p">(:)</span>
-<a id="ln-95" name="ln-95" href="#ln-95"></a><span class="w">        </span><span class="c">!! An N-element array containing the first data set.</span>
-<a id="ln-96" name="ln-96" href="#ln-96"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x2</span><span class="p">(:)</span>
-<a id="ln-97" name="ln-97" href="#ln-97"></a><span class="w">        </span><span class="c">!! An M-element array containing the second data set.</span>
-<a id="ln-98" name="ln-98" href="#ln-98"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="nb">stat</span>
-<a id="ln-99" name="ln-99" href="#ln-99"></a><span class="w">        </span><span class="c">!! The Student-&#39;s T-Test statistic.</span>
-<a id="ln-100" name="ln-100" href="#ln-100"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">p</span>
-<a id="ln-101" name="ln-101" href="#ln-101"></a><span class="w">        </span><span class="c">!! The probability value that the two samples are likely to</span>
-<a id="ln-102" name="ln-102" href="#ln-102"></a><span class="w">        </span><span class="c">!! have come from two underlying populations that </span>
-<a id="ln-103" name="ln-103" href="#ln-103"></a><span class="w">        </span><span class="c">!! have the same mean.</span>
-<a id="ln-104" name="ln-104" href="#ln-104"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dof</span>
-<a id="ln-105" name="ln-105" href="#ln-105"></a><span class="w">        </span><span class="c">!! The degrees of freedom.</span>
-<a id="ln-106" name="ln-106" href="#ln-106"></a>
-<a id="ln-107" name="ln-107" href="#ln-107"></a><span class="w">    </span><span class="c">! Parameters</span>
-<a id="ln-108" name="ln-108" href="#ln-108"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">half</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.5d0</span>
-<a id="ln-109" name="ln-109" href="#ln-109"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">one</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d0</span>
-<a id="ln-110" name="ln-110" href="#ln-110"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">two</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">2.0d0</span>
-<a id="ln-111" name="ln-111" href="#ln-111"></a>
-<a id="ln-112" name="ln-112" href="#ln-112"></a><span class="w">    </span><span class="c">! Local Variables</span>
-<a id="ln-113" name="ln-113" href="#ln-113"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">v1</span><span class="p">,</span><span class="w"> </span><span class="n">v2</span><span class="p">,</span><span class="w"> </span><span class="n">m1</span><span class="p">,</span><span class="w"> </span><span class="n">m2</span><span class="p">,</span><span class="w"> </span><span class="n">sv</span><span class="p">,</span><span class="w"> </span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">b</span><span class="p">,</span><span class="w"> </span><span class="n">x</span>
-<a id="ln-114" name="ln-114" href="#ln-114"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">n1</span><span class="p">,</span><span class="w"> </span><span class="n">n2</span>
-<a id="ln-115" name="ln-115" href="#ln-115"></a>
-<a id="ln-116" name="ln-116" href="#ln-116"></a><span class="w">    </span><span class="c">! Compute the T-statistic</span>
-<a id="ln-117" name="ln-117" href="#ln-117"></a><span class="w">    </span><span class="n">n1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x1</span><span class="p">)</span>
-<a id="ln-118" name="ln-118" href="#ln-118"></a><span class="w">    </span><span class="n">n2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x2</span><span class="p">)</span>
-<a id="ln-119" name="ln-119" href="#ln-119"></a><span class="w">    </span><span class="n">m1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">mean</span><span class="p">(</span><span class="n">x1</span><span class="p">)</span>
-<a id="ln-120" name="ln-120" href="#ln-120"></a><span class="w">    </span><span class="n">m2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">mean</span><span class="p">(</span><span class="n">x2</span><span class="p">)</span>
-<a id="ln-121" name="ln-121" href="#ln-121"></a><span class="w">    </span><span class="n">v1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">variance</span><span class="p">(</span><span class="n">x1</span><span class="p">)</span>
-<a id="ln-122" name="ln-122" href="#ln-122"></a><span class="w">    </span><span class="n">v2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">variance</span><span class="p">(</span><span class="n">x2</span><span class="p">)</span>
-<a id="ln-123" name="ln-123" href="#ln-123"></a><span class="w">    </span><span class="n">dof</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">n1</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">n2</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">two</span>
-<a id="ln-124" name="ln-124" href="#ln-124"></a><span class="w">    </span><span class="n">sv</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">((</span><span class="n">n1</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">one</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">v1</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">(</span><span class="n">n2</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">one</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">v2</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">dof</span>
-<a id="ln-125" name="ln-125" href="#ln-125"></a><span class="w">    </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">abs</span><span class="p">(</span><span class="n">m1</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">m2</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="nb">sqrt</span><span class="p">(</span><span class="n">sv</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="p">(</span><span class="n">one</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="kt">real</span><span class="p">(</span><span class="n">n1</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">one</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="kt">real</span><span class="p">(</span><span class="n">n2</span><span class="p">)))</span>
-<a id="ln-126" name="ln-126" href="#ln-126"></a>
-<a id="ln-127" name="ln-127" href="#ln-127"></a><span class="w">    </span><span class="c">! Compute the probability</span>
-<a id="ln-128" name="ln-128" href="#ln-128"></a><span class="w">    </span><span class="n">a</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">half</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">dof</span>
-<a id="ln-129" name="ln-129" href="#ln-129"></a><span class="w">    </span><span class="n">b</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">half</span>
-<a id="ln-130" name="ln-130" href="#ln-130"></a><span class="w">    </span><span class="n">x</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">dof</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="p">(</span><span class="n">dof</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="nb">stat</span><span class="o">**</span><span class="mi">2</span><span class="p">)</span>
-<a id="ln-131" name="ln-131" href="#ln-131"></a><span class="w">    </span><span class="n">p</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">regularized_beta</span><span class="p">(</span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">b</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">)</span>
-<a id="ln-132" name="ln-132" href="#ln-132"></a><span class="k">end subroutine</span>
-<a id="ln-133" name="ln-133" href="#ln-133"></a>
-<a id="ln-134" name="ln-134" href="#ln-134"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-135" name="ln-135" href="#ln-135"></a><span class="k">subroutine </span><span class="n">t_test_unequal_variance</span><span class="p">(</span><span class="n">x1</span><span class="p">,</span><span class="w"> </span><span class="n">x2</span><span class="p">,</span><span class="w"> </span><span class="nb">stat</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">dof</span><span class="p">)</span>
-<a id="ln-136" name="ln-136" href="#ln-136"></a><span class="w">    </span><span class="c">!! Computes the 2-tailed Student&#39;s T-Test for two data sets of </span>
-<a id="ln-137" name="ln-137" href="#ln-137"></a><span class="w">    </span><span class="c">!! assumed non-equivalent variances.</span>
-<a id="ln-138" name="ln-138" href="#ln-138"></a><span class="w">    </span><span class="c">!!</span>
-<a id="ln-139" name="ln-139" href="#ln-139"></a><span class="w">    </span><span class="c">!! See Also</span>
+<a id="ln-93" name="ln-93" href="#ln-93"></a><span class="w">    </span><span class="c">!! See Also</span>
+<a id="ln-94" name="ln-94" href="#ln-94"></a><span class="w">    </span><span class="c">!!</span>
+<a id="ln-95" name="ln-95" href="#ln-95"></a><span class="w">    </span><span class="c">!! - [Wikipedia](https://en.wikipedia.org/wiki/Student%27s_t-test)</span>
+<a id="ln-96" name="ln-96" href="#ln-96"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x1</span><span class="p">(:)</span>
+<a id="ln-97" name="ln-97" href="#ln-97"></a><span class="w">        </span><span class="c">!! An N-element array containing the first data set.</span>
+<a id="ln-98" name="ln-98" href="#ln-98"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x2</span><span class="p">(:)</span>
+<a id="ln-99" name="ln-99" href="#ln-99"></a><span class="w">        </span><span class="c">!! An M-element array containing the second data set.</span>
+<a id="ln-100" name="ln-100" href="#ln-100"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="nb">stat</span>
+<a id="ln-101" name="ln-101" href="#ln-101"></a><span class="w">        </span><span class="c">!! The Student-&#39;s T-Test statistic.</span>
+<a id="ln-102" name="ln-102" href="#ln-102"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">p</span>
+<a id="ln-103" name="ln-103" href="#ln-103"></a><span class="w">        </span><span class="c">!! The probability value that the two samples are likely to</span>
+<a id="ln-104" name="ln-104" href="#ln-104"></a><span class="w">        </span><span class="c">!! have come from two underlying populations that </span>
+<a id="ln-105" name="ln-105" href="#ln-105"></a><span class="w">        </span><span class="c">!! have the same mean.</span>
+<a id="ln-106" name="ln-106" href="#ln-106"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dof</span>
+<a id="ln-107" name="ln-107" href="#ln-107"></a><span class="w">        </span><span class="c">!! The degrees of freedom.</span>
+<a id="ln-108" name="ln-108" href="#ln-108"></a>
+<a id="ln-109" name="ln-109" href="#ln-109"></a><span class="w">    </span><span class="c">! Parameters</span>
+<a id="ln-110" name="ln-110" href="#ln-110"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">half</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.5d0</span>
+<a id="ln-111" name="ln-111" href="#ln-111"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">one</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d0</span>
+<a id="ln-112" name="ln-112" href="#ln-112"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">two</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">2.0d0</span>
+<a id="ln-113" name="ln-113" href="#ln-113"></a>
+<a id="ln-114" name="ln-114" href="#ln-114"></a><span class="w">    </span><span class="c">! Local Variables</span>
+<a id="ln-115" name="ln-115" href="#ln-115"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">v1</span><span class="p">,</span><span class="w"> </span><span class="n">v2</span><span class="p">,</span><span class="w"> </span><span class="n">m1</span><span class="p">,</span><span class="w"> </span><span class="n">m2</span><span class="p">,</span><span class="w"> </span><span class="n">sv</span><span class="p">,</span><span class="w"> </span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">b</span><span class="p">,</span><span class="w"> </span><span class="n">x</span>
+<a id="ln-116" name="ln-116" href="#ln-116"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">n1</span><span class="p">,</span><span class="w"> </span><span class="n">n2</span>
+<a id="ln-117" name="ln-117" href="#ln-117"></a>
+<a id="ln-118" name="ln-118" href="#ln-118"></a><span class="w">    </span><span class="c">! Compute the T-statistic</span>
+<a id="ln-119" name="ln-119" href="#ln-119"></a><span class="w">    </span><span class="n">n1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x1</span><span class="p">)</span>
+<a id="ln-120" name="ln-120" href="#ln-120"></a><span class="w">    </span><span class="n">n2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x2</span><span class="p">)</span>
+<a id="ln-121" name="ln-121" href="#ln-121"></a><span class="w">    </span><span class="n">m1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">mean</span><span class="p">(</span><span class="n">x1</span><span class="p">)</span>
+<a id="ln-122" name="ln-122" href="#ln-122"></a><span class="w">    </span><span class="n">m2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">mean</span><span class="p">(</span><span class="n">x2</span><span class="p">)</span>
+<a id="ln-123" name="ln-123" href="#ln-123"></a><span class="w">    </span><span class="n">v1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">variance</span><span class="p">(</span><span class="n">x1</span><span class="p">)</span>
+<a id="ln-124" name="ln-124" href="#ln-124"></a><span class="w">    </span><span class="n">v2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">variance</span><span class="p">(</span><span class="n">x2</span><span class="p">)</span>
+<a id="ln-125" name="ln-125" href="#ln-125"></a><span class="w">    </span><span class="n">dof</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">n1</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">n2</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">two</span>
+<a id="ln-126" name="ln-126" href="#ln-126"></a><span class="w">    </span><span class="n">sv</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">((</span><span class="n">n1</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">one</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">v1</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">(</span><span class="n">n2</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">one</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">v2</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">dof</span>
+<a id="ln-127" name="ln-127" href="#ln-127"></a><span class="w">    </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">abs</span><span class="p">(</span><span class="n">m1</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">m2</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="nb">sqrt</span><span class="p">(</span><span class="n">sv</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="p">(</span><span class="n">one</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="kt">real</span><span class="p">(</span><span class="n">n1</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">one</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="kt">real</span><span class="p">(</span><span class="n">n2</span><span class="p">)))</span>
+<a id="ln-128" name="ln-128" href="#ln-128"></a>
+<a id="ln-129" name="ln-129" href="#ln-129"></a><span class="w">    </span><span class="c">! Compute the probability</span>
+<a id="ln-130" name="ln-130" href="#ln-130"></a><span class="w">    </span><span class="n">a</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">half</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">dof</span>
+<a id="ln-131" name="ln-131" href="#ln-131"></a><span class="w">    </span><span class="n">b</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">half</span>
+<a id="ln-132" name="ln-132" href="#ln-132"></a><span class="w">    </span><span class="n">x</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">dof</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="p">(</span><span class="n">dof</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="nb">stat</span><span class="o">**</span><span class="mi">2</span><span class="p">)</span>
+<a id="ln-133" name="ln-133" href="#ln-133"></a><span class="w">    </span><span class="n">p</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">regularized_beta</span><span class="p">(</span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">b</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">)</span>
+<a id="ln-134" name="ln-134" href="#ln-134"></a><span class="k">end subroutine</span>
+<a id="ln-135" name="ln-135" href="#ln-135"></a>
+<a id="ln-136" name="ln-136" href="#ln-136"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-137" name="ln-137" href="#ln-137"></a><span class="k">subroutine </span><span class="n">t_test_unequal_variance</span><span class="p">(</span><span class="n">x1</span><span class="p">,</span><span class="w"> </span><span class="n">x2</span><span class="p">,</span><span class="w"> </span><span class="nb">stat</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">dof</span><span class="p">)</span>
+<a id="ln-138" name="ln-138" href="#ln-138"></a><span class="w">    </span><span class="c">!! Computes the 2-tailed Student&#39;s T-Test for two data sets of </span>
+<a id="ln-139" name="ln-139" href="#ln-139"></a><span class="w">    </span><span class="c">!! assumed non-equivalent variances.</span>
 <a id="ln-140" name="ln-140" href="#ln-140"></a><span class="w">    </span><span class="c">!!</span>
-<a id="ln-141" name="ln-141" href="#ln-141"></a><span class="w">    </span><span class="c">!! - [Wikipedia](https://en.wikipedia.org/wiki/Student%27s_t-test)</span>
-<a id="ln-142" name="ln-142" href="#ln-142"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x1</span><span class="p">(:)</span>
-<a id="ln-143" name="ln-143" href="#ln-143"></a><span class="w">        </span><span class="c">!! An N-element array containing the first data set.</span>
-<a id="ln-144" name="ln-144" href="#ln-144"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x2</span><span class="p">(:)</span>
-<a id="ln-145" name="ln-145" href="#ln-145"></a><span class="w">        </span><span class="c">!! An M-element array containing the second data set.</span>
-<a id="ln-146" name="ln-146" href="#ln-146"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="nb">stat</span>
-<a id="ln-147" name="ln-147" href="#ln-147"></a><span class="w">        </span><span class="c">!! The Student-&#39;s T-Test statistic.</span>
-<a id="ln-148" name="ln-148" href="#ln-148"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">p</span>
-<a id="ln-149" name="ln-149" href="#ln-149"></a><span class="w">        </span><span class="c">!! The probability value that the two samples are likely to</span>
-<a id="ln-150" name="ln-150" href="#ln-150"></a><span class="w">        </span><span class="c">!! have come from two underlying populations that </span>
-<a id="ln-151" name="ln-151" href="#ln-151"></a><span class="w">        </span><span class="c">!! have the same mean.</span>
-<a id="ln-152" name="ln-152" href="#ln-152"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dof</span>
-<a id="ln-153" name="ln-153" href="#ln-153"></a><span class="w">        </span><span class="c">!! The degrees of freedom.</span>
-<a id="ln-154" name="ln-154" href="#ln-154"></a>
-<a id="ln-155" name="ln-155" href="#ln-155"></a><span class="w">    </span><span class="c">! Parameters</span>
-<a id="ln-156" name="ln-156" href="#ln-156"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">half</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.5d0</span>
-<a id="ln-157" name="ln-157" href="#ln-157"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">one</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d0</span>
-<a id="ln-158" name="ln-158" href="#ln-158"></a>
-<a id="ln-159" name="ln-159" href="#ln-159"></a><span class="w">    </span><span class="c">! Local Variables</span>
-<a id="ln-160" name="ln-160" href="#ln-160"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">v1</span><span class="p">,</span><span class="w"> </span><span class="n">v2</span><span class="p">,</span><span class="w"> </span><span class="n">m1</span><span class="p">,</span><span class="w"> </span><span class="n">m2</span><span class="p">,</span><span class="w"> </span><span class="n">sv</span><span class="p">,</span><span class="w"> </span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">b</span><span class="p">,</span><span class="w"> </span><span class="n">x</span>
-<a id="ln-161" name="ln-161" href="#ln-161"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">n1</span><span class="p">,</span><span class="w"> </span><span class="n">n2</span>
-<a id="ln-162" name="ln-162" href="#ln-162"></a>
-<a id="ln-163" name="ln-163" href="#ln-163"></a><span class="w">    </span><span class="c">! Compute the T-statistic</span>
-<a id="ln-164" name="ln-164" href="#ln-164"></a><span class="w">    </span><span class="n">n1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x1</span><span class="p">)</span>
-<a id="ln-165" name="ln-165" href="#ln-165"></a><span class="w">    </span><span class="n">n2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x2</span><span class="p">)</span>
-<a id="ln-166" name="ln-166" href="#ln-166"></a><span class="w">    </span><span class="n">m1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">mean</span><span class="p">(</span><span class="n">x1</span><span class="p">)</span>
-<a id="ln-167" name="ln-167" href="#ln-167"></a><span class="w">    </span><span class="n">m2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">mean</span><span class="p">(</span><span class="n">x2</span><span class="p">)</span>
-<a id="ln-168" name="ln-168" href="#ln-168"></a><span class="w">    </span><span class="n">v1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">variance</span><span class="p">(</span><span class="n">x1</span><span class="p">)</span>
-<a id="ln-169" name="ln-169" href="#ln-169"></a><span class="w">    </span><span class="n">v2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">variance</span><span class="p">(</span><span class="n">x2</span><span class="p">)</span>
-<a id="ln-170" name="ln-170" href="#ln-170"></a><span class="w">    </span><span class="n">dof</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">v1</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="kt">real</span><span class="p">(</span><span class="n">n1</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">v2</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="kt">real</span><span class="p">(</span><span class="n">n2</span><span class="p">))</span><span class="o">**</span><span class="mi">2</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="p">((</span><span class="n">v1</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">n1</span><span class="p">)</span><span class="o">**</span><span class="mi">2</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="p">(</span><span class="n">n1</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">one</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-171" name="ln-171" href="#ln-171"></a><span class="w">        </span><span class="p">(</span><span class="n">v2</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">n2</span><span class="p">)</span><span class="o">**</span><span class="mi">2</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="p">(</span><span class="n">n2</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">one</span><span class="p">))</span>
-<a id="ln-172" name="ln-172" href="#ln-172"></a><span class="w">    </span><span class="n">sv</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">sqrt</span><span class="p">(</span><span class="n">v1</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">n1</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">v2</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">n2</span><span class="p">)</span>
-<a id="ln-173" name="ln-173" href="#ln-173"></a><span class="w">    </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">m1</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">m2</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">sv</span>
-<a id="ln-174" name="ln-174" href="#ln-174"></a>
-<a id="ln-175" name="ln-175" href="#ln-175"></a><span class="w">    </span><span class="c">! Compute the probability</span>
-<a id="ln-176" name="ln-176" href="#ln-176"></a><span class="w">    </span><span class="n">a</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">half</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">dof</span>
-<a id="ln-177" name="ln-177" href="#ln-177"></a><span class="w">    </span><span class="n">b</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">half</span>
-<a id="ln-178" name="ln-178" href="#ln-178"></a><span class="w">    </span><span class="n">x</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">dof</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="p">(</span><span class="n">dof</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="nb">stat</span><span class="o">**</span><span class="mi">2</span><span class="p">)</span>
-<a id="ln-179" name="ln-179" href="#ln-179"></a><span class="w">    </span><span class="n">p</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">regularized_beta</span><span class="p">(</span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">b</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">)</span>
-<a id="ln-180" name="ln-180" href="#ln-180"></a><span class="k">end subroutine</span>
-<a id="ln-181" name="ln-181" href="#ln-181"></a>
-<a id="ln-182" name="ln-182" href="#ln-182"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-183" name="ln-183" href="#ln-183"></a><span class="k">subroutine </span><span class="n">t_test_paired</span><span class="p">(</span><span class="n">x1</span><span class="p">,</span><span class="w"> </span><span class="n">x2</span><span class="p">,</span><span class="w"> </span><span class="nb">stat</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">dof</span><span class="p">,</span><span class="w"> </span><span class="n">err</span><span class="p">)</span>
-<a id="ln-184" name="ln-184" href="#ln-184"></a><span class="w">    </span><span class="c">!! Computes the 2-tailed Student&#39;s T-Test for two paired data sets.</span>
-<a id="ln-185" name="ln-185" href="#ln-185"></a><span class="w">    </span><span class="c">!!</span>
-<a id="ln-186" name="ln-186" href="#ln-186"></a><span class="w">    </span><span class="c">!! See Also</span>
+<a id="ln-141" name="ln-141" href="#ln-141"></a><span class="w">    </span><span class="c">!! See Also</span>
+<a id="ln-142" name="ln-142" href="#ln-142"></a><span class="w">    </span><span class="c">!!</span>
+<a id="ln-143" name="ln-143" href="#ln-143"></a><span class="w">    </span><span class="c">!! - [Wikipedia](https://en.wikipedia.org/wiki/Student%27s_t-test)</span>
+<a id="ln-144" name="ln-144" href="#ln-144"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x1</span><span class="p">(:)</span>
+<a id="ln-145" name="ln-145" href="#ln-145"></a><span class="w">        </span><span class="c">!! An N-element array containing the first data set.</span>
+<a id="ln-146" name="ln-146" href="#ln-146"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x2</span><span class="p">(:)</span>
+<a id="ln-147" name="ln-147" href="#ln-147"></a><span class="w">        </span><span class="c">!! An M-element array containing the second data set.</span>
+<a id="ln-148" name="ln-148" href="#ln-148"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="nb">stat</span>
+<a id="ln-149" name="ln-149" href="#ln-149"></a><span class="w">        </span><span class="c">!! The Student-&#39;s T-Test statistic.</span>
+<a id="ln-150" name="ln-150" href="#ln-150"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">p</span>
+<a id="ln-151" name="ln-151" href="#ln-151"></a><span class="w">        </span><span class="c">!! The probability value that the two samples are likely to</span>
+<a id="ln-152" name="ln-152" href="#ln-152"></a><span class="w">        </span><span class="c">!! have come from two underlying populations that </span>
+<a id="ln-153" name="ln-153" href="#ln-153"></a><span class="w">        </span><span class="c">!! have the same mean.</span>
+<a id="ln-154" name="ln-154" href="#ln-154"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dof</span>
+<a id="ln-155" name="ln-155" href="#ln-155"></a><span class="w">        </span><span class="c">!! The degrees of freedom.</span>
+<a id="ln-156" name="ln-156" href="#ln-156"></a>
+<a id="ln-157" name="ln-157" href="#ln-157"></a><span class="w">    </span><span class="c">! Parameters</span>
+<a id="ln-158" name="ln-158" href="#ln-158"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">half</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.5d0</span>
+<a id="ln-159" name="ln-159" href="#ln-159"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">one</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d0</span>
+<a id="ln-160" name="ln-160" href="#ln-160"></a>
+<a id="ln-161" name="ln-161" href="#ln-161"></a><span class="w">    </span><span class="c">! Local Variables</span>
+<a id="ln-162" name="ln-162" href="#ln-162"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">v1</span><span class="p">,</span><span class="w"> </span><span class="n">v2</span><span class="p">,</span><span class="w"> </span><span class="n">m1</span><span class="p">,</span><span class="w"> </span><span class="n">m2</span><span class="p">,</span><span class="w"> </span><span class="n">sv</span><span class="p">,</span><span class="w"> </span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">b</span><span class="p">,</span><span class="w"> </span><span class="n">x</span>
+<a id="ln-163" name="ln-163" href="#ln-163"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">n1</span><span class="p">,</span><span class="w"> </span><span class="n">n2</span>
+<a id="ln-164" name="ln-164" href="#ln-164"></a>
+<a id="ln-165" name="ln-165" href="#ln-165"></a><span class="w">    </span><span class="c">! Compute the T-statistic</span>
+<a id="ln-166" name="ln-166" href="#ln-166"></a><span class="w">    </span><span class="n">n1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x1</span><span class="p">)</span>
+<a id="ln-167" name="ln-167" href="#ln-167"></a><span class="w">    </span><span class="n">n2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x2</span><span class="p">)</span>
+<a id="ln-168" name="ln-168" href="#ln-168"></a><span class="w">    </span><span class="n">m1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">mean</span><span class="p">(</span><span class="n">x1</span><span class="p">)</span>
+<a id="ln-169" name="ln-169" href="#ln-169"></a><span class="w">    </span><span class="n">m2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">mean</span><span class="p">(</span><span class="n">x2</span><span class="p">)</span>
+<a id="ln-170" name="ln-170" href="#ln-170"></a><span class="w">    </span><span class="n">v1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">variance</span><span class="p">(</span><span class="n">x1</span><span class="p">)</span>
+<a id="ln-171" name="ln-171" href="#ln-171"></a><span class="w">    </span><span class="n">v2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">variance</span><span class="p">(</span><span class="n">x2</span><span class="p">)</span>
+<a id="ln-172" name="ln-172" href="#ln-172"></a><span class="w">    </span><span class="n">dof</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">v1</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="kt">real</span><span class="p">(</span><span class="n">n1</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">v2</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="kt">real</span><span class="p">(</span><span class="n">n2</span><span class="p">))</span><span class="o">**</span><span class="mi">2</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="p">((</span><span class="n">v1</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">n1</span><span class="p">)</span><span class="o">**</span><span class="mi">2</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="p">(</span><span class="n">n1</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">one</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-173" name="ln-173" href="#ln-173"></a><span class="w">        </span><span class="p">(</span><span class="n">v2</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">n2</span><span class="p">)</span><span class="o">**</span><span class="mi">2</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="p">(</span><span class="n">n2</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">one</span><span class="p">))</span>
+<a id="ln-174" name="ln-174" href="#ln-174"></a><span class="w">    </span><span class="n">sv</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">sqrt</span><span class="p">(</span><span class="n">v1</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">n1</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">v2</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">n2</span><span class="p">)</span>
+<a id="ln-175" name="ln-175" href="#ln-175"></a><span class="w">    </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">m1</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">m2</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">sv</span>
+<a id="ln-176" name="ln-176" href="#ln-176"></a>
+<a id="ln-177" name="ln-177" href="#ln-177"></a><span class="w">    </span><span class="c">! Compute the probability</span>
+<a id="ln-178" name="ln-178" href="#ln-178"></a><span class="w">    </span><span class="n">a</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">half</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">dof</span>
+<a id="ln-179" name="ln-179" href="#ln-179"></a><span class="w">    </span><span class="n">b</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">half</span>
+<a id="ln-180" name="ln-180" href="#ln-180"></a><span class="w">    </span><span class="n">x</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">dof</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="p">(</span><span class="n">dof</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="nb">stat</span><span class="o">**</span><span class="mi">2</span><span class="p">)</span>
+<a id="ln-181" name="ln-181" href="#ln-181"></a><span class="w">    </span><span class="n">p</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">regularized_beta</span><span class="p">(</span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">b</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">)</span>
+<a id="ln-182" name="ln-182" href="#ln-182"></a><span class="k">end subroutine</span>
+<a id="ln-183" name="ln-183" href="#ln-183"></a>
+<a id="ln-184" name="ln-184" href="#ln-184"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-185" name="ln-185" href="#ln-185"></a><span class="k">subroutine </span><span class="n">t_test_paired</span><span class="p">(</span><span class="n">x1</span><span class="p">,</span><span class="w"> </span><span class="n">x2</span><span class="p">,</span><span class="w"> </span><span class="nb">stat</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">dof</span><span class="p">,</span><span class="w"> </span><span class="n">err</span><span class="p">)</span>
+<a id="ln-186" name="ln-186" href="#ln-186"></a><span class="w">    </span><span class="c">!! Computes the 2-tailed Student&#39;s T-Test for two paired data sets.</span>
 <a id="ln-187" name="ln-187" href="#ln-187"></a><span class="w">    </span><span class="c">!!</span>
-<a id="ln-188" name="ln-188" href="#ln-188"></a><span class="w">    </span><span class="c">!! - [Wikipedia](https://en.wikipedia.org/wiki/Student%27s_t-test)</span>
-<a id="ln-189" name="ln-189" href="#ln-189"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x1</span><span class="p">(:)</span>
-<a id="ln-190" name="ln-190" href="#ln-190"></a><span class="w">        </span><span class="c">!! An N-element array containing the first data set.</span>
-<a id="ln-191" name="ln-191" href="#ln-191"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x2</span><span class="p">(:)</span>
-<a id="ln-192" name="ln-192" href="#ln-192"></a><span class="w">        </span><span class="c">!! An N-element array containing the second data set.</span>
-<a id="ln-193" name="ln-193" href="#ln-193"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="nb">stat</span>
-<a id="ln-194" name="ln-194" href="#ln-194"></a><span class="w">        </span><span class="c">!! The Student-&#39;s T-Test statistic.</span>
-<a id="ln-195" name="ln-195" href="#ln-195"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">p</span>
-<a id="ln-196" name="ln-196" href="#ln-196"></a><span class="w">        </span><span class="c">!! The probability value that the two samples are likely to</span>
-<a id="ln-197" name="ln-197" href="#ln-197"></a><span class="w">        </span><span class="c">!! have come from  two underlying populations that </span>
-<a id="ln-198" name="ln-198" href="#ln-198"></a><span class="w">        </span><span class="c">!! have the same mean.</span>
-<a id="ln-199" name="ln-199" href="#ln-199"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dof</span>
-<a id="ln-200" name="ln-200" href="#ln-200"></a><span class="w">        </span><span class="c">!! The degrees of freedom.</span>
-<a id="ln-201" name="ln-201" href="#ln-201"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">err</span>
-<a id="ln-202" name="ln-202" href="#ln-202"></a><span class="w">        </span><span class="c">!! A mechanism for communicating errors and warnings to the </span>
-<a id="ln-203" name="ln-203" href="#ln-203"></a><span class="w">        </span><span class="c">!! caller.  Possible warning and error codes are as follows.</span>
-<a id="ln-204" name="ln-204" href="#ln-204"></a><span class="w">        </span><span class="c">!! - FS_NO_ERROR: No errors encountered.</span>
-<a id="ln-205" name="ln-205" href="#ln-205"></a><span class="w">        </span><span class="c">!! - FS_ARRAY_SIZE_ERROR: Occurs if x1 and x2 are not the same </span>
-<a id="ln-206" name="ln-206" href="#ln-206"></a><span class="w">        </span><span class="c">!!   length.</span>
-<a id="ln-207" name="ln-207" href="#ln-207"></a>
-<a id="ln-208" name="ln-208" href="#ln-208"></a><span class="w">    </span><span class="c">! Parameters</span>
-<a id="ln-209" name="ln-209" href="#ln-209"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">zero</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.0d0</span>
-<a id="ln-210" name="ln-210" href="#ln-210"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">half</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.5d0</span>
-<a id="ln-211" name="ln-211" href="#ln-211"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">one</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d0</span>
-<a id="ln-212" name="ln-212" href="#ln-212"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">two</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">2.0d0</span>
-<a id="ln-213" name="ln-213" href="#ln-213"></a>
-<a id="ln-214" name="ln-214" href="#ln-214"></a><span class="w">    </span><span class="c">! Local Variables</span>
-<a id="ln-215" name="ln-215" href="#ln-215"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">errmgr</span>
-<a id="ln-216" name="ln-216" href="#ln-216"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">deferr</span>
-<a id="ln-217" name="ln-217" href="#ln-217"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">v1</span><span class="p">,</span><span class="w"> </span><span class="n">v2</span><span class="p">,</span><span class="w"> </span><span class="n">m1</span><span class="p">,</span><span class="w"> </span><span class="n">m2</span><span class="p">,</span><span class="w"> </span><span class="n">sd</span><span class="p">,</span><span class="w"> </span><span class="n">cov</span><span class="p">,</span><span class="w"> </span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">b</span><span class="p">,</span><span class="w"> </span><span class="n">x</span>
-<a id="ln-218" name="ln-218" href="#ln-218"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">i</span><span class="p">,</span><span class="w"> </span><span class="n">n1</span><span class="p">,</span><span class="w"> </span><span class="n">n2</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
-<a id="ln-219" name="ln-219" href="#ln-219"></a><span class="w">    </span>
-<a id="ln-220" name="ln-220" href="#ln-220"></a><span class="w">    </span><span class="c">! Initialization</span>
-<a id="ln-221" name="ln-221" href="#ln-221"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">err</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-222" name="ln-222" href="#ln-222"></a><span class="k">        </span><span class="n">errmgr</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">err</span>
-<a id="ln-223" name="ln-223" href="#ln-223"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-224" name="ln-224" href="#ln-224"></a><span class="k">        </span><span class="n">errmgr</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">deferr</span>
-<a id="ln-225" name="ln-225" href="#ln-225"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-226" name="ln-226" href="#ln-226"></a><span class="k">    </span><span class="n">n1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x1</span><span class="p">)</span>
-<a id="ln-227" name="ln-227" href="#ln-227"></a><span class="w">    </span><span class="n">n2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x2</span><span class="p">)</span>
-<a id="ln-228" name="ln-228" href="#ln-228"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">min</span><span class="p">(</span><span class="n">n1</span><span class="p">,</span><span class="w"> </span><span class="n">n2</span><span class="p">)</span>
-<a id="ln-229" name="ln-229" href="#ln-229"></a>
-<a id="ln-230" name="ln-230" href="#ln-230"></a><span class="w">    </span><span class="c">! Input Checking</span>
-<a id="ln-231" name="ln-231" href="#ln-231"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">n1</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">n2</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-232" name="ln-232" href="#ln-232"></a><span class="k">        call </span><span class="n">report_arrays_not_same_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;t_test_paired_real64&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-233" name="ln-233" href="#ln-233"></a><span class="w">            </span><span class="s2">&quot;X1&quot;</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;X2&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">n1</span><span class="p">,</span><span class="w"> </span><span class="n">n2</span><span class="p">)</span>
-<a id="ln-234" name="ln-234" href="#ln-234"></a><span class="w">        </span><span class="k">return</span>
-<a id="ln-235" name="ln-235" href="#ln-235"></a><span class="k">    end if</span>
-<a id="ln-236" name="ln-236" href="#ln-236"></a>
-<a id="ln-237" name="ln-237" href="#ln-237"></a><span class="w">    </span><span class="c">! Compute the T-statistic</span>
-<a id="ln-238" name="ln-238" href="#ln-238"></a><span class="w">    </span><span class="n">m1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">mean</span><span class="p">(</span><span class="n">x1</span><span class="p">)</span>
-<a id="ln-239" name="ln-239" href="#ln-239"></a><span class="w">    </span><span class="n">m2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">mean</span><span class="p">(</span><span class="n">x2</span><span class="p">)</span>
-<a id="ln-240" name="ln-240" href="#ln-240"></a><span class="w">    </span><span class="n">v1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">variance</span><span class="p">(</span><span class="n">x1</span><span class="p">)</span>
-<a id="ln-241" name="ln-241" href="#ln-241"></a><span class="w">    </span><span class="n">v2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">variance</span><span class="p">(</span><span class="n">x2</span><span class="p">)</span>
-<a id="ln-242" name="ln-242" href="#ln-242"></a><span class="w">    </span><span class="n">dof</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="kt">real</span><span class="p">(</span><span class="n">n1</span><span class="p">)</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">one</span>
-<a id="ln-243" name="ln-243" href="#ln-243"></a><span class="w">    </span><span class="n">cov</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">zero</span>
-<a id="ln-244" name="ln-244" href="#ln-244"></a><span class="w">    </span><span class="k">do </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
-<a id="ln-245" name="ln-245" href="#ln-245"></a><span class="w">        </span><span class="n">cov</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">cov</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">(</span><span class="n">x1</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">m1</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="p">(</span><span class="n">x2</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">m2</span><span class="p">)</span>
-<a id="ln-246" name="ln-246" href="#ln-246"></a><span class="w">    </span><span class="k">end do</span>
-<a id="ln-247" name="ln-247" href="#ln-247"></a><span class="k">    </span><span class="n">cov</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">cov</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">dof</span>
-<a id="ln-248" name="ln-248" href="#ln-248"></a><span class="w">    </span><span class="n">sd</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">sqrt</span><span class="p">((</span><span class="n">v1</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">v2</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">two</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">cov</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">n</span><span class="p">)</span>
-<a id="ln-249" name="ln-249" href="#ln-249"></a><span class="w">    </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">m1</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">m2</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">sd</span>
-<a id="ln-250" name="ln-250" href="#ln-250"></a>
-<a id="ln-251" name="ln-251" href="#ln-251"></a><span class="w">    </span><span class="c">! Compute the probability</span>
-<a id="ln-252" name="ln-252" href="#ln-252"></a><span class="w">    </span><span class="n">a</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">half</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">dof</span>
-<a id="ln-253" name="ln-253" href="#ln-253"></a><span class="w">    </span><span class="n">b</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">half</span>
-<a id="ln-254" name="ln-254" href="#ln-254"></a><span class="w">    </span><span class="n">x</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">dof</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="p">(</span><span class="n">dof</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="nb">stat</span><span class="o">**</span><span class="mi">2</span><span class="p">)</span>
-<a id="ln-255" name="ln-255" href="#ln-255"></a><span class="w">    </span><span class="n">p</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">regularized_beta</span><span class="p">(</span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">b</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">)</span>
-<a id="ln-256" name="ln-256" href="#ln-256"></a><span class="k">end subroutine</span>
-<a id="ln-257" name="ln-257" href="#ln-257"></a>
-<a id="ln-258" name="ln-258" href="#ln-258"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-259" name="ln-259" href="#ln-259"></a><span class="k">subroutine </span><span class="n">f_test</span><span class="p">(</span><span class="n">x1</span><span class="p">,</span><span class="w"> </span><span class="n">x2</span><span class="p">,</span><span class="w"> </span><span class="nb">stat</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">dof1</span><span class="p">,</span><span class="w"> </span><span class="n">dof2</span><span class="p">)</span>
-<a id="ln-260" name="ln-260" href="#ln-260"></a><span class="w">    </span><span class="c">!! Computes the F-test and returns the probability (two-tailed) that</span>
-<a id="ln-261" name="ln-261" href="#ln-261"></a><span class="w">    </span><span class="c">!! the variances of two data sets are not significantly different.</span>
-<a id="ln-262" name="ln-262" href="#ln-262"></a><span class="w">    </span><span class="c">!!</span>
-<a id="ln-263" name="ln-263" href="#ln-263"></a><span class="w">    </span><span class="c">!! See Also</span>
+<a id="ln-188" name="ln-188" href="#ln-188"></a><span class="w">    </span><span class="c">!! See Also</span>
+<a id="ln-189" name="ln-189" href="#ln-189"></a><span class="w">    </span><span class="c">!!</span>
+<a id="ln-190" name="ln-190" href="#ln-190"></a><span class="w">    </span><span class="c">!! - [Wikipedia](https://en.wikipedia.org/wiki/Student%27s_t-test)</span>
+<a id="ln-191" name="ln-191" href="#ln-191"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x1</span><span class="p">(:)</span>
+<a id="ln-192" name="ln-192" href="#ln-192"></a><span class="w">        </span><span class="c">!! An N-element array containing the first data set.</span>
+<a id="ln-193" name="ln-193" href="#ln-193"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x2</span><span class="p">(:)</span>
+<a id="ln-194" name="ln-194" href="#ln-194"></a><span class="w">        </span><span class="c">!! An N-element array containing the second data set.</span>
+<a id="ln-195" name="ln-195" href="#ln-195"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="nb">stat</span>
+<a id="ln-196" name="ln-196" href="#ln-196"></a><span class="w">        </span><span class="c">!! The Student-&#39;s T-Test statistic.</span>
+<a id="ln-197" name="ln-197" href="#ln-197"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">p</span>
+<a id="ln-198" name="ln-198" href="#ln-198"></a><span class="w">        </span><span class="c">!! The probability value that the two samples are likely to</span>
+<a id="ln-199" name="ln-199" href="#ln-199"></a><span class="w">        </span><span class="c">!! have come from  two underlying populations that </span>
+<a id="ln-200" name="ln-200" href="#ln-200"></a><span class="w">        </span><span class="c">!! have the same mean.</span>
+<a id="ln-201" name="ln-201" href="#ln-201"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dof</span>
+<a id="ln-202" name="ln-202" href="#ln-202"></a><span class="w">        </span><span class="c">!! The degrees of freedom.</span>
+<a id="ln-203" name="ln-203" href="#ln-203"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">err</span>
+<a id="ln-204" name="ln-204" href="#ln-204"></a><span class="w">        </span><span class="c">!! A mechanism for communicating errors and warnings to the </span>
+<a id="ln-205" name="ln-205" href="#ln-205"></a><span class="w">        </span><span class="c">!! caller.  Possible warning and error codes are as follows.</span>
+<a id="ln-206" name="ln-206" href="#ln-206"></a><span class="w">        </span><span class="c">!! - FS_NO_ERROR: No errors encountered.</span>
+<a id="ln-207" name="ln-207" href="#ln-207"></a><span class="w">        </span><span class="c">!! - FS_ARRAY_SIZE_ERROR: Occurs if x1 and x2 are not the same </span>
+<a id="ln-208" name="ln-208" href="#ln-208"></a><span class="w">        </span><span class="c">!!   length.</span>
+<a id="ln-209" name="ln-209" href="#ln-209"></a>
+<a id="ln-210" name="ln-210" href="#ln-210"></a><span class="w">    </span><span class="c">! Parameters</span>
+<a id="ln-211" name="ln-211" href="#ln-211"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">zero</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.0d0</span>
+<a id="ln-212" name="ln-212" href="#ln-212"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">half</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.5d0</span>
+<a id="ln-213" name="ln-213" href="#ln-213"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">one</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d0</span>
+<a id="ln-214" name="ln-214" href="#ln-214"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">two</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">2.0d0</span>
+<a id="ln-215" name="ln-215" href="#ln-215"></a>
+<a id="ln-216" name="ln-216" href="#ln-216"></a><span class="w">    </span><span class="c">! Local Variables</span>
+<a id="ln-217" name="ln-217" href="#ln-217"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">errmgr</span>
+<a id="ln-218" name="ln-218" href="#ln-218"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">deferr</span>
+<a id="ln-219" name="ln-219" href="#ln-219"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">v1</span><span class="p">,</span><span class="w"> </span><span class="n">v2</span><span class="p">,</span><span class="w"> </span><span class="n">m1</span><span class="p">,</span><span class="w"> </span><span class="n">m2</span><span class="p">,</span><span class="w"> </span><span class="n">sd</span><span class="p">,</span><span class="w"> </span><span class="n">cov</span><span class="p">,</span><span class="w"> </span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">b</span><span class="p">,</span><span class="w"> </span><span class="n">x</span>
+<a id="ln-220" name="ln-220" href="#ln-220"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">i</span><span class="p">,</span><span class="w"> </span><span class="n">n1</span><span class="p">,</span><span class="w"> </span><span class="n">n2</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
+<a id="ln-221" name="ln-221" href="#ln-221"></a><span class="w">    </span>
+<a id="ln-222" name="ln-222" href="#ln-222"></a><span class="w">    </span><span class="c">! Initialization</span>
+<a id="ln-223" name="ln-223" href="#ln-223"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">err</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-224" name="ln-224" href="#ln-224"></a><span class="k">        </span><span class="n">errmgr</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">err</span>
+<a id="ln-225" name="ln-225" href="#ln-225"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-226" name="ln-226" href="#ln-226"></a><span class="k">        </span><span class="n">errmgr</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">deferr</span>
+<a id="ln-227" name="ln-227" href="#ln-227"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-228" name="ln-228" href="#ln-228"></a><span class="k">    </span><span class="n">n1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x1</span><span class="p">)</span>
+<a id="ln-229" name="ln-229" href="#ln-229"></a><span class="w">    </span><span class="n">n2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x2</span><span class="p">)</span>
+<a id="ln-230" name="ln-230" href="#ln-230"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">min</span><span class="p">(</span><span class="n">n1</span><span class="p">,</span><span class="w"> </span><span class="n">n2</span><span class="p">)</span>
+<a id="ln-231" name="ln-231" href="#ln-231"></a>
+<a id="ln-232" name="ln-232" href="#ln-232"></a><span class="w">    </span><span class="c">! Input Checking</span>
+<a id="ln-233" name="ln-233" href="#ln-233"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">n1</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">n2</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-234" name="ln-234" href="#ln-234"></a><span class="k">        call </span><span class="n">report_arrays_not_same_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;t_test_paired_real64&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-235" name="ln-235" href="#ln-235"></a><span class="w">            </span><span class="s2">&quot;X1&quot;</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;X2&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">n1</span><span class="p">,</span><span class="w"> </span><span class="n">n2</span><span class="p">)</span>
+<a id="ln-236" name="ln-236" href="#ln-236"></a><span class="w">        </span><span class="k">return</span>
+<a id="ln-237" name="ln-237" href="#ln-237"></a><span class="k">    end if</span>
+<a id="ln-238" name="ln-238" href="#ln-238"></a>
+<a id="ln-239" name="ln-239" href="#ln-239"></a><span class="w">    </span><span class="c">! Compute the T-statistic</span>
+<a id="ln-240" name="ln-240" href="#ln-240"></a><span class="w">    </span><span class="n">m1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">mean</span><span class="p">(</span><span class="n">x1</span><span class="p">)</span>
+<a id="ln-241" name="ln-241" href="#ln-241"></a><span class="w">    </span><span class="n">m2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">mean</span><span class="p">(</span><span class="n">x2</span><span class="p">)</span>
+<a id="ln-242" name="ln-242" href="#ln-242"></a><span class="w">    </span><span class="n">v1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">variance</span><span class="p">(</span><span class="n">x1</span><span class="p">)</span>
+<a id="ln-243" name="ln-243" href="#ln-243"></a><span class="w">    </span><span class="n">v2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">variance</span><span class="p">(</span><span class="n">x2</span><span class="p">)</span>
+<a id="ln-244" name="ln-244" href="#ln-244"></a><span class="w">    </span><span class="n">dof</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="kt">real</span><span class="p">(</span><span class="n">n1</span><span class="p">)</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">one</span>
+<a id="ln-245" name="ln-245" href="#ln-245"></a><span class="w">    </span><span class="n">cov</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">zero</span>
+<a id="ln-246" name="ln-246" href="#ln-246"></a><span class="w">    </span><span class="k">do </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
+<a id="ln-247" name="ln-247" href="#ln-247"></a><span class="w">        </span><span class="n">cov</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">cov</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">(</span><span class="n">x1</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">m1</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="p">(</span><span class="n">x2</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">m2</span><span class="p">)</span>
+<a id="ln-248" name="ln-248" href="#ln-248"></a><span class="w">    </span><span class="k">end do</span>
+<a id="ln-249" name="ln-249" href="#ln-249"></a><span class="k">    </span><span class="n">cov</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">cov</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">dof</span>
+<a id="ln-250" name="ln-250" href="#ln-250"></a><span class="w">    </span><span class="n">sd</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">sqrt</span><span class="p">((</span><span class="n">v1</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">v2</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">two</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">cov</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">n</span><span class="p">)</span>
+<a id="ln-251" name="ln-251" href="#ln-251"></a><span class="w">    </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">m1</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">m2</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">sd</span>
+<a id="ln-252" name="ln-252" href="#ln-252"></a>
+<a id="ln-253" name="ln-253" href="#ln-253"></a><span class="w">    </span><span class="c">! Compute the probability</span>
+<a id="ln-254" name="ln-254" href="#ln-254"></a><span class="w">    </span><span class="n">a</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">half</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">dof</span>
+<a id="ln-255" name="ln-255" href="#ln-255"></a><span class="w">    </span><span class="n">b</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">half</span>
+<a id="ln-256" name="ln-256" href="#ln-256"></a><span class="w">    </span><span class="n">x</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">dof</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="p">(</span><span class="n">dof</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="nb">stat</span><span class="o">**</span><span class="mi">2</span><span class="p">)</span>
+<a id="ln-257" name="ln-257" href="#ln-257"></a><span class="w">    </span><span class="n">p</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">regularized_beta</span><span class="p">(</span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">b</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">)</span>
+<a id="ln-258" name="ln-258" href="#ln-258"></a><span class="k">end subroutine</span>
+<a id="ln-259" name="ln-259" href="#ln-259"></a>
+<a id="ln-260" name="ln-260" href="#ln-260"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-261" name="ln-261" href="#ln-261"></a><span class="k">subroutine </span><span class="n">f_test</span><span class="p">(</span><span class="n">x1</span><span class="p">,</span><span class="w"> </span><span class="n">x2</span><span class="p">,</span><span class="w"> </span><span class="nb">stat</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">dof1</span><span class="p">,</span><span class="w"> </span><span class="n">dof2</span><span class="p">)</span>
+<a id="ln-262" name="ln-262" href="#ln-262"></a><span class="w">    </span><span class="c">!! Computes the F-test and returns the probability (two-tailed) that</span>
+<a id="ln-263" name="ln-263" href="#ln-263"></a><span class="w">    </span><span class="c">!! the variances of two data sets are not significantly different.</span>
 <a id="ln-264" name="ln-264" href="#ln-264"></a><span class="w">    </span><span class="c">!!</span>
-<a id="ln-265" name="ln-265" href="#ln-265"></a><span class="w">    </span><span class="c">!! - [Wikipedia](https://en.wikipedia.org/wiki/F-test)</span>
-<a id="ln-266" name="ln-266" href="#ln-266"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x1</span><span class="p">(:)</span>
-<a id="ln-267" name="ln-267" href="#ln-267"></a><span class="w">        </span><span class="c">!! An N-element array containing the first data set.</span>
-<a id="ln-268" name="ln-268" href="#ln-268"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x2</span><span class="p">(:)</span>
-<a id="ln-269" name="ln-269" href="#ln-269"></a><span class="w">        </span><span class="c">!! An M-element array containing the second data set.</span>
-<a id="ln-270" name="ln-270" href="#ln-270"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="nb">stat</span>
-<a id="ln-271" name="ln-271" href="#ln-271"></a><span class="w">        </span><span class="c">!! The F-statistic.</span>
-<a id="ln-272" name="ln-272" href="#ln-272"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">p</span>
-<a id="ln-273" name="ln-273" href="#ln-273"></a><span class="w">        </span><span class="c">!! The probability value that the two samples are likely to</span>
-<a id="ln-274" name="ln-274" href="#ln-274"></a><span class="w">        </span><span class="c">!! have come from the two underlying populations that </span>
-<a id="ln-275" name="ln-275" href="#ln-275"></a><span class="w">        </span><span class="c">!! have the same variance.</span>
-<a id="ln-276" name="ln-276" href="#ln-276"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dof1</span>
-<a id="ln-277" name="ln-277" href="#ln-277"></a><span class="w">        </span><span class="c">!! A measure of the degrees of freedom.</span>
-<a id="ln-278" name="ln-278" href="#ln-278"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dof2</span>
+<a id="ln-265" name="ln-265" href="#ln-265"></a><span class="w">    </span><span class="c">!! See Also</span>
+<a id="ln-266" name="ln-266" href="#ln-266"></a><span class="w">    </span><span class="c">!!</span>
+<a id="ln-267" name="ln-267" href="#ln-267"></a><span class="w">    </span><span class="c">!! - [Wikipedia](https://en.wikipedia.org/wiki/F-test)</span>
+<a id="ln-268" name="ln-268" href="#ln-268"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x1</span><span class="p">(:)</span>
+<a id="ln-269" name="ln-269" href="#ln-269"></a><span class="w">        </span><span class="c">!! An N-element array containing the first data set.</span>
+<a id="ln-270" name="ln-270" href="#ln-270"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x2</span><span class="p">(:)</span>
+<a id="ln-271" name="ln-271" href="#ln-271"></a><span class="w">        </span><span class="c">!! An M-element array containing the second data set.</span>
+<a id="ln-272" name="ln-272" href="#ln-272"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="nb">stat</span>
+<a id="ln-273" name="ln-273" href="#ln-273"></a><span class="w">        </span><span class="c">!! The F-statistic.</span>
+<a id="ln-274" name="ln-274" href="#ln-274"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">p</span>
+<a id="ln-275" name="ln-275" href="#ln-275"></a><span class="w">        </span><span class="c">!! The probability value that the two samples are likely to</span>
+<a id="ln-276" name="ln-276" href="#ln-276"></a><span class="w">        </span><span class="c">!! have come from the two underlying populations that </span>
+<a id="ln-277" name="ln-277" href="#ln-277"></a><span class="w">        </span><span class="c">!! have the same variance.</span>
+<a id="ln-278" name="ln-278" href="#ln-278"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dof1</span>
 <a id="ln-279" name="ln-279" href="#ln-279"></a><span class="w">        </span><span class="c">!! A measure of the degrees of freedom.</span>
-<a id="ln-280" name="ln-280" href="#ln-280"></a>
-<a id="ln-281" name="ln-281" href="#ln-281"></a><span class="w">    </span><span class="c">! Parameters</span>
-<a id="ln-282" name="ln-282" href="#ln-282"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">half</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.5d0</span>
-<a id="ln-283" name="ln-283" href="#ln-283"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">one</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d0</span>
-<a id="ln-284" name="ln-284" href="#ln-284"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">two</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">2.0d0</span>
-<a id="ln-285" name="ln-285" href="#ln-285"></a>
-<a id="ln-286" name="ln-286" href="#ln-286"></a><span class="w">    </span><span class="c">! Local Variables</span>
-<a id="ln-287" name="ln-287" href="#ln-287"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">n1</span><span class="p">,</span><span class="w"> </span><span class="n">n2</span>
-<a id="ln-288" name="ln-288" href="#ln-288"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">v1</span><span class="p">,</span><span class="w"> </span><span class="n">v2</span><span class="p">,</span><span class="w"> </span><span class="n">m1</span><span class="p">,</span><span class="w"> </span><span class="n">m2</span><span class="p">,</span><span class="w"> </span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">b</span><span class="p">,</span><span class="w"> </span><span class="n">x</span>
-<a id="ln-289" name="ln-289" href="#ln-289"></a>
-<a id="ln-290" name="ln-290" href="#ln-290"></a><span class="w">    </span><span class="c">! Compute the F-statistic</span>
-<a id="ln-291" name="ln-291" href="#ln-291"></a><span class="w">    </span><span class="n">n1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x1</span><span class="p">)</span>
-<a id="ln-292" name="ln-292" href="#ln-292"></a><span class="w">    </span><span class="n">n2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x2</span><span class="p">)</span>
-<a id="ln-293" name="ln-293" href="#ln-293"></a><span class="w">    </span><span class="n">m1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">mean</span><span class="p">(</span><span class="n">x1</span><span class="p">)</span>
-<a id="ln-294" name="ln-294" href="#ln-294"></a><span class="w">    </span><span class="n">m2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">mean</span><span class="p">(</span><span class="n">x2</span><span class="p">)</span>
-<a id="ln-295" name="ln-295" href="#ln-295"></a><span class="w">    </span><span class="n">v1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">variance</span><span class="p">(</span><span class="n">x1</span><span class="p">)</span>
-<a id="ln-296" name="ln-296" href="#ln-296"></a><span class="w">    </span><span class="n">v2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">variance</span><span class="p">(</span><span class="n">x2</span><span class="p">)</span>
-<a id="ln-297" name="ln-297" href="#ln-297"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">v1</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="n">v2</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-298" name="ln-298" href="#ln-298"></a><span class="k">        </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">v1</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">v2</span>
-<a id="ln-299" name="ln-299" href="#ln-299"></a><span class="w">        </span><span class="n">dof1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">n1</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">one</span>
-<a id="ln-300" name="ln-300" href="#ln-300"></a><span class="w">        </span><span class="n">dof2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">n2</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">one</span>
-<a id="ln-301" name="ln-301" href="#ln-301"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-302" name="ln-302" href="#ln-302"></a><span class="k">        </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">v2</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">v1</span>
-<a id="ln-303" name="ln-303" href="#ln-303"></a><span class="w">        </span><span class="n">dof1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">n2</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">one</span>
-<a id="ln-304" name="ln-304" href="#ln-304"></a><span class="w">        </span><span class="n">dof2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">n1</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">one</span>
-<a id="ln-305" name="ln-305" href="#ln-305"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-306" name="ln-306" href="#ln-306"></a>
-<a id="ln-307" name="ln-307" href="#ln-307"></a><span class="w">    </span><span class="c">! Compute the probability</span>
-<a id="ln-308" name="ln-308" href="#ln-308"></a><span class="w">    </span><span class="n">a</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">half</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">dof2</span>
-<a id="ln-309" name="ln-309" href="#ln-309"></a><span class="w">    </span><span class="n">b</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">half</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">dof1</span>
-<a id="ln-310" name="ln-310" href="#ln-310"></a><span class="w">    </span><span class="n">x</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">dof2</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="p">(</span><span class="n">dof2</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">dof1</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="nb">stat</span><span class="p">)</span>
-<a id="ln-311" name="ln-311" href="#ln-311"></a><span class="w">    </span><span class="n">p</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">two</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">regularized_beta</span><span class="p">(</span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">b</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">)</span>
-<a id="ln-312" name="ln-312" href="#ln-312"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">p</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="n">one</span><span class="p">)</span><span class="w"> </span><span class="n">p</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">two</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">p</span>
-<a id="ln-313" name="ln-313" href="#ln-313"></a><span class="k">end subroutine</span>
-<a id="ln-314" name="ln-314" href="#ln-314"></a>
-<a id="ln-315" name="ln-315" href="#ln-315"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-316" name="ln-316" href="#ln-316"></a><span class="k">end module</span>
+<a id="ln-280" name="ln-280" href="#ln-280"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dof2</span>
+<a id="ln-281" name="ln-281" href="#ln-281"></a><span class="w">        </span><span class="c">!! A measure of the degrees of freedom.</span>
+<a id="ln-282" name="ln-282" href="#ln-282"></a>
+<a id="ln-283" name="ln-283" href="#ln-283"></a><span class="w">    </span><span class="c">! Parameters</span>
+<a id="ln-284" name="ln-284" href="#ln-284"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">one</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d0</span>
+<a id="ln-285" name="ln-285" href="#ln-285"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">two</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">2.0d0</span>
+<a id="ln-286" name="ln-286" href="#ln-286"></a>
+<a id="ln-287" name="ln-287" href="#ln-287"></a><span class="w">    </span><span class="c">! Local Variables</span>
+<a id="ln-288" name="ln-288" href="#ln-288"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">n1</span><span class="p">,</span><span class="w"> </span><span class="n">n2</span>
+<a id="ln-289" name="ln-289" href="#ln-289"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">v1</span><span class="p">,</span><span class="w"> </span><span class="n">v2</span><span class="p">,</span><span class="w"> </span><span class="n">m1</span><span class="p">,</span><span class="w"> </span><span class="n">m2</span>
+<a id="ln-290" name="ln-290" href="#ln-290"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">f_distribution</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dist</span>
+<a id="ln-291" name="ln-291" href="#ln-291"></a>
+<a id="ln-292" name="ln-292" href="#ln-292"></a><span class="w">    </span><span class="c">! Compute the F-statistic</span>
+<a id="ln-293" name="ln-293" href="#ln-293"></a><span class="w">    </span><span class="n">n1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x1</span><span class="p">)</span>
+<a id="ln-294" name="ln-294" href="#ln-294"></a><span class="w">    </span><span class="n">n2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x2</span><span class="p">)</span>
+<a id="ln-295" name="ln-295" href="#ln-295"></a><span class="w">    </span><span class="n">m1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">mean</span><span class="p">(</span><span class="n">x1</span><span class="p">)</span>
+<a id="ln-296" name="ln-296" href="#ln-296"></a><span class="w">    </span><span class="n">m2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">mean</span><span class="p">(</span><span class="n">x2</span><span class="p">)</span>
+<a id="ln-297" name="ln-297" href="#ln-297"></a><span class="w">    </span><span class="n">v1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">variance</span><span class="p">(</span><span class="n">x1</span><span class="p">)</span>
+<a id="ln-298" name="ln-298" href="#ln-298"></a><span class="w">    </span><span class="n">v2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">variance</span><span class="p">(</span><span class="n">x2</span><span class="p">)</span>
+<a id="ln-299" name="ln-299" href="#ln-299"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">v1</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="n">v2</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-300" name="ln-300" href="#ln-300"></a><span class="k">        </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">v1</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">v2</span>
+<a id="ln-301" name="ln-301" href="#ln-301"></a><span class="w">        </span><span class="n">dof1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">n1</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">one</span>
+<a id="ln-302" name="ln-302" href="#ln-302"></a><span class="w">        </span><span class="n">dof2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">n2</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">one</span>
+<a id="ln-303" name="ln-303" href="#ln-303"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-304" name="ln-304" href="#ln-304"></a><span class="k">        </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">v2</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">v1</span>
+<a id="ln-305" name="ln-305" href="#ln-305"></a><span class="w">        </span><span class="n">dof1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">n2</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">one</span>
+<a id="ln-306" name="ln-306" href="#ln-306"></a><span class="w">        </span><span class="n">dof2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">n1</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">one</span>
+<a id="ln-307" name="ln-307" href="#ln-307"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-308" name="ln-308" href="#ln-308"></a>
+<a id="ln-309" name="ln-309" href="#ln-309"></a><span class="k">    </span><span class="n">dist</span><span class="p">%</span><span class="n">d1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">dof1</span>
+<a id="ln-310" name="ln-310" href="#ln-310"></a><span class="w">    </span><span class="n">dist</span><span class="p">%</span><span class="n">d2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">dof2</span>
+<a id="ln-311" name="ln-311" href="#ln-311"></a><span class="w">    </span><span class="n">p</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">two</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="p">(</span><span class="n">one</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">dist</span><span class="p">%</span><span class="n">cdf</span><span class="p">(</span><span class="nb">stat</span><span class="p">))</span>
+<a id="ln-312" name="ln-312" href="#ln-312"></a><span class="k">end subroutine</span>
+<a id="ln-313" name="ln-313" href="#ln-313"></a>
+<a id="ln-314" name="ln-314" href="#ln-314"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-315" name="ln-315" href="#ln-315"></a><span class="k">subroutine </span><span class="n">bartletts_test</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="nb">stat</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">)</span>
+<a id="ln-316" name="ln-316" href="#ln-316"></a><span class="w">    </span><span class="c">!! Computes Bartlett&#39;s test statistic as follows.</span>
+<a id="ln-317" name="ln-317" href="#ln-317"></a><span class="w">    </span><span class="c">!!</span>
+<a id="ln-318" name="ln-318" href="#ln-318"></a><span class="w">    </span><span class="c">!! $$ \chi^{2} = \frac{(N - k) \ln(S_{p}^{2}) \sum_{i = 1}^{k} </span>
+<a id="ln-319" name="ln-319" href="#ln-319"></a><span class="w">    </span><span class="c">!! \left(n_{i} - 1 \right) \ln(S_{i}^{2})}{1 + </span>
+<a id="ln-320" name="ln-320" href="#ln-320"></a><span class="w">    </span><span class="c">!! \frac{1}{3 \left( k - 1 \right)} \left( \sum_{i = 1}^{k} </span>
+<a id="ln-321" name="ln-321" href="#ln-321"></a><span class="w">    </span><span class="c">!! \left( \frac{1}{n_{i} - 1} \right) - \frac{1}{N - k} \right)} $$</span>
+<a id="ln-322" name="ln-322" href="#ln-322"></a><span class="w">    </span><span class="c">!!</span>
+<a id="ln-323" name="ln-323" href="#ln-323"></a><span class="w">    </span><span class="c">!! Where \( N = \sum_{i = 1}^{k} n_{i} \) and \( S_{p}^{2} \) is the pooled</span>
+<a id="ln-324" name="ln-324" href="#ln-324"></a><span class="w">    </span><span class="c">!! variance.</span>
+<a id="ln-325" name="ln-325" href="#ln-325"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">array_container</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">dimension</span><span class="p">(:)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span>
+<a id="ln-326" name="ln-326" href="#ln-326"></a><span class="w">        </span><span class="c">!! The arrays of data to analyze.</span>
+<a id="ln-327" name="ln-327" href="#ln-327"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="nb">stat</span>
+<a id="ln-328" name="ln-328" href="#ln-328"></a><span class="w">        </span><span class="c">!! The Bartlett&#39;s test statistic.</span>
+<a id="ln-329" name="ln-329" href="#ln-329"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">p</span>
+<a id="ln-330" name="ln-330" href="#ln-330"></a><span class="w">        </span><span class="c">!! The probability value that the variances of each data set are</span>
+<a id="ln-331" name="ln-331" href="#ln-331"></a><span class="w">        </span><span class="c">!! equivalent.  A low p-value, less than some significance level,</span>
+<a id="ln-332" name="ln-332" href="#ln-332"></a><span class="w">        </span><span class="c">!! indicates a non-equivalance of variances.</span>
+<a id="ln-333" name="ln-333" href="#ln-333"></a>
+<a id="ln-334" name="ln-334" href="#ln-334"></a><span class="w">    </span><span class="c">! Local Variables</span>
+<a id="ln-335" name="ln-335" href="#ln-335"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">i</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">k</span><span class="p">,</span><span class="w"> </span><span class="n">ni</span>
+<a id="ln-336" name="ln-336" href="#ln-336"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">si</span><span class="p">,</span><span class="w"> </span><span class="n">sp</span><span class="p">,</span><span class="w"> </span><span class="n">numer</span><span class="p">,</span><span class="w"> </span><span class="n">denom</span>
+<a id="ln-337" name="ln-337" href="#ln-337"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">chi_squared_distribution</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dist</span>
+<a id="ln-338" name="ln-338" href="#ln-338"></a>
+<a id="ln-339" name="ln-339" href="#ln-339"></a><span class="w">    </span><span class="c">! Initialization</span>
+<a id="ln-340" name="ln-340" href="#ln-340"></a><span class="w">    </span><span class="n">k</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
+<a id="ln-341" name="ln-341" href="#ln-341"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span>
+<a id="ln-342" name="ln-342" href="#ln-342"></a><span class="w">    </span><span class="k">do </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="n">k</span>
+<a id="ln-343" name="ln-343" href="#ln-343"></a><span class="w">        </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">(</span><span class="n">i</span><span class="p">)%</span><span class="n">x</span><span class="p">)</span>
+<a id="ln-344" name="ln-344" href="#ln-344"></a><span class="w">    </span><span class="k">end do</span>
+<a id="ln-345" name="ln-345" href="#ln-345"></a>
+<a id="ln-346" name="ln-346" href="#ln-346"></a><span class="w">    </span><span class="c">! Compute the statistic</span>
+<a id="ln-347" name="ln-347" href="#ln-347"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span>
+<a id="ln-348" name="ln-348" href="#ln-348"></a><span class="w">    </span><span class="n">sp</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.0d0</span>
+<a id="ln-349" name="ln-349" href="#ln-349"></a><span class="w">    </span><span class="n">numer</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.0d0</span>
+<a id="ln-350" name="ln-350" href="#ln-350"></a><span class="w">    </span><span class="n">denom</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.0d0</span>
+<a id="ln-351" name="ln-351" href="#ln-351"></a><span class="w">    </span><span class="k">do </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="n">k</span>
+<a id="ln-352" name="ln-352" href="#ln-352"></a><span class="w">        </span><span class="n">ni</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">(</span><span class="n">i</span><span class="p">)%</span><span class="n">x</span><span class="p">)</span>
+<a id="ln-353" name="ln-353" href="#ln-353"></a><span class="w">        </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">ni</span>
+<a id="ln-354" name="ln-354" href="#ln-354"></a><span class="w">        </span><span class="n">si</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">variance</span><span class="p">(</span><span class="n">x</span><span class="p">(</span><span class="n">i</span><span class="p">)%</span><span class="n">x</span><span class="p">)</span>
+<a id="ln-355" name="ln-355" href="#ln-355"></a><span class="w">        </span><span class="n">sp</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">sp</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">(</span><span class="n">ni</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mf">1.0d0</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">si</span>
+<a id="ln-356" name="ln-356" href="#ln-356"></a><span class="w">        </span><span class="n">numer</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">numer</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">(</span><span class="n">ni</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mf">1.0d0</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="nb">log</span><span class="p">(</span><span class="n">variance</span><span class="p">(</span><span class="n">x</span><span class="p">(</span><span class="n">i</span><span class="p">)%</span><span class="n">x</span><span class="p">))</span>
+<a id="ln-357" name="ln-357" href="#ln-357"></a><span class="w">        </span><span class="n">denom</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">denom</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mf">1.0d0</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="p">(</span><span class="n">ni</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mf">1.0d0</span><span class="p">)</span>
+<a id="ln-358" name="ln-358" href="#ln-358"></a><span class="w">    </span><span class="k">end do</span>
+<a id="ln-359" name="ln-359" href="#ln-359"></a><span class="k">    </span><span class="n">sp</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">sp</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="kt">real</span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">k</span><span class="p">,</span><span class="w"> </span><span class="n">real64</span><span class="p">)</span>
+<a id="ln-360" name="ln-360" href="#ln-360"></a><span class="w">    </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">((</span><span class="n">n</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">k</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="nb">log</span><span class="p">(</span><span class="n">sp</span><span class="p">)</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">numer</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-361" name="ln-361" href="#ln-361"></a><span class="w">        </span><span class="p">(</span><span class="mf">1.0d0</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">(</span><span class="mf">1.0d0</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="p">(</span><span class="mf">3.0d0</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">k</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mf">3.0d0</span><span class="p">))</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-362" name="ln-362" href="#ln-362"></a><span class="w">        </span><span class="p">(</span><span class="n">denom</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mf">1.0d0</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="kt">real</span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">k</span><span class="p">,</span><span class="w"> </span><span class="n">real64</span><span class="p">)))</span>
+<a id="ln-363" name="ln-363" href="#ln-363"></a>
+<a id="ln-364" name="ln-364" href="#ln-364"></a><span class="w">    </span><span class="c">! Compute the p-value</span>
+<a id="ln-365" name="ln-365" href="#ln-365"></a><span class="w">    </span><span class="n">dist</span><span class="p">%</span><span class="n">dof</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">k</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mi">1</span>
+<a id="ln-366" name="ln-366" href="#ln-366"></a><span class="w">    </span><span class="n">p</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d0</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">dist</span><span class="p">%</span><span class="n">cdf</span><span class="p">(</span><span class="nb">stat</span><span class="p">)</span>
+<a id="ln-367" name="ln-367" href="#ln-367"></a><span class="k">end subroutine</span>
+<a id="ln-368" name="ln-368" href="#ln-368"></a>
+<a id="ln-369" name="ln-369" href="#ln-369"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-370" name="ln-370" href="#ln-370"></a><span class="k">end module</span>
 </pre></div>
 
       </section>
@@ -485,7 +539,7 @@ <h2><span class="anchor" id="src"></span>Source Code</h2>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/sourcefile/fstats_regression.f90.html b/doc/sourcefile/fstats_regression.f90.html
index 9e4e881..023e80c 100644
--- a/doc/sourcefile/fstats_regression.f90.html
+++ b/doc/sourcefile/fstats_regression.f90.html
@@ -74,7 +74,7 @@ <h1>fstats_regression.f90
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title="30.9% of total for source files.">861 statements</a>
+                 title="30.1% of total for source files.">861 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -172,7 +172,7 @@ <h2><span class="anchor" id="src"></span>Source Code</h2>
 <a id="ln-19" name="ln-19" href="#ln-19"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">r_squared</span>
 <a id="ln-20" name="ln-20" href="#ln-20"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">adjusted_r_squared</span>
 <a id="ln-21" name="ln-21" href="#ln-21"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">correlation</span>
-<a id="ln-22" name="ln-22" href="#ln-22"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">coefficient_matrix</span>
+<a id="ln-22" name="ln-22" href="#ln-22"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">design_matrix</span>
 <a id="ln-23" name="ln-23" href="#ln-23"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">covariance_matrix</span>
 <a id="ln-24" name="ln-24" href="#ln-24"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">linear_least_squares</span>
 <a id="ln-25" name="ln-25" href="#ln-25"></a><span class="w">    </span><span class="k">public</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">calculate_regression_statistics</span>
@@ -446,1368 +446,1370 @@ <h2><span class="anchor" id="src"></span>Source Code</h2>
 <a id="ln-293" name="ln-293" href="#ln-293"></a><span class="k">end function</span>
 <a id="ln-294" name="ln-294" href="#ln-294"></a>
 <a id="ln-295" name="ln-295" href="#ln-295"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-296" name="ln-296" href="#ln-296"></a><span class="k">subroutine </span><span class="n">coefficient_matrix</span><span class="p">(</span><span class="n">order</span><span class="p">,</span><span class="w"> </span><span class="n">intercept</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="n">err</span><span class="p">)</span>
-<a id="ln-297" name="ln-297" href="#ln-297"></a><span class="w">    </span><span class="c">!! Computes the coefficient matrix \( X \) to the linear </span>
+<a id="ln-296" name="ln-296" href="#ln-296"></a><span class="k">subroutine </span><span class="n">design_matrix</span><span class="p">(</span><span class="n">order</span><span class="p">,</span><span class="w"> </span><span class="n">intercept</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="n">err</span><span class="p">)</span>
+<a id="ln-297" name="ln-297" href="#ln-297"></a><span class="w">    </span><span class="c">!! Computes the design matrix \( X \) for the linear </span>
 <a id="ln-298" name="ln-298" href="#ln-298"></a><span class="w">    </span><span class="c">!! least-squares regression problem of \( X \beta = y \), where </span>
-<a id="ln-299" name="ln-299" href="#ln-299"></a><span class="w">    </span><span class="c">!! \( X \) is the coefficient matrix computed here, \( \beta \) is </span>
+<a id="ln-299" name="ln-299" href="#ln-299"></a><span class="w">    </span><span class="c">!! \( X \) is the matrix computed here, \( \beta \) is </span>
 <a id="ln-300" name="ln-300" href="#ln-300"></a><span class="w">    </span><span class="c">!! the vector of coefficients to be determined, and \( y \) is the </span>
 <a id="ln-301" name="ln-301" href="#ln-301"></a><span class="w">    </span><span class="c">!! vector of measured dependent variables.</span>
 <a id="ln-302" name="ln-302" href="#ln-302"></a><span class="w">    </span><span class="c">!!</span>
 <a id="ln-303" name="ln-303" href="#ln-303"></a><span class="w">    </span><span class="c">!! See Also</span>
 <a id="ln-304" name="ln-304" href="#ln-304"></a><span class="w">    </span><span class="c">!!</span>
 <a id="ln-305" name="ln-305" href="#ln-305"></a><span class="w">    </span><span class="c">!! - [Wikipedia](https://en.wikipedia.org/wiki/Linear_regression)</span>
-<a id="ln-306" name="ln-306" href="#ln-306"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">order</span>
-<a id="ln-307" name="ln-307" href="#ln-307"></a><span class="w">        </span><span class="c">!! The order of the equation to fit.  This value must be</span>
-<a id="ln-308" name="ln-308" href="#ln-308"></a><span class="w">        </span><span class="c">!! at least one (linear equation), but can be higher as desired.</span>
-<a id="ln-309" name="ln-309" href="#ln-309"></a><span class="w">    </span><span class="kt">logical</span><span class="p">,</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">intercept</span>
-<a id="ln-310" name="ln-310" href="#ln-310"></a><span class="w">        </span><span class="c">!! Set to true if the intercept is being computed</span>
-<a id="ln-311" name="ln-311" href="#ln-311"></a><span class="w">        </span><span class="c">!! as part of the regression; else, false.</span>
-<a id="ln-312" name="ln-312" href="#ln-312"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span><span class="p">(:)</span>
-<a id="ln-313" name="ln-313" href="#ln-313"></a><span class="w">        </span><span class="c">!! An N-element array containing the independent variable</span>
-<a id="ln-314" name="ln-314" href="#ln-314"></a><span class="w">        </span><span class="c">!! measurement points.</span>
-<a id="ln-315" name="ln-315" href="#ln-315"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">c</span><span class="p">(:,:)</span>
-<a id="ln-316" name="ln-316" href="#ln-316"></a><span class="w">        </span><span class="c">!! An N-by-K matrix where the results will be written.  K</span>
-<a id="ln-317" name="ln-317" href="#ln-317"></a><span class="w">        </span><span class="c">!! must equal order + 1 in the event intercept is true; </span>
-<a id="ln-318" name="ln-318" href="#ln-318"></a><span class="w">        </span><span class="c">!! however, if intercept is false, K must equal order.</span>
-<a id="ln-319" name="ln-319" href="#ln-319"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">err</span>
-<a id="ln-320" name="ln-320" href="#ln-320"></a><span class="w">        </span><span class="c">!! A mechanism for communicating errors and warnings to the </span>
-<a id="ln-321" name="ln-321" href="#ln-321"></a><span class="w">        </span><span class="c">!! caller.  Possible warning and error codes are as follows.</span>
-<a id="ln-322" name="ln-322" href="#ln-322"></a><span class="w">        </span><span class="c">!! - FS_NO_ERROR: No errors encountered.</span>
-<a id="ln-323" name="ln-323" href="#ln-323"></a><span class="w">        </span><span class="c">!! - FS_ARRAY_SIZE_ERROR: Occurs if c is not properly sized.</span>
-<a id="ln-324" name="ln-324" href="#ln-324"></a><span class="w">        </span><span class="c">!! - FS_INVALID_INPUT_ERROR: Occurs if order is less than 1.</span>
-<a id="ln-325" name="ln-325" href="#ln-325"></a>
-<a id="ln-326" name="ln-326" href="#ln-326"></a><span class="w">    </span><span class="c">! Parameters</span>
-<a id="ln-327" name="ln-327" href="#ln-327"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">one</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d0</span>
-<a id="ln-328" name="ln-328" href="#ln-328"></a>
-<a id="ln-329" name="ln-329" href="#ln-329"></a><span class="w">    </span><span class="c">! Local Variables</span>
-<a id="ln-330" name="ln-330" href="#ln-330"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">i</span><span class="p">,</span><span class="w"> </span><span class="n">start</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">ncols</span>
-<a id="ln-331" name="ln-331" href="#ln-331"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">errmgr</span>
-<a id="ln-332" name="ln-332" href="#ln-332"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">deferr</span>
-<a id="ln-333" name="ln-333" href="#ln-333"></a><span class="w">    </span>
-<a id="ln-334" name="ln-334" href="#ln-334"></a><span class="w">    </span><span class="c">! Initialization</span>
-<a id="ln-335" name="ln-335" href="#ln-335"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">err</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-336" name="ln-336" href="#ln-336"></a><span class="k">        </span><span class="n">errmgr</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">err</span>
-<a id="ln-337" name="ln-337" href="#ln-337"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-338" name="ln-338" href="#ln-338"></a><span class="k">        </span><span class="n">errmgr</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">deferr</span>
-<a id="ln-339" name="ln-339" href="#ln-339"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-340" name="ln-340" href="#ln-340"></a><span class="k">    </span><span class="n">npts</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
-<a id="ln-341" name="ln-341" href="#ln-341"></a><span class="w">    </span><span class="n">ncols</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">order</span>
-<a id="ln-342" name="ln-342" href="#ln-342"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">intercept</span><span class="p">)</span><span class="w"> </span><span class="n">ncols</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">ncols</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span>
-<a id="ln-343" name="ln-343" href="#ln-343"></a>
-<a id="ln-344" name="ln-344" href="#ln-344"></a><span class="w">    </span><span class="c">! Input Check</span>
-<a id="ln-345" name="ln-345" href="#ln-345"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">order</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-346" name="ln-346" href="#ln-346"></a><span class="k">        call </span><span class="n">errmgr</span><span class="p">%</span><span class="n">report_error</span><span class="p">(</span><span class="s2">&quot;coefficient_matrix&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-347" name="ln-347" href="#ln-347"></a><span class="w">            </span><span class="s2">&quot;The model order must be at least one.&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">FS_INVALID_INPUT_ERROR</span><span class="p">)</span>
-<a id="ln-348" name="ln-348" href="#ln-348"></a><span class="w">        </span><span class="k">return</span>
-<a id="ln-349" name="ln-349" href="#ln-349"></a><span class="k">    end if</span>
-<a id="ln-350" name="ln-350" href="#ln-350"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">npts</span><span class="w"> </span><span class="p">.</span><span class="nb">or</span><span class="p">.</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">ncols</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-351" name="ln-351" href="#ln-351"></a><span class="k">        call </span><span class="n">report_matrix_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;coefficient_matrix&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-352" name="ln-352" href="#ln-352"></a><span class="w">            </span><span class="s2">&quot;c&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">ncols</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="mi">1</span><span class="p">),</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">))</span>
-<a id="ln-353" name="ln-353" href="#ln-353"></a><span class="w">        </span><span class="k">return</span>
-<a id="ln-354" name="ln-354" href="#ln-354"></a><span class="k">    end if</span>
-<a id="ln-355" name="ln-355" href="#ln-355"></a>
-<a id="ln-356" name="ln-356" href="#ln-356"></a><span class="w">    </span><span class="c">! Process</span>
-<a id="ln-357" name="ln-357" href="#ln-357"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">intercept</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-358" name="ln-358" href="#ln-358"></a><span class="k">        </span><span class="n">c</span><span class="p">(:,</span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">one</span>
-<a id="ln-359" name="ln-359" href="#ln-359"></a><span class="w">        </span><span class="n">c</span><span class="p">(:,</span><span class="mi">2</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span>
-<a id="ln-360" name="ln-360" href="#ln-360"></a><span class="w">        </span><span class="n">start</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">3</span>
-<a id="ln-361" name="ln-361" href="#ln-361"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-362" name="ln-362" href="#ln-362"></a><span class="k">        </span><span class="n">c</span><span class="p">(:,</span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span>
-<a id="ln-363" name="ln-363" href="#ln-363"></a><span class="w">        </span><span class="n">start</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">2</span>
-<a id="ln-364" name="ln-364" href="#ln-364"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-365" name="ln-365" href="#ln-365"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="n">start</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="n">ncols</span><span class="p">)</span><span class="w"> </span><span class="k">return</span>
-<a id="ln-366" name="ln-366" href="#ln-366"></a><span class="k">    do </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">start</span><span class="p">,</span><span class="w"> </span><span class="n">ncols</span>
-<a id="ln-367" name="ln-367" href="#ln-367"></a><span class="w">        </span><span class="n">c</span><span class="p">(:,</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">c</span><span class="p">(:,</span><span class="n">i</span><span class="o">-</span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">x</span>
-<a id="ln-368" name="ln-368" href="#ln-368"></a><span class="w">    </span><span class="k">end do</span>
-<a id="ln-369" name="ln-369" href="#ln-369"></a><span class="k">end subroutine</span>
-<a id="ln-370" name="ln-370" href="#ln-370"></a>
-<a id="ln-371" name="ln-371" href="#ln-371"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-372" name="ln-372" href="#ln-372"></a><span class="k">subroutine </span><span class="n">covariance_matrix</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="n">err</span><span class="p">)</span>
-<a id="ln-373" name="ln-373" href="#ln-373"></a><span class="w">    </span><span class="c">!! Computes the covariance matrix \( C \) where </span>
-<a id="ln-374" name="ln-374" href="#ln-374"></a><span class="w">    </span><span class="c">!! \( C = \left( X^{T} X \right)^{-1} \) and \( X \) is computed</span>
-<a id="ln-375" name="ln-375" href="#ln-375"></a><span class="w">    </span><span class="c">!! by coefficient_matrix.</span>
-<a id="ln-376" name="ln-376" href="#ln-376"></a><span class="w">    </span><span class="c">!!</span>
-<a id="ln-377" name="ln-377" href="#ln-377"></a><span class="w">    </span><span class="c">!! See Also</span>
+<a id="ln-306" name="ln-306" href="#ln-306"></a><span class="w">    </span><span class="c">!! - [Wikipedia](https://en.wikipedia.org/wiki/Vandermonde_matrix)</span>
+<a id="ln-307" name="ln-307" href="#ln-307"></a><span class="w">    </span><span class="c">!! - [Wikipedia](https://en.wikipedia.org/wiki/Design_matrix)</span>
+<a id="ln-308" name="ln-308" href="#ln-308"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">order</span>
+<a id="ln-309" name="ln-309" href="#ln-309"></a><span class="w">        </span><span class="c">!! The order of the equation to fit.  This value must be</span>
+<a id="ln-310" name="ln-310" href="#ln-310"></a><span class="w">        </span><span class="c">!! at least one (linear equation), but can be higher as desired.</span>
+<a id="ln-311" name="ln-311" href="#ln-311"></a><span class="w">    </span><span class="kt">logical</span><span class="p">,</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">intercept</span>
+<a id="ln-312" name="ln-312" href="#ln-312"></a><span class="w">        </span><span class="c">!! Set to true if the intercept is being computed</span>
+<a id="ln-313" name="ln-313" href="#ln-313"></a><span class="w">        </span><span class="c">!! as part of the regression; else, false.</span>
+<a id="ln-314" name="ln-314" href="#ln-314"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span><span class="p">(:)</span>
+<a id="ln-315" name="ln-315" href="#ln-315"></a><span class="w">        </span><span class="c">!! An N-element array containing the independent variable</span>
+<a id="ln-316" name="ln-316" href="#ln-316"></a><span class="w">        </span><span class="c">!! measurement points.</span>
+<a id="ln-317" name="ln-317" href="#ln-317"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">c</span><span class="p">(:,:)</span>
+<a id="ln-318" name="ln-318" href="#ln-318"></a><span class="w">        </span><span class="c">!! An N-by-K matrix where the results will be written.  K</span>
+<a id="ln-319" name="ln-319" href="#ln-319"></a><span class="w">        </span><span class="c">!! must equal order + 1 in the event intercept is true; </span>
+<a id="ln-320" name="ln-320" href="#ln-320"></a><span class="w">        </span><span class="c">!! however, if intercept is false, K must equal order.</span>
+<a id="ln-321" name="ln-321" href="#ln-321"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">err</span>
+<a id="ln-322" name="ln-322" href="#ln-322"></a><span class="w">        </span><span class="c">!! A mechanism for communicating errors and warnings to the </span>
+<a id="ln-323" name="ln-323" href="#ln-323"></a><span class="w">        </span><span class="c">!! caller.  Possible warning and error codes are as follows.</span>
+<a id="ln-324" name="ln-324" href="#ln-324"></a><span class="w">        </span><span class="c">!! - FS_NO_ERROR: No errors encountered.</span>
+<a id="ln-325" name="ln-325" href="#ln-325"></a><span class="w">        </span><span class="c">!! - FS_ARRAY_SIZE_ERROR: Occurs if c is not properly sized.</span>
+<a id="ln-326" name="ln-326" href="#ln-326"></a><span class="w">        </span><span class="c">!! - FS_INVALID_INPUT_ERROR: Occurs if order is less than 1.</span>
+<a id="ln-327" name="ln-327" href="#ln-327"></a>
+<a id="ln-328" name="ln-328" href="#ln-328"></a><span class="w">    </span><span class="c">! Parameters</span>
+<a id="ln-329" name="ln-329" href="#ln-329"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">one</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d0</span>
+<a id="ln-330" name="ln-330" href="#ln-330"></a>
+<a id="ln-331" name="ln-331" href="#ln-331"></a><span class="w">    </span><span class="c">! Local Variables</span>
+<a id="ln-332" name="ln-332" href="#ln-332"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">i</span><span class="p">,</span><span class="w"> </span><span class="n">start</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">ncols</span>
+<a id="ln-333" name="ln-333" href="#ln-333"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">errmgr</span>
+<a id="ln-334" name="ln-334" href="#ln-334"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">deferr</span>
+<a id="ln-335" name="ln-335" href="#ln-335"></a><span class="w">    </span>
+<a id="ln-336" name="ln-336" href="#ln-336"></a><span class="w">    </span><span class="c">! Initialization</span>
+<a id="ln-337" name="ln-337" href="#ln-337"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">err</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-338" name="ln-338" href="#ln-338"></a><span class="k">        </span><span class="n">errmgr</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">err</span>
+<a id="ln-339" name="ln-339" href="#ln-339"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-340" name="ln-340" href="#ln-340"></a><span class="k">        </span><span class="n">errmgr</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">deferr</span>
+<a id="ln-341" name="ln-341" href="#ln-341"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-342" name="ln-342" href="#ln-342"></a><span class="k">    </span><span class="n">npts</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
+<a id="ln-343" name="ln-343" href="#ln-343"></a><span class="w">    </span><span class="n">ncols</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">order</span>
+<a id="ln-344" name="ln-344" href="#ln-344"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">intercept</span><span class="p">)</span><span class="w"> </span><span class="n">ncols</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">ncols</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span>
+<a id="ln-345" name="ln-345" href="#ln-345"></a>
+<a id="ln-346" name="ln-346" href="#ln-346"></a><span class="w">    </span><span class="c">! Input Check</span>
+<a id="ln-347" name="ln-347" href="#ln-347"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">order</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-348" name="ln-348" href="#ln-348"></a><span class="k">        call </span><span class="n">errmgr</span><span class="p">%</span><span class="n">report_error</span><span class="p">(</span><span class="s2">&quot;design_matrix&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-349" name="ln-349" href="#ln-349"></a><span class="w">            </span><span class="s2">&quot;The model order must be at least one.&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">FS_INVALID_INPUT_ERROR</span><span class="p">)</span>
+<a id="ln-350" name="ln-350" href="#ln-350"></a><span class="w">        </span><span class="k">return</span>
+<a id="ln-351" name="ln-351" href="#ln-351"></a><span class="k">    end if</span>
+<a id="ln-352" name="ln-352" href="#ln-352"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">npts</span><span class="w"> </span><span class="p">.</span><span class="nb">or</span><span class="p">.</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">ncols</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-353" name="ln-353" href="#ln-353"></a><span class="k">        call </span><span class="n">report_matrix_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;design_matrix&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-354" name="ln-354" href="#ln-354"></a><span class="w">            </span><span class="s2">&quot;c&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">ncols</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="mi">1</span><span class="p">),</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">))</span>
+<a id="ln-355" name="ln-355" href="#ln-355"></a><span class="w">        </span><span class="k">return</span>
+<a id="ln-356" name="ln-356" href="#ln-356"></a><span class="k">    end if</span>
+<a id="ln-357" name="ln-357" href="#ln-357"></a>
+<a id="ln-358" name="ln-358" href="#ln-358"></a><span class="w">    </span><span class="c">! Process</span>
+<a id="ln-359" name="ln-359" href="#ln-359"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">intercept</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-360" name="ln-360" href="#ln-360"></a><span class="k">        </span><span class="n">c</span><span class="p">(:,</span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">one</span>
+<a id="ln-361" name="ln-361" href="#ln-361"></a><span class="w">        </span><span class="n">c</span><span class="p">(:,</span><span class="mi">2</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span>
+<a id="ln-362" name="ln-362" href="#ln-362"></a><span class="w">        </span><span class="n">start</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">3</span>
+<a id="ln-363" name="ln-363" href="#ln-363"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-364" name="ln-364" href="#ln-364"></a><span class="k">        </span><span class="n">c</span><span class="p">(:,</span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span>
+<a id="ln-365" name="ln-365" href="#ln-365"></a><span class="w">        </span><span class="n">start</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">2</span>
+<a id="ln-366" name="ln-366" href="#ln-366"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-367" name="ln-367" href="#ln-367"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="n">start</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="n">ncols</span><span class="p">)</span><span class="w"> </span><span class="k">return</span>
+<a id="ln-368" name="ln-368" href="#ln-368"></a><span class="k">    do </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">start</span><span class="p">,</span><span class="w"> </span><span class="n">ncols</span>
+<a id="ln-369" name="ln-369" href="#ln-369"></a><span class="w">        </span><span class="n">c</span><span class="p">(:,</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">c</span><span class="p">(:,</span><span class="n">i</span><span class="o">-</span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">x</span>
+<a id="ln-370" name="ln-370" href="#ln-370"></a><span class="w">    </span><span class="k">end do</span>
+<a id="ln-371" name="ln-371" href="#ln-371"></a><span class="k">end subroutine</span>
+<a id="ln-372" name="ln-372" href="#ln-372"></a>
+<a id="ln-373" name="ln-373" href="#ln-373"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-374" name="ln-374" href="#ln-374"></a><span class="k">subroutine </span><span class="n">covariance_matrix</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="n">err</span><span class="p">)</span>
+<a id="ln-375" name="ln-375" href="#ln-375"></a><span class="w">    </span><span class="c">!! Computes the covariance matrix \( C \) where </span>
+<a id="ln-376" name="ln-376" href="#ln-376"></a><span class="w">    </span><span class="c">!! \( C = \left( X^{T} X \right)^{-1} \) and \( X \) is computed</span>
+<a id="ln-377" name="ln-377" href="#ln-377"></a><span class="w">    </span><span class="c">!! by design_matrix.</span>
 <a id="ln-378" name="ln-378" href="#ln-378"></a><span class="w">    </span><span class="c">!!</span>
-<a id="ln-379" name="ln-379" href="#ln-379"></a><span class="w">    </span><span class="c">!! - [Wikipedia](https://en.wikipedia.org/wiki/Covariance_matrix)</span>
-<a id="ln-380" name="ln-380" href="#ln-380"></a><span class="w">    </span><span class="c">!! - [Wikipedia - Regression](https://en.wikipedia.org/wiki/Linear_regression)</span>
-<a id="ln-381" name="ln-381" href="#ln-381"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span><span class="p">(:,:)</span>
-<a id="ln-382" name="ln-382" href="#ln-382"></a><span class="w">        </span><span class="c">!! An M-by-N matrix containing the formatted independent data</span>
-<a id="ln-383" name="ln-383" href="#ln-383"></a><span class="w">        </span><span class="c">!!  matrix \( X \) as computed by coefficient_matrix.</span>
-<a id="ln-384" name="ln-384" href="#ln-384"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">c</span><span class="p">(:,:)</span>
-<a id="ln-385" name="ln-385" href="#ln-385"></a><span class="w">        </span><span class="c">!! The N-by-N covariance matrix.</span>
-<a id="ln-386" name="ln-386" href="#ln-386"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">err</span>
-<a id="ln-387" name="ln-387" href="#ln-387"></a><span class="w">        </span><span class="c">!! A mechanism for communicating errors and warnings to the </span>
-<a id="ln-388" name="ln-388" href="#ln-388"></a><span class="w">        </span><span class="c">!! caller.  Possible warning and error codes are as follows.</span>
-<a id="ln-389" name="ln-389" href="#ln-389"></a><span class="w">        </span><span class="c">!! - FS_NO_ERROR: No errors encountered.</span>
-<a id="ln-390" name="ln-390" href="#ln-390"></a><span class="w">        </span><span class="c">!! - FS_ARRAY_SIZE_ERROR: Occurs if any of the matrices are not </span>
-<a id="ln-391" name="ln-391" href="#ln-391"></a><span class="w">        </span><span class="c">!!      sized correctly.</span>
-<a id="ln-392" name="ln-392" href="#ln-392"></a><span class="w">        </span><span class="c">!! - FS_MEMORY_ERROR: Occurs if there is a memory allocation </span>
-<a id="ln-393" name="ln-393" href="#ln-393"></a><span class="w">        </span><span class="c">!!      error.</span>
-<a id="ln-394" name="ln-394" href="#ln-394"></a>
-<a id="ln-395" name="ln-395" href="#ln-395"></a><span class="w">    </span><span class="c">! Parameters</span>
-<a id="ln-396" name="ln-396" href="#ln-396"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">zero</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.0d0</span>
-<a id="ln-397" name="ln-397" href="#ln-397"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">one</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d0</span>
-<a id="ln-398" name="ln-398" href="#ln-398"></a>
-<a id="ln-399" name="ln-399" href="#ln-399"></a><span class="w">    </span><span class="c">! Local Variables</span>
-<a id="ln-400" name="ln-400" href="#ln-400"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">errmgr</span>
-<a id="ln-401" name="ln-401" href="#ln-401"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">deferr</span>
-<a id="ln-402" name="ln-402" href="#ln-402"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">ncoeffs</span><span class="p">,</span><span class="w"> </span><span class="n">flag</span>
-<a id="ln-403" name="ln-403" href="#ln-403"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">allocatable</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">xtx</span><span class="p">(:,:)</span>
-<a id="ln-404" name="ln-404" href="#ln-404"></a><span class="w">    </span>
-<a id="ln-405" name="ln-405" href="#ln-405"></a><span class="w">    </span><span class="c">! Initialization</span>
-<a id="ln-406" name="ln-406" href="#ln-406"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">err</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-407" name="ln-407" href="#ln-407"></a><span class="k">        </span><span class="n">errmgr</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">err</span>
-<a id="ln-408" name="ln-408" href="#ln-408"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-409" name="ln-409" href="#ln-409"></a><span class="k">        </span><span class="n">errmgr</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">deferr</span>
-<a id="ln-410" name="ln-410" href="#ln-410"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-411" name="ln-411" href="#ln-411"></a><span class="k">    </span><span class="n">npts</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
-<a id="ln-412" name="ln-412" href="#ln-412"></a><span class="w">    </span><span class="n">ncoeffs</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">)</span>
-<a id="ln-413" name="ln-413" href="#ln-413"></a>
-<a id="ln-414" name="ln-414" href="#ln-414"></a><span class="w">    </span><span class="c">! Input Checking</span>
-<a id="ln-415" name="ln-415" href="#ln-415"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">ncoeffs</span><span class="w"> </span><span class="p">.</span><span class="nb">or</span><span class="p">.</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">ncoeffs</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-416" name="ln-416" href="#ln-416"></a><span class="k">        call </span><span class="n">report_matrix_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;covariance_matrix&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-417" name="ln-417" href="#ln-417"></a><span class="w">            </span><span class="s2">&quot;c&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">ncoeffs</span><span class="p">,</span><span class="w"> </span><span class="n">ncoeffs</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="mi">1</span><span class="p">),</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">))</span>
-<a id="ln-418" name="ln-418" href="#ln-418"></a><span class="w">        </span><span class="k">return</span>
-<a id="ln-419" name="ln-419" href="#ln-419"></a><span class="k">    end if</span>
-<a id="ln-420" name="ln-420" href="#ln-420"></a>
-<a id="ln-421" name="ln-421" href="#ln-421"></a><span class="w">    </span><span class="c">! Local Memory Allocation</span>
-<a id="ln-422" name="ln-422" href="#ln-422"></a><span class="w">    </span><span class="k">allocate</span><span class="p">(</span><span class="n">xtx</span><span class="p">(</span><span class="n">ncoeffs</span><span class="p">,</span><span class="w"> </span><span class="n">ncoeffs</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
-<a id="ln-423" name="ln-423" href="#ln-423"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-424" name="ln-424" href="#ln-424"></a><span class="k">        call </span><span class="n">report_memory_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;covariance_matrix&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
-<a id="ln-425" name="ln-425" href="#ln-425"></a><span class="w">        </span><span class="k">return</span>
-<a id="ln-426" name="ln-426" href="#ln-426"></a><span class="k">    end if</span>
-<a id="ln-427" name="ln-427" href="#ln-427"></a>
-<a id="ln-428" name="ln-428" href="#ln-428"></a><span class="w">    </span><span class="c">! Compute X**T * X</span>
-<a id="ln-429" name="ln-429" href="#ln-429"></a><span class="w">    </span><span class="k">call </span><span class="n">DGEMM</span><span class="p">(</span><span class="s2">&quot;T&quot;</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;N&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">ncoeffs</span><span class="p">,</span><span class="w"> </span><span class="n">ncoeffs</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">one</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-430" name="ln-430" href="#ln-430"></a><span class="w">        </span><span class="n">zero</span><span class="p">,</span><span class="w"> </span><span class="n">xtx</span><span class="p">,</span><span class="w"> </span><span class="n">ncoeffs</span><span class="p">)</span>
-<a id="ln-431" name="ln-431" href="#ln-431"></a><span class="w">    </span>
-<a id="ln-432" name="ln-432" href="#ln-432"></a><span class="w">    </span><span class="c">! Compute the inverse of X**T * X to obtain the covariance matrix</span>
-<a id="ln-433" name="ln-433" href="#ln-433"></a><span class="w">    </span><span class="k">call </span><span class="n">mtx_pinverse</span><span class="p">(</span><span class="n">xtx</span><span class="p">,</span><span class="w"> </span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="n">err</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">errmgr</span><span class="p">)</span>
-<a id="ln-434" name="ln-434" href="#ln-434"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">errmgr</span><span class="p">%</span><span class="n">has_error_occurred</span><span class="p">())</span><span class="w"> </span><span class="k">return</span>
-<a id="ln-435" name="ln-435" href="#ln-435"></a><span class="k">end subroutine</span>
-<a id="ln-436" name="ln-436" href="#ln-436"></a>
-<a id="ln-437" name="ln-437" href="#ln-437"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-438" name="ln-438" href="#ln-438"></a><span class="k">subroutine </span><span class="n">linear_least_squares</span><span class="p">(</span><span class="n">order</span><span class="p">,</span><span class="w"> </span><span class="n">intercept</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="n">coeffs</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-439" name="ln-439" href="#ln-439"></a><span class="w">    </span><span class="n">ymod</span><span class="p">,</span><span class="w"> </span><span class="n">resid</span><span class="p">,</span><span class="w"> </span><span class="n">stats</span><span class="p">,</span><span class="w"> </span><span class="n">alpha</span><span class="p">,</span><span class="w"> </span><span class="n">err</span><span class="p">)</span>
-<a id="ln-440" name="ln-440" href="#ln-440"></a><span class="w">    </span><span class="c">!! Computes a linear least-squares regression to fit a set of data.</span>
-<a id="ln-441" name="ln-441" href="#ln-441"></a><span class="w">    </span><span class="c">!!</span>
-<a id="ln-442" name="ln-442" href="#ln-442"></a><span class="w">    </span><span class="c">!! See Also</span>
+<a id="ln-379" name="ln-379" href="#ln-379"></a><span class="w">    </span><span class="c">!! See Also</span>
+<a id="ln-380" name="ln-380" href="#ln-380"></a><span class="w">    </span><span class="c">!!</span>
+<a id="ln-381" name="ln-381" href="#ln-381"></a><span class="w">    </span><span class="c">!! - [Wikipedia](https://en.wikipedia.org/wiki/Covariance_matrix)</span>
+<a id="ln-382" name="ln-382" href="#ln-382"></a><span class="w">    </span><span class="c">!! - [Wikipedia - Regression](https://en.wikipedia.org/wiki/Linear_regression)</span>
+<a id="ln-383" name="ln-383" href="#ln-383"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span><span class="p">(:,:)</span>
+<a id="ln-384" name="ln-384" href="#ln-384"></a><span class="w">        </span><span class="c">!! An M-by-N matrix containing the formatted independent data</span>
+<a id="ln-385" name="ln-385" href="#ln-385"></a><span class="w">        </span><span class="c">!!  matrix \( X \) as computed by design_matrix.</span>
+<a id="ln-386" name="ln-386" href="#ln-386"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">c</span><span class="p">(:,:)</span>
+<a id="ln-387" name="ln-387" href="#ln-387"></a><span class="w">        </span><span class="c">!! The N-by-N covariance matrix.</span>
+<a id="ln-388" name="ln-388" href="#ln-388"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">err</span>
+<a id="ln-389" name="ln-389" href="#ln-389"></a><span class="w">        </span><span class="c">!! A mechanism for communicating errors and warnings to the </span>
+<a id="ln-390" name="ln-390" href="#ln-390"></a><span class="w">        </span><span class="c">!! caller.  Possible warning and error codes are as follows.</span>
+<a id="ln-391" name="ln-391" href="#ln-391"></a><span class="w">        </span><span class="c">!! - FS_NO_ERROR: No errors encountered.</span>
+<a id="ln-392" name="ln-392" href="#ln-392"></a><span class="w">        </span><span class="c">!! - FS_ARRAY_SIZE_ERROR: Occurs if any of the matrices are not </span>
+<a id="ln-393" name="ln-393" href="#ln-393"></a><span class="w">        </span><span class="c">!!      sized correctly.</span>
+<a id="ln-394" name="ln-394" href="#ln-394"></a><span class="w">        </span><span class="c">!! - FS_MEMORY_ERROR: Occurs if there is a memory allocation </span>
+<a id="ln-395" name="ln-395" href="#ln-395"></a><span class="w">        </span><span class="c">!!      error.</span>
+<a id="ln-396" name="ln-396" href="#ln-396"></a>
+<a id="ln-397" name="ln-397" href="#ln-397"></a><span class="w">    </span><span class="c">! Parameters</span>
+<a id="ln-398" name="ln-398" href="#ln-398"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">zero</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.0d0</span>
+<a id="ln-399" name="ln-399" href="#ln-399"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">one</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d0</span>
+<a id="ln-400" name="ln-400" href="#ln-400"></a>
+<a id="ln-401" name="ln-401" href="#ln-401"></a><span class="w">    </span><span class="c">! Local Variables</span>
+<a id="ln-402" name="ln-402" href="#ln-402"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">errmgr</span>
+<a id="ln-403" name="ln-403" href="#ln-403"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">deferr</span>
+<a id="ln-404" name="ln-404" href="#ln-404"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">ncoeffs</span><span class="p">,</span><span class="w"> </span><span class="n">flag</span>
+<a id="ln-405" name="ln-405" href="#ln-405"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">allocatable</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">xtx</span><span class="p">(:,:)</span>
+<a id="ln-406" name="ln-406" href="#ln-406"></a><span class="w">    </span>
+<a id="ln-407" name="ln-407" href="#ln-407"></a><span class="w">    </span><span class="c">! Initialization</span>
+<a id="ln-408" name="ln-408" href="#ln-408"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">err</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-409" name="ln-409" href="#ln-409"></a><span class="k">        </span><span class="n">errmgr</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">err</span>
+<a id="ln-410" name="ln-410" href="#ln-410"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-411" name="ln-411" href="#ln-411"></a><span class="k">        </span><span class="n">errmgr</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">deferr</span>
+<a id="ln-412" name="ln-412" href="#ln-412"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-413" name="ln-413" href="#ln-413"></a><span class="k">    </span><span class="n">npts</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
+<a id="ln-414" name="ln-414" href="#ln-414"></a><span class="w">    </span><span class="n">ncoeffs</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">)</span>
+<a id="ln-415" name="ln-415" href="#ln-415"></a>
+<a id="ln-416" name="ln-416" href="#ln-416"></a><span class="w">    </span><span class="c">! Input Checking</span>
+<a id="ln-417" name="ln-417" href="#ln-417"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">ncoeffs</span><span class="w"> </span><span class="p">.</span><span class="nb">or</span><span class="p">.</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">ncoeffs</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-418" name="ln-418" href="#ln-418"></a><span class="k">        call </span><span class="n">report_matrix_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;covariance_matrix&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-419" name="ln-419" href="#ln-419"></a><span class="w">            </span><span class="s2">&quot;c&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">ncoeffs</span><span class="p">,</span><span class="w"> </span><span class="n">ncoeffs</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="mi">1</span><span class="p">),</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">))</span>
+<a id="ln-420" name="ln-420" href="#ln-420"></a><span class="w">        </span><span class="k">return</span>
+<a id="ln-421" name="ln-421" href="#ln-421"></a><span class="k">    end if</span>
+<a id="ln-422" name="ln-422" href="#ln-422"></a>
+<a id="ln-423" name="ln-423" href="#ln-423"></a><span class="w">    </span><span class="c">! Local Memory Allocation</span>
+<a id="ln-424" name="ln-424" href="#ln-424"></a><span class="w">    </span><span class="k">allocate</span><span class="p">(</span><span class="n">xtx</span><span class="p">(</span><span class="n">ncoeffs</span><span class="p">,</span><span class="w"> </span><span class="n">ncoeffs</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
+<a id="ln-425" name="ln-425" href="#ln-425"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-426" name="ln-426" href="#ln-426"></a><span class="k">        call </span><span class="n">report_memory_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;covariance_matrix&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
+<a id="ln-427" name="ln-427" href="#ln-427"></a><span class="w">        </span><span class="k">return</span>
+<a id="ln-428" name="ln-428" href="#ln-428"></a><span class="k">    end if</span>
+<a id="ln-429" name="ln-429" href="#ln-429"></a>
+<a id="ln-430" name="ln-430" href="#ln-430"></a><span class="w">    </span><span class="c">! Compute X**T * X</span>
+<a id="ln-431" name="ln-431" href="#ln-431"></a><span class="w">    </span><span class="k">call </span><span class="n">DGEMM</span><span class="p">(</span><span class="s2">&quot;T&quot;</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;N&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">ncoeffs</span><span class="p">,</span><span class="w"> </span><span class="n">ncoeffs</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">one</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-432" name="ln-432" href="#ln-432"></a><span class="w">        </span><span class="n">zero</span><span class="p">,</span><span class="w"> </span><span class="n">xtx</span><span class="p">,</span><span class="w"> </span><span class="n">ncoeffs</span><span class="p">)</span>
+<a id="ln-433" name="ln-433" href="#ln-433"></a><span class="w">    </span>
+<a id="ln-434" name="ln-434" href="#ln-434"></a><span class="w">    </span><span class="c">! Compute the inverse of X**T * X to obtain the covariance matrix</span>
+<a id="ln-435" name="ln-435" href="#ln-435"></a><span class="w">    </span><span class="k">call </span><span class="n">mtx_pinverse</span><span class="p">(</span><span class="n">xtx</span><span class="p">,</span><span class="w"> </span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="n">err</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">errmgr</span><span class="p">)</span>
+<a id="ln-436" name="ln-436" href="#ln-436"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">errmgr</span><span class="p">%</span><span class="n">has_error_occurred</span><span class="p">())</span><span class="w"> </span><span class="k">return</span>
+<a id="ln-437" name="ln-437" href="#ln-437"></a><span class="k">end subroutine</span>
+<a id="ln-438" name="ln-438" href="#ln-438"></a>
+<a id="ln-439" name="ln-439" href="#ln-439"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-440" name="ln-440" href="#ln-440"></a><span class="k">subroutine </span><span class="n">linear_least_squares</span><span class="p">(</span><span class="n">order</span><span class="p">,</span><span class="w"> </span><span class="n">intercept</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="n">coeffs</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-441" name="ln-441" href="#ln-441"></a><span class="w">    </span><span class="n">ymod</span><span class="p">,</span><span class="w"> </span><span class="n">resid</span><span class="p">,</span><span class="w"> </span><span class="n">stats</span><span class="p">,</span><span class="w"> </span><span class="n">alpha</span><span class="p">,</span><span class="w"> </span><span class="n">err</span><span class="p">)</span>
+<a id="ln-442" name="ln-442" href="#ln-442"></a><span class="w">    </span><span class="c">!! Computes a linear least-squares regression to fit a set of data.</span>
 <a id="ln-443" name="ln-443" href="#ln-443"></a><span class="w">    </span><span class="c">!!</span>
-<a id="ln-444" name="ln-444" href="#ln-444"></a><span class="w">    </span><span class="c">!! - [Wikipedia](https://en.wikipedia.org/wiki/Linear_regression)</span>
-<a id="ln-445" name="ln-445" href="#ln-445"></a><span class="w">    </span><span class="c">!! - [SPC Excel Understanding Regression Statistics](https://www.spcforexcel.com/knowledge/root-cause-analysis/understanding-regression-statistics-part-1)</span>
-<a id="ln-446" name="ln-446" href="#ln-446"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">order</span>
-<a id="ln-447" name="ln-447" href="#ln-447"></a><span class="w">        </span><span class="c">!! The order of the equation to fit.  This value must be at </span>
-<a id="ln-448" name="ln-448" href="#ln-448"></a><span class="w">        </span><span class="c">!! least one (linear equation), but can be higher as desired, </span>
-<a id="ln-449" name="ln-449" href="#ln-449"></a><span class="w">        </span><span class="c">!! as long as there is sufficient data.</span>
-<a id="ln-450" name="ln-450" href="#ln-450"></a><span class="w">    </span><span class="kt">logical</span><span class="p">,</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">intercept</span>
-<a id="ln-451" name="ln-451" href="#ln-451"></a><span class="w">        </span><span class="c">!! Set to true if the intercept is being computed as part of </span>
-<a id="ln-452" name="ln-452" href="#ln-452"></a><span class="w">        </span><span class="c">!! the regression; else, false.</span>
-<a id="ln-453" name="ln-453" href="#ln-453"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span><span class="p">(:)</span>
-<a id="ln-454" name="ln-454" href="#ln-454"></a><span class="w">        </span><span class="c">!! An N-element array containing the independent variable</span>
-<a id="ln-455" name="ln-455" href="#ln-455"></a><span class="w">        </span><span class="c">!! measurement points.</span>
-<a id="ln-456" name="ln-456" href="#ln-456"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">y</span><span class="p">(:)</span>
-<a id="ln-457" name="ln-457" href="#ln-457"></a><span class="w">        </span><span class="c">!! An N-element array containing the dependent variable</span>
-<a id="ln-458" name="ln-458" href="#ln-458"></a><span class="w">        </span><span class="c">!! measurement points.</span>
-<a id="ln-459" name="ln-459" href="#ln-459"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">coeffs</span><span class="p">(:)</span>
-<a id="ln-460" name="ln-460" href="#ln-460"></a><span class="w">        </span><span class="c">!! An ORDER+1 element array where the coefficients will be written.</span>
-<a id="ln-461" name="ln-461" href="#ln-461"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">ymod</span><span class="p">(:)</span>
-<a id="ln-462" name="ln-462" href="#ln-462"></a><span class="w">        </span><span class="c">!! An N-element array where the modeled data will be written.</span>
-<a id="ln-463" name="ln-463" href="#ln-463"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">resid</span><span class="p">(:)</span>
-<a id="ln-464" name="ln-464" href="#ln-464"></a><span class="w">        </span><span class="c">!! An N-element array where the residual error data will be </span>
-<a id="ln-465" name="ln-465" href="#ln-465"></a><span class="w">        </span><span class="c">!! written (modeled - actual).</span>
-<a id="ln-466" name="ln-466" href="#ln-466"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">regression_statistics</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">stats</span><span class="p">(:)</span>
-<a id="ln-467" name="ln-467" href="#ln-467"></a><span class="w">        </span><span class="c">!! An M-element array of regression_statistics items where </span>
-<a id="ln-468" name="ln-468" href="#ln-468"></a><span class="w">        </span><span class="c">!! M = ORDER + 1 when intercept is set to true; however, if </span>
-<a id="ln-469" name="ln-469" href="#ln-469"></a><span class="w">        </span><span class="c">!! intercept is set to false, M = ORDER.</span>
-<a id="ln-470" name="ln-470" href="#ln-470"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">alpha</span>
-<a id="ln-471" name="ln-471" href="#ln-471"></a><span class="w">        </span><span class="c">!! The significance level at which to evaluate the confidence </span>
-<a id="ln-472" name="ln-472" href="#ln-472"></a><span class="w">        </span><span class="c">!! intervals.  The default value is 0.05 such that a 95% </span>
-<a id="ln-473" name="ln-473" href="#ln-473"></a><span class="w">        </span><span class="c">!! confidence interval is calculated.</span>
-<a id="ln-474" name="ln-474" href="#ln-474"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">err</span>
-<a id="ln-475" name="ln-475" href="#ln-475"></a><span class="w">        </span><span class="c">!! A mechanism for communicating errors and warnings to the </span>
-<a id="ln-476" name="ln-476" href="#ln-476"></a><span class="w">        </span><span class="c">!! caller.  Possible warning and error codes are as follows.</span>
-<a id="ln-477" name="ln-477" href="#ln-477"></a><span class="w">        </span><span class="c">!! - FS_NO_ERROR: No errors encountered.</span>
-<a id="ln-478" name="ln-478" href="#ln-478"></a><span class="w">        </span><span class="c">!! - FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not </span>
-<a id="ln-479" name="ln-479" href="#ln-479"></a><span class="w">        </span><span class="c">!!      approriately sized.</span>
-<a id="ln-480" name="ln-480" href="#ln-480"></a><span class="w">        </span><span class="c">!! - FS_INVALID_INPUT_ERROR: Occurs if order is less than 1.</span>
-<a id="ln-481" name="ln-481" href="#ln-481"></a><span class="w">        </span><span class="c">!! - FS_MEMORY_ERROR: Occurs if there is a memory allocation </span>
-<a id="ln-482" name="ln-482" href="#ln-482"></a><span class="w">        </span><span class="c">!!      error.</span>
-<a id="ln-483" name="ln-483" href="#ln-483"></a>
-<a id="ln-484" name="ln-484" href="#ln-484"></a><span class="w">    </span><span class="c">! Parameters</span>
-<a id="ln-485" name="ln-485" href="#ln-485"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">zero</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.0d0</span>
-<a id="ln-486" name="ln-486" href="#ln-486"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">half</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.5d0</span>
-<a id="ln-487" name="ln-487" href="#ln-487"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">one</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d0</span>
-<a id="ln-488" name="ln-488" href="#ln-488"></a>
-<a id="ln-489" name="ln-489" href="#ln-489"></a><span class="w">    </span><span class="c">! Local Variables</span>
-<a id="ln-490" name="ln-490" href="#ln-490"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">i</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">ncols</span><span class="p">,</span><span class="w"> </span><span class="n">ncoeffs</span><span class="p">,</span><span class="w"> </span><span class="n">flag</span>
-<a id="ln-491" name="ln-491" href="#ln-491"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">alph</span><span class="p">,</span><span class="w"> </span><span class="n">var</span><span class="p">,</span><span class="w"> </span><span class="n">df</span><span class="p">,</span><span class="w"> </span><span class="n">ssr</span><span class="p">,</span><span class="w"> </span><span class="n">talpha</span>
-<a id="ln-492" name="ln-492" href="#ln-492"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">allocatable</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">a</span><span class="p">(:,:),</span><span class="w"> </span><span class="n">c</span><span class="p">(:,:),</span><span class="w"> </span><span class="n">cxt</span><span class="p">(:,:)</span>
-<a id="ln-493" name="ln-493" href="#ln-493"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">t_distribution</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dist</span>
-<a id="ln-494" name="ln-494" href="#ln-494"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">errmgr</span>
-<a id="ln-495" name="ln-495" href="#ln-495"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">deferr</span>
-<a id="ln-496" name="ln-496" href="#ln-496"></a><span class="w">    </span>
-<a id="ln-497" name="ln-497" href="#ln-497"></a><span class="w">    </span><span class="c">! Initialization</span>
-<a id="ln-498" name="ln-498" href="#ln-498"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">err</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-499" name="ln-499" href="#ln-499"></a><span class="k">        </span><span class="n">errmgr</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">err</span>
-<a id="ln-500" name="ln-500" href="#ln-500"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-501" name="ln-501" href="#ln-501"></a><span class="k">        </span><span class="n">errmgr</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">deferr</span>
-<a id="ln-502" name="ln-502" href="#ln-502"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-503" name="ln-503" href="#ln-503"></a><span class="k">    </span><span class="n">npts</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
-<a id="ln-504" name="ln-504" href="#ln-504"></a><span class="w">    </span><span class="n">ncoeffs</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">order</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span>
-<a id="ln-505" name="ln-505" href="#ln-505"></a><span class="w">    </span><span class="n">ncols</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">order</span>
-<a id="ln-506" name="ln-506" href="#ln-506"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">intercept</span><span class="p">)</span><span class="w"> </span><span class="n">ncols</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">ncols</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span>
-<a id="ln-507" name="ln-507" href="#ln-507"></a><span class="w">    </span><span class="n">alph</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.05d0</span>
-<a id="ln-508" name="ln-508" href="#ln-508"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">alpha</span><span class="p">))</span><span class="w"> </span><span class="n">alph</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">alpha</span>
-<a id="ln-509" name="ln-509" href="#ln-509"></a>
-<a id="ln-510" name="ln-510" href="#ln-510"></a><span class="w">    </span><span class="c">! Input Check</span>
-<a id="ln-511" name="ln-511" href="#ln-511"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">order</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-512" name="ln-512" href="#ln-512"></a><span class="k">        call </span><span class="n">errmgr</span><span class="p">%</span><span class="n">report_error</span><span class="p">(</span><span class="s2">&quot;linear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-513" name="ln-513" href="#ln-513"></a><span class="w">            </span><span class="s2">&quot;The model order must be at least one.&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">FS_INVALID_INPUT_ERROR</span><span class="p">)</span>
-<a id="ln-514" name="ln-514" href="#ln-514"></a><span class="w">        </span><span class="k">return</span>
-<a id="ln-515" name="ln-515" href="#ln-515"></a><span class="k">    end if</span>
-<a id="ln-516" name="ln-516" href="#ln-516"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">y</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">npts</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-517" name="ln-517" href="#ln-517"></a><span class="k">        call </span><span class="n">report_array_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;linear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-518" name="ln-518" href="#ln-518"></a><span class="w">            </span><span class="s2">&quot;y&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">y</span><span class="p">))</span>
-<a id="ln-519" name="ln-519" href="#ln-519"></a><span class="w">        </span><span class="k">return</span>
-<a id="ln-520" name="ln-520" href="#ln-520"></a><span class="k">    end if</span>
-<a id="ln-521" name="ln-521" href="#ln-521"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">coeffs</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">ncoeffs</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-522" name="ln-522" href="#ln-522"></a><span class="k">        call </span><span class="n">report_array_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;linear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-523" name="ln-523" href="#ln-523"></a><span class="w">            </span><span class="s2">&quot;coeffs&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">ncoeffs</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">coeffs</span><span class="p">))</span>
-<a id="ln-524" name="ln-524" href="#ln-524"></a><span class="w">        </span><span class="k">return</span>
-<a id="ln-525" name="ln-525" href="#ln-525"></a><span class="k">    end if</span>
-<a id="ln-526" name="ln-526" href="#ln-526"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">ymod</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">npts</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-527" name="ln-527" href="#ln-527"></a><span class="k">        call </span><span class="n">report_array_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;linear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-528" name="ln-528" href="#ln-528"></a><span class="w">            </span><span class="s2">&quot;ymod&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">ymod</span><span class="p">))</span>
-<a id="ln-529" name="ln-529" href="#ln-529"></a><span class="w">        </span><span class="k">return</span>
-<a id="ln-530" name="ln-530" href="#ln-530"></a><span class="k">    end if</span>
-<a id="ln-531" name="ln-531" href="#ln-531"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">resid</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">npts</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-532" name="ln-532" href="#ln-532"></a><span class="k">        call </span><span class="n">report_array_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;linear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-533" name="ln-533" href="#ln-533"></a><span class="w">            </span><span class="s2">&quot;resid&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">resid</span><span class="p">))</span>
-<a id="ln-534" name="ln-534" href="#ln-534"></a><span class="w">        </span><span class="k">return</span>
-<a id="ln-535" name="ln-535" href="#ln-535"></a><span class="k">    end if</span>
-<a id="ln-536" name="ln-536" href="#ln-536"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">stats</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-537" name="ln-537" href="#ln-537"></a><span class="k">        if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">stats</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">ncols</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-538" name="ln-538" href="#ln-538"></a><span class="k">            call </span><span class="n">report_array_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-539" name="ln-539" href="#ln-539"></a><span class="w">                </span><span class="s2">&quot;linear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;stats&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">ncols</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">stats</span><span class="p">))</span>
-<a id="ln-540" name="ln-540" href="#ln-540"></a><span class="w">            </span><span class="k">return</span>
-<a id="ln-541" name="ln-541" href="#ln-541"></a><span class="k">        end if</span>
-<a id="ln-542" name="ln-542" href="#ln-542"></a><span class="k">    end if</span>
-<a id="ln-543" name="ln-543" href="#ln-543"></a>
-<a id="ln-544" name="ln-544" href="#ln-544"></a><span class="w">    </span><span class="c">! Memory Allocation</span>
-<a id="ln-545" name="ln-545" href="#ln-545"></a><span class="w">    </span><span class="k">allocate</span><span class="p">(</span><span class="n">a</span><span class="p">(</span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">ncols</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
-<a id="ln-546" name="ln-546" href="#ln-546"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">allocate</span><span class="p">(</span><span class="n">c</span><span class="p">(</span><span class="n">ncols</span><span class="p">,</span><span class="w"> </span><span class="n">ncols</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
-<a id="ln-547" name="ln-547" href="#ln-547"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">allocate</span><span class="p">(</span><span class="n">cxt</span><span class="p">(</span><span class="n">ncols</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
-<a id="ln-548" name="ln-548" href="#ln-548"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-549" name="ln-549" href="#ln-549"></a><span class="k">        call </span><span class="n">report_memory_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;linear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
-<a id="ln-550" name="ln-550" href="#ln-550"></a><span class="w">        </span><span class="k">return</span>
-<a id="ln-551" name="ln-551" href="#ln-551"></a><span class="k">    end if</span>
-<a id="ln-552" name="ln-552" href="#ln-552"></a>
-<a id="ln-553" name="ln-553" href="#ln-553"></a><span class="w">    </span><span class="c">! Compute the coefficient matrix</span>
-<a id="ln-554" name="ln-554" href="#ln-554"></a><span class="w">    </span><span class="k">call </span><span class="n">coefficient_matrix</span><span class="p">(</span><span class="n">order</span><span class="p">,</span><span class="w"> </span><span class="n">intercept</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">errmgr</span><span class="p">)</span>
-<a id="ln-555" name="ln-555" href="#ln-555"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">errmgr</span><span class="p">%</span><span class="n">has_error_occurred</span><span class="p">())</span><span class="w"> </span><span class="k">return</span>
-<a id="ln-556" name="ln-556" href="#ln-556"></a>
-<a id="ln-557" name="ln-557" href="#ln-557"></a><span class="w">    </span><span class="c">! Compute the covariance matrix</span>
-<a id="ln-558" name="ln-558" href="#ln-558"></a><span class="w">    </span><span class="k">call </span><span class="n">covariance_matrix</span><span class="p">(</span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="n">errmgr</span><span class="p">)</span>
-<a id="ln-559" name="ln-559" href="#ln-559"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">errmgr</span><span class="p">%</span><span class="n">has_error_occurred</span><span class="p">())</span><span class="w"> </span><span class="k">return</span>
-<a id="ln-560" name="ln-560" href="#ln-560"></a>
-<a id="ln-561" name="ln-561" href="#ln-561"></a><span class="w">    </span><span class="c">! Compute the coefficients (NCOLS-by-1)</span>
-<a id="ln-562" name="ln-562" href="#ln-562"></a><span class="w">    </span><span class="k">call </span><span class="n">DGEMM</span><span class="p">(</span><span class="s2">&quot;N&quot;</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;T&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">ncols</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">ncols</span><span class="p">,</span><span class="w"> </span><span class="n">one</span><span class="p">,</span><span class="w"> </span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="n">ncols</span><span class="p">,</span><span class="w"> </span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">zero</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-563" name="ln-563" href="#ln-563"></a><span class="w">        </span><span class="n">cxt</span><span class="p">,</span><span class="w"> </span><span class="n">ncols</span><span class="p">)</span><span class="w">     </span><span class="c">! C * X**T</span>
-<a id="ln-564" name="ln-564" href="#ln-564"></a>
-<a id="ln-565" name="ln-565" href="#ln-565"></a><span class="w">    </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">2</span>
-<a id="ln-566" name="ln-566" href="#ln-566"></a><span class="w">    </span><span class="n">coeffs</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">zero</span>
-<a id="ln-567" name="ln-567" href="#ln-567"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">intercept</span><span class="p">)</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span>
-<a id="ln-568" name="ln-568" href="#ln-568"></a><span class="w">    </span><span class="k">call </span><span class="n">DGEMM</span><span class="p">(</span><span class="s2">&quot;N&quot;</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;N&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">ncols</span><span class="p">,</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">one</span><span class="p">,</span><span class="w"> </span><span class="n">cxt</span><span class="p">,</span><span class="w"> </span><span class="n">ncols</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">zero</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-569" name="ln-569" href="#ln-569"></a><span class="w">        </span><span class="n">coeffs</span><span class="p">(</span><span class="n">i</span><span class="p">:),</span><span class="w"> </span><span class="n">ncols</span><span class="p">)</span><span class="w">  </span><span class="c">! (C * X**T) * Y</span>
-<a id="ln-570" name="ln-570" href="#ln-570"></a>
-<a id="ln-571" name="ln-571" href="#ln-571"></a><span class="w">    </span><span class="c">! Evaluate the model and compute the residuals</span>
-<a id="ln-572" name="ln-572" href="#ln-572"></a><span class="w">    </span><span class="k">call </span><span class="n">DGEMM</span><span class="p">(</span><span class="s2">&quot;N&quot;</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;N&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="n">ncols</span><span class="p">,</span><span class="w"> </span><span class="n">one</span><span class="p">,</span><span class="w"> </span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">coeffs</span><span class="p">(</span><span class="n">i</span><span class="p">:),</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-573" name="ln-573" href="#ln-573"></a><span class="w">        </span><span class="n">ncols</span><span class="p">,</span><span class="w"> </span><span class="n">zero</span><span class="p">,</span><span class="w"> </span><span class="n">ymod</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">)</span>
-<a id="ln-574" name="ln-574" href="#ln-574"></a><span class="w">    </span><span class="n">resid</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">ymod</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">y</span>
-<a id="ln-575" name="ln-575" href="#ln-575"></a>
-<a id="ln-576" name="ln-576" href="#ln-576"></a><span class="w">    </span><span class="c">! If the user doesn&#39;t want the statistics calculations we can stop now</span>
-<a id="ln-577" name="ln-577" href="#ln-577"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(.</span><span class="nb">not</span><span class="p">.</span><span class="nb">present</span><span class="p">(</span><span class="n">stats</span><span class="p">))</span><span class="w"> </span><span class="k">return</span>
-<a id="ln-578" name="ln-578" href="#ln-578"></a><span class="w">    </span>
-<a id="ln-579" name="ln-579" href="#ln-579"></a><span class="w">    </span><span class="c">! Start the process of computing statistics</span>
-<a id="ln-580" name="ln-580" href="#ln-580"></a><span class="w">    </span><span class="n">stats</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">calculate_regression_statistics</span><span class="p">(</span><span class="n">resid</span><span class="p">,</span><span class="w"> </span><span class="n">coeffs</span><span class="p">(</span><span class="n">i</span><span class="p">:),</span><span class="w"> </span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="n">alph</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-581" name="ln-581" href="#ln-581"></a><span class="w">        </span><span class="n">errmgr</span><span class="p">)</span>
-<a id="ln-582" name="ln-582" href="#ln-582"></a><span class="k">end subroutine</span>
-<a id="ln-583" name="ln-583" href="#ln-583"></a>
-<a id="ln-584" name="ln-584" href="#ln-584"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-585" name="ln-585" href="#ln-585"></a><span class="k">function </span><span class="n">calculate_regression_statistics</span><span class="p">(</span><span class="n">resid</span><span class="p">,</span><span class="w"> </span><span class="n">params</span><span class="p">,</span><span class="w"> </span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="n">alpha</span><span class="p">,</span><span class="w"> </span><span class="n">err</span><span class="p">)</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-586" name="ln-586" href="#ln-586"></a><span class="w">    </span><span class="k">result</span><span class="p">(</span><span class="n">rst</span><span class="p">)</span>
-<a id="ln-587" name="ln-587" href="#ln-587"></a><span class="w">    </span><span class="c">!! Computes statistics for the quality of fit for a regression </span>
-<a id="ln-588" name="ln-588" href="#ln-588"></a><span class="w">    </span><span class="c">!! model.</span>
-<a id="ln-589" name="ln-589" href="#ln-589"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">resid</span><span class="p">(:)</span>
-<a id="ln-590" name="ln-590" href="#ln-590"></a><span class="w">        </span><span class="c">!! An M-element array containing the model residual errors.</span>
-<a id="ln-591" name="ln-591" href="#ln-591"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">params</span><span class="p">(:)</span>
-<a id="ln-592" name="ln-592" href="#ln-592"></a><span class="w">        </span><span class="c">!! An N-element array containing the model parameters.</span>
-<a id="ln-593" name="ln-593" href="#ln-593"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">c</span><span class="p">(:,:)</span>
-<a id="ln-594" name="ln-594" href="#ln-594"></a><span class="w">        </span><span class="c">!! The N-by-N covariance matrix.</span>
-<a id="ln-595" name="ln-595" href="#ln-595"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">alpha</span>
-<a id="ln-596" name="ln-596" href="#ln-596"></a><span class="w">        </span><span class="c">!! The significance level at which to evaluate the confidence </span>
-<a id="ln-597" name="ln-597" href="#ln-597"></a><span class="w">        </span><span class="c">!! intervals.  The default value is 0.05 such that a 95% </span>
-<a id="ln-598" name="ln-598" href="#ln-598"></a><span class="w">        </span><span class="c">!! confidence interval is calculated.</span>
-<a id="ln-599" name="ln-599" href="#ln-599"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">err</span>
-<a id="ln-600" name="ln-600" href="#ln-600"></a><span class="w">        </span><span class="c">!! A mechanism for communicating errors and warnings to the </span>
-<a id="ln-601" name="ln-601" href="#ln-601"></a><span class="w">        </span><span class="c">!! caller.  Possible warning and error codes are as follows.</span>
-<a id="ln-602" name="ln-602" href="#ln-602"></a><span class="w">        </span><span class="c">!! - FS_NO_ERROR: No errors encountered.</span>
-<a id="ln-603" name="ln-603" href="#ln-603"></a><span class="w">        </span><span class="c">!! - FS_ARRAY_SIZE_ERROR: Occurs if c is not sized correctly.</span>
-<a id="ln-604" name="ln-604" href="#ln-604"></a><span class="w">        </span><span class="c">!! - FS_INVALID_INPUT_ERROR: Occurs if order is less than 1.</span>
-<a id="ln-605" name="ln-605" href="#ln-605"></a><span class="w">        </span><span class="c">!! - FS_MEMORY_ERROR: Occurs if there is a memory allocation </span>
-<a id="ln-606" name="ln-606" href="#ln-606"></a><span class="w">        </span><span class="c">!!      error.</span>
-<a id="ln-607" name="ln-607" href="#ln-607"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">regression_statistics</span><span class="p">),</span><span class="w"> </span><span class="k">allocatable</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">rst</span><span class="p">(:)</span>
-<a id="ln-608" name="ln-608" href="#ln-608"></a><span class="w">        </span><span class="c">!! A regression_statistics object containing the analysis results.</span>
-<a id="ln-609" name="ln-609" href="#ln-609"></a>
-<a id="ln-610" name="ln-610" href="#ln-610"></a><span class="w">    </span><span class="c">! Parameters</span>
-<a id="ln-611" name="ln-611" href="#ln-611"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">p05</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.05d0</span>
-<a id="ln-612" name="ln-612" href="#ln-612"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">half</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.5d0</span>
-<a id="ln-613" name="ln-613" href="#ln-613"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">one</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d0</span>
-<a id="ln-614" name="ln-614" href="#ln-614"></a>
-<a id="ln-615" name="ln-615" href="#ln-615"></a><span class="w">    </span><span class="c">! Local Variables</span>
-<a id="ln-616" name="ln-616" href="#ln-616"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">i</span><span class="p">,</span><span class="w"> </span><span class="n">m</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">dof</span><span class="p">,</span><span class="w"> </span><span class="n">flag</span>
-<a id="ln-617" name="ln-617" href="#ln-617"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">ssr</span><span class="p">,</span><span class="w"> </span><span class="n">var</span><span class="p">,</span><span class="w"> </span><span class="n">talpha</span>
-<a id="ln-618" name="ln-618" href="#ln-618"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">t_distribution</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dist</span>
-<a id="ln-619" name="ln-619" href="#ln-619"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">errmgr</span>
-<a id="ln-620" name="ln-620" href="#ln-620"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">deferr</span>
-<a id="ln-621" name="ln-621" href="#ln-621"></a><span class="w">    </span>
-<a id="ln-622" name="ln-622" href="#ln-622"></a><span class="w">    </span><span class="c">! Initialization</span>
-<a id="ln-623" name="ln-623" href="#ln-623"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">err</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-624" name="ln-624" href="#ln-624"></a><span class="k">        </span><span class="n">errmgr</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">err</span>
-<a id="ln-625" name="ln-625" href="#ln-625"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-626" name="ln-626" href="#ln-626"></a><span class="k">        </span><span class="n">errmgr</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">deferr</span>
-<a id="ln-627" name="ln-627" href="#ln-627"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-628" name="ln-628" href="#ln-628"></a>
-<a id="ln-629" name="ln-629" href="#ln-629"></a><span class="w">    </span><span class="c">! Initialization</span>
-<a id="ln-630" name="ln-630" href="#ln-630"></a><span class="w">    </span><span class="n">m</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">resid</span><span class="p">)</span>
-<a id="ln-631" name="ln-631" href="#ln-631"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">params</span><span class="p">)</span>
-<a id="ln-632" name="ln-632" href="#ln-632"></a><span class="w">    </span><span class="n">dof</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">m</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">n</span>
-<a id="ln-633" name="ln-633" href="#ln-633"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">alpha</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-634" name="ln-634" href="#ln-634"></a><span class="k">        </span><span class="n">a</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">alpha</span>
-<a id="ln-635" name="ln-635" href="#ln-635"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-636" name="ln-636" href="#ln-636"></a><span class="k">        </span><span class="n">a</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">p05</span>
-<a id="ln-637" name="ln-637" href="#ln-637"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-638" name="ln-638" href="#ln-638"></a><span class="k">    allocate</span><span class="p">(</span><span class="n">rst</span><span class="p">(</span><span class="n">n</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
-<a id="ln-639" name="ln-639" href="#ln-639"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-640" name="ln-640" href="#ln-640"></a><span class="k">    end if</span>
-<a id="ln-641" name="ln-641" href="#ln-641"></a>
-<a id="ln-642" name="ln-642" href="#ln-642"></a><span class="w">    </span><span class="c">! Input Checking</span>
-<a id="ln-643" name="ln-643" href="#ln-643"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="p">.</span><span class="nb">or</span><span class="p">.</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-644" name="ln-644" href="#ln-644"></a><span class="k">    end if</span>
-<a id="ln-645" name="ln-645" href="#ln-645"></a>
-<a id="ln-646" name="ln-646" href="#ln-646"></a><span class="w">    </span><span class="c">! Process</span>
-<a id="ln-647" name="ln-647" href="#ln-647"></a><span class="w">    </span><span class="n">ssr</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">norm2</span><span class="p">(</span><span class="n">resid</span><span class="p">)</span><span class="o">**</span><span class="mi">2</span><span class="w">   </span><span class="c">! sum of the squares of the residual</span>
-<a id="ln-648" name="ln-648" href="#ln-648"></a><span class="w">    </span><span class="n">var</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">ssr</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">dof</span>
-<a id="ln-649" name="ln-649" href="#ln-649"></a><span class="w">    </span><span class="n">dist</span><span class="p">%</span><span class="n">dof</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="kt">real</span><span class="p">(</span><span class="n">dof</span><span class="p">,</span><span class="w"> </span><span class="n">real64</span><span class="p">)</span>
-<a id="ln-650" name="ln-650" href="#ln-650"></a><span class="w">    </span><span class="n">talpha</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">confidence_interval</span><span class="p">(</span><span class="n">dist</span><span class="p">,</span><span class="w"> </span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">one</span><span class="p">,</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
-<a id="ln-651" name="ln-651" href="#ln-651"></a><span class="w">    </span><span class="k">do </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
-<a id="ln-652" name="ln-652" href="#ln-652"></a><span class="w">        </span><span class="n">rst</span><span class="p">(</span><span class="n">i</span><span class="p">)%</span><span class="n">standard_error</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">sqrt</span><span class="p">(</span><span class="n">var</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">c</span><span class="p">(</span><span class="n">i</span><span class="p">,</span><span class="n">i</span><span class="p">))</span>
-<a id="ln-653" name="ln-653" href="#ln-653"></a><span class="w">        </span><span class="n">rst</span><span class="p">(</span><span class="n">i</span><span class="p">)%</span><span class="n">t_statistic</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">params</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">rst</span><span class="p">(</span><span class="n">i</span><span class="p">)%</span><span class="n">standard_error</span>
-<a id="ln-654" name="ln-654" href="#ln-654"></a><span class="w">        </span><span class="n">rst</span><span class="p">(</span><span class="n">i</span><span class="p">)%</span><span class="n">probability</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">regularized_beta</span><span class="p">(</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-655" name="ln-655" href="#ln-655"></a><span class="w">            </span><span class="n">half</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">dof</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-656" name="ln-656" href="#ln-656"></a><span class="w">            </span><span class="n">half</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-657" name="ln-657" href="#ln-657"></a><span class="w">            </span><span class="kt">real</span><span class="p">(</span><span class="n">dof</span><span class="p">,</span><span class="w"> </span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="p">(</span><span class="n">dof</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">(</span><span class="n">rst</span><span class="p">(</span><span class="n">i</span><span class="p">)%</span><span class="n">t_statistic</span><span class="p">)</span><span class="o">**</span><span class="mi">2</span><span class="p">)</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-658" name="ln-658" href="#ln-658"></a><span class="w">        </span><span class="p">)</span>
-<a id="ln-659" name="ln-659" href="#ln-659"></a><span class="w">        </span><span class="n">rst</span><span class="p">(</span><span class="n">i</span><span class="p">)%</span><span class="n">confidence_interval</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">talpha</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">rst</span><span class="p">(</span><span class="n">i</span><span class="p">)%</span><span class="n">standard_error</span>
-<a id="ln-660" name="ln-660" href="#ln-660"></a><span class="w">    </span><span class="k">end do</span>
-<a id="ln-661" name="ln-661" href="#ln-661"></a><span class="k">end function</span>
-<a id="ln-662" name="ln-662" href="#ln-662"></a>
-<a id="ln-663" name="ln-663" href="#ln-663"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-664" name="ln-664" href="#ln-664"></a><span class="k">subroutine </span><span class="n">jacobian</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">params</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-665" name="ln-665" href="#ln-665"></a><span class="w">    </span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">,</span><span class="w"> </span><span class="n">f0</span><span class="p">,</span><span class="w"> </span><span class="n">f1</span><span class="p">,</span><span class="w"> </span><span class="n">step</span><span class="p">,</span><span class="w"> </span><span class="n">err</span><span class="p">)</span>
-<a id="ln-666" name="ln-666" href="#ln-666"></a><span class="w">    </span><span class="c">!! Computes the Jacobian matrix for a nonlinear regression problem.</span>
-<a id="ln-667" name="ln-667" href="#ln-667"></a><span class="w">    </span><span class="k">procedure</span><span class="p">(</span><span class="n">regression_function</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">fun</span>
-<a id="ln-668" name="ln-668" href="#ln-668"></a><span class="w">        </span><span class="c">!! A pointer to the regression_function to evaluate.</span>
-<a id="ln-669" name="ln-669" href="#ln-669"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">xdata</span><span class="p">(:)</span>
-<a id="ln-670" name="ln-670" href="#ln-670"></a><span class="w">        </span><span class="c">!! The M-element array containing x-coordinate data.</span>
-<a id="ln-671" name="ln-671" href="#ln-671"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">params</span><span class="p">(:)</span>
-<a id="ln-672" name="ln-672" href="#ln-672"></a><span class="w">        </span><span class="c">!! The N-element array containing the model parameters.</span>
-<a id="ln-673" name="ln-673" href="#ln-673"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">jac</span><span class="p">(:,:)</span>
-<a id="ln-674" name="ln-674" href="#ln-674"></a><span class="w">        </span><span class="c">!! The M-by-N matrix where the Jacobian will be written.</span>
-<a id="ln-675" name="ln-675" href="#ln-675"></a><span class="w">    </span><span class="kt">logical</span><span class="p">,</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="k">stop</span>
-<a id="ln-676" name="ln-676" href="#ln-676"></a><span class="w">        </span><span class="c">!! A value that the user can set in fun forcing the</span>
-<a id="ln-677" name="ln-677" href="#ln-677"></a><span class="w">        </span><span class="c">!! evaluation process to stop prior to completion.</span>
-<a id="ln-678" name="ln-678" href="#ln-678"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">f0</span><span class="p">(:)</span>
-<a id="ln-679" name="ln-679" href="#ln-679"></a><span class="w">        </span><span class="c">!! An optional M-element array containing the model values</span>
-<a id="ln-680" name="ln-680" href="#ln-680"></a><span class="w">        </span><span class="c">!!  using the current parameters as defined in m.  This input </span>
-<a id="ln-681" name="ln-681" href="#ln-681"></a><span class="w">        </span><span class="c">!! can be used to prevent the routine from performing a </span>
-<a id="ln-682" name="ln-682" href="#ln-682"></a><span class="w">        </span><span class="c">!! function evaluation at the model parameter state defined in </span>
-<a id="ln-683" name="ln-683" href="#ln-683"></a><span class="w">        </span><span class="c">!! params.</span>
-<a id="ln-684" name="ln-684" href="#ln-684"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">f1</span><span class="p">(:)</span>
-<a id="ln-685" name="ln-685" href="#ln-685"></a><span class="w">        </span><span class="c">!! An optional M-element workspace array used for function</span>
-<a id="ln-686" name="ln-686" href="#ln-686"></a><span class="w">        </span><span class="c">!! evaluations.</span>
-<a id="ln-687" name="ln-687" href="#ln-687"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">step</span>
-<a id="ln-688" name="ln-688" href="#ln-688"></a><span class="w">        </span><span class="c">!! The differentiation step size.  The default is the square </span>
-<a id="ln-689" name="ln-689" href="#ln-689"></a><span class="w">        </span><span class="c">!! root of machine precision.</span>
-<a id="ln-690" name="ln-690" href="#ln-690"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">err</span>
-<a id="ln-691" name="ln-691" href="#ln-691"></a><span class="w">        </span><span class="c">!! A mechanism for communicating errors and warnings to the </span>
-<a id="ln-692" name="ln-692" href="#ln-692"></a><span class="w">        </span><span class="c">!! caller.  Possible warning and error codes are as follows.</span>
-<a id="ln-693" name="ln-693" href="#ln-693"></a><span class="w">        </span><span class="c">!! - FS_NO_ERROR: No errors encountered.</span>
-<a id="ln-694" name="ln-694" href="#ln-694"></a><span class="w">        </span><span class="c">!! - FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not </span>
-<a id="ln-695" name="ln-695" href="#ln-695"></a><span class="w">        </span><span class="c">!!      properly sized.</span>
-<a id="ln-696" name="ln-696" href="#ln-696"></a><span class="w">        </span><span class="c">!! - FS_MEMORY_ERROR: Occurs if there is a memory allocation </span>
-<a id="ln-697" name="ln-697" href="#ln-697"></a><span class="w">        </span><span class="c">!!      error.</span>
-<a id="ln-698" name="ln-698" href="#ln-698"></a>
-<a id="ln-699" name="ln-699" href="#ln-699"></a><span class="w">    </span><span class="c">! Local Variables</span>
-<a id="ln-700" name="ln-700" href="#ln-700"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">h</span>
-<a id="ln-701" name="ln-701" href="#ln-701"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">m</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">flag</span><span class="p">,</span><span class="w"> </span><span class="n">expected</span><span class="p">,</span><span class="w"> </span><span class="n">actual</span>
-<a id="ln-702" name="ln-702" href="#ln-702"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">f1p</span><span class="p">(:),</span><span class="w"> </span><span class="n">f0p</span><span class="p">(:)</span>
-<a id="ln-703" name="ln-703" href="#ln-703"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">allocatable</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">f1a</span><span class="p">(:),</span><span class="w"> </span><span class="n">f0a</span><span class="p">(:),</span><span class="w"> </span><span class="n">work</span><span class="p">(:)</span>
-<a id="ln-704" name="ln-704" href="#ln-704"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">errmgr</span>
-<a id="ln-705" name="ln-705" href="#ln-705"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">deferr</span>
-<a id="ln-706" name="ln-706" href="#ln-706"></a>
-<a id="ln-707" name="ln-707" href="#ln-707"></a><span class="w">    </span><span class="c">! Initialization</span>
-<a id="ln-708" name="ln-708" href="#ln-708"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">err</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-709" name="ln-709" href="#ln-709"></a><span class="k">        </span><span class="n">errmgr</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">err</span>
-<a id="ln-710" name="ln-710" href="#ln-710"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-711" name="ln-711" href="#ln-711"></a><span class="k">        </span><span class="n">errmgr</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">deferr</span>
-<a id="ln-712" name="ln-712" href="#ln-712"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-713" name="ln-713" href="#ln-713"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">step</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-714" name="ln-714" href="#ln-714"></a><span class="k">        </span><span class="n">h</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">step</span>
-<a id="ln-715" name="ln-715" href="#ln-715"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-716" name="ln-716" href="#ln-716"></a><span class="k">        </span><span class="n">h</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">sqrt</span><span class="p">(</span><span class="nb">epsilon</span><span class="p">(</span><span class="n">h</span><span class="p">))</span>
-<a id="ln-717" name="ln-717" href="#ln-717"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-718" name="ln-718" href="#ln-718"></a><span class="k">    </span><span class="n">m</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">xdata</span><span class="p">)</span>
-<a id="ln-719" name="ln-719" href="#ln-719"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">params</span><span class="p">)</span>
-<a id="ln-720" name="ln-720" href="#ln-720"></a>
-<a id="ln-721" name="ln-721" href="#ln-721"></a><span class="w">    </span><span class="c">! Input Size Checking</span>
-<a id="ln-722" name="ln-722" href="#ln-722"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">m</span><span class="w"> </span><span class="p">.</span><span class="nb">or</span><span class="p">.</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-723" name="ln-723" href="#ln-723"></a><span class="k">        call </span><span class="n">report_matrix_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;jacobian&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-724" name="ln-724" href="#ln-724"></a><span class="w">            </span><span class="s2">&quot;JAC&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">m</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="mi">1</span><span class="p">),</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">))</span>
-<a id="ln-725" name="ln-725" href="#ln-725"></a><span class="w">        </span><span class="k">return</span>
-<a id="ln-726" name="ln-726" href="#ln-726"></a><span class="k">    end if</span>
-<a id="ln-727" name="ln-727" href="#ln-727"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">f0</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-728" name="ln-728" href="#ln-728"></a><span class="w">        </span><span class="c">! Check Size</span>
-<a id="ln-729" name="ln-729" href="#ln-729"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">f0</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">m</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-730" name="ln-730" href="#ln-730"></a><span class="k">            call </span><span class="n">report_array_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;jacobian&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-731" name="ln-731" href="#ln-731"></a><span class="w">                </span><span class="s2">&quot;F0&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">m</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">f0</span><span class="p">))</span>
-<a id="ln-732" name="ln-732" href="#ln-732"></a><span class="w">            </span><span class="k">return</span>
-<a id="ln-733" name="ln-733" href="#ln-733"></a><span class="k">        end if</span>
-<a id="ln-734" name="ln-734" href="#ln-734"></a><span class="k">        </span><span class="n">f0p</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">m</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">f0</span>
-<a id="ln-735" name="ln-735" href="#ln-735"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-736" name="ln-736" href="#ln-736"></a><span class="w">        </span><span class="c">! Allocate space, and fill the array with the current function</span>
-<a id="ln-737" name="ln-737" href="#ln-737"></a><span class="w">        </span><span class="c">! results</span>
-<a id="ln-738" name="ln-738" href="#ln-738"></a><span class="w">        </span><span class="k">allocate</span><span class="p">(</span><span class="n">f0a</span><span class="p">(</span><span class="n">m</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
-<a id="ln-739" name="ln-739" href="#ln-739"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">go</span><span class="w"> </span><span class="k">to</span><span class="w"> </span><span class="mi">20</span>
-<a id="ln-740" name="ln-740" href="#ln-740"></a><span class="w">        </span><span class="n">f0p</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">m</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">f0a</span>
-<a id="ln-741" name="ln-741" href="#ln-741"></a><span class="w">        </span><span class="k">call </span><span class="n">fun</span><span class="p">(</span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">params</span><span class="p">,</span><span class="w"> </span><span class="n">f0p</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">)</span>
-<a id="ln-742" name="ln-742" href="#ln-742"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="k">stop</span><span class="p">)</span><span class="w"> </span><span class="k">return</span>
-<a id="ln-743" name="ln-743" href="#ln-743"></a><span class="k">    end if</span>
-<a id="ln-744" name="ln-744" href="#ln-744"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">f1</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-745" name="ln-745" href="#ln-745"></a><span class="w">        </span><span class="c">! Check Size</span>
-<a id="ln-746" name="ln-746" href="#ln-746"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">f1</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">m</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-747" name="ln-747" href="#ln-747"></a><span class="k">            call </span><span class="n">report_array_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;jacobian&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-748" name="ln-748" href="#ln-748"></a><span class="w">                </span><span class="s2">&quot;F1&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">m</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">f1</span><span class="p">))</span>
-<a id="ln-749" name="ln-749" href="#ln-749"></a><span class="w">            </span><span class="k">return</span>
-<a id="ln-750" name="ln-750" href="#ln-750"></a><span class="k">        end if</span>
-<a id="ln-751" name="ln-751" href="#ln-751"></a><span class="k">        </span><span class="n">f1p</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">m</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">f1</span>
-<a id="ln-752" name="ln-752" href="#ln-752"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-753" name="ln-753" href="#ln-753"></a><span class="w">        </span><span class="c">! Allocate space</span>
-<a id="ln-754" name="ln-754" href="#ln-754"></a><span class="w">        </span><span class="k">allocate</span><span class="p">(</span><span class="n">f1a</span><span class="p">(</span><span class="n">m</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
-<a id="ln-755" name="ln-755" href="#ln-755"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">go</span><span class="w"> </span><span class="k">to</span><span class="w"> </span><span class="mi">20</span>
-<a id="ln-756" name="ln-756" href="#ln-756"></a><span class="w">        </span><span class="n">f1p</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">m</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">f1a</span>
-<a id="ln-757" name="ln-757" href="#ln-757"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-758" name="ln-758" href="#ln-758"></a>
-<a id="ln-759" name="ln-759" href="#ln-759"></a><span class="w">    </span><span class="c">! Allocate a workspace array the same size as params</span>
-<a id="ln-760" name="ln-760" href="#ln-760"></a><span class="w">    </span><span class="k">allocate</span><span class="p">(</span><span class="n">work</span><span class="p">(</span><span class="n">n</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
-<a id="ln-761" name="ln-761" href="#ln-761"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">go</span><span class="w"> </span><span class="k">to</span><span class="w"> </span><span class="mi">20</span>
-<a id="ln-762" name="ln-762" href="#ln-762"></a>
-<a id="ln-763" name="ln-763" href="#ln-763"></a><span class="w">    </span><span class="c">! Compute the Jacobian</span>
-<a id="ln-764" name="ln-764" href="#ln-764"></a><span class="w">    </span><span class="k">call </span><span class="n">jacobian_finite_diff</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">params</span><span class="p">,</span><span class="w"> </span><span class="n">f0p</span><span class="p">,</span><span class="w"> </span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="n">f1p</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-765" name="ln-765" href="#ln-765"></a><span class="w">        </span><span class="k">stop</span><span class="p">,</span><span class="w"> </span><span class="n">h</span><span class="p">,</span><span class="w"> </span><span class="n">work</span><span class="p">)</span>
-<a id="ln-766" name="ln-766" href="#ln-766"></a>
-<a id="ln-767" name="ln-767" href="#ln-767"></a><span class="w">    </span><span class="c">! End</span>
-<a id="ln-768" name="ln-768" href="#ln-768"></a><span class="w">    </span><span class="k">return</span>
-<a id="ln-769" name="ln-769" href="#ln-769"></a>
-<a id="ln-770" name="ln-770" href="#ln-770"></a><span class="w">    </span><span class="c">! Memroy Allocation Error Handling</span>
-<a id="ln-771" name="ln-771" href="#ln-771"></a><span class="mi">20</span><span class="w">  </span><span class="k">continue</span>
-<a id="ln-772" name="ln-772" href="#ln-772"></a><span class="k">    call </span><span class="n">report_memory_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;jacobian&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
-<a id="ln-773" name="ln-773" href="#ln-773"></a><span class="w">    </span><span class="k">return</span>
-<a id="ln-774" name="ln-774" href="#ln-774"></a><span class="k">end subroutine</span>
-<a id="ln-775" name="ln-775" href="#ln-775"></a>
-<a id="ln-776" name="ln-776" href="#ln-776"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-777" name="ln-777" href="#ln-777"></a><span class="k">subroutine </span><span class="n">nonlinear_least_squares</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="n">params</span><span class="p">,</span><span class="w"> </span><span class="n">ymod</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-778" name="ln-778" href="#ln-778"></a><span class="w">    </span><span class="n">resid</span><span class="p">,</span><span class="w"> </span><span class="n">weights</span><span class="p">,</span><span class="w"> </span><span class="n">maxp</span><span class="p">,</span><span class="w"> </span><span class="n">minp</span><span class="p">,</span><span class="w"> </span><span class="n">stats</span><span class="p">,</span><span class="w"> </span><span class="n">alpha</span><span class="p">,</span><span class="w"> </span><span class="n">controls</span><span class="p">,</span><span class="w"> </span><span class="n">settings</span><span class="p">,</span><span class="w"> </span><span class="n">info</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-779" name="ln-779" href="#ln-779"></a><span class="w">    </span><span class="n">status</span><span class="p">,</span><span class="w"> </span><span class="n">err</span><span class="p">)</span>
-<a id="ln-780" name="ln-780" href="#ln-780"></a><span class="w">    </span><span class="c">!! Performs a nonlinear regression to fit a model using a version</span>
-<a id="ln-781" name="ln-781" href="#ln-781"></a><span class="w">    </span><span class="c">!! of the Levenberg-Marquardt algorithm.</span>
-<a id="ln-782" name="ln-782" href="#ln-782"></a><span class="w">    </span><span class="k">procedure</span><span class="p">(</span><span class="n">regression_function</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">fun</span>
-<a id="ln-783" name="ln-783" href="#ln-783"></a><span class="w">        </span><span class="c">!! A pointer to the regression_function to evaluate.</span>
-<a id="ln-784" name="ln-784" href="#ln-784"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span><span class="p">(:)</span>
-<a id="ln-785" name="ln-785" href="#ln-785"></a><span class="w">        </span><span class="c">!! The M-element array containing independent data.</span>
-<a id="ln-786" name="ln-786" href="#ln-786"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">y</span><span class="p">(:)</span>
-<a id="ln-787" name="ln-787" href="#ln-787"></a><span class="w">        </span><span class="c">!! The M-element array containing dependent data.</span>
-<a id="ln-788" name="ln-788" href="#ln-788"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">params</span><span class="p">(:)</span>
-<a id="ln-789" name="ln-789" href="#ln-789"></a><span class="w">        </span><span class="c">!! On input, the N-element array containing the initial estimate</span>
-<a id="ln-790" name="ln-790" href="#ln-790"></a><span class="w">        </span><span class="c">!! of the model parameters.  On output, the computed model </span>
-<a id="ln-791" name="ln-791" href="#ln-791"></a><span class="w">        </span><span class="c">!! parameters.</span>
-<a id="ln-792" name="ln-792" href="#ln-792"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">ymod</span><span class="p">(:)</span>
-<a id="ln-793" name="ln-793" href="#ln-793"></a><span class="w">        </span><span class="c">!! An M-element array where the modeled dependent data will</span>
-<a id="ln-794" name="ln-794" href="#ln-794"></a><span class="w">        </span><span class="c">!! be written.</span>
-<a id="ln-795" name="ln-795" href="#ln-795"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">resid</span><span class="p">(:)</span>
-<a id="ln-796" name="ln-796" href="#ln-796"></a><span class="w">        </span><span class="c">!! An M-element array where the model residuals will be</span>
-<a id="ln-797" name="ln-797" href="#ln-797"></a><span class="w">        </span><span class="c">!! written.</span>
-<a id="ln-798" name="ln-798" href="#ln-798"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">weights</span><span class="p">(:)</span>
-<a id="ln-799" name="ln-799" href="#ln-799"></a><span class="w">        </span><span class="c">!! An optional M-element array allowing the weighting of</span>
-<a id="ln-800" name="ln-800" href="#ln-800"></a><span class="w">        </span><span class="c">!! individual points.</span>
-<a id="ln-801" name="ln-801" href="#ln-801"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">maxp</span><span class="p">(:)</span>
-<a id="ln-802" name="ln-802" href="#ln-802"></a><span class="w">        </span><span class="c">!! An optional N-element array that can be used as upper limits </span>
-<a id="ln-803" name="ln-803" href="#ln-803"></a><span class="w">        </span><span class="c">!! on the parameter values.  If no upper limit is requested for</span>
-<a id="ln-804" name="ln-804" href="#ln-804"></a><span class="w">        </span><span class="c">!! a particular parameter, utilize a very large value.  The </span>
-<a id="ln-805" name="ln-805" href="#ln-805"></a><span class="w">        </span><span class="c">!! internal default is to utilize huge() as a value.</span>
-<a id="ln-806" name="ln-806" href="#ln-806"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">minp</span><span class="p">(:)</span>
-<a id="ln-807" name="ln-807" href="#ln-807"></a><span class="w">        </span><span class="c">!! An optional N-element array that can be used as lower limits </span>
-<a id="ln-808" name="ln-808" href="#ln-808"></a><span class="w">        </span><span class="c">!! on the parameter values.  If no lower limit is requested for</span>
-<a id="ln-809" name="ln-809" href="#ln-809"></a><span class="w">        </span><span class="c">!! a particalar parameter, utilize a very large magnitude, but </span>
-<a id="ln-810" name="ln-810" href="#ln-810"></a><span class="w">        </span><span class="c">!! negative, value.  The internal default is to utilize -huge() </span>
-<a id="ln-811" name="ln-811" href="#ln-811"></a><span class="w">        </span><span class="c">!! as a value.</span>
-<a id="ln-812" name="ln-812" href="#ln-812"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">regression_statistics</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">stats</span><span class="p">(:)</span>
-<a id="ln-813" name="ln-813" href="#ln-813"></a><span class="w">        </span><span class="c">!! An optional N-element array that, if supplied, will be used </span>
-<a id="ln-814" name="ln-814" href="#ln-814"></a><span class="w">        </span><span class="c">!! to return statistics about the fit for each parameter.</span>
-<a id="ln-815" name="ln-815" href="#ln-815"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">alpha</span>
-<a id="ln-816" name="ln-816" href="#ln-816"></a><span class="w">        </span><span class="c">!! The significance level at which to evaluate the confidence </span>
-<a id="ln-817" name="ln-817" href="#ln-817"></a><span class="w">        </span><span class="c">!! intervals.  The default value is 0.05 such that a 95% </span>
-<a id="ln-818" name="ln-818" href="#ln-818"></a><span class="w">        </span><span class="c">!! confidence interval is calculated.</span>
-<a id="ln-819" name="ln-819" href="#ln-819"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">iteration_controls</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">controls</span>
-<a id="ln-820" name="ln-820" href="#ln-820"></a><span class="w">        </span><span class="c">!! An optional input providing custom iteration controls.</span>
-<a id="ln-821" name="ln-821" href="#ln-821"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">lm_solver_options</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">settings</span>
-<a id="ln-822" name="ln-822" href="#ln-822"></a><span class="w">        </span><span class="c">!! An optional input providing custom settings for the solver.</span>
-<a id="ln-823" name="ln-823" href="#ln-823"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">convergence_info</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">info</span>
-<a id="ln-824" name="ln-824" href="#ln-824"></a><span class="w">        </span><span class="c">!! An optional output that can be used to gain information about</span>
-<a id="ln-825" name="ln-825" href="#ln-825"></a><span class="w">        </span><span class="c">!! the iterative solution and the nature of the convergence.</span>
-<a id="ln-826" name="ln-826" href="#ln-826"></a><span class="w">    </span><span class="k">procedure</span><span class="p">(</span><span class="n">iteration_update</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="p">,</span><span class="w"> </span><span class="k">optional</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">status</span>
-<a id="ln-827" name="ln-827" href="#ln-827"></a><span class="w">        </span><span class="c">!! An optional pointer to a routine that can be used to extract</span>
-<a id="ln-828" name="ln-828" href="#ln-828"></a><span class="w">        </span><span class="c">!! iteration information.</span>
-<a id="ln-829" name="ln-829" href="#ln-829"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">err</span>
-<a id="ln-830" name="ln-830" href="#ln-830"></a><span class="w">        </span><span class="c">!! A mechanism for communicating errors and warnings to the </span>
-<a id="ln-831" name="ln-831" href="#ln-831"></a><span class="w">        </span><span class="c">!! caller.  Possible warning and error codes are as follows.</span>
-<a id="ln-832" name="ln-832" href="#ln-832"></a><span class="w">        </span><span class="c">!! - FS_NO_ERROR: No errors encountered.</span>
-<a id="ln-833" name="ln-833" href="#ln-833"></a><span class="w">        </span><span class="c">!! - FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not </span>
-<a id="ln-834" name="ln-834" href="#ln-834"></a><span class="w">        </span><span class="c">!!      properly sized.</span>
-<a id="ln-835" name="ln-835" href="#ln-835"></a><span class="w">        </span><span class="c">!! - FS_MEMORY_ERROR: Occurs if there is a memory allocation </span>
-<a id="ln-836" name="ln-836" href="#ln-836"></a><span class="w">        </span><span class="c">!!      error.</span>
-<a id="ln-837" name="ln-837" href="#ln-837"></a><span class="w">        </span><span class="c">!! - FS_UNDERDEFINED_PROBLEM_ERROR: Occurs if the problem posed </span>
-<a id="ln-838" name="ln-838" href="#ln-838"></a><span class="w">        </span><span class="c">!!      is underdetetermined (M &lt; N).</span>
-<a id="ln-839" name="ln-839" href="#ln-839"></a><span class="w">        </span><span class="c">!! - FS_TOLERANCE_TOO_SMALL_ERROR: Occurs if any supplied </span>
-<a id="ln-840" name="ln-840" href="#ln-840"></a><span class="w">        </span><span class="c">!!      tolerances are too small to be practical.</span>
-<a id="ln-841" name="ln-841" href="#ln-841"></a><span class="w">        </span><span class="c">!! - FS_TOO_FEW_ITERATION_ERROR: Occurs if too few iterations </span>
-<a id="ln-842" name="ln-842" href="#ln-842"></a><span class="w">        </span><span class="c">!!      are allowed.</span>
-<a id="ln-843" name="ln-843" href="#ln-843"></a>
-<a id="ln-844" name="ln-844" href="#ln-844"></a><span class="w">    </span><span class="c">! Parameters</span>
-<a id="ln-845" name="ln-845" href="#ln-845"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">too_small</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d-14</span>
-<a id="ln-846" name="ln-846" href="#ln-846"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">min_iter_count</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">2</span>
-<a id="ln-847" name="ln-847" href="#ln-847"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">min_fun_count</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">10</span>
-<a id="ln-848" name="ln-848" href="#ln-848"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">min_update_count</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span>
-<a id="ln-849" name="ln-849" href="#ln-849"></a>
-<a id="ln-850" name="ln-850" href="#ln-850"></a><span class="w">    </span><span class="c">! Local Variables</span>
-<a id="ln-851" name="ln-851" href="#ln-851"></a><span class="w">    </span><span class="kt">logical</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="k">stop</span>
-<a id="ln-852" name="ln-852" href="#ln-852"></a><span class="k">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">m</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">actual</span><span class="p">,</span><span class="w"> </span><span class="n">expected</span><span class="p">,</span><span class="w"> </span><span class="n">flag</span>
-<a id="ln-853" name="ln-853" href="#ln-853"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">w</span><span class="p">(:),</span><span class="w"> </span><span class="n">pmax</span><span class="p">(:),</span><span class="w"> </span><span class="n">pmin</span><span class="p">(:)</span>
-<a id="ln-854" name="ln-854" href="#ln-854"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">allocatable</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">defaultWeights</span><span class="p">(:),</span><span class="w"> </span><span class="n">maxparam</span><span class="p">(:),</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-855" name="ln-855" href="#ln-855"></a><span class="w">        </span><span class="n">minparam</span><span class="p">(:),</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">(:,:)</span>
-<a id="ln-856" name="ln-856" href="#ln-856"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">iteration_controls</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">tol</span>
-<a id="ln-857" name="ln-857" href="#ln-857"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">lm_solver_options</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">opt</span>
-<a id="ln-858" name="ln-858" href="#ln-858"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">convergence_info</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">cInfo</span>
-<a id="ln-859" name="ln-859" href="#ln-859"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">errmgr</span>
-<a id="ln-860" name="ln-860" href="#ln-860"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">deferr</span>
-<a id="ln-861" name="ln-861" href="#ln-861"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">convergence_info</span><span class="p">),</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">defaultinfo</span>
-<a id="ln-862" name="ln-862" href="#ln-862"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">convergence_info</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">inf</span>
-<a id="ln-863" name="ln-863" href="#ln-863"></a><span class="w">    </span>
-<a id="ln-864" name="ln-864" href="#ln-864"></a><span class="w">    </span><span class="c">! Initialization</span>
-<a id="ln-865" name="ln-865" href="#ln-865"></a><span class="w">    </span><span class="k">stop</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">false</span><span class="p">.</span>
-<a id="ln-866" name="ln-866" href="#ln-866"></a><span class="w">    </span><span class="n">m</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
-<a id="ln-867" name="ln-867" href="#ln-867"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">params</span><span class="p">)</span>
-<a id="ln-868" name="ln-868" href="#ln-868"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">info</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-869" name="ln-869" href="#ln-869"></a><span class="k">        </span><span class="n">inf</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">info</span>
-<a id="ln-870" name="ln-870" href="#ln-870"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-871" name="ln-871" href="#ln-871"></a><span class="k">        </span><span class="n">inf</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">defaultinfo</span>
-<a id="ln-872" name="ln-872" href="#ln-872"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-873" name="ln-873" href="#ln-873"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">err</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-874" name="ln-874" href="#ln-874"></a><span class="k">        </span><span class="n">errmgr</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">err</span>
-<a id="ln-875" name="ln-875" href="#ln-875"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-876" name="ln-876" href="#ln-876"></a><span class="k">        </span><span class="n">errmgr</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">deferr</span>
-<a id="ln-877" name="ln-877" href="#ln-877"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-878" name="ln-878" href="#ln-878"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">controls</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-879" name="ln-879" href="#ln-879"></a><span class="k">        </span><span class="n">tol</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">controls</span>
-<a id="ln-880" name="ln-880" href="#ln-880"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-881" name="ln-881" href="#ln-881"></a><span class="k">        call </span><span class="n">tol</span><span class="p">%</span><span class="n">set_to_default</span><span class="p">()</span>
-<a id="ln-882" name="ln-882" href="#ln-882"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-883" name="ln-883" href="#ln-883"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">settings</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-884" name="ln-884" href="#ln-884"></a><span class="k">        </span><span class="n">opt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">settings</span>
-<a id="ln-885" name="ln-885" href="#ln-885"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-886" name="ln-886" href="#ln-886"></a><span class="k">        call </span><span class="n">opt</span><span class="p">%</span><span class="n">set_to_default</span><span class="p">()</span>
-<a id="ln-887" name="ln-887" href="#ln-887"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-888" name="ln-888" href="#ln-888"></a>
-<a id="ln-889" name="ln-889" href="#ln-889"></a><span class="w">    </span><span class="c">! Input Checking</span>
-<a id="ln-890" name="ln-890" href="#ln-890"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">y</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">m</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-891" name="ln-891" href="#ln-891"></a><span class="k">        call </span><span class="n">report_array_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-892" name="ln-892" href="#ln-892"></a><span class="w">            </span><span class="s2">&quot;y&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">m</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">y</span><span class="p">))</span>
-<a id="ln-893" name="ln-893" href="#ln-893"></a><span class="w">        </span><span class="k">return</span>
-<a id="ln-894" name="ln-894" href="#ln-894"></a><span class="k">    end if</span>
-<a id="ln-895" name="ln-895" href="#ln-895"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">ymod</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">m</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-896" name="ln-896" href="#ln-896"></a><span class="k">        call </span><span class="n">report_array_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-897" name="ln-897" href="#ln-897"></a><span class="w">            </span><span class="s2">&quot;ymod&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">m</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">ymod</span><span class="p">))</span>
-<a id="ln-898" name="ln-898" href="#ln-898"></a><span class="w">        </span><span class="k">return</span>
-<a id="ln-899" name="ln-899" href="#ln-899"></a><span class="k">    end if</span>
-<a id="ln-900" name="ln-900" href="#ln-900"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">resid</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">m</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-901" name="ln-901" href="#ln-901"></a><span class="k">        call </span><span class="n">report_array_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-902" name="ln-902" href="#ln-902"></a><span class="w">            </span><span class="s2">&quot;resid&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">m</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">resid</span><span class="p">))</span>
-<a id="ln-903" name="ln-903" href="#ln-903"></a><span class="w">        </span><span class="k">return</span>
-<a id="ln-904" name="ln-904" href="#ln-904"></a><span class="k">    end if</span>
-<a id="ln-905" name="ln-905" href="#ln-905"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="n">m</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-906" name="ln-906" href="#ln-906"></a><span class="k">        call </span><span class="n">report_underdefined_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-907" name="ln-907" href="#ln-907"></a><span class="w">            </span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">m</span><span class="p">)</span>
-<a id="ln-908" name="ln-908" href="#ln-908"></a><span class="w">        </span><span class="k">return</span>
-<a id="ln-909" name="ln-909" href="#ln-909"></a><span class="k">    end if</span>
-<a id="ln-910" name="ln-910" href="#ln-910"></a>
-<a id="ln-911" name="ln-911" href="#ln-911"></a><span class="w">    </span><span class="c">! Tolerance Checking</span>
-<a id="ln-912" name="ln-912" href="#ln-912"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">tol</span><span class="p">%</span><span class="n">gradient_tolerance</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">too_small</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-913" name="ln-913" href="#ln-913"></a><span class="k">        call </span><span class="n">errmgr</span><span class="p">%</span><span class="n">report_error</span><span class="p">(</span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-914" name="ln-914" href="#ln-914"></a><span class="w">            </span><span class="s2">&quot;The gradient tolerance was found to be too small.&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-915" name="ln-915" href="#ln-915"></a><span class="w">            </span><span class="n">FS_TOLERANCE_TOO_SMALL_ERROR</span><span class="p">)</span>
-<a id="ln-916" name="ln-916" href="#ln-916"></a><span class="w">        </span><span class="k">return</span>
-<a id="ln-917" name="ln-917" href="#ln-917"></a><span class="k">    end if</span>
-<a id="ln-918" name="ln-918" href="#ln-918"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="n">tol</span><span class="p">%</span><span class="n">change_in_solution_tolerance</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">too_small</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-919" name="ln-919" href="#ln-919"></a><span class="k">        call </span><span class="n">errmgr</span><span class="p">%</span><span class="n">report_error</span><span class="p">(</span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-920" name="ln-920" href="#ln-920"></a><span class="w">            </span><span class="s2">&quot;The change in solution tolerance was found to be too small.&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-921" name="ln-921" href="#ln-921"></a><span class="w">            </span><span class="n">FS_TOLERANCE_TOO_SMALL_ERROR</span><span class="p">)</span>
-<a id="ln-922" name="ln-922" href="#ln-922"></a><span class="w">        </span><span class="k">return</span>
-<a id="ln-923" name="ln-923" href="#ln-923"></a><span class="k">    end if</span>
-<a id="ln-924" name="ln-924" href="#ln-924"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="n">tol</span><span class="p">%</span><span class="n">residual_tolerance</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">too_small</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-925" name="ln-925" href="#ln-925"></a><span class="k">        call </span><span class="n">errmgr</span><span class="p">%</span><span class="n">report_error</span><span class="p">(</span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-926" name="ln-926" href="#ln-926"></a><span class="w">            </span><span class="s2">&quot;The residual error tolerance was found to be too small.&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-927" name="ln-927" href="#ln-927"></a><span class="w">            </span><span class="n">FS_TOLERANCE_TOO_SMALL_ERROR</span><span class="p">)</span>
-<a id="ln-928" name="ln-928" href="#ln-928"></a><span class="w">        </span><span class="k">return</span>
-<a id="ln-929" name="ln-929" href="#ln-929"></a><span class="k">    end if</span>
-<a id="ln-930" name="ln-930" href="#ln-930"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="n">tol</span><span class="p">%</span><span class="n">iteration_improvement_tolerance</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">too_small</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-931" name="ln-931" href="#ln-931"></a><span class="k">        call </span><span class="n">errmgr</span><span class="p">%</span><span class="n">report_error</span><span class="p">(</span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-932" name="ln-932" href="#ln-932"></a><span class="w">            </span><span class="s2">&quot;The iteration improvement tolerance was found to be too small.&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-933" name="ln-933" href="#ln-933"></a><span class="w">            </span><span class="n">FS_TOLERANCE_TOO_SMALL_ERROR</span><span class="p">)</span>
-<a id="ln-934" name="ln-934" href="#ln-934"></a><span class="w">        </span><span class="k">return</span>
-<a id="ln-935" name="ln-935" href="#ln-935"></a><span class="k">    end if</span>
-<a id="ln-936" name="ln-936" href="#ln-936"></a>
-<a id="ln-937" name="ln-937" href="#ln-937"></a><span class="w">    </span><span class="c">! Iteration Count Checking</span>
-<a id="ln-938" name="ln-938" href="#ln-938"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">tol</span><span class="p">%</span><span class="n">max_iteration_count</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">min_iter_count</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-939" name="ln-939" href="#ln-939"></a><span class="k">        call </span><span class="n">report_iteration_count_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-940" name="ln-940" href="#ln-940"></a><span class="w">            </span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-941" name="ln-941" href="#ln-941"></a><span class="w">            </span><span class="s2">&quot;Too few iterations were specified.&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-942" name="ln-942" href="#ln-942"></a><span class="w">            </span><span class="n">min_iter_count</span><span class="p">)</span>
-<a id="ln-943" name="ln-943" href="#ln-943"></a><span class="w">        </span><span class="k">return</span>
-<a id="ln-944" name="ln-944" href="#ln-944"></a><span class="k">    end if</span>
-<a id="ln-945" name="ln-945" href="#ln-945"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="n">tol</span><span class="p">%</span><span class="n">max_function_evaluations</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">min_fun_count</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-946" name="ln-946" href="#ln-946"></a><span class="k">        call </span><span class="n">report_iteration_count_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-947" name="ln-947" href="#ln-947"></a><span class="w">            </span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-948" name="ln-948" href="#ln-948"></a><span class="w">            </span><span class="s2">&quot;Too few function evaluations were specified.&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-949" name="ln-949" href="#ln-949"></a><span class="w">            </span><span class="n">min_fun_count</span><span class="p">)</span>
-<a id="ln-950" name="ln-950" href="#ln-950"></a><span class="w">        </span><span class="k">return</span>
-<a id="ln-951" name="ln-951" href="#ln-951"></a><span class="k">    end if</span>
-<a id="ln-952" name="ln-952" href="#ln-952"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="n">tol</span><span class="p">%</span><span class="n">max_iteration_between_updates</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">min_update_count</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-953" name="ln-953" href="#ln-953"></a><span class="k">        call </span><span class="n">report_iteration_count_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-954" name="ln-954" href="#ln-954"></a><span class="w">            </span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-955" name="ln-955" href="#ln-955"></a><span class="w">            </span><span class="s2">&quot;Too few iterations between updates were specified.&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-956" name="ln-956" href="#ln-956"></a><span class="w">            </span><span class="n">min_update_count</span><span class="p">)</span>
-<a id="ln-957" name="ln-957" href="#ln-957"></a><span class="w">        </span><span class="k">return</span>
-<a id="ln-958" name="ln-958" href="#ln-958"></a><span class="k">    end if</span>
-<a id="ln-959" name="ln-959" href="#ln-959"></a>
-<a id="ln-960" name="ln-960" href="#ln-960"></a><span class="w">    </span><span class="c">! Optional Array Arguments (weights, parameter limits, etc.)</span>
-<a id="ln-961" name="ln-961" href="#ln-961"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">weights</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-962" name="ln-962" href="#ln-962"></a><span class="k">        if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">weights</span><span class="p">)</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">m</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-963" name="ln-963" href="#ln-963"></a><span class="k">            call </span><span class="n">report_array_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-964" name="ln-964" href="#ln-964"></a><span class="w">                </span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;weights&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">m</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">weights</span><span class="p">))</span>
-<a id="ln-965" name="ln-965" href="#ln-965"></a><span class="w">            </span><span class="k">return</span>
-<a id="ln-966" name="ln-966" href="#ln-966"></a><span class="k">        end if</span>
-<a id="ln-967" name="ln-967" href="#ln-967"></a><span class="k">        </span><span class="n">w</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">m</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">weights</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">m</span><span class="p">)</span>
-<a id="ln-968" name="ln-968" href="#ln-968"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-969" name="ln-969" href="#ln-969"></a><span class="k">        allocate</span><span class="p">(</span><span class="n">defaultWeights</span><span class="p">(</span><span class="n">m</span><span class="p">),</span><span class="w"> </span><span class="n">source</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d0</span><span class="p">,</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
-<a id="ln-970" name="ln-970" href="#ln-970"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">go</span><span class="w"> </span><span class="k">to</span><span class="w"> </span><span class="mi">50</span>
-<a id="ln-971" name="ln-971" href="#ln-971"></a><span class="w">        </span><span class="n">w</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">m</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">defaultWeights</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">m</span><span class="p">)</span>
-<a id="ln-972" name="ln-972" href="#ln-972"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-973" name="ln-973" href="#ln-973"></a>
-<a id="ln-974" name="ln-974" href="#ln-974"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">maxp</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-975" name="ln-975" href="#ln-975"></a><span class="k">        if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">maxp</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-976" name="ln-976" href="#ln-976"></a><span class="k">            call </span><span class="n">report_array_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-977" name="ln-977" href="#ln-977"></a><span class="w">                </span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;maxp&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">maxp</span><span class="p">))</span>
-<a id="ln-978" name="ln-978" href="#ln-978"></a><span class="w">            </span><span class="k">return</span>
-<a id="ln-979" name="ln-979" href="#ln-979"></a><span class="k">        end if</span>
-<a id="ln-980" name="ln-980" href="#ln-980"></a><span class="k">        </span><span class="n">pmax</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">maxp</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">)</span>
-<a id="ln-981" name="ln-981" href="#ln-981"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-982" name="ln-982" href="#ln-982"></a><span class="k">        allocate</span><span class="p">(</span><span class="n">maxparam</span><span class="p">(</span><span class="n">n</span><span class="p">),</span><span class="w"> </span><span class="n">source</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">huge</span><span class="p">(</span><span class="mf">1.0d0</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
-<a id="ln-983" name="ln-983" href="#ln-983"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">go</span><span class="w"> </span><span class="k">to</span><span class="w"> </span><span class="mi">50</span>
-<a id="ln-984" name="ln-984" href="#ln-984"></a><span class="w">        </span><span class="n">pmax</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">maxparam</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">)</span>
-<a id="ln-985" name="ln-985" href="#ln-985"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-986" name="ln-986" href="#ln-986"></a>
-<a id="ln-987" name="ln-987" href="#ln-987"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">minp</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-988" name="ln-988" href="#ln-988"></a><span class="k">        if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">minp</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-989" name="ln-989" href="#ln-989"></a><span class="k">            call </span><span class="n">report_array_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-990" name="ln-990" href="#ln-990"></a><span class="w">                </span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;minp&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">minp</span><span class="p">))</span>
-<a id="ln-991" name="ln-991" href="#ln-991"></a><span class="w">            </span><span class="k">return</span>
-<a id="ln-992" name="ln-992" href="#ln-992"></a><span class="k">        end if</span>
-<a id="ln-993" name="ln-993" href="#ln-993"></a><span class="k">        </span><span class="n">pmin</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">minp</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">)</span>
-<a id="ln-994" name="ln-994" href="#ln-994"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-995" name="ln-995" href="#ln-995"></a><span class="k">        allocate</span><span class="p">(</span><span class="n">minparam</span><span class="p">(</span><span class="n">n</span><span class="p">),</span><span class="w"> </span><span class="n">source</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="o">-</span><span class="nb">huge</span><span class="p">(</span><span class="mf">1.0d0</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
-<a id="ln-996" name="ln-996" href="#ln-996"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">go</span><span class="w"> </span><span class="k">to</span><span class="w"> </span><span class="mi">50</span>
-<a id="ln-997" name="ln-997" href="#ln-997"></a><span class="w">        </span><span class="n">pmin</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">minparam</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">)</span>
-<a id="ln-998" name="ln-998" href="#ln-998"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-999" name="ln-999" href="#ln-999"></a>
-<a id="ln-1000" name="ln-1000" href="#ln-1000"></a><span class="w">    </span><span class="c">! Local Memory Allocations</span>
-<a id="ln-1001" name="ln-1001" href="#ln-1001"></a><span class="w">    </span><span class="k">allocate</span><span class="p">(</span><span class="n">JtWJ</span><span class="p">(</span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
-<a id="ln-1002" name="ln-1002" href="#ln-1002"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">go</span><span class="w"> </span><span class="k">to</span><span class="w"> </span><span class="mi">50</span>
-<a id="ln-1003" name="ln-1003" href="#ln-1003"></a>
-<a id="ln-1004" name="ln-1004" href="#ln-1004"></a><span class="w">    </span><span class="c">! Process</span>
-<a id="ln-1005" name="ln-1005" href="#ln-1005"></a><span class="w">    </span><span class="k">call </span><span class="n">lm_solve</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="n">params</span><span class="p">,</span><span class="w"> </span><span class="n">w</span><span class="p">,</span><span class="w"> </span><span class="n">pmax</span><span class="p">,</span><span class="w"> </span><span class="n">pmin</span><span class="p">,</span><span class="w"> </span><span class="n">tol</span><span class="p">,</span><span class="w"> </span><span class="n">opt</span><span class="p">,</span><span class="w"> </span><span class="n">ymod</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1006" name="ln-1006" href="#ln-1006"></a><span class="w">        </span><span class="n">resid</span><span class="p">,</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="n">inf</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">,</span><span class="w"> </span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="n">status</span><span class="p">)</span>
-<a id="ln-1007" name="ln-1007" href="#ln-1007"></a>
-<a id="ln-1008" name="ln-1008" href="#ln-1008"></a><span class="w">    </span><span class="c">! Statistical Parameters</span>
-<a id="ln-1009" name="ln-1009" href="#ln-1009"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">stats</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-1010" name="ln-1010" href="#ln-1010"></a><span class="k">        if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">stats</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-1011" name="ln-1011" href="#ln-1011"></a><span class="k">            call </span><span class="n">report_array_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1012" name="ln-1012" href="#ln-1012"></a><span class="w">                </span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;stats&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">stats</span><span class="p">))</span>
-<a id="ln-1013" name="ln-1013" href="#ln-1013"></a><span class="w">            </span><span class="k">return</span>
-<a id="ln-1014" name="ln-1014" href="#ln-1014"></a><span class="k">        end if</span>
-<a id="ln-1015" name="ln-1015" href="#ln-1015"></a>
-<a id="ln-1016" name="ln-1016" href="#ln-1016"></a><span class="w">        </span><span class="c">! Compute the covariance matrix</span>
-<a id="ln-1017" name="ln-1017" href="#ln-1017"></a><span class="w">        </span><span class="k">call </span><span class="n">mtx_inverse</span><span class="p">(</span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="n">err</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">errmgr</span><span class="p">)</span>
-<a id="ln-1018" name="ln-1018" href="#ln-1018"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">errmgr</span><span class="p">%</span><span class="n">has_error_occurred</span><span class="p">())</span><span class="w"> </span><span class="k">return</span>
-<a id="ln-1019" name="ln-1019" href="#ln-1019"></a>
-<a id="ln-1020" name="ln-1020" href="#ln-1020"></a><span class="w">        </span><span class="c">! Compute the statistics</span>
-<a id="ln-1021" name="ln-1021" href="#ln-1021"></a><span class="w">        </span><span class="n">stats</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">calculate_regression_statistics</span><span class="p">(</span><span class="n">resid</span><span class="p">,</span><span class="w"> </span><span class="n">params</span><span class="p">,</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1022" name="ln-1022" href="#ln-1022"></a><span class="w">            </span><span class="n">alpha</span><span class="p">,</span><span class="w"> </span><span class="n">errmgr</span><span class="p">)</span>
-<a id="ln-1023" name="ln-1023" href="#ln-1023"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-1024" name="ln-1024" href="#ln-1024"></a>
-<a id="ln-1025" name="ln-1025" href="#ln-1025"></a><span class="w">    </span><span class="c">! End</span>
-<a id="ln-1026" name="ln-1026" href="#ln-1026"></a><span class="w">    </span><span class="k">return</span>
-<a id="ln-1027" name="ln-1027" href="#ln-1027"></a>
-<a id="ln-1028" name="ln-1028" href="#ln-1028"></a><span class="w">    </span><span class="c">! Memory Error Handler</span>
-<a id="ln-1029" name="ln-1029" href="#ln-1029"></a><span class="mi">50</span><span class="w">      </span><span class="k">continue</span>
-<a id="ln-1030" name="ln-1030" href="#ln-1030"></a><span class="k">    call </span><span class="n">report_memory_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
-<a id="ln-1031" name="ln-1031" href="#ln-1031"></a><span class="w">    </span><span class="k">return</span>
-<a id="ln-1032" name="ln-1032" href="#ln-1032"></a><span class="k">end subroutine</span>
-<a id="ln-1033" name="ln-1033" href="#ln-1033"></a>
-<a id="ln-1034" name="ln-1034" href="#ln-1034"></a><span class="c">! ******************************************************************************</span>
-<a id="ln-1035" name="ln-1035" href="#ln-1035"></a><span class="c">! SETTINGS DEFAULTS</span>
-<a id="ln-1036" name="ln-1036" href="#ln-1036"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-1037" name="ln-1037" href="#ln-1037"></a><span class="c">! Sets up default tolerances.</span>
-<a id="ln-1038" name="ln-1038" href="#ln-1038"></a><span class="k">subroutine </span><span class="n">lm_set_default_tolerances</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
-<a id="ln-1039" name="ln-1039" href="#ln-1039"></a><span class="w">    </span><span class="c">! Arguments</span>
-<a id="ln-1040" name="ln-1040" href="#ln-1040"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">iteration_controls</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span>
-<a id="ln-1041" name="ln-1041" href="#ln-1041"></a>
-<a id="ln-1042" name="ln-1042" href="#ln-1042"></a><span class="w">    </span><span class="c">! Set defaults</span>
-<a id="ln-1043" name="ln-1043" href="#ln-1043"></a><span class="w">    </span><span class="n">x</span><span class="p">%</span><span class="n">max_iteration_count</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">500</span>
-<a id="ln-1044" name="ln-1044" href="#ln-1044"></a><span class="w">    </span><span class="n">x</span><span class="p">%</span><span class="n">max_function_evaluations</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">5000</span>
-<a id="ln-1045" name="ln-1045" href="#ln-1045"></a><span class="w">    </span><span class="n">x</span><span class="p">%</span><span class="n">max_iteration_between_updates</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">10</span>
-<a id="ln-1046" name="ln-1046" href="#ln-1046"></a><span class="w">    </span><span class="n">x</span><span class="p">%</span><span class="n">gradient_tolerance</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d-8</span>
-<a id="ln-1047" name="ln-1047" href="#ln-1047"></a><span class="w">    </span><span class="n">x</span><span class="p">%</span><span class="n">residual_tolerance</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.5d-2</span>
-<a id="ln-1048" name="ln-1048" href="#ln-1048"></a><span class="w">    </span><span class="n">x</span><span class="p">%</span><span class="n">change_in_solution_tolerance</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d-6</span>
-<a id="ln-1049" name="ln-1049" href="#ln-1049"></a><span class="w">    </span><span class="n">x</span><span class="p">%</span><span class="n">iteration_improvement_tolerance</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d-1</span>
-<a id="ln-1050" name="ln-1050" href="#ln-1050"></a><span class="k">end subroutine</span>
-<a id="ln-1051" name="ln-1051" href="#ln-1051"></a>
-<a id="ln-1052" name="ln-1052" href="#ln-1052"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-1053" name="ln-1053" href="#ln-1053"></a><span class="c">! Sets up default solver settings.</span>
-<a id="ln-1054" name="ln-1054" href="#ln-1054"></a><span class="k">subroutine </span><span class="n">lm_set_default_settings</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
-<a id="ln-1055" name="ln-1055" href="#ln-1055"></a><span class="w">    </span><span class="c">! Arguments</span>
-<a id="ln-1056" name="ln-1056" href="#ln-1056"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">lm_solver_options</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span>
-<a id="ln-1057" name="ln-1057" href="#ln-1057"></a>
-<a id="ln-1058" name="ln-1058" href="#ln-1058"></a><span class="w">    </span><span class="c">! Set defaults</span>
-<a id="ln-1059" name="ln-1059" href="#ln-1059"></a><span class="w">    </span><span class="n">x</span><span class="p">%</span><span class="n">method</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">FS_LEVENBERG_MARQUARDT_UPDATE</span>
-<a id="ln-1060" name="ln-1060" href="#ln-1060"></a><span class="w">    </span><span class="n">x</span><span class="p">%</span><span class="n">finite_difference_step_size</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">sqrt</span><span class="p">(</span><span class="nb">epsilon</span><span class="p">(</span><span class="mf">1.0d0</span><span class="p">))</span>
-<a id="ln-1061" name="ln-1061" href="#ln-1061"></a><span class="w">    </span><span class="n">x</span><span class="p">%</span><span class="n">damping_increase_factor</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="mf">1.0d0</span>
-<a id="ln-1062" name="ln-1062" href="#ln-1062"></a><span class="w">    </span><span class="n">x</span><span class="p">%</span><span class="n">damping_decrease_factor</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">9.0d0</span>
-<a id="ln-1063" name="ln-1063" href="#ln-1063"></a><span class="k">end subroutine</span>
-<a id="ln-1064" name="ln-1064" href="#ln-1064"></a>
-<a id="ln-1065" name="ln-1065" href="#ln-1065"></a><span class="c">! ******************************************************************************</span>
-<a id="ln-1066" name="ln-1066" href="#ln-1066"></a><span class="c">! PRIVATE ROUTINES</span>
-<a id="ln-1067" name="ln-1067" href="#ln-1067"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-1068" name="ln-1068" href="#ln-1068"></a><span class="c">! Computes the Jacobian matrix via a forward difference.</span>
-<a id="ln-1069" name="ln-1069" href="#ln-1069"></a><span class="c">!</span>
-<a id="ln-1070" name="ln-1070" href="#ln-1070"></a><span class="c">! Inputs:</span>
-<a id="ln-1071" name="ln-1071" href="#ln-1071"></a><span class="c">! - fun: The function to evaluate</span>
-<a id="ln-1072" name="ln-1072" href="#ln-1072"></a><span class="c">! - xdata: The independent coordinate data to fit (M-by-1)</span>
-<a id="ln-1073" name="ln-1073" href="#ln-1073"></a><span class="c">! - params: The model parameters (N-by-1)</span>
-<a id="ln-1074" name="ln-1074" href="#ln-1074"></a><span class="c">! - f0: The current model estimate (M-by-1)</span>
-<a id="ln-1075" name="ln-1075" href="#ln-1075"></a><span class="c">! - step: The differentiation step size</span>
-<a id="ln-1076" name="ln-1076" href="#ln-1076"></a><span class="c">!</span>
-<a id="ln-1077" name="ln-1077" href="#ln-1077"></a><span class="c">! Outputs:</span>
-<a id="ln-1078" name="ln-1078" href="#ln-1078"></a><span class="c">! - jac: The Jacobian matrix (M-by-N)</span>
-<a id="ln-1079" name="ln-1079" href="#ln-1079"></a><span class="c">! - f1: A workspace array for the model output (M-by-1)</span>
-<a id="ln-1080" name="ln-1080" href="#ln-1080"></a><span class="c">! - stop: A flag allowing the user to terminate model execution</span>
-<a id="ln-1081" name="ln-1081" href="#ln-1081"></a><span class="c">! - work: A workspace array for the model parameters (N-by-1)</span>
-<a id="ln-1082" name="ln-1082" href="#ln-1082"></a><span class="k">subroutine </span><span class="n">jacobian_finite_diff</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">params</span><span class="p">,</span><span class="w"> </span><span class="n">f0</span><span class="p">,</span><span class="w"> </span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="n">f1</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1083" name="ln-1083" href="#ln-1083"></a><span class="w">    </span><span class="k">stop</span><span class="p">,</span><span class="w"> </span><span class="n">step</span><span class="p">,</span><span class="w"> </span><span class="n">work</span><span class="p">)</span>
-<a id="ln-1084" name="ln-1084" href="#ln-1084"></a><span class="w">    </span><span class="c">! Arguments</span>
-<a id="ln-1085" name="ln-1085" href="#ln-1085"></a><span class="w">    </span><span class="k">procedure</span><span class="p">(</span><span class="n">regression_function</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">fun</span>
-<a id="ln-1086" name="ln-1086" href="#ln-1086"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">xdata</span><span class="p">(:),</span><span class="w"> </span><span class="n">params</span><span class="p">(:)</span>
-<a id="ln-1087" name="ln-1087" href="#ln-1087"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">f0</span><span class="p">(:)</span>
-<a id="ln-1088" name="ln-1088" href="#ln-1088"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">jac</span><span class="p">(:,:)</span>
-<a id="ln-1089" name="ln-1089" href="#ln-1089"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">f1</span><span class="p">(:),</span><span class="w"> </span><span class="n">work</span><span class="p">(:)</span>
-<a id="ln-1090" name="ln-1090" href="#ln-1090"></a><span class="w">    </span><span class="kt">logical</span><span class="p">,</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="k">stop</span>
-<a id="ln-1091" name="ln-1091" href="#ln-1091"></a><span class="k">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">step</span>
-<a id="ln-1092" name="ln-1092" href="#ln-1092"></a>
-<a id="ln-1093" name="ln-1093" href="#ln-1093"></a><span class="w">    </span><span class="c">! Local Variables</span>
-<a id="ln-1094" name="ln-1094" href="#ln-1094"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">i</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
-<a id="ln-1095" name="ln-1095" href="#ln-1095"></a>
-<a id="ln-1096" name="ln-1096" href="#ln-1096"></a><span class="w">    </span><span class="c">! Initialization</span>
-<a id="ln-1097" name="ln-1097" href="#ln-1097"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">params</span><span class="p">)</span>
-<a id="ln-1098" name="ln-1098" href="#ln-1098"></a>
-<a id="ln-1099" name="ln-1099" href="#ln-1099"></a><span class="w">    </span><span class="c">! Cycle over each column of the Jacobian and calculate the derivative</span>
-<a id="ln-1100" name="ln-1100" href="#ln-1100"></a><span class="w">    </span><span class="c">! via a forward difference scheme</span>
-<a id="ln-1101" name="ln-1101" href="#ln-1101"></a><span class="w">    </span><span class="c">!</span>
-<a id="ln-1102" name="ln-1102" href="#ln-1102"></a><span class="w">    </span><span class="c">! J(i,j) = df(i) / dx(j)</span>
-<a id="ln-1103" name="ln-1103" href="#ln-1103"></a><span class="w">    </span><span class="n">work</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">params</span>
-<a id="ln-1104" name="ln-1104" href="#ln-1104"></a><span class="w">    </span><span class="k">do </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
-<a id="ln-1105" name="ln-1105" href="#ln-1105"></a><span class="w">        </span><span class="n">work</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">work</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">step</span>
-<a id="ln-1106" name="ln-1106" href="#ln-1106"></a><span class="w">        </span><span class="k">call </span><span class="n">fun</span><span class="p">(</span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">work</span><span class="p">,</span><span class="w"> </span><span class="n">f1</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">)</span>
-<a id="ln-1107" name="ln-1107" href="#ln-1107"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="k">stop</span><span class="p">)</span><span class="w"> </span><span class="k">return</span>
-<a id="ln-1108" name="ln-1108" href="#ln-1108"></a>
-<a id="ln-1109" name="ln-1109" href="#ln-1109"></a><span class="k">        </span><span class="n">jac</span><span class="p">(:,</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">f1</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">f0</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">step</span>
-<a id="ln-1110" name="ln-1110" href="#ln-1110"></a><span class="w">        </span><span class="n">work</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">params</span><span class="p">(</span><span class="n">i</span><span class="p">)</span>
-<a id="ln-1111" name="ln-1111" href="#ln-1111"></a><span class="w">    </span><span class="k">end do</span>
-<a id="ln-1112" name="ln-1112" href="#ln-1112"></a><span class="k">end subroutine</span>
-<a id="ln-1113" name="ln-1113" href="#ln-1113"></a>
-<a id="ln-1114" name="ln-1114" href="#ln-1114"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-1115" name="ln-1115" href="#ln-1115"></a><span class="c">! Computes a rank-1 update to the Jacobian matrix</span>
-<a id="ln-1116" name="ln-1116" href="#ln-1116"></a><span class="c">!</span>
-<a id="ln-1117" name="ln-1117" href="#ln-1117"></a><span class="c">! Inputs:</span>
-<a id="ln-1118" name="ln-1118" href="#ln-1118"></a><span class="c">! - pOld: previous set of parameters (N-by-1)</span>
-<a id="ln-1119" name="ln-1119" href="#ln-1119"></a><span class="c">! - yOld: model evaluation at previous set of parameters (M-by-1)</span>
-<a id="ln-1120" name="ln-1120" href="#ln-1120"></a><span class="c">! - jac: current Jacobian estimate (M-by-N)</span>
-<a id="ln-1121" name="ln-1121" href="#ln-1121"></a><span class="c">! - p: current set of parameters (N-by-1)</span>
-<a id="ln-1122" name="ln-1122" href="#ln-1122"></a><span class="c">! - y: model evaluation at current set of parameters (M-by-1)</span>
-<a id="ln-1123" name="ln-1123" href="#ln-1123"></a><span class="c">! </span>
-<a id="ln-1124" name="ln-1124" href="#ln-1124"></a><span class="c">! Outputs:</span>
-<a id="ln-1125" name="ln-1125" href="#ln-1125"></a><span class="c">! - jac: updated Jacobian matrix (M-by-N) (dy * dp**T + J)</span>
-<a id="ln-1126" name="ln-1126" href="#ln-1126"></a><span class="c">! - dp: p - pOld (N-by-1)</span>
-<a id="ln-1127" name="ln-1127" href="#ln-1127"></a><span class="c">! - dy: (y - yOld - J * dp) / (dp&#39; * dp) (M-by-1)</span>
-<a id="ln-1128" name="ln-1128" href="#ln-1128"></a><span class="k">subroutine </span><span class="n">broyden_update</span><span class="p">(</span><span class="n">pOld</span><span class="p">,</span><span class="w"> </span><span class="n">yOld</span><span class="p">,</span><span class="w"> </span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="n">dp</span><span class="p">,</span><span class="w"> </span><span class="n">dy</span><span class="p">)</span>
-<a id="ln-1129" name="ln-1129" href="#ln-1129"></a><span class="w">    </span><span class="c">! Arguments</span>
-<a id="ln-1130" name="ln-1130" href="#ln-1130"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">pOld</span><span class="p">(:),</span><span class="w"> </span><span class="n">yOld</span><span class="p">(:),</span><span class="w"> </span><span class="n">p</span><span class="p">(:),</span><span class="w"> </span><span class="n">y</span><span class="p">(:)</span>
-<a id="ln-1131" name="ln-1131" href="#ln-1131"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">jac</span><span class="p">(:,:)</span>
-<a id="ln-1132" name="ln-1132" href="#ln-1132"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dp</span><span class="p">(:),</span><span class="w"> </span><span class="n">dy</span><span class="p">(:)</span>
-<a id="ln-1133" name="ln-1133" href="#ln-1133"></a>
-<a id="ln-1134" name="ln-1134" href="#ln-1134"></a><span class="w">    </span><span class="c">! Local Variables</span>
-<a id="ln-1135" name="ln-1135" href="#ln-1135"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">h2</span>
-<a id="ln-1136" name="ln-1136" href="#ln-1136"></a>
-<a id="ln-1137" name="ln-1137" href="#ln-1137"></a><span class="w">    </span><span class="c">! Process</span>
-<a id="ln-1138" name="ln-1138" href="#ln-1138"></a><span class="w">    </span><span class="n">dp</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">p</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">pOld</span>
-<a id="ln-1139" name="ln-1139" href="#ln-1139"></a><span class="w">    </span><span class="n">h2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">dot_product</span><span class="p">(</span><span class="n">dp</span><span class="p">,</span><span class="w"> </span><span class="n">dp</span><span class="p">)</span>
-<a id="ln-1140" name="ln-1140" href="#ln-1140"></a><span class="w">    </span><span class="n">dy</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">yOld</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="nb">matmul</span><span class="p">(</span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="n">dp</span><span class="p">)</span>
-<a id="ln-1141" name="ln-1141" href="#ln-1141"></a><span class="w">    </span><span class="n">dy</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">dy</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">h2</span>
-<a id="ln-1142" name="ln-1142" href="#ln-1142"></a><span class="w">    </span><span class="k">call </span><span class="n">rank1_update</span><span class="p">(</span><span class="mf">1.0d0</span><span class="p">,</span><span class="w"> </span><span class="n">dy</span><span class="p">,</span><span class="w"> </span><span class="n">dp</span><span class="p">,</span><span class="w"> </span><span class="n">jac</span><span class="p">)</span>
-<a id="ln-1143" name="ln-1143" href="#ln-1143"></a><span class="k">end subroutine</span>
-<a id="ln-1144" name="ln-1144" href="#ln-1144"></a>
-<a id="ln-1145" name="ln-1145" href="#ln-1145"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-1146" name="ln-1146" href="#ln-1146"></a><span class="c">! Updates the Levenberg-Marquardt matrix by either computing a new Jacobian</span>
-<a id="ln-1147" name="ln-1147" href="#ln-1147"></a><span class="c">! matrix or performing a rank-1 update to the existing Jacobian matrix.</span>
-<a id="ln-1148" name="ln-1148" href="#ln-1148"></a><span class="c">!</span>
-<a id="ln-1149" name="ln-1149" href="#ln-1149"></a><span class="c">! Inputs:</span>
-<a id="ln-1150" name="ln-1150" href="#ln-1150"></a><span class="c">! - fun: The function to evaluate</span>
-<a id="ln-1151" name="ln-1151" href="#ln-1151"></a><span class="c">! - xdata: The independent coordinate data to fit (M-by-1)</span>
-<a id="ln-1152" name="ln-1152" href="#ln-1152"></a><span class="c">! - ydata: The dependent coordinate data to fit (M-by-1)</span>
-<a id="ln-1153" name="ln-1153" href="#ln-1153"></a><span class="c">! - pOld: previous set of parameters (N-by-1)</span>
-<a id="ln-1154" name="ln-1154" href="#ln-1154"></a><span class="c">! - yOld: model evaluation at previous set of parameters (M-by-1)</span>
-<a id="ln-1155" name="ln-1155" href="#ln-1155"></a><span class="c">! - dX2: The previous change in the Chi-squared criteria</span>
-<a id="ln-1156" name="ln-1156" href="#ln-1156"></a><span class="c">! - jac: current Jacobian estimate (M-by-N)</span>
-<a id="ln-1157" name="ln-1157" href="#ln-1157"></a><span class="c">! - p: current set of parameters (N-by-1)</span>
-<a id="ln-1158" name="ln-1158" href="#ln-1158"></a><span class="c">! - weights: A weighting vector (M-by-1)</span>
-<a id="ln-1159" name="ln-1159" href="#ln-1159"></a><span class="c">! - neval: Current number of function evaluations</span>
-<a id="ln-1160" name="ln-1160" href="#ln-1160"></a><span class="c">! - update: Set to true to force an update of the Jacobian; else, set to</span>
-<a id="ln-1161" name="ln-1161" href="#ln-1161"></a><span class="c">!       false to let the program choose based upon the change in the </span>
-<a id="ln-1162" name="ln-1162" href="#ln-1162"></a><span class="c">!       Chi-squared parameter.</span>
-<a id="ln-1163" name="ln-1163" href="#ln-1163"></a><span class="c">! - step: The differentiation step size</span>
-<a id="ln-1164" name="ln-1164" href="#ln-1164"></a><span class="c">!</span>
-<a id="ln-1165" name="ln-1165" href="#ln-1165"></a><span class="c">! Outputs:</span>
-<a id="ln-1166" name="ln-1166" href="#ln-1166"></a><span class="c">! - JtWJ: linearized Hessian matrix (inverse of the covariance matrix) (N-by-N)</span>
-<a id="ln-1167" name="ln-1167" href="#ln-1167"></a><span class="c">! - JtWdy: linearized fitting vector (N-by-1)</span>
-<a id="ln-1168" name="ln-1168" href="#ln-1168"></a><span class="c">! - X2: Updated Chi-squared criteria</span>
-<a id="ln-1169" name="ln-1169" href="#ln-1169"></a><span class="c">! - yNew: model evaluated with parameters of p (M-by-1)</span>
-<a id="ln-1170" name="ln-1170" href="#ln-1170"></a><span class="c">! - jac: updated Jacobian matrix (M-by-N)</span>
-<a id="ln-1171" name="ln-1171" href="#ln-1171"></a><span class="c">! - neval: updated count of function evaluations</span>
-<a id="ln-1172" name="ln-1172" href="#ln-1172"></a><span class="c">! - stop: A flag allowing the user to terminate model execution</span>
-<a id="ln-1173" name="ln-1173" href="#ln-1173"></a><span class="c">! - work: A workspace array (N+M-by-1)</span>
-<a id="ln-1174" name="ln-1174" href="#ln-1174"></a><span class="c">! - mwork: A workspace matrix (N-by-M)</span>
-<a id="ln-1175" name="ln-1175" href="#ln-1175"></a><span class="c">! - update: Reset to false if a Jacobian evaluation was performed.</span>
-<a id="ln-1176" name="ln-1176" href="#ln-1176"></a><span class="k">subroutine </span><span class="n">lm_matrix</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">ydata</span><span class="p">,</span><span class="w"> </span><span class="n">pOld</span><span class="p">,</span><span class="w"> </span><span class="n">yOld</span><span class="p">,</span><span class="w"> </span><span class="n">dX2</span><span class="p">,</span><span class="w"> </span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">weights</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1177" name="ln-1177" href="#ln-1177"></a><span class="w">    </span><span class="n">neval</span><span class="p">,</span><span class="w"> </span><span class="n">update</span><span class="p">,</span><span class="w"> </span><span class="n">step</span><span class="p">,</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">,</span><span class="w"> </span><span class="n">X2</span><span class="p">,</span><span class="w"> </span><span class="n">yNew</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">,</span><span class="w"> </span><span class="n">work</span><span class="p">,</span><span class="w"> </span><span class="n">mwork</span><span class="p">)</span>
-<a id="ln-1178" name="ln-1178" href="#ln-1178"></a><span class="w">    </span><span class="c">! Arguments</span>
-<a id="ln-1179" name="ln-1179" href="#ln-1179"></a><span class="w">    </span><span class="k">procedure</span><span class="p">(</span><span class="n">regression_function</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">fun</span>
-<a id="ln-1180" name="ln-1180" href="#ln-1180"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">xdata</span><span class="p">(:),</span><span class="w"> </span><span class="n">ydata</span><span class="p">(:),</span><span class="w"> </span><span class="n">pOld</span><span class="p">(:),</span><span class="w"> </span><span class="n">yOld</span><span class="p">(:),</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1181" name="ln-1181" href="#ln-1181"></a><span class="w">        </span><span class="n">p</span><span class="p">(:),</span><span class="w"> </span><span class="n">weights</span><span class="p">(:)</span>
-<a id="ln-1182" name="ln-1182" href="#ln-1182"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dX2</span><span class="p">,</span><span class="w"> </span><span class="n">step</span>
-<a id="ln-1183" name="ln-1183" href="#ln-1183"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">jac</span><span class="p">(:,:)</span>
-<a id="ln-1184" name="ln-1184" href="#ln-1184"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">neval</span>
-<a id="ln-1185" name="ln-1185" href="#ln-1185"></a><span class="w">    </span><span class="kt">logical</span><span class="p">,</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">update</span>
-<a id="ln-1186" name="ln-1186" href="#ln-1186"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">(:,:),</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">(:)</span>
-<a id="ln-1187" name="ln-1187" href="#ln-1187"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">X2</span><span class="p">,</span><span class="w"> </span><span class="n">mwork</span><span class="p">(:,:),</span><span class="w"> </span><span class="n">yNew</span><span class="p">(:)</span>
-<a id="ln-1188" name="ln-1188" href="#ln-1188"></a><span class="w">    </span><span class="kt">logical</span><span class="p">,</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="k">stop</span>
-<a id="ln-1189" name="ln-1189" href="#ln-1189"></a><span class="k">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">),</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">work</span><span class="p">(:)</span>
-<a id="ln-1190" name="ln-1190" href="#ln-1190"></a>
-<a id="ln-1191" name="ln-1191" href="#ln-1191"></a><span class="w">    </span><span class="c">! Local Variables</span>
-<a id="ln-1192" name="ln-1192" href="#ln-1192"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">m</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
-<a id="ln-1193" name="ln-1193" href="#ln-1193"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">w1</span><span class="p">(:),</span><span class="w"> </span><span class="n">w2</span><span class="p">(:)</span>
-<a id="ln-1194" name="ln-1194" href="#ln-1194"></a>
-<a id="ln-1195" name="ln-1195" href="#ln-1195"></a><span class="w">    </span><span class="c">! Initialization</span>
-<a id="ln-1196" name="ln-1196" href="#ln-1196"></a><span class="w">    </span><span class="n">m</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">xdata</span><span class="p">)</span>
-<a id="ln-1197" name="ln-1197" href="#ln-1197"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">p</span><span class="p">)</span>
-<a id="ln-1198" name="ln-1198" href="#ln-1198"></a><span class="w">    </span><span class="n">w1</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">m</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">work</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">m</span><span class="p">)</span>
-<a id="ln-1199" name="ln-1199" href="#ln-1199"></a><span class="w">    </span><span class="n">w2</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">work</span><span class="p">(</span><span class="n">m</span><span class="o">+</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="o">+</span><span class="n">m</span><span class="p">)</span>
-<a id="ln-1200" name="ln-1200" href="#ln-1200"></a>
-<a id="ln-1201" name="ln-1201" href="#ln-1201"></a><span class="w">    </span><span class="c">! Perform the next function evaluation</span>
-<a id="ln-1202" name="ln-1202" href="#ln-1202"></a><span class="w">    </span><span class="k">call </span><span class="n">fun</span><span class="p">(</span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">yNew</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">)</span>
-<a id="ln-1203" name="ln-1203" href="#ln-1203"></a><span class="w">    </span><span class="n">neval</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">neval</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span>
-<a id="ln-1204" name="ln-1204" href="#ln-1204"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="k">stop</span><span class="p">)</span><span class="w"> </span><span class="k">return</span>
-<a id="ln-1205" name="ln-1205" href="#ln-1205"></a>
-<a id="ln-1206" name="ln-1206" href="#ln-1206"></a><span class="w">    </span><span class="c">! Update or recompute the Jacobian matrix</span>
-<a id="ln-1207" name="ln-1207" href="#ln-1207"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">dX2</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="p">.</span><span class="nb">or</span><span class="p">.</span><span class="w"> </span><span class="n">update</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-1208" name="ln-1208" href="#ln-1208"></a><span class="w">        </span><span class="c">! Recompute the Jacobian</span>
-<a id="ln-1209" name="ln-1209" href="#ln-1209"></a><span class="w">        </span><span class="k">call </span><span class="n">jacobian_finite_diff</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">yNew</span><span class="p">,</span><span class="w"> </span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="n">w1</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1210" name="ln-1210" href="#ln-1210"></a><span class="w">            </span><span class="k">stop</span><span class="p">,</span><span class="w"> </span><span class="n">step</span><span class="p">,</span><span class="w"> </span><span class="n">w2</span><span class="p">)</span>
-<a id="ln-1211" name="ln-1211" href="#ln-1211"></a><span class="w">        </span><span class="n">neval</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">neval</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">n</span>
-<a id="ln-1212" name="ln-1212" href="#ln-1212"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="k">stop</span><span class="p">)</span><span class="w"> </span><span class="k">return</span>
-<a id="ln-1213" name="ln-1213" href="#ln-1213"></a><span class="k">        </span><span class="n">update</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">false</span><span class="p">.</span>
-<a id="ln-1214" name="ln-1214" href="#ln-1214"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-1215" name="ln-1215" href="#ln-1215"></a><span class="w">        </span><span class="c">! Simply perform a rank-1 update to the Jacobian</span>
-<a id="ln-1216" name="ln-1216" href="#ln-1216"></a><span class="w">        </span><span class="k">call </span><span class="n">broyden_update</span><span class="p">(</span><span class="n">pOld</span><span class="p">,</span><span class="w"> </span><span class="n">yOld</span><span class="p">,</span><span class="w"> </span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">yNew</span><span class="p">,</span><span class="w"> </span><span class="n">w2</span><span class="p">,</span><span class="w"> </span><span class="n">w1</span><span class="p">)</span>
-<a id="ln-1217" name="ln-1217" href="#ln-1217"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-1218" name="ln-1218" href="#ln-1218"></a>
-<a id="ln-1219" name="ln-1219" href="#ln-1219"></a><span class="w">    </span><span class="c">! Update the Chi-squared estimate</span>
-<a id="ln-1220" name="ln-1220" href="#ln-1220"></a><span class="w">    </span><span class="n">w1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">ydata</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">yNew</span>
-<a id="ln-1221" name="ln-1221" href="#ln-1221"></a><span class="w">    </span><span class="n">X2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">dot_product</span><span class="p">(</span><span class="n">w1</span><span class="p">,</span><span class="w"> </span><span class="n">w1</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">weights</span><span class="p">)</span>
-<a id="ln-1222" name="ln-1222" href="#ln-1222"></a>
-<a id="ln-1223" name="ln-1223" href="#ln-1223"></a><span class="w">    </span><span class="c">! Compute J**T * (W .* dY)</span>
-<a id="ln-1224" name="ln-1224" href="#ln-1224"></a><span class="w">    </span><span class="n">w1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">w1</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">weights</span>
-<a id="ln-1225" name="ln-1225" href="#ln-1225"></a><span class="w">    </span><span class="k">call </span><span class="n">mtx_mult</span><span class="p">(.</span><span class="n">true</span><span class="p">.,</span><span class="w"> </span><span class="mf">1.0d0</span><span class="p">,</span><span class="w"> </span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="n">w1</span><span class="p">,</span><span class="w"> </span><span class="mf">0.0d0</span><span class="p">,</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">)</span>
-<a id="ln-1226" name="ln-1226" href="#ln-1226"></a>
-<a id="ln-1227" name="ln-1227" href="#ln-1227"></a><span class="w">    </span><span class="c">! Update the Hessian</span>
-<a id="ln-1228" name="ln-1228" href="#ln-1228"></a><span class="w">    </span><span class="c">! First: J**T * W = MWORK</span>
-<a id="ln-1229" name="ln-1229" href="#ln-1229"></a><span class="w">    </span><span class="c">! Second: (J**T * W) * J</span>
-<a id="ln-1230" name="ln-1230" href="#ln-1230"></a><span class="w">    </span><span class="k">call </span><span class="n">diag_mtx_mult</span><span class="p">(.</span><span class="n">false</span><span class="p">.,</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.,</span><span class="w"> </span><span class="mf">1.0d0</span><span class="p">,</span><span class="w"> </span><span class="n">weights</span><span class="p">,</span><span class="w"> </span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="mf">0.0d0</span><span class="p">,</span><span class="w"> </span><span class="n">mwork</span><span class="p">)</span>
-<a id="ln-1231" name="ln-1231" href="#ln-1231"></a><span class="w">    </span><span class="k">call </span><span class="n">mtx_mult</span><span class="p">(.</span><span class="n">false</span><span class="p">.,</span><span class="w"> </span><span class="p">.</span><span class="n">false</span><span class="p">.,</span><span class="w"> </span><span class="mf">1.0d0</span><span class="p">,</span><span class="w"> </span><span class="n">mwork</span><span class="p">,</span><span class="w"> </span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="mf">0.0d0</span><span class="p">,</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">)</span>
-<a id="ln-1232" name="ln-1232" href="#ln-1232"></a><span class="k">end subroutine</span>
-<a id="ln-1233" name="ln-1233" href="#ln-1233"></a>
-<a id="ln-1234" name="ln-1234" href="#ln-1234"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-1235" name="ln-1235" href="#ln-1235"></a><span class="c">! Performs a single iteration of the Levenberg-Marquardt algorithm.</span>
-<a id="ln-1236" name="ln-1236" href="#ln-1236"></a><span class="c">!</span>
-<a id="ln-1237" name="ln-1237" href="#ln-1237"></a><span class="c">! Inputs:</span>
-<a id="ln-1238" name="ln-1238" href="#ln-1238"></a><span class="c">! - fun: The function to evaluate</span>
-<a id="ln-1239" name="ln-1239" href="#ln-1239"></a><span class="c">! - xdata: The independent coordinate data to fit (M-by-1)</span>
-<a id="ln-1240" name="ln-1240" href="#ln-1240"></a><span class="c">! - ydata: The dependent coordinate data to fit (M-by-1)</span>
-<a id="ln-1241" name="ln-1241" href="#ln-1241"></a><span class="c">! - p: current set of parameters (N-by-1)</span>
-<a id="ln-1242" name="ln-1242" href="#ln-1242"></a><span class="c">! - neval: current number of function evaluations</span>
-<a id="ln-1243" name="ln-1243" href="#ln-1243"></a><span class="c">! - niter: current iteration number</span>
-<a id="ln-1244" name="ln-1244" href="#ln-1244"></a><span class="c">! - update: set to 1 to use Marquardt&#39;s modification; else, </span>
-<a id="ln-1245" name="ln-1245" href="#ln-1245"></a><span class="c">! - step: the differentiation step size</span>
-<a id="ln-1246" name="ln-1246" href="#ln-1246"></a><span class="c">! - lambda: LM damping parameter</span>
-<a id="ln-1247" name="ln-1247" href="#ln-1247"></a><span class="c">! - maxP: maximum limits on the parameters.  Use huge() or larger for no constraints (N-by-1)</span>
-<a id="ln-1248" name="ln-1248" href="#ln-1248"></a><span class="c">! - minP: minimum limits on the parameters.  Use -huge() or smaller for no constraints (N-by-1)</span>
-<a id="ln-1249" name="ln-1249" href="#ln-1249"></a><span class="c">! - weights: a weighting vector (M-by-1)</span>
-<a id="ln-1250" name="ln-1250" href="#ln-1250"></a><span class="c">! - JtWJ: linearized Hessian matrix (inverse of the covariance matrix) (N-by-N)</span>
-<a id="ln-1251" name="ln-1251" href="#ln-1251"></a><span class="c">! - JtWdy: linearized fitting vector (N-by-1)</span>
-<a id="ln-1252" name="ln-1252" href="#ln-1252"></a><span class="c">!</span>
-<a id="ln-1253" name="ln-1253" href="#ln-1253"></a><span class="c">! Outputs:</span>
-<a id="ln-1254" name="ln-1254" href="#ln-1254"></a><span class="c">! - JtWJ: overwritten LU factorization of the original matrix (N-by-N)</span>
-<a id="ln-1255" name="ln-1255" href="#ln-1255"></a><span class="c">! - h: The new estimate of the change in parameter (N-by-1)</span>
-<a id="ln-1256" name="ln-1256" href="#ln-1256"></a><span class="c">! - pNew: The new parameter estimates (N-by-1)</span>
-<a id="ln-1257" name="ln-1257" href="#ln-1257"></a><span class="c">! - deltaY: The new difference between data and model (M-by-1)</span>
-<a id="ln-1258" name="ln-1258" href="#ln-1258"></a><span class="c">! - yNew: model evaluated with parameters of pNew (M-by-1)</span>
-<a id="ln-1259" name="ln-1259" href="#ln-1259"></a><span class="c">! - neval: updated count of function evaluations</span>
-<a id="ln-1260" name="ln-1260" href="#ln-1260"></a><span class="c">! - niter: updated current iteration number</span>
-<a id="ln-1261" name="ln-1261" href="#ln-1261"></a><span class="c">! - X2: updated Chi-squared criteria</span>
-<a id="ln-1262" name="ln-1262" href="#ln-1262"></a><span class="c">! - stop: A flag allowing the user to terminate model execution</span>
-<a id="ln-1263" name="ln-1263" href="#ln-1263"></a><span class="c">! - iwork: A workspace array (N-by-1)</span>
-<a id="ln-1264" name="ln-1264" href="#ln-1264"></a><span class="c">! - err: An error handling mechanism</span>
-<a id="ln-1265" name="ln-1265" href="#ln-1265"></a><span class="k">subroutine </span><span class="n">lm_iter</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">ydata</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">neval</span><span class="p">,</span><span class="w"> </span><span class="n">niter</span><span class="p">,</span><span class="w"> </span><span class="n">update</span><span class="p">,</span><span class="w"> </span><span class="n">lambda</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1266" name="ln-1266" href="#ln-1266"></a><span class="w">    </span><span class="n">maxP</span><span class="p">,</span><span class="w"> </span><span class="n">minP</span><span class="p">,</span><span class="w"> </span><span class="n">weights</span><span class="p">,</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">,</span><span class="w"> </span><span class="n">h</span><span class="p">,</span><span class="w"> </span><span class="n">pNew</span><span class="p">,</span><span class="w"> </span><span class="n">deltaY</span><span class="p">,</span><span class="w"> </span><span class="n">yNew</span><span class="p">,</span><span class="w"> </span><span class="n">X2</span><span class="p">,</span><span class="w"> </span><span class="n">X2Old</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1267" name="ln-1267" href="#ln-1267"></a><span class="w">    </span><span class="n">alpha</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">,</span><span class="w"> </span><span class="n">iwork</span><span class="p">,</span><span class="w"> </span><span class="n">err</span><span class="p">,</span><span class="w"> </span><span class="n">status</span><span class="p">)</span>
-<a id="ln-1268" name="ln-1268" href="#ln-1268"></a><span class="w">    </span><span class="c">! Arguments</span>
-<a id="ln-1269" name="ln-1269" href="#ln-1269"></a><span class="w">    </span><span class="k">procedure</span><span class="p">(</span><span class="n">regression_function</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">fun</span>
-<a id="ln-1270" name="ln-1270" href="#ln-1270"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">xdata</span><span class="p">(:),</span><span class="w"> </span><span class="n">ydata</span><span class="p">(:),</span><span class="w"> </span><span class="n">p</span><span class="p">(:),</span><span class="w"> </span><span class="n">maxP</span><span class="p">(:),</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1271" name="ln-1271" href="#ln-1271"></a><span class="w">        </span><span class="n">minP</span><span class="p">(:),</span><span class="w"> </span><span class="n">weights</span><span class="p">(:),</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">(:)</span>
-<a id="ln-1272" name="ln-1272" href="#ln-1272"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">lambda</span><span class="p">,</span><span class="w"> </span><span class="n">X2Old</span>
-<a id="ln-1273" name="ln-1273" href="#ln-1273"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">neval</span><span class="p">,</span><span class="w"> </span><span class="n">niter</span>
-<a id="ln-1274" name="ln-1274" href="#ln-1274"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">update</span>
-<a id="ln-1275" name="ln-1275" href="#ln-1275"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">(:,:)</span>
-<a id="ln-1276" name="ln-1276" href="#ln-1276"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">h</span><span class="p">(:),</span><span class="w"> </span><span class="n">pNew</span><span class="p">(:),</span><span class="w"> </span><span class="n">deltaY</span><span class="p">(:),</span><span class="w"> </span><span class="n">yNew</span><span class="p">(:)</span>
-<a id="ln-1277" name="ln-1277" href="#ln-1277"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">X2</span><span class="p">,</span><span class="w"> </span><span class="n">alpha</span>
-<a id="ln-1278" name="ln-1278" href="#ln-1278"></a><span class="w">    </span><span class="kt">logical</span><span class="p">,</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="k">stop</span>
-<a id="ln-1279" name="ln-1279" href="#ln-1279"></a><span class="k">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">iwork</span><span class="p">(:)</span>
-<a id="ln-1280" name="ln-1280" href="#ln-1280"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">err</span>
-<a id="ln-1281" name="ln-1281" href="#ln-1281"></a><span class="w">    </span><span class="k">procedure</span><span class="p">(</span><span class="n">iteration_update</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="p">,</span><span class="w"> </span><span class="k">optional</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">status</span>
-<a id="ln-1282" name="ln-1282" href="#ln-1282"></a>
-<a id="ln-1283" name="ln-1283" href="#ln-1283"></a><span class="w">    </span><span class="c">! Local Variables</span>
-<a id="ln-1284" name="ln-1284" href="#ln-1284"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">i</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
-<a id="ln-1285" name="ln-1285" href="#ln-1285"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dpJh</span>
-<a id="ln-1286" name="ln-1286" href="#ln-1286"></a>
-<a id="ln-1287" name="ln-1287" href="#ln-1287"></a><span class="w">    </span><span class="c">! Initialization</span>
-<a id="ln-1288" name="ln-1288" href="#ln-1288"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">p</span><span class="p">)</span>
-<a id="ln-1289" name="ln-1289" href="#ln-1289"></a>
-<a id="ln-1290" name="ln-1290" href="#ln-1290"></a><span class="w">    </span><span class="c">! Increment the iteration counter</span>
-<a id="ln-1291" name="ln-1291" href="#ln-1291"></a><span class="w">    </span><span class="n">niter</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">niter</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span>
-<a id="ln-1292" name="ln-1292" href="#ln-1292"></a>
-<a id="ln-1293" name="ln-1293" href="#ln-1293"></a><span class="w">    </span><span class="c">! Solve the linear system to determine the change in parameters</span>
-<a id="ln-1294" name="ln-1294" href="#ln-1294"></a><span class="w">    </span><span class="c">! A is N-by-N and is stored in JtWJ</span>
-<a id="ln-1295" name="ln-1295" href="#ln-1295"></a><span class="w">    </span><span class="c">! b is N-by-1</span>
-<a id="ln-1296" name="ln-1296" href="#ln-1296"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">update</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">FS_LEVENBERG_MARQUARDT_UPDATE</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-1297" name="ln-1297" href="#ln-1297"></a><span class="w">        </span><span class="c">! Compute: h = A \ b</span>
-<a id="ln-1298" name="ln-1298" href="#ln-1298"></a><span class="w">        </span><span class="c">! A = J**T * W * J + lambda * diag(J**T * W * J)</span>
-<a id="ln-1299" name="ln-1299" href="#ln-1299"></a><span class="w">        </span><span class="c">! b = J**T * W * dy</span>
-<a id="ln-1300" name="ln-1300" href="#ln-1300"></a><span class="w">        </span><span class="k">do </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
-<a id="ln-1301" name="ln-1301" href="#ln-1301"></a><span class="w">            </span><span class="n">JtWJ</span><span class="p">(</span><span class="n">i</span><span class="p">,</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">(</span><span class="n">i</span><span class="p">,</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="p">(</span><span class="mf">1.0d0</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">lambda</span><span class="p">)</span>
-<a id="ln-1302" name="ln-1302" href="#ln-1302"></a><span class="w">            </span><span class="n">h</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">(</span><span class="n">i</span><span class="p">)</span>
-<a id="ln-1303" name="ln-1303" href="#ln-1303"></a><span class="w">        </span><span class="k">end do</span>
-<a id="ln-1304" name="ln-1304" href="#ln-1304"></a><span class="k">    else</span>
-<a id="ln-1305" name="ln-1305" href="#ln-1305"></a><span class="w">        </span><span class="c">! Compute: h = A \ b</span>
-<a id="ln-1306" name="ln-1306" href="#ln-1306"></a><span class="w">        </span><span class="c">! A = J**T * W * J + lambda * I</span>
-<a id="ln-1307" name="ln-1307" href="#ln-1307"></a><span class="w">        </span><span class="c">! b = J**T * W * dy</span>
-<a id="ln-1308" name="ln-1308" href="#ln-1308"></a><span class="w">        </span><span class="k">do </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
-<a id="ln-1309" name="ln-1309" href="#ln-1309"></a><span class="w">            </span><span class="n">JtWJ</span><span class="p">(</span><span class="n">i</span><span class="p">,</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">(</span><span class="n">i</span><span class="p">,</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">lambda</span>
-<a id="ln-1310" name="ln-1310" href="#ln-1310"></a><span class="w">            </span><span class="n">h</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">(</span><span class="n">i</span><span class="p">)</span>
-<a id="ln-1311" name="ln-1311" href="#ln-1311"></a><span class="w">        </span><span class="k">end do</span>
-<a id="ln-1312" name="ln-1312" href="#ln-1312"></a><span class="k">    end if</span>
-<a id="ln-1313" name="ln-1313" href="#ln-1313"></a><span class="k">    call </span><span class="n">lu_factor</span><span class="p">(</span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="n">iwork</span><span class="p">,</span><span class="w"> </span><span class="n">err</span><span class="p">)</span><span class="w">        </span><span class="c">! overwrites JtWJ with [L\U]</span>
-<a id="ln-1314" name="ln-1314" href="#ln-1314"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">err</span><span class="p">%</span><span class="n">has_error_occurred</span><span class="p">())</span><span class="w"> </span><span class="k">return</span><span class="w">    </span><span class="c">! if JtWJ is singular</span>
-<a id="ln-1315" name="ln-1315" href="#ln-1315"></a><span class="w">    </span><span class="k">call </span><span class="n">solve_lu</span><span class="p">(</span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="n">iwork</span><span class="p">,</span><span class="w"> </span><span class="n">h</span><span class="p">)</span><span class="w">           </span><span class="c">! solution stored in h</span>
-<a id="ln-1316" name="ln-1316" href="#ln-1316"></a>
-<a id="ln-1317" name="ln-1317" href="#ln-1317"></a><span class="w">    </span><span class="c">! Compute the new attempted solution, and apply any constraints</span>
-<a id="ln-1318" name="ln-1318" href="#ln-1318"></a><span class="w">    </span><span class="k">do </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
-<a id="ln-1319" name="ln-1319" href="#ln-1319"></a><span class="w">        </span><span class="n">pNew</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">min</span><span class="p">(</span><span class="nb">max</span><span class="p">(</span><span class="n">minP</span><span class="p">(</span><span class="n">i</span><span class="p">),</span><span class="w"> </span><span class="n">h</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">p</span><span class="p">(</span><span class="n">i</span><span class="p">)),</span><span class="w"> </span><span class="n">maxP</span><span class="p">(</span><span class="n">i</span><span class="p">))</span>
-<a id="ln-1320" name="ln-1320" href="#ln-1320"></a><span class="w">    </span><span class="k">end do</span>
-<a id="ln-1321" name="ln-1321" href="#ln-1321"></a>
-<a id="ln-1322" name="ln-1322" href="#ln-1322"></a><span class="w">    </span><span class="c">! Update the residual error</span>
-<a id="ln-1323" name="ln-1323" href="#ln-1323"></a><span class="w">    </span><span class="k">call </span><span class="n">fun</span><span class="p">(</span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">pNew</span><span class="p">,</span><span class="w"> </span><span class="n">yNew</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">)</span>
-<a id="ln-1324" name="ln-1324" href="#ln-1324"></a><span class="w">    </span><span class="n">neval</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">neval</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span>
-<a id="ln-1325" name="ln-1325" href="#ln-1325"></a><span class="w">    </span><span class="n">deltaY</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">ydata</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">yNew</span>
-<a id="ln-1326" name="ln-1326" href="#ln-1326"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="k">stop</span><span class="p">)</span><span class="w"> </span><span class="k">return</span>
-<a id="ln-1327" name="ln-1327" href="#ln-1327"></a>
-<a id="ln-1328" name="ln-1328" href="#ln-1328"></a><span class="w">    </span><span class="c">! Update the Chi-squared estimate</span>
-<a id="ln-1329" name="ln-1329" href="#ln-1329"></a><span class="w">    </span><span class="n">X2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">dot_product</span><span class="p">(</span><span class="n">deltaY</span><span class="p">,</span><span class="w"> </span><span class="n">deltaY</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">weights</span><span class="p">)</span>
-<a id="ln-1330" name="ln-1330" href="#ln-1330"></a>
-<a id="ln-1331" name="ln-1331" href="#ln-1331"></a><span class="w">    </span><span class="c">! Perform a quadratic line update in the H direction, if necessary</span>
-<a id="ln-1332" name="ln-1332" href="#ln-1332"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">update</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">FS_QUADRATIC_UPDATE</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-1333" name="ln-1333" href="#ln-1333"></a><span class="k">        </span><span class="n">dpJh</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">dot_product</span><span class="p">(</span><span class="n">JtWdy</span><span class="p">,</span><span class="w"> </span><span class="n">h</span><span class="p">)</span>
-<a id="ln-1334" name="ln-1334" href="#ln-1334"></a><span class="w">        </span><span class="n">alpha</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">abs</span><span class="p">(</span><span class="n">dpJh</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="p">(</span><span class="mf">0.5d0</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="p">(</span><span class="n">X2</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">X2Old</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mf">2.0d0</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">dpJh</span><span class="p">))</span>
-<a id="ln-1335" name="ln-1335" href="#ln-1335"></a><span class="w">        </span><span class="n">h</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">alpha</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">h</span>
-<a id="ln-1336" name="ln-1336" href="#ln-1336"></a>
-<a id="ln-1337" name="ln-1337" href="#ln-1337"></a><span class="w">        </span><span class="k">do </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
-<a id="ln-1338" name="ln-1338" href="#ln-1338"></a><span class="w">            </span><span class="n">pNew</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">min</span><span class="p">(</span><span class="nb">max</span><span class="p">(</span><span class="n">minP</span><span class="p">(</span><span class="n">i</span><span class="p">),</span><span class="w"> </span><span class="n">p</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">h</span><span class="p">(</span><span class="n">i</span><span class="p">)),</span><span class="w"> </span><span class="n">maxP</span><span class="p">(</span><span class="n">i</span><span class="p">))</span>
-<a id="ln-1339" name="ln-1339" href="#ln-1339"></a><span class="w">        </span><span class="k">end do</span>
-<a id="ln-1340" name="ln-1340" href="#ln-1340"></a>
-<a id="ln-1341" name="ln-1341" href="#ln-1341"></a><span class="k">        call </span><span class="n">fun</span><span class="p">(</span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">pNew</span><span class="p">,</span><span class="w"> </span><span class="n">yNew</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">)</span>
-<a id="ln-1342" name="ln-1342" href="#ln-1342"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="k">stop</span><span class="p">)</span><span class="w"> </span><span class="k">return</span>
-<a id="ln-1343" name="ln-1343" href="#ln-1343"></a><span class="k">        </span><span class="n">neval</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">neval</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span>
-<a id="ln-1344" name="ln-1344" href="#ln-1344"></a><span class="w">        </span><span class="n">deltaY</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">ydata</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">yNew</span>
-<a id="ln-1345" name="ln-1345" href="#ln-1345"></a><span class="w">        </span><span class="n">X2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">dot_product</span><span class="p">(</span><span class="n">deltaY</span><span class="p">,</span><span class="w"> </span><span class="n">deltaY</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">weights</span><span class="p">)</span>
-<a id="ln-1346" name="ln-1346" href="#ln-1346"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-1347" name="ln-1347" href="#ln-1347"></a>
-<a id="ln-1348" name="ln-1348" href="#ln-1348"></a><span class="w">    </span><span class="c">! Update the status of the iteration, if needed</span>
-<a id="ln-1349" name="ln-1349" href="#ln-1349"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">status</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-1350" name="ln-1350" href="#ln-1350"></a><span class="k">        call </span><span class="n">status</span><span class="p">(</span><span class="n">niter</span><span class="p">,</span><span class="w"> </span><span class="n">yNew</span><span class="p">,</span><span class="w"> </span><span class="n">deltaY</span><span class="p">,</span><span class="w"> </span><span class="n">pNew</span><span class="p">,</span><span class="w"> </span><span class="n">h</span><span class="p">)</span>
-<a id="ln-1351" name="ln-1351" href="#ln-1351"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-1352" name="ln-1352" href="#ln-1352"></a><span class="k">end subroutine</span>
-<a id="ln-1353" name="ln-1353" href="#ln-1353"></a>
-<a id="ln-1354" name="ln-1354" href="#ln-1354"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-1355" name="ln-1355" href="#ln-1355"></a><span class="c">! A Levenberg-Marquardt solver.</span>
-<a id="ln-1356" name="ln-1356" href="#ln-1356"></a><span class="c">!</span>
-<a id="ln-1357" name="ln-1357" href="#ln-1357"></a><span class="c">! Inputs:</span>
-<a id="ln-1358" name="ln-1358" href="#ln-1358"></a><span class="c">! - fun: The function to evaluate</span>
-<a id="ln-1359" name="ln-1359" href="#ln-1359"></a><span class="c">! - xdata: The independent coordinate data to fit (M-by-1)</span>
-<a id="ln-1360" name="ln-1360" href="#ln-1360"></a><span class="c">! - ydata: The dependent coordinate data to fit (M-by-1)</span>
-<a id="ln-1361" name="ln-1361" href="#ln-1361"></a><span class="c">! - p: current set of parameters (N-by-1)</span>
-<a id="ln-1362" name="ln-1362" href="#ln-1362"></a><span class="c">! - weights: a weighting vector (M-by-1)</span>
-<a id="ln-1363" name="ln-1363" href="#ln-1363"></a><span class="c">! - maxP: maximum limits on the parameters.  Use huge() or larger for no constraints (N-by-1)</span>
-<a id="ln-1364" name="ln-1364" href="#ln-1364"></a><span class="c">! - minP: minimum limits on the parameters.  Use -huge() or smaller for no constraints (N-by-1)</span>
-<a id="ln-1365" name="ln-1365" href="#ln-1365"></a><span class="c">! - controls: an iteration_controls instance containing solution tolerances</span>
-<a id="ln-1366" name="ln-1366" href="#ln-1366"></a><span class="c">!</span>
-<a id="ln-1367" name="ln-1367" href="#ln-1367"></a><span class="c">! Outputs:</span>
-<a id="ln-1368" name="ln-1368" href="#ln-1368"></a><span class="c">! - p: solution (N-by-1)</span>
-<a id="ln-1369" name="ln-1369" href="#ln-1369"></a><span class="c">! - y: model results at p (M-by-1)</span>
-<a id="ln-1370" name="ln-1370" href="#ln-1370"></a><span class="c">! - resid: residual (ydata - y) (M-by-1)</span>
-<a id="ln-1371" name="ln-1371" href="#ln-1371"></a><span class="c">! - JtWJ: linearized Hessian matrix (inverse of the covariance matrix) (N-by-N)</span>
-<a id="ln-1372" name="ln-1372" href="#ln-1372"></a><span class="c">! - opt: a convergence_info object containing information regarding </span>
-<a id="ln-1373" name="ln-1373" href="#ln-1373"></a><span class="c">!       convergence of the iteration</span>
-<a id="ln-1374" name="ln-1374" href="#ln-1374"></a><span class="c">! - stop: A flag allowing the user to terminate model execution</span>
-<a id="ln-1375" name="ln-1375" href="#ln-1375"></a><span class="c">! - err: An error handling object</span>
-<a id="ln-1376" name="ln-1376" href="#ln-1376"></a><span class="k">subroutine </span><span class="n">lm_solve</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">ydata</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">weights</span><span class="p">,</span><span class="w"> </span><span class="n">maxP</span><span class="p">,</span><span class="w"> </span><span class="n">minP</span><span class="p">,</span><span class="w"> </span><span class="n">controls</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1377" name="ln-1377" href="#ln-1377"></a><span class="w">    </span><span class="n">opt</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="n">resid</span><span class="p">,</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="n">info</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">,</span><span class="w"> </span><span class="n">err</span><span class="p">,</span><span class="w"> </span><span class="n">status</span><span class="p">)</span>
-<a id="ln-1378" name="ln-1378" href="#ln-1378"></a><span class="w">    </span><span class="c">! Arguments</span>
-<a id="ln-1379" name="ln-1379" href="#ln-1379"></a><span class="w">    </span><span class="k">procedure</span><span class="p">(</span><span class="n">regression_function</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">fun</span>
-<a id="ln-1380" name="ln-1380" href="#ln-1380"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">xdata</span><span class="p">(:),</span><span class="w"> </span><span class="n">ydata</span><span class="p">(:),</span><span class="w"> </span><span class="n">weights</span><span class="p">(:),</span><span class="w"> </span><span class="n">maxP</span><span class="p">(:),</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1381" name="ln-1381" href="#ln-1381"></a><span class="w">        </span><span class="n">minP</span><span class="p">(:)</span>
-<a id="ln-1382" name="ln-1382" href="#ln-1382"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">p</span><span class="p">(:)</span>
-<a id="ln-1383" name="ln-1383" href="#ln-1383"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">iteration_controls</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">controls</span>
-<a id="ln-1384" name="ln-1384" href="#ln-1384"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">lm_solver_options</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">opt</span>
-<a id="ln-1385" name="ln-1385" href="#ln-1385"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">y</span><span class="p">(:),</span><span class="w"> </span><span class="n">resid</span><span class="p">(:),</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">(:,:)</span>
-<a id="ln-1386" name="ln-1386" href="#ln-1386"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">convergence_info</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">info</span>
-<a id="ln-1387" name="ln-1387" href="#ln-1387"></a><span class="w">    </span><span class="kt">logical</span><span class="p">,</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="k">stop</span>
-<a id="ln-1388" name="ln-1388" href="#ln-1388"></a><span class="k">    class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">err</span>
-<a id="ln-1389" name="ln-1389" href="#ln-1389"></a><span class="w">    </span><span class="k">procedure</span><span class="p">(</span><span class="n">iteration_update</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="p">,</span><span class="w"> </span><span class="k">optional</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">status</span>
-<a id="ln-1390" name="ln-1390" href="#ln-1390"></a>
-<a id="ln-1391" name="ln-1391" href="#ln-1391"></a><span class="w">    </span><span class="c">! Local Variables</span>
-<a id="ln-1392" name="ln-1392" href="#ln-1392"></a><span class="w">    </span><span class="kt">logical</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">update</span>
-<a id="ln-1393" name="ln-1393" href="#ln-1393"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">i</span><span class="p">,</span><span class="w"> </span><span class="n">m</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">dof</span><span class="p">,</span><span class="w"> </span><span class="n">flag</span><span class="p">,</span><span class="w"> </span><span class="n">neval</span><span class="p">,</span><span class="w"> </span><span class="n">niter</span><span class="p">,</span><span class="w"> </span><span class="n">nupdate</span>
-<a id="ln-1394" name="ln-1394" href="#ln-1394"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dX2</span><span class="p">,</span><span class="w"> </span><span class="n">X2</span><span class="p">,</span><span class="w"> </span><span class="n">X2Old</span><span class="p">,</span><span class="w"> </span><span class="n">X2Try</span><span class="p">,</span><span class="w"> </span><span class="n">lambda</span><span class="p">,</span><span class="w"> </span><span class="n">alpha</span><span class="p">,</span><span class="w"> </span><span class="n">nu</span><span class="p">,</span><span class="w"> </span><span class="n">step</span>
-<a id="ln-1395" name="ln-1395" href="#ln-1395"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">allocatable</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">pOld</span><span class="p">(:),</span><span class="w"> </span><span class="n">yOld</span><span class="p">(:),</span><span class="w"> </span><span class="n">J</span><span class="p">(:,:),</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">(:),</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1396" name="ln-1396" href="#ln-1396"></a><span class="w">        </span><span class="n">work</span><span class="p">(:),</span><span class="w"> </span><span class="n">mwork</span><span class="p">(:,:),</span><span class="w"> </span><span class="n">pTry</span><span class="p">(:),</span><span class="w"> </span><span class="n">yTemp</span><span class="p">(:),</span><span class="w"> </span><span class="n">JtWJc</span><span class="p">(:,:),</span><span class="w"> </span><span class="n">h</span><span class="p">(:)</span>
-<a id="ln-1397" name="ln-1397" href="#ln-1397"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">allocatable</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">iwork</span><span class="p">(:)</span>
-<a id="ln-1398" name="ln-1398" href="#ln-1398"></a><span class="w">    </span><span class="kt">character</span><span class="p">(</span><span class="nb">len</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">:),</span><span class="w"> </span><span class="k">allocatable</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">errmsg</span>
-<a id="ln-1399" name="ln-1399" href="#ln-1399"></a>
-<a id="ln-1400" name="ln-1400" href="#ln-1400"></a><span class="w">    </span><span class="c">! Initialization</span>
-<a id="ln-1401" name="ln-1401" href="#ln-1401"></a><span class="w">    </span><span class="n">update</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.</span>
-<a id="ln-1402" name="ln-1402" href="#ln-1402"></a><span class="w">    </span><span class="n">m</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">xdata</span><span class="p">)</span>
-<a id="ln-1403" name="ln-1403" href="#ln-1403"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">p</span><span class="p">)</span>
-<a id="ln-1404" name="ln-1404" href="#ln-1404"></a><span class="w">    </span><span class="n">dof</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">m</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">n</span>
-<a id="ln-1405" name="ln-1405" href="#ln-1405"></a><span class="w">    </span><span class="n">niter</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span>
-<a id="ln-1406" name="ln-1406" href="#ln-1406"></a><span class="w">    </span><span class="n">step</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">opt</span><span class="p">%</span><span class="n">finite_difference_step_size</span>
-<a id="ln-1407" name="ln-1407" href="#ln-1407"></a><span class="w">    </span><span class="k">stop</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">false</span><span class="p">.</span>
-<a id="ln-1408" name="ln-1408" href="#ln-1408"></a><span class="w">    </span><span class="n">info</span><span class="p">%</span><span class="n">user_requested_stop</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">false</span><span class="p">.</span>
-<a id="ln-1409" name="ln-1409" href="#ln-1409"></a><span class="w">    </span><span class="n">nupdate</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span>
-<a id="ln-1410" name="ln-1410" href="#ln-1410"></a>
-<a id="ln-1411" name="ln-1411" href="#ln-1411"></a><span class="w">    </span><span class="c">! Local Memory Allocation</span>
-<a id="ln-1412" name="ln-1412" href="#ln-1412"></a><span class="w">    </span><span class="k">allocate</span><span class="p">(</span><span class="n">pOld</span><span class="p">(</span><span class="n">n</span><span class="p">),</span><span class="w"> </span><span class="n">source</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.0d0</span><span class="p">,</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
-<a id="ln-1413" name="ln-1413" href="#ln-1413"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">allocate</span><span class="p">(</span><span class="n">yOld</span><span class="p">(</span><span class="n">m</span><span class="p">),</span><span class="w"> </span><span class="n">source</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.0d0</span><span class="p">,</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
-<a id="ln-1414" name="ln-1414" href="#ln-1414"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">allocate</span><span class="p">(</span><span class="n">J</span><span class="p">(</span><span class="n">m</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
-<a id="ln-1415" name="ln-1415" href="#ln-1415"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">allocate</span><span class="p">(</span><span class="n">JtWdy</span><span class="p">(</span><span class="n">n</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
-<a id="ln-1416" name="ln-1416" href="#ln-1416"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">allocate</span><span class="p">(</span><span class="n">work</span><span class="p">(</span><span class="n">m</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">n</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
-<a id="ln-1417" name="ln-1417" href="#ln-1417"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">allocate</span><span class="p">(</span><span class="n">mwork</span><span class="p">(</span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">m</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
-<a id="ln-1418" name="ln-1418" href="#ln-1418"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">allocate</span><span class="p">(</span><span class="n">pTry</span><span class="p">(</span><span class="n">n</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
-<a id="ln-1419" name="ln-1419" href="#ln-1419"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">allocate</span><span class="p">(</span><span class="n">h</span><span class="p">(</span><span class="n">n</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
-<a id="ln-1420" name="ln-1420" href="#ln-1420"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">allocate</span><span class="p">(</span><span class="n">yTemp</span><span class="p">(</span><span class="n">m</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
-<a id="ln-1421" name="ln-1421" href="#ln-1421"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">allocate</span><span class="p">(</span><span class="n">JtWJc</span><span class="p">(</span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
-<a id="ln-1422" name="ln-1422" href="#ln-1422"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">allocate</span><span class="p">(</span><span class="n">iwork</span><span class="p">(</span><span class="n">n</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
-<a id="ln-1423" name="ln-1423" href="#ln-1423"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">go</span><span class="w"> </span><span class="k">to</span><span class="w"> </span><span class="mi">10</span>
-<a id="ln-1424" name="ln-1424" href="#ln-1424"></a>
-<a id="ln-1425" name="ln-1425" href="#ln-1425"></a><span class="w">    </span><span class="c">! Perform an initial function evaluation</span>
-<a id="ln-1426" name="ln-1426" href="#ln-1426"></a><span class="w">    </span><span class="k">call </span><span class="n">fun</span><span class="p">(</span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">)</span>
-<a id="ln-1427" name="ln-1427" href="#ln-1427"></a><span class="w">    </span><span class="n">neval</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span>
-<a id="ln-1428" name="ln-1428" href="#ln-1428"></a>
-<a id="ln-1429" name="ln-1429" href="#ln-1429"></a><span class="w">    </span><span class="c">! Evaluate the problem matrices</span>
-<a id="ln-1430" name="ln-1430" href="#ln-1430"></a><span class="w">    </span><span class="k">call </span><span class="n">lm_matrix</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">ydata</span><span class="p">,</span><span class="w"> </span><span class="n">pOld</span><span class="p">,</span><span class="w"> </span><span class="n">yOld</span><span class="p">,</span><span class="w"> </span><span class="mf">1.0d0</span><span class="p">,</span><span class="w"> </span><span class="n">J</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">weights</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1431" name="ln-1431" href="#ln-1431"></a><span class="w">        </span><span class="n">neval</span><span class="p">,</span><span class="w"> </span><span class="n">update</span><span class="p">,</span><span class="w"> </span><span class="n">step</span><span class="p">,</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">,</span><span class="w"> </span><span class="n">X2</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">,</span><span class="w"> </span><span class="n">work</span><span class="p">,</span><span class="w"> </span><span class="n">mwork</span><span class="p">)</span>
-<a id="ln-1432" name="ln-1432" href="#ln-1432"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="k">stop</span><span class="p">)</span><span class="w"> </span><span class="k">go</span><span class="w"> </span><span class="k">to</span><span class="w"> </span><span class="mi">5</span>
-<a id="ln-1433" name="ln-1433" href="#ln-1433"></a><span class="w">    </span><span class="n">X2Old</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">X2</span>
-<a id="ln-1434" name="ln-1434" href="#ln-1434"></a><span class="w">    </span><span class="n">JtWJc</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">JtWJ</span>
-<a id="ln-1435" name="ln-1435" href="#ln-1435"></a>
-<a id="ln-1436" name="ln-1436" href="#ln-1436"></a><span class="w">    </span><span class="c">! Determine an initial value for lambda</span>
-<a id="ln-1437" name="ln-1437" href="#ln-1437"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">opt</span><span class="p">%</span><span class="n">method</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">FS_LEVENBERG_MARQUARDT_UPDATE</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-1438" name="ln-1438" href="#ln-1438"></a><span class="k">        </span><span class="n">lambda</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d-2</span>
-<a id="ln-1439" name="ln-1439" href="#ln-1439"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-1440" name="ln-1440" href="#ln-1440"></a><span class="k">        call </span><span class="n">extract_diagonal</span><span class="p">(</span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="n">work</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">))</span>
-<a id="ln-1441" name="ln-1441" href="#ln-1441"></a><span class="w">        </span><span class="n">lambda</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d-2</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="nb">maxval</span><span class="p">(</span><span class="n">work</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">))</span>
-<a id="ln-1442" name="ln-1442" href="#ln-1442"></a><span class="w">        </span><span class="n">nu</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">2.0d0</span>
-<a id="ln-1443" name="ln-1443" href="#ln-1443"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-1444" name="ln-1444" href="#ln-1444"></a>
-<a id="ln-1445" name="ln-1445" href="#ln-1445"></a><span class="w">    </span><span class="c">! Main Loop</span>
-<a id="ln-1446" name="ln-1446" href="#ln-1446"></a><span class="w">    </span><span class="n">main</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="k">do while</span><span class="w"> </span><span class="p">(</span><span class="n">niter</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">controls</span><span class="p">%</span><span class="n">max_iteration_count</span><span class="p">)</span>
-<a id="ln-1447" name="ln-1447" href="#ln-1447"></a><span class="w">        </span><span class="c">! Compute the linear solution at the current solution estimate and</span>
-<a id="ln-1448" name="ln-1448" href="#ln-1448"></a><span class="w">        </span><span class="c">! update the new parameter estimates</span>
-<a id="ln-1449" name="ln-1449" href="#ln-1449"></a><span class="w">        </span><span class="k">call </span><span class="n">lm_iter</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">ydata</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">neval</span><span class="p">,</span><span class="w"> </span><span class="n">niter</span><span class="p">,</span><span class="w"> </span><span class="n">opt</span><span class="p">%</span><span class="n">method</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1450" name="ln-1450" href="#ln-1450"></a><span class="w">            </span><span class="n">lambda</span><span class="p">,</span><span class="w"> </span><span class="n">maxP</span><span class="p">,</span><span class="w"> </span><span class="n">minP</span><span class="p">,</span><span class="w"> </span><span class="n">weights</span><span class="p">,</span><span class="w"> </span><span class="n">JtWJc</span><span class="p">,</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">,</span><span class="w"> </span><span class="n">h</span><span class="p">,</span><span class="w"> </span><span class="n">pTry</span><span class="p">,</span><span class="w"> </span><span class="n">resid</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1451" name="ln-1451" href="#ln-1451"></a><span class="w">            </span><span class="n">yTemp</span><span class="p">,</span><span class="w"> </span><span class="n">X2Try</span><span class="p">,</span><span class="w"> </span><span class="n">X2Old</span><span class="p">,</span><span class="w"> </span><span class="n">alpha</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">,</span><span class="w"> </span><span class="n">iwork</span><span class="p">,</span><span class="w"> </span><span class="n">err</span><span class="p">,</span><span class="w"> </span><span class="n">status</span><span class="p">)</span>
-<a id="ln-1452" name="ln-1452" href="#ln-1452"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="k">stop</span><span class="p">)</span><span class="w"> </span><span class="k">go</span><span class="w"> </span><span class="k">to</span><span class="w"> </span><span class="mi">5</span>
-<a id="ln-1453" name="ln-1453" href="#ln-1453"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">err</span><span class="p">%</span><span class="n">has_error_occurred</span><span class="p">())</span><span class="w"> </span><span class="k">return</span>
-<a id="ln-1454" name="ln-1454" href="#ln-1454"></a>
-<a id="ln-1455" name="ln-1455" href="#ln-1455"></a><span class="w">        </span><span class="c">! Update the Chi-squared estimate, update the damping parameter</span>
-<a id="ln-1456" name="ln-1456" href="#ln-1456"></a><span class="w">        </span><span class="c">! lambda, and, if necessary, update the matrices</span>
-<a id="ln-1457" name="ln-1457" href="#ln-1457"></a><span class="w">        </span><span class="k">call </span><span class="n">lm_update</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">ydata</span><span class="p">,</span><span class="w"> </span><span class="n">pOld</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">pTry</span><span class="p">,</span><span class="w"> </span><span class="n">yOld</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="n">h</span><span class="p">,</span><span class="w"> </span><span class="n">dX2</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1458" name="ln-1458" href="#ln-1458"></a><span class="w">            </span><span class="n">X2Old</span><span class="p">,</span><span class="w"> </span><span class="n">X2</span><span class="p">,</span><span class="w"> </span><span class="n">X2Try</span><span class="p">,</span><span class="w"> </span><span class="n">lambda</span><span class="p">,</span><span class="w"> </span><span class="n">alpha</span><span class="p">,</span><span class="w"> </span><span class="n">nu</span><span class="p">,</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">,</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="n">J</span><span class="p">,</span><span class="w"> </span><span class="n">weights</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1459" name="ln-1459" href="#ln-1459"></a><span class="w">            </span><span class="n">niter</span><span class="p">,</span><span class="w"> </span><span class="n">neval</span><span class="p">,</span><span class="w"> </span><span class="n">update</span><span class="p">,</span><span class="w"> </span><span class="n">step</span><span class="p">,</span><span class="w"> </span><span class="n">work</span><span class="p">,</span><span class="w"> </span><span class="n">mwork</span><span class="p">,</span><span class="w"> </span><span class="n">controls</span><span class="p">,</span><span class="w"> </span><span class="n">opt</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">)</span>
-<a id="ln-1460" name="ln-1460" href="#ln-1460"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="k">stop</span><span class="p">)</span><span class="w"> </span><span class="k">go</span><span class="w"> </span><span class="k">to</span><span class="w"> </span><span class="mi">5</span>
-<a id="ln-1461" name="ln-1461" href="#ln-1461"></a><span class="w">        </span><span class="n">JtWJc</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">JtWJ</span>
-<a id="ln-1462" name="ln-1462" href="#ln-1462"></a>
-<a id="ln-1463" name="ln-1463" href="#ln-1463"></a><span class="w">        </span><span class="c">! Determine the matrix update scheme</span>
-<a id="ln-1464" name="ln-1464" href="#ln-1464"></a><span class="w">        </span><span class="n">nupdate</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">nupdate</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span>
-<a id="ln-1465" name="ln-1465" href="#ln-1465"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">opt</span><span class="p">%</span><span class="n">method</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">FS_QUADRATIC_UPDATE</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-1466" name="ln-1466" href="#ln-1466"></a><span class="k">            </span><span class="n">update</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">mod</span><span class="p">(</span><span class="n">niter</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="mi">0</span>
-<a id="ln-1467" name="ln-1467" href="#ln-1467"></a><span class="w">        </span><span class="k">else if</span><span class="w"> </span><span class="p">(</span><span class="n">nupdate</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="n">controls</span><span class="p">%</span><span class="n">max_iteration_between_updates</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-1468" name="ln-1468" href="#ln-1468"></a><span class="k">            </span><span class="n">update</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.</span>
-<a id="ln-1469" name="ln-1469" href="#ln-1469"></a><span class="w">            </span><span class="n">nupdate</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span>
-<a id="ln-1470" name="ln-1470" href="#ln-1470"></a><span class="w">        </span><span class="k">end if</span>
-<a id="ln-1471" name="ln-1471" href="#ln-1471"></a>
-<a id="ln-1472" name="ln-1472" href="#ln-1472"></a><span class="w">        </span><span class="c">! Test for convergence</span>
-<a id="ln-1473" name="ln-1473" href="#ln-1473"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">lm_check_convergence</span><span class="p">(</span><span class="n">controls</span><span class="p">,</span><span class="w"> </span><span class="n">dof</span><span class="p">,</span><span class="w"> </span><span class="n">resid</span><span class="p">,</span><span class="w"> </span><span class="n">niter</span><span class="p">,</span><span class="w"> </span><span class="n">neval</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1474" name="ln-1474" href="#ln-1474"></a><span class="w">            </span><span class="n">JtWdy</span><span class="p">,</span><span class="w"> </span><span class="n">h</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">X2</span><span class="p">,</span><span class="w"> </span><span class="n">info</span><span class="p">))</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1475" name="ln-1475" href="#ln-1475"></a><span class="w">        </span><span class="k">then</span>
-<a id="ln-1476" name="ln-1476" href="#ln-1476"></a><span class="k">            exit </span><span class="n">main</span>
-<a id="ln-1477" name="ln-1477" href="#ln-1477"></a><span class="w">        </span><span class="k">end if</span>
-<a id="ln-1478" name="ln-1478" href="#ln-1478"></a><span class="k">    end do </span><span class="n">main</span>
-<a id="ln-1479" name="ln-1479" href="#ln-1479"></a>
-<a id="ln-1480" name="ln-1480" href="#ln-1480"></a><span class="w">    </span><span class="c">! End</span>
-<a id="ln-1481" name="ln-1481" href="#ln-1481"></a><span class="w">    </span><span class="k">return</span>
-<a id="ln-1482" name="ln-1482" href="#ln-1482"></a>
-<a id="ln-1483" name="ln-1483" href="#ln-1483"></a><span class="w">    </span><span class="c">! User Requested End</span>
-<a id="ln-1484" name="ln-1484" href="#ln-1484"></a><span class="mi">5</span><span class="w">       </span><span class="k">continue</span>
-<a id="ln-1485" name="ln-1485" href="#ln-1485"></a><span class="k">    </span><span class="n">info</span><span class="p">%</span><span class="n">user_requested_stop</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.</span>
-<a id="ln-1486" name="ln-1486" href="#ln-1486"></a><span class="w">    </span><span class="k">return</span>
-<a id="ln-1487" name="ln-1487" href="#ln-1487"></a>
-<a id="ln-1488" name="ln-1488" href="#ln-1488"></a><span class="w">    </span><span class="c">! Memory Error Handling</span>
-<a id="ln-1489" name="ln-1489" href="#ln-1489"></a><span class="mi">10</span><span class="w">      </span><span class="k">continue</span>
-<a id="ln-1490" name="ln-1490" href="#ln-1490"></a><span class="k">    allocate</span><span class="p">(</span><span class="kt">character</span><span class="p">(</span><span class="nb">len</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">512</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">errmsg</span><span class="p">)</span>
-<a id="ln-1491" name="ln-1491" href="#ln-1491"></a><span class="w">    </span><span class="k">write</span><span class="p">(</span><span class="n">errmsg</span><span class="p">,</span><span class="w"> </span><span class="mi">100</span><span class="p">)</span><span class="w"> </span><span class="s2">&quot;Memory allocation error code &quot;</span><span class="p">,</span><span class="w"> </span><span class="n">flag</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;.&quot;</span>
-<a id="ln-1492" name="ln-1492" href="#ln-1492"></a><span class="w">    </span><span class="k">call </span><span class="n">err</span><span class="p">%</span><span class="n">report_error</span><span class="p">(</span><span class="s2">&quot;lm_solve&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1493" name="ln-1493" href="#ln-1493"></a><span class="w">        </span><span class="nb">trim</span><span class="p">(</span><span class="n">errmsg</span><span class="p">),</span><span class="w"> </span><span class="n">FS_MEMORY_ERROR</span><span class="p">)</span>
-<a id="ln-1494" name="ln-1494" href="#ln-1494"></a><span class="w">    </span><span class="k">return</span>
-<a id="ln-1495" name="ln-1495" href="#ln-1495"></a>
-<a id="ln-1496" name="ln-1496" href="#ln-1496"></a><span class="w">    </span><span class="c">! Formatting</span>
-<a id="ln-1497" name="ln-1497" href="#ln-1497"></a><span class="mi">100</span><span class="w">     </span><span class="k">format</span><span class="p">(</span><span class="n">A</span><span class="p">,</span><span class="w"> </span><span class="n">I0</span><span class="p">,</span><span class="w"> </span><span class="n">A</span><span class="p">)</span>
-<a id="ln-1498" name="ln-1498" href="#ln-1498"></a><span class="k">end subroutine</span>
-<a id="ln-1499" name="ln-1499" href="#ln-1499"></a>
-<a id="ln-1500" name="ln-1500" href="#ln-1500"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-1501" name="ln-1501" href="#ln-1501"></a><span class="c">!</span>
-<a id="ln-1502" name="ln-1502" href="#ln-1502"></a><span class="k">subroutine </span><span class="n">lm_update</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">ydata</span><span class="p">,</span><span class="w"> </span><span class="n">pOld</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">pTry</span><span class="p">,</span><span class="w"> </span><span class="n">yOld</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="n">h</span><span class="p">,</span><span class="w"> </span><span class="n">dX2</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1503" name="ln-1503" href="#ln-1503"></a><span class="w">    </span><span class="n">X2old</span><span class="p">,</span><span class="w"> </span><span class="n">X2</span><span class="p">,</span><span class="w"> </span><span class="n">X2try</span><span class="p">,</span><span class="w"> </span><span class="n">lambda</span><span class="p">,</span><span class="w"> </span><span class="n">alpha</span><span class="p">,</span><span class="w"> </span><span class="n">nu</span><span class="p">,</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">,</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="n">J</span><span class="p">,</span><span class="w"> </span><span class="n">weights</span><span class="p">,</span><span class="w"> </span><span class="n">niter</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1504" name="ln-1504" href="#ln-1504"></a><span class="w">    </span><span class="n">neval</span><span class="p">,</span><span class="w"> </span><span class="n">update</span><span class="p">,</span><span class="w"> </span><span class="n">step</span><span class="p">,</span><span class="w"> </span><span class="n">work</span><span class="p">,</span><span class="w"> </span><span class="n">mwork</span><span class="p">,</span><span class="w"> </span><span class="n">controls</span><span class="p">,</span><span class="w"> </span><span class="n">opt</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">)</span>
-<a id="ln-1505" name="ln-1505" href="#ln-1505"></a><span class="w">    </span><span class="c">! Arguments</span>
-<a id="ln-1506" name="ln-1506" href="#ln-1506"></a><span class="w">    </span><span class="k">procedure</span><span class="p">(</span><span class="n">regression_function</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">fun</span>
-<a id="ln-1507" name="ln-1507" href="#ln-1507"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">xdata</span><span class="p">(:),</span><span class="w"> </span><span class="n">ydata</span><span class="p">(:),</span><span class="w"> </span><span class="n">X2try</span><span class="p">,</span><span class="w"> </span><span class="n">h</span><span class="p">(:),</span><span class="w"> </span><span class="n">step</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1508" name="ln-1508" href="#ln-1508"></a><span class="w">        </span><span class="n">pTry</span><span class="p">(:),</span><span class="w"> </span><span class="n">weights</span><span class="p">(:),</span><span class="w"> </span><span class="n">alpha</span>
-<a id="ln-1509" name="ln-1509" href="#ln-1509"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">pOld</span><span class="p">(:),</span><span class="w"> </span><span class="n">p</span><span class="p">(:),</span><span class="w"> </span><span class="n">yOld</span><span class="p">(:),</span><span class="w"> </span><span class="n">y</span><span class="p">(:),</span><span class="w"> </span><span class="n">lambda</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1510" name="ln-1510" href="#ln-1510"></a><span class="w">        </span><span class="n">JtWdy</span><span class="p">(:),</span><span class="w"> </span><span class="n">dX2</span><span class="p">,</span><span class="w"> </span><span class="n">X2</span><span class="p">,</span><span class="w"> </span><span class="n">X2old</span><span class="p">,</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">(:,:),</span><span class="w"> </span><span class="n">J</span><span class="p">(:,:),</span><span class="w"> </span><span class="n">nu</span>
-<a id="ln-1511" name="ln-1511" href="#ln-1511"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">work</span><span class="p">(:),</span><span class="w"> </span><span class="n">mwork</span><span class="p">(:,:)</span>
-<a id="ln-1512" name="ln-1512" href="#ln-1512"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">niter</span>
-<a id="ln-1513" name="ln-1513" href="#ln-1513"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">neval</span>
-<a id="ln-1514" name="ln-1514" href="#ln-1514"></a><span class="w">    </span><span class="kt">logical</span><span class="p">,</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">update</span>
-<a id="ln-1515" name="ln-1515" href="#ln-1515"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">iteration_controls</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">controls</span>
-<a id="ln-1516" name="ln-1516" href="#ln-1516"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">lm_solver_options</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">opt</span>
-<a id="ln-1517" name="ln-1517" href="#ln-1517"></a><span class="w">    </span><span class="kt">logical</span><span class="p">,</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="k">stop</span>
-<a id="ln-1518" name="ln-1518" href="#ln-1518"></a>
-<a id="ln-1519" name="ln-1519" href="#ln-1519"></a><span class="w">    </span><span class="c">! Local Variables</span>
-<a id="ln-1520" name="ln-1520" href="#ln-1520"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">n</span>
-<a id="ln-1521" name="ln-1521" href="#ln-1521"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">rho</span>
-<a id="ln-1522" name="ln-1522" href="#ln-1522"></a>
-<a id="ln-1523" name="ln-1523" href="#ln-1523"></a><span class="w">    </span><span class="c">! Initialization</span>
-<a id="ln-1524" name="ln-1524" href="#ln-1524"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">p</span><span class="p">)</span>
-<a id="ln-1525" name="ln-1525" href="#ln-1525"></a>
-<a id="ln-1526" name="ln-1526" href="#ln-1526"></a><span class="w">    </span><span class="c">! Process</span>
-<a id="ln-1527" name="ln-1527" href="#ln-1527"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">opt</span><span class="p">%</span><span class="n">method</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">FS_LEVENBERG_MARQUARDT_UPDATE</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-1528" name="ln-1528" href="#ln-1528"></a><span class="k">        call </span><span class="n">extract_diagonal</span><span class="p">(</span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="n">work</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">))</span>
-<a id="ln-1529" name="ln-1529" href="#ln-1529"></a><span class="w">        </span><span class="n">work</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">lambda</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">work</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">h</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">JtWdy</span>
-<a id="ln-1530" name="ln-1530" href="#ln-1530"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-1531" name="ln-1531" href="#ln-1531"></a><span class="k">        </span><span class="n">work</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">lambda</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">h</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">JtWdy</span>
-<a id="ln-1532" name="ln-1532" href="#ln-1532"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-1533" name="ln-1533" href="#ln-1533"></a><span class="k">    </span><span class="n">rho</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">X2</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">X2try</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="nb">abs</span><span class="p">(</span><span class="nb">dot_product</span><span class="p">(</span><span class="n">h</span><span class="p">,</span><span class="w"> </span><span class="n">work</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">)))</span>
-<a id="ln-1534" name="ln-1534" href="#ln-1534"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">rho</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="n">controls</span><span class="p">%</span><span class="n">iteration_improvement_tolerance</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-1535" name="ln-1535" href="#ln-1535"></a><span class="w">        </span><span class="c">! Things are getting better at an acceptable rate</span>
-<a id="ln-1536" name="ln-1536" href="#ln-1536"></a><span class="w">        </span><span class="n">dX2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">X2</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">X2old</span>
-<a id="ln-1537" name="ln-1537" href="#ln-1537"></a><span class="w">        </span><span class="n">X2old</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">X2</span>
-<a id="ln-1538" name="ln-1538" href="#ln-1538"></a><span class="w">        </span><span class="n">pOld</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">p</span>
-<a id="ln-1539" name="ln-1539" href="#ln-1539"></a><span class="w">        </span><span class="n">yOld</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">y</span>
-<a id="ln-1540" name="ln-1540" href="#ln-1540"></a><span class="w">        </span><span class="n">p</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">pTry</span>
-<a id="ln-1541" name="ln-1541" href="#ln-1541"></a>
-<a id="ln-1542" name="ln-1542" href="#ln-1542"></a><span class="w">        </span><span class="c">! Recompute the matrices</span>
-<a id="ln-1543" name="ln-1543" href="#ln-1543"></a><span class="w">        </span><span class="k">call </span><span class="n">lm_matrix</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">ydata</span><span class="p">,</span><span class="w"> </span><span class="n">pOld</span><span class="p">,</span><span class="w"> </span><span class="n">yOld</span><span class="p">,</span><span class="w"> </span><span class="n">dX2</span><span class="p">,</span><span class="w"> </span><span class="n">J</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">weights</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1544" name="ln-1544" href="#ln-1544"></a><span class="w">            </span><span class="n">neval</span><span class="p">,</span><span class="w"> </span><span class="n">update</span><span class="p">,</span><span class="w"> </span><span class="n">step</span><span class="p">,</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">,</span><span class="w"> </span><span class="n">X2</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">,</span><span class="w"> </span><span class="n">work</span><span class="p">,</span><span class="w"> </span><span class="n">mwork</span><span class="p">)</span>
-<a id="ln-1545" name="ln-1545" href="#ln-1545"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="k">stop</span><span class="p">)</span><span class="w"> </span><span class="k">return</span>
-<a id="ln-1546" name="ln-1546" href="#ln-1546"></a>
-<a id="ln-1547" name="ln-1547" href="#ln-1547"></a><span class="w">        </span><span class="c">! Decrease lambda</span>
-<a id="ln-1548" name="ln-1548" href="#ln-1548"></a><span class="w">        </span><span class="k">select case</span><span class="w"> </span><span class="p">(</span><span class="n">opt</span><span class="p">%</span><span class="n">method</span><span class="p">)</span>
-<a id="ln-1549" name="ln-1549" href="#ln-1549"></a><span class="w">        </span><span class="k">case</span><span class="w"> </span><span class="p">(</span><span class="n">FS_LEVENBERG_MARQUARDT_UPDATE</span><span class="p">)</span>
-<a id="ln-1550" name="ln-1550" href="#ln-1550"></a><span class="w">            </span><span class="n">lambda</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">max</span><span class="p">(</span><span class="n">lambda</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">opt</span><span class="p">%</span><span class="n">damping_decrease_factor</span><span class="p">,</span><span class="w"> </span><span class="mf">1.0d-7</span><span class="p">)</span>
-<a id="ln-1551" name="ln-1551" href="#ln-1551"></a><span class="w">        </span><span class="k">case</span><span class="w"> </span><span class="p">(</span><span class="n">FS_QUADRATIC_UPDATE</span><span class="p">)</span>
-<a id="ln-1552" name="ln-1552" href="#ln-1552"></a><span class="w">            </span><span class="n">lambda</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">max</span><span class="p">(</span><span class="n">lambda</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="p">(</span><span class="mf">1.0d0</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">alpha</span><span class="p">),</span><span class="w"> </span><span class="mf">1.0d-7</span><span class="p">)</span>
-<a id="ln-1553" name="ln-1553" href="#ln-1553"></a><span class="w">        </span><span class="k">case</span><span class="w"> </span><span class="p">(</span><span class="n">FS_NIELSEN_UPDATE</span><span class="p">)</span>
-<a id="ln-1554" name="ln-1554" href="#ln-1554"></a><span class="w">            </span><span class="n">lambda</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">lambda</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="nb">max</span><span class="p">(</span><span class="mf">1.0d0</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="mf">3.0d0</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1555" name="ln-1555" href="#ln-1555"></a><span class="w">                </span><span class="mf">1.0d0</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="p">(</span><span class="mf">2.0d0</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">rho</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mf">1.0d0</span><span class="o">**</span><span class="mi">3</span><span class="p">))</span>
-<a id="ln-1556" name="ln-1556" href="#ln-1556"></a><span class="w">            </span><span class="n">nu</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">2.0d0</span>
-<a id="ln-1557" name="ln-1557" href="#ln-1557"></a><span class="w">        </span><span class="k">end select</span>
-<a id="ln-1558" name="ln-1558" href="#ln-1558"></a><span class="k">    else</span>
-<a id="ln-1559" name="ln-1559" href="#ln-1559"></a><span class="w">        </span><span class="c">! The iteration is not improving in a satisfactory manner</span>
-<a id="ln-1560" name="ln-1560" href="#ln-1560"></a><span class="w">        </span><span class="n">X2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">X2old</span>
-<a id="ln-1561" name="ln-1561" href="#ln-1561"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">mod</span><span class="p">(</span><span class="n">niter</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-1562" name="ln-1562" href="#ln-1562"></a><span class="k">            call </span><span class="n">lm_matrix</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">ydata</span><span class="p">,</span><span class="w"> </span><span class="n">pOld</span><span class="p">,</span><span class="w"> </span><span class="n">yOld</span><span class="p">,</span><span class="w"> </span><span class="o">-</span><span class="mf">1.0d0</span><span class="p">,</span><span class="w"> </span><span class="n">J</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1563" name="ln-1563" href="#ln-1563"></a><span class="w">                </span><span class="n">weights</span><span class="p">,</span><span class="w"> </span><span class="n">neval</span><span class="p">,</span><span class="w"> </span><span class="n">update</span><span class="p">,</span><span class="w"> </span><span class="n">step</span><span class="p">,</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">,</span><span class="w"> </span><span class="n">dX2</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1564" name="ln-1564" href="#ln-1564"></a><span class="w">                </span><span class="n">work</span><span class="p">,</span><span class="w"> </span><span class="n">mwork</span><span class="p">)</span>
-<a id="ln-1565" name="ln-1565" href="#ln-1565"></a><span class="w">            </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="k">stop</span><span class="p">)</span><span class="w"> </span><span class="k">return</span>
-<a id="ln-1566" name="ln-1566" href="#ln-1566"></a><span class="k">        end if</span>
-<a id="ln-1567" name="ln-1567" href="#ln-1567"></a>
-<a id="ln-1568" name="ln-1568" href="#ln-1568"></a><span class="w">        </span><span class="c">! Increase lambda</span>
-<a id="ln-1569" name="ln-1569" href="#ln-1569"></a><span class="w">        </span><span class="k">select case</span><span class="w"> </span><span class="p">(</span><span class="n">opt</span><span class="p">%</span><span class="n">method</span><span class="p">)</span>
-<a id="ln-1570" name="ln-1570" href="#ln-1570"></a><span class="w">        </span><span class="k">case</span><span class="w"> </span><span class="p">(</span><span class="n">FS_LEVENBERG_MARQUARDT_UPDATE</span><span class="p">)</span>
-<a id="ln-1571" name="ln-1571" href="#ln-1571"></a><span class="w">            </span><span class="n">lambda</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">min</span><span class="p">(</span><span class="n">lambda</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">opt</span><span class="p">%</span><span class="n">damping_increase_factor</span><span class="p">,</span><span class="w"> </span><span class="mf">1.0d7</span><span class="p">)</span>
-<a id="ln-1572" name="ln-1572" href="#ln-1572"></a><span class="w">        </span><span class="k">case</span><span class="w"> </span><span class="p">(</span><span class="n">FS_QUADRATIC_UPDATE</span><span class="p">)</span>
-<a id="ln-1573" name="ln-1573" href="#ln-1573"></a><span class="w">            </span><span class="n">lambda</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">lambda</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="nb">abs</span><span class="p">((</span><span class="n">X2try</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">X2</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="mf">2.0d0</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">alpha</span><span class="p">)</span>
-<a id="ln-1574" name="ln-1574" href="#ln-1574"></a><span class="w">        </span><span class="k">case</span><span class="w"> </span><span class="p">(</span><span class="n">FS_NIELSEN_UPDATE</span><span class="p">)</span>
-<a id="ln-1575" name="ln-1575" href="#ln-1575"></a><span class="w">            </span><span class="n">lambda</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">lambda</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">nu</span>
-<a id="ln-1576" name="ln-1576" href="#ln-1576"></a><span class="w">            </span><span class="n">nu</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">2.0d0</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">nu</span>
-<a id="ln-1577" name="ln-1577" href="#ln-1577"></a><span class="w">        </span><span class="k">end select</span>
-<a id="ln-1578" name="ln-1578" href="#ln-1578"></a><span class="k">    end if</span>
-<a id="ln-1579" name="ln-1579" href="#ln-1579"></a><span class="k">end subroutine</span>
-<a id="ln-1580" name="ln-1580" href="#ln-1580"></a>
-<a id="ln-1581" name="ln-1581" href="#ln-1581"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-1582" name="ln-1582" href="#ln-1582"></a><span class="c">! Checks the Levenberg-Marquardt solution against the convergence criteria.</span>
-<a id="ln-1583" name="ln-1583" href="#ln-1583"></a><span class="c">!</span>
-<a id="ln-1584" name="ln-1584" href="#ln-1584"></a><span class="c">! Inputs:</span>
-<a id="ln-1585" name="ln-1585" href="#ln-1585"></a><span class="c">! - controls: the solution controls and convergence criteria</span>
-<a id="ln-1586" name="ln-1586" href="#ln-1586"></a><span class="c">! - dof: the statistical degrees of freedom of the system (M - N)</span>
-<a id="ln-1587" name="ln-1587" href="#ln-1587"></a><span class="c">! - resid: the residual error (M-by-1)</span>
-<a id="ln-1588" name="ln-1588" href="#ln-1588"></a><span class="c">! - niter: the number of iterations</span>
-<a id="ln-1589" name="ln-1589" href="#ln-1589"></a><span class="c">! - neval: the number of function evaluations</span>
-<a id="ln-1590" name="ln-1590" href="#ln-1590"></a><span class="c">! - JtWdy: linearized fitting vector (N-by-1)</span>
-<a id="ln-1591" name="ln-1591" href="#ln-1591"></a><span class="c">! - h: the change in parameter (solution) values (N-by-1)</span>
-<a id="ln-1592" name="ln-1592" href="#ln-1592"></a><span class="c">! - p: the parameter (solution) values (N-by-1)</span>
-<a id="ln-1593" name="ln-1593" href="#ln-1593"></a><span class="c">! - X2: the Chi-squared estimate</span>
-<a id="ln-1594" name="ln-1594" href="#ln-1594"></a><span class="c">!</span>
-<a id="ln-1595" name="ln-1595" href="#ln-1595"></a><span class="c">! Outputs:</span>
-<a id="ln-1596" name="ln-1596" href="#ln-1596"></a><span class="c">! - info: The convergence information.</span>
-<a id="ln-1597" name="ln-1597" href="#ln-1597"></a><span class="c">! - rst: True if convergence was achieved; else, false.</span>
-<a id="ln-1598" name="ln-1598" href="#ln-1598"></a><span class="k">function </span><span class="n">lm_check_convergence</span><span class="p">(</span><span class="n">controls</span><span class="p">,</span><span class="w"> </span><span class="n">dof</span><span class="p">,</span><span class="w"> </span><span class="n">resid</span><span class="p">,</span><span class="w"> </span><span class="n">niter</span><span class="p">,</span><span class="w"> </span><span class="n">neval</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1599" name="ln-1599" href="#ln-1599"></a><span class="w">    </span><span class="n">JtWdy</span><span class="p">,</span><span class="w"> </span><span class="n">h</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">X2</span><span class="p">,</span><span class="w"> </span><span class="n">info</span><span class="p">)</span><span class="w"> </span><span class="k">result</span><span class="p">(</span><span class="n">rst</span><span class="p">)</span>
-<a id="ln-1600" name="ln-1600" href="#ln-1600"></a><span class="w">    </span><span class="c">! Arguments</span>
-<a id="ln-1601" name="ln-1601" href="#ln-1601"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">iteration_controls</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">controls</span>
-<a id="ln-1602" name="ln-1602" href="#ln-1602"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">resid</span><span class="p">(:),</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">(:),</span><span class="w"> </span><span class="n">h</span><span class="p">(:),</span><span class="w"> </span><span class="n">p</span><span class="p">(:),</span><span class="w"> </span><span class="n">X2</span>
-<a id="ln-1603" name="ln-1603" href="#ln-1603"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dof</span><span class="p">,</span><span class="w"> </span><span class="n">niter</span><span class="p">,</span><span class="w"> </span><span class="n">neval</span>
-<a id="ln-1604" name="ln-1604" href="#ln-1604"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">convergence_info</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">info</span>
-<a id="ln-1605" name="ln-1605" href="#ln-1605"></a><span class="w">    </span><span class="kt">logical</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">rst</span>
-<a id="ln-1606" name="ln-1606" href="#ln-1606"></a>
-<a id="ln-1607" name="ln-1607" href="#ln-1607"></a><span class="w">    </span><span class="c">! Initialization</span>
-<a id="ln-1608" name="ln-1608" href="#ln-1608"></a><span class="w">    </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">false</span><span class="p">.</span>
-<a id="ln-1609" name="ln-1609" href="#ln-1609"></a>
-<a id="ln-1610" name="ln-1610" href="#ln-1610"></a><span class="w">    </span><span class="c">! Iteration Checks</span>
-<a id="ln-1611" name="ln-1611" href="#ln-1611"></a><span class="w">    </span><span class="n">info</span><span class="p">%</span><span class="n">iteration_count</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">niter</span>
-<a id="ln-1612" name="ln-1612" href="#ln-1612"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">niter</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="n">controls</span><span class="p">%</span><span class="n">max_iteration_count</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-1613" name="ln-1613" href="#ln-1613"></a><span class="k">        </span><span class="n">info</span><span class="p">%</span><span class="n">reach_iteration_limit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.</span>
-<a id="ln-1614" name="ln-1614" href="#ln-1614"></a><span class="w">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.</span>
-<a id="ln-1615" name="ln-1615" href="#ln-1615"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-1616" name="ln-1616" href="#ln-1616"></a><span class="k">        </span><span class="n">info</span><span class="p">%</span><span class="n">reach_iteration_limit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">false</span><span class="p">.</span>
-<a id="ln-1617" name="ln-1617" href="#ln-1617"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-1618" name="ln-1618" href="#ln-1618"></a>
-<a id="ln-1619" name="ln-1619" href="#ln-1619"></a><span class="k">    </span><span class="n">info</span><span class="p">%</span><span class="n">function_evaluation_count</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">neval</span>
-<a id="ln-1620" name="ln-1620" href="#ln-1620"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">neval</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="n">controls</span><span class="p">%</span><span class="n">max_function_evaluations</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
-<a id="ln-1621" name="ln-1621" href="#ln-1621"></a><span class="k">        </span><span class="n">info</span><span class="p">%</span><span class="n">reach_function_evaluation_limit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.</span>
-<a id="ln-1622" name="ln-1622" href="#ln-1622"></a><span class="w">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.</span>
-<a id="ln-1623" name="ln-1623" href="#ln-1623"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-1624" name="ln-1624" href="#ln-1624"></a><span class="k">        </span><span class="n">info</span><span class="p">%</span><span class="n">reach_function_evaluation_limit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">false</span><span class="p">.</span>
-<a id="ln-1625" name="ln-1625" href="#ln-1625"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-1626" name="ln-1626" href="#ln-1626"></a>
-<a id="ln-1627" name="ln-1627" href="#ln-1627"></a><span class="k">    </span><span class="n">info</span><span class="p">%</span><span class="n">gradient_value</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">maxval</span><span class="p">(</span><span class="nb">abs</span><span class="p">(</span><span class="n">JtWdy</span><span class="p">))</span>
-<a id="ln-1628" name="ln-1628" href="#ln-1628"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">info</span><span class="p">%</span><span class="n">gradient_value</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">controls</span><span class="p">%</span><span class="n">gradient_tolerance</span><span class="w"> </span><span class="p">.</span><span class="nb">and</span><span class="p">.</span><span class="w"> </span><span class="n">niter</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="mi">2</span><span class="p">)</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1629" name="ln-1629" href="#ln-1629"></a><span class="w">    </span><span class="k">then</span>
-<a id="ln-1630" name="ln-1630" href="#ln-1630"></a><span class="k">        </span><span class="n">info</span><span class="p">%</span><span class="n">converge_on_gradient</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.</span>
-<a id="ln-1631" name="ln-1631" href="#ln-1631"></a><span class="w">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.</span>
-<a id="ln-1632" name="ln-1632" href="#ln-1632"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-1633" name="ln-1633" href="#ln-1633"></a><span class="k">        </span><span class="n">info</span><span class="p">%</span><span class="n">converge_on_gradient</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">false</span><span class="p">.</span>
-<a id="ln-1634" name="ln-1634" href="#ln-1634"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-1635" name="ln-1635" href="#ln-1635"></a>
-<a id="ln-1636" name="ln-1636" href="#ln-1636"></a><span class="k">    </span><span class="n">info</span><span class="p">%</span><span class="n">solution_change_value</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">maxval</span><span class="p">(</span><span class="nb">abs</span><span class="p">(</span><span class="n">h</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="p">(</span><span class="nb">abs</span><span class="p">(</span><span class="n">p</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mf">1.0d-12</span><span class="p">))</span>
-<a id="ln-1637" name="ln-1637" href="#ln-1637"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">info</span><span class="p">%</span><span class="n">solution_change_value</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1638" name="ln-1638" href="#ln-1638"></a><span class="w">        </span><span class="n">controls</span><span class="p">%</span><span class="n">change_in_solution_tolerance</span><span class="w"> </span><span class="p">.</span><span class="nb">and</span><span class="p">.</span><span class="w"> </span><span class="n">niter</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="mi">2</span><span class="p">)</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1639" name="ln-1639" href="#ln-1639"></a><span class="w">    </span><span class="k">then</span>
-<a id="ln-1640" name="ln-1640" href="#ln-1640"></a><span class="k">        </span><span class="n">info</span><span class="p">%</span><span class="n">converge_on_solution_change</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.</span>
-<a id="ln-1641" name="ln-1641" href="#ln-1641"></a><span class="w">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.</span>
-<a id="ln-1642" name="ln-1642" href="#ln-1642"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-1643" name="ln-1643" href="#ln-1643"></a><span class="k">        </span><span class="n">info</span><span class="p">%</span><span class="n">converge_on_solution_change</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">false</span><span class="p">.</span>
-<a id="ln-1644" name="ln-1644" href="#ln-1644"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-1645" name="ln-1645" href="#ln-1645"></a>
-<a id="ln-1646" name="ln-1646" href="#ln-1646"></a><span class="k">    </span><span class="n">info</span><span class="p">%</span><span class="n">residual_value</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">X2</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">dof</span>
-<a id="ln-1647" name="ln-1647" href="#ln-1647"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">info</span><span class="p">%</span><span class="n">residual_value</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">controls</span><span class="p">%</span><span class="n">residual_tolerance</span><span class="w"> </span><span class="p">.</span><span class="nb">and</span><span class="p">.</span><span class="w"> </span><span class="n">niter</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="mi">2</span><span class="p">)</span><span class="w"> </span><span class="p">&amp;</span>
-<a id="ln-1648" name="ln-1648" href="#ln-1648"></a><span class="w">    </span><span class="k">then</span>
-<a id="ln-1649" name="ln-1649" href="#ln-1649"></a><span class="k">        </span><span class="n">info</span><span class="p">%</span><span class="n">converge_on_residual_parameter</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.</span>
-<a id="ln-1650" name="ln-1650" href="#ln-1650"></a><span class="w">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.</span>
-<a id="ln-1651" name="ln-1651" href="#ln-1651"></a><span class="w">    </span><span class="k">else</span>
-<a id="ln-1652" name="ln-1652" href="#ln-1652"></a><span class="k">        </span><span class="n">info</span><span class="p">%</span><span class="n">converge_on_residual_parameter</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">false</span><span class="p">.</span>
-<a id="ln-1653" name="ln-1653" href="#ln-1653"></a><span class="w">    </span><span class="k">end if</span>
-<a id="ln-1654" name="ln-1654" href="#ln-1654"></a><span class="k">end function</span>
-<a id="ln-1655" name="ln-1655" href="#ln-1655"></a>
-<a id="ln-1656" name="ln-1656" href="#ln-1656"></a><span class="c">! ------------------------------------------------------------------------------</span>
-<a id="ln-1657" name="ln-1657" href="#ln-1657"></a><span class="k">end module</span>
+<a id="ln-444" name="ln-444" href="#ln-444"></a><span class="w">    </span><span class="c">!! See Also</span>
+<a id="ln-445" name="ln-445" href="#ln-445"></a><span class="w">    </span><span class="c">!!</span>
+<a id="ln-446" name="ln-446" href="#ln-446"></a><span class="w">    </span><span class="c">!! - [Wikipedia](https://en.wikipedia.org/wiki/Linear_regression)</span>
+<a id="ln-447" name="ln-447" href="#ln-447"></a><span class="w">    </span><span class="c">!! - [SPC Excel Understanding Regression Statistics](https://www.spcforexcel.com/knowledge/root-cause-analysis/understanding-regression-statistics-part-1)</span>
+<a id="ln-448" name="ln-448" href="#ln-448"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">order</span>
+<a id="ln-449" name="ln-449" href="#ln-449"></a><span class="w">        </span><span class="c">!! The order of the equation to fit.  This value must be at </span>
+<a id="ln-450" name="ln-450" href="#ln-450"></a><span class="w">        </span><span class="c">!! least one (linear equation), but can be higher as desired, </span>
+<a id="ln-451" name="ln-451" href="#ln-451"></a><span class="w">        </span><span class="c">!! as long as there is sufficient data.</span>
+<a id="ln-452" name="ln-452" href="#ln-452"></a><span class="w">    </span><span class="kt">logical</span><span class="p">,</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">intercept</span>
+<a id="ln-453" name="ln-453" href="#ln-453"></a><span class="w">        </span><span class="c">!! Set to true if the intercept is being computed as part of </span>
+<a id="ln-454" name="ln-454" href="#ln-454"></a><span class="w">        </span><span class="c">!! the regression; else, false.</span>
+<a id="ln-455" name="ln-455" href="#ln-455"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span><span class="p">(:)</span>
+<a id="ln-456" name="ln-456" href="#ln-456"></a><span class="w">        </span><span class="c">!! An N-element array containing the independent variable</span>
+<a id="ln-457" name="ln-457" href="#ln-457"></a><span class="w">        </span><span class="c">!! measurement points.</span>
+<a id="ln-458" name="ln-458" href="#ln-458"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">y</span><span class="p">(:)</span>
+<a id="ln-459" name="ln-459" href="#ln-459"></a><span class="w">        </span><span class="c">!! An N-element array containing the dependent variable</span>
+<a id="ln-460" name="ln-460" href="#ln-460"></a><span class="w">        </span><span class="c">!! measurement points.</span>
+<a id="ln-461" name="ln-461" href="#ln-461"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">coeffs</span><span class="p">(:)</span>
+<a id="ln-462" name="ln-462" href="#ln-462"></a><span class="w">        </span><span class="c">!! An ORDER+1 element array where the coefficients will be written.</span>
+<a id="ln-463" name="ln-463" href="#ln-463"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">ymod</span><span class="p">(:)</span>
+<a id="ln-464" name="ln-464" href="#ln-464"></a><span class="w">        </span><span class="c">!! An N-element array where the modeled data will be written.</span>
+<a id="ln-465" name="ln-465" href="#ln-465"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">resid</span><span class="p">(:)</span>
+<a id="ln-466" name="ln-466" href="#ln-466"></a><span class="w">        </span><span class="c">!! An N-element array where the residual error data will be </span>
+<a id="ln-467" name="ln-467" href="#ln-467"></a><span class="w">        </span><span class="c">!! written (modeled - actual).</span>
+<a id="ln-468" name="ln-468" href="#ln-468"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">regression_statistics</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">stats</span><span class="p">(:)</span>
+<a id="ln-469" name="ln-469" href="#ln-469"></a><span class="w">        </span><span class="c">!! An M-element array of regression_statistics items where </span>
+<a id="ln-470" name="ln-470" href="#ln-470"></a><span class="w">        </span><span class="c">!! M = ORDER + 1 when intercept is set to true; however, if </span>
+<a id="ln-471" name="ln-471" href="#ln-471"></a><span class="w">        </span><span class="c">!! intercept is set to false, M = ORDER.</span>
+<a id="ln-472" name="ln-472" href="#ln-472"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">alpha</span>
+<a id="ln-473" name="ln-473" href="#ln-473"></a><span class="w">        </span><span class="c">!! The significance level at which to evaluate the confidence </span>
+<a id="ln-474" name="ln-474" href="#ln-474"></a><span class="w">        </span><span class="c">!! intervals.  The default value is 0.05 such that a 95% </span>
+<a id="ln-475" name="ln-475" href="#ln-475"></a><span class="w">        </span><span class="c">!! confidence interval is calculated.</span>
+<a id="ln-476" name="ln-476" href="#ln-476"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">err</span>
+<a id="ln-477" name="ln-477" href="#ln-477"></a><span class="w">        </span><span class="c">!! A mechanism for communicating errors and warnings to the </span>
+<a id="ln-478" name="ln-478" href="#ln-478"></a><span class="w">        </span><span class="c">!! caller.  Possible warning and error codes are as follows.</span>
+<a id="ln-479" name="ln-479" href="#ln-479"></a><span class="w">        </span><span class="c">!! - FS_NO_ERROR: No errors encountered.</span>
+<a id="ln-480" name="ln-480" href="#ln-480"></a><span class="w">        </span><span class="c">!! - FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not </span>
+<a id="ln-481" name="ln-481" href="#ln-481"></a><span class="w">        </span><span class="c">!!      approriately sized.</span>
+<a id="ln-482" name="ln-482" href="#ln-482"></a><span class="w">        </span><span class="c">!! - FS_INVALID_INPUT_ERROR: Occurs if order is less than 1.</span>
+<a id="ln-483" name="ln-483" href="#ln-483"></a><span class="w">        </span><span class="c">!! - FS_MEMORY_ERROR: Occurs if there is a memory allocation </span>
+<a id="ln-484" name="ln-484" href="#ln-484"></a><span class="w">        </span><span class="c">!!      error.</span>
+<a id="ln-485" name="ln-485" href="#ln-485"></a>
+<a id="ln-486" name="ln-486" href="#ln-486"></a><span class="w">    </span><span class="c">! Parameters</span>
+<a id="ln-487" name="ln-487" href="#ln-487"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">zero</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.0d0</span>
+<a id="ln-488" name="ln-488" href="#ln-488"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">half</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.5d0</span>
+<a id="ln-489" name="ln-489" href="#ln-489"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">one</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d0</span>
+<a id="ln-490" name="ln-490" href="#ln-490"></a>
+<a id="ln-491" name="ln-491" href="#ln-491"></a><span class="w">    </span><span class="c">! Local Variables</span>
+<a id="ln-492" name="ln-492" href="#ln-492"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">i</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">ncols</span><span class="p">,</span><span class="w"> </span><span class="n">ncoeffs</span><span class="p">,</span><span class="w"> </span><span class="n">flag</span>
+<a id="ln-493" name="ln-493" href="#ln-493"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">alph</span><span class="p">,</span><span class="w"> </span><span class="n">var</span><span class="p">,</span><span class="w"> </span><span class="n">df</span><span class="p">,</span><span class="w"> </span><span class="n">ssr</span><span class="p">,</span><span class="w"> </span><span class="n">talpha</span>
+<a id="ln-494" name="ln-494" href="#ln-494"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">allocatable</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">a</span><span class="p">(:,:),</span><span class="w"> </span><span class="n">c</span><span class="p">(:,:),</span><span class="w"> </span><span class="n">cxt</span><span class="p">(:,:)</span>
+<a id="ln-495" name="ln-495" href="#ln-495"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">t_distribution</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dist</span>
+<a id="ln-496" name="ln-496" href="#ln-496"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">errmgr</span>
+<a id="ln-497" name="ln-497" href="#ln-497"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">deferr</span>
+<a id="ln-498" name="ln-498" href="#ln-498"></a><span class="w">    </span>
+<a id="ln-499" name="ln-499" href="#ln-499"></a><span class="w">    </span><span class="c">! Initialization</span>
+<a id="ln-500" name="ln-500" href="#ln-500"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">err</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-501" name="ln-501" href="#ln-501"></a><span class="k">        </span><span class="n">errmgr</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">err</span>
+<a id="ln-502" name="ln-502" href="#ln-502"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-503" name="ln-503" href="#ln-503"></a><span class="k">        </span><span class="n">errmgr</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">deferr</span>
+<a id="ln-504" name="ln-504" href="#ln-504"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-505" name="ln-505" href="#ln-505"></a><span class="k">    </span><span class="n">npts</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
+<a id="ln-506" name="ln-506" href="#ln-506"></a><span class="w">    </span><span class="n">ncoeffs</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">order</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span>
+<a id="ln-507" name="ln-507" href="#ln-507"></a><span class="w">    </span><span class="n">ncols</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">order</span>
+<a id="ln-508" name="ln-508" href="#ln-508"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">intercept</span><span class="p">)</span><span class="w"> </span><span class="n">ncols</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">ncols</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span>
+<a id="ln-509" name="ln-509" href="#ln-509"></a><span class="w">    </span><span class="n">alph</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.05d0</span>
+<a id="ln-510" name="ln-510" href="#ln-510"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">alpha</span><span class="p">))</span><span class="w"> </span><span class="n">alph</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">alpha</span>
+<a id="ln-511" name="ln-511" href="#ln-511"></a>
+<a id="ln-512" name="ln-512" href="#ln-512"></a><span class="w">    </span><span class="c">! Input Check</span>
+<a id="ln-513" name="ln-513" href="#ln-513"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">order</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-514" name="ln-514" href="#ln-514"></a><span class="k">        call </span><span class="n">errmgr</span><span class="p">%</span><span class="n">report_error</span><span class="p">(</span><span class="s2">&quot;linear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-515" name="ln-515" href="#ln-515"></a><span class="w">            </span><span class="s2">&quot;The model order must be at least one.&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">FS_INVALID_INPUT_ERROR</span><span class="p">)</span>
+<a id="ln-516" name="ln-516" href="#ln-516"></a><span class="w">        </span><span class="k">return</span>
+<a id="ln-517" name="ln-517" href="#ln-517"></a><span class="k">    end if</span>
+<a id="ln-518" name="ln-518" href="#ln-518"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">y</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">npts</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-519" name="ln-519" href="#ln-519"></a><span class="k">        call </span><span class="n">report_array_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;linear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-520" name="ln-520" href="#ln-520"></a><span class="w">            </span><span class="s2">&quot;y&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">y</span><span class="p">))</span>
+<a id="ln-521" name="ln-521" href="#ln-521"></a><span class="w">        </span><span class="k">return</span>
+<a id="ln-522" name="ln-522" href="#ln-522"></a><span class="k">    end if</span>
+<a id="ln-523" name="ln-523" href="#ln-523"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">coeffs</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">ncoeffs</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-524" name="ln-524" href="#ln-524"></a><span class="k">        call </span><span class="n">report_array_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;linear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-525" name="ln-525" href="#ln-525"></a><span class="w">            </span><span class="s2">&quot;coeffs&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">ncoeffs</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">coeffs</span><span class="p">))</span>
+<a id="ln-526" name="ln-526" href="#ln-526"></a><span class="w">        </span><span class="k">return</span>
+<a id="ln-527" name="ln-527" href="#ln-527"></a><span class="k">    end if</span>
+<a id="ln-528" name="ln-528" href="#ln-528"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">ymod</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">npts</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-529" name="ln-529" href="#ln-529"></a><span class="k">        call </span><span class="n">report_array_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;linear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-530" name="ln-530" href="#ln-530"></a><span class="w">            </span><span class="s2">&quot;ymod&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">ymod</span><span class="p">))</span>
+<a id="ln-531" name="ln-531" href="#ln-531"></a><span class="w">        </span><span class="k">return</span>
+<a id="ln-532" name="ln-532" href="#ln-532"></a><span class="k">    end if</span>
+<a id="ln-533" name="ln-533" href="#ln-533"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">resid</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">npts</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-534" name="ln-534" href="#ln-534"></a><span class="k">        call </span><span class="n">report_array_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;linear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-535" name="ln-535" href="#ln-535"></a><span class="w">            </span><span class="s2">&quot;resid&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">resid</span><span class="p">))</span>
+<a id="ln-536" name="ln-536" href="#ln-536"></a><span class="w">        </span><span class="k">return</span>
+<a id="ln-537" name="ln-537" href="#ln-537"></a><span class="k">    end if</span>
+<a id="ln-538" name="ln-538" href="#ln-538"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">stats</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-539" name="ln-539" href="#ln-539"></a><span class="k">        if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">stats</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">ncols</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-540" name="ln-540" href="#ln-540"></a><span class="k">            call </span><span class="n">report_array_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-541" name="ln-541" href="#ln-541"></a><span class="w">                </span><span class="s2">&quot;linear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;stats&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">ncols</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">stats</span><span class="p">))</span>
+<a id="ln-542" name="ln-542" href="#ln-542"></a><span class="w">            </span><span class="k">return</span>
+<a id="ln-543" name="ln-543" href="#ln-543"></a><span class="k">        end if</span>
+<a id="ln-544" name="ln-544" href="#ln-544"></a><span class="k">    end if</span>
+<a id="ln-545" name="ln-545" href="#ln-545"></a>
+<a id="ln-546" name="ln-546" href="#ln-546"></a><span class="w">    </span><span class="c">! Memory Allocation</span>
+<a id="ln-547" name="ln-547" href="#ln-547"></a><span class="w">    </span><span class="k">allocate</span><span class="p">(</span><span class="n">a</span><span class="p">(</span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">ncols</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
+<a id="ln-548" name="ln-548" href="#ln-548"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">allocate</span><span class="p">(</span><span class="n">c</span><span class="p">(</span><span class="n">ncols</span><span class="p">,</span><span class="w"> </span><span class="n">ncols</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
+<a id="ln-549" name="ln-549" href="#ln-549"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">allocate</span><span class="p">(</span><span class="n">cxt</span><span class="p">(</span><span class="n">ncols</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
+<a id="ln-550" name="ln-550" href="#ln-550"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-551" name="ln-551" href="#ln-551"></a><span class="k">        call </span><span class="n">report_memory_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;linear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
+<a id="ln-552" name="ln-552" href="#ln-552"></a><span class="w">        </span><span class="k">return</span>
+<a id="ln-553" name="ln-553" href="#ln-553"></a><span class="k">    end if</span>
+<a id="ln-554" name="ln-554" href="#ln-554"></a>
+<a id="ln-555" name="ln-555" href="#ln-555"></a><span class="w">    </span><span class="c">! Compute the coefficient matrix</span>
+<a id="ln-556" name="ln-556" href="#ln-556"></a><span class="w">    </span><span class="k">call </span><span class="n">design_matrix</span><span class="p">(</span><span class="n">order</span><span class="p">,</span><span class="w"> </span><span class="n">intercept</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">errmgr</span><span class="p">)</span>
+<a id="ln-557" name="ln-557" href="#ln-557"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">errmgr</span><span class="p">%</span><span class="n">has_error_occurred</span><span class="p">())</span><span class="w"> </span><span class="k">return</span>
+<a id="ln-558" name="ln-558" href="#ln-558"></a>
+<a id="ln-559" name="ln-559" href="#ln-559"></a><span class="w">    </span><span class="c">! Compute the covariance matrix</span>
+<a id="ln-560" name="ln-560" href="#ln-560"></a><span class="w">    </span><span class="k">call </span><span class="n">covariance_matrix</span><span class="p">(</span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="n">errmgr</span><span class="p">)</span>
+<a id="ln-561" name="ln-561" href="#ln-561"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">errmgr</span><span class="p">%</span><span class="n">has_error_occurred</span><span class="p">())</span><span class="w"> </span><span class="k">return</span>
+<a id="ln-562" name="ln-562" href="#ln-562"></a>
+<a id="ln-563" name="ln-563" href="#ln-563"></a><span class="w">    </span><span class="c">! Compute the coefficients (NCOLS-by-1)</span>
+<a id="ln-564" name="ln-564" href="#ln-564"></a><span class="w">    </span><span class="k">call </span><span class="n">DGEMM</span><span class="p">(</span><span class="s2">&quot;N&quot;</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;T&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">ncols</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">ncols</span><span class="p">,</span><span class="w"> </span><span class="n">one</span><span class="p">,</span><span class="w"> </span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="n">ncols</span><span class="p">,</span><span class="w"> </span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">zero</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-565" name="ln-565" href="#ln-565"></a><span class="w">        </span><span class="n">cxt</span><span class="p">,</span><span class="w"> </span><span class="n">ncols</span><span class="p">)</span><span class="w">     </span><span class="c">! C * X**T</span>
+<a id="ln-566" name="ln-566" href="#ln-566"></a>
+<a id="ln-567" name="ln-567" href="#ln-567"></a><span class="w">    </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">2</span>
+<a id="ln-568" name="ln-568" href="#ln-568"></a><span class="w">    </span><span class="n">coeffs</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">zero</span>
+<a id="ln-569" name="ln-569" href="#ln-569"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">intercept</span><span class="p">)</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span>
+<a id="ln-570" name="ln-570" href="#ln-570"></a><span class="w">    </span><span class="k">call </span><span class="n">DGEMM</span><span class="p">(</span><span class="s2">&quot;N&quot;</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;N&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">ncols</span><span class="p">,</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">one</span><span class="p">,</span><span class="w"> </span><span class="n">cxt</span><span class="p">,</span><span class="w"> </span><span class="n">ncols</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">zero</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-571" name="ln-571" href="#ln-571"></a><span class="w">        </span><span class="n">coeffs</span><span class="p">(</span><span class="n">i</span><span class="p">:),</span><span class="w"> </span><span class="n">ncols</span><span class="p">)</span><span class="w">  </span><span class="c">! (C * X**T) * Y</span>
+<a id="ln-572" name="ln-572" href="#ln-572"></a>
+<a id="ln-573" name="ln-573" href="#ln-573"></a><span class="w">    </span><span class="c">! Evaluate the model and compute the residuals</span>
+<a id="ln-574" name="ln-574" href="#ln-574"></a><span class="w">    </span><span class="k">call </span><span class="n">DGEMM</span><span class="p">(</span><span class="s2">&quot;N&quot;</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;N&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="n">ncols</span><span class="p">,</span><span class="w"> </span><span class="n">one</span><span class="p">,</span><span class="w"> </span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">,</span><span class="w"> </span><span class="n">coeffs</span><span class="p">(</span><span class="n">i</span><span class="p">:),</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-575" name="ln-575" href="#ln-575"></a><span class="w">        </span><span class="n">ncols</span><span class="p">,</span><span class="w"> </span><span class="n">zero</span><span class="p">,</span><span class="w"> </span><span class="n">ymod</span><span class="p">,</span><span class="w"> </span><span class="n">npts</span><span class="p">)</span>
+<a id="ln-576" name="ln-576" href="#ln-576"></a><span class="w">    </span><span class="n">resid</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">ymod</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">y</span>
+<a id="ln-577" name="ln-577" href="#ln-577"></a>
+<a id="ln-578" name="ln-578" href="#ln-578"></a><span class="w">    </span><span class="c">! If the user doesn&#39;t want the statistics calculations we can stop now</span>
+<a id="ln-579" name="ln-579" href="#ln-579"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(.</span><span class="nb">not</span><span class="p">.</span><span class="nb">present</span><span class="p">(</span><span class="n">stats</span><span class="p">))</span><span class="w"> </span><span class="k">return</span>
+<a id="ln-580" name="ln-580" href="#ln-580"></a><span class="w">    </span>
+<a id="ln-581" name="ln-581" href="#ln-581"></a><span class="w">    </span><span class="c">! Start the process of computing statistics</span>
+<a id="ln-582" name="ln-582" href="#ln-582"></a><span class="w">    </span><span class="n">stats</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">calculate_regression_statistics</span><span class="p">(</span><span class="n">resid</span><span class="p">,</span><span class="w"> </span><span class="n">coeffs</span><span class="p">(</span><span class="n">i</span><span class="p">:),</span><span class="w"> </span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="n">alph</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-583" name="ln-583" href="#ln-583"></a><span class="w">        </span><span class="n">errmgr</span><span class="p">)</span>
+<a id="ln-584" name="ln-584" href="#ln-584"></a><span class="k">end subroutine</span>
+<a id="ln-585" name="ln-585" href="#ln-585"></a>
+<a id="ln-586" name="ln-586" href="#ln-586"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-587" name="ln-587" href="#ln-587"></a><span class="k">function </span><span class="n">calculate_regression_statistics</span><span class="p">(</span><span class="n">resid</span><span class="p">,</span><span class="w"> </span><span class="n">params</span><span class="p">,</span><span class="w"> </span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="n">alpha</span><span class="p">,</span><span class="w"> </span><span class="n">err</span><span class="p">)</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-588" name="ln-588" href="#ln-588"></a><span class="w">    </span><span class="k">result</span><span class="p">(</span><span class="n">rst</span><span class="p">)</span>
+<a id="ln-589" name="ln-589" href="#ln-589"></a><span class="w">    </span><span class="c">!! Computes statistics for the quality of fit for a regression </span>
+<a id="ln-590" name="ln-590" href="#ln-590"></a><span class="w">    </span><span class="c">!! model.</span>
+<a id="ln-591" name="ln-591" href="#ln-591"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">resid</span><span class="p">(:)</span>
+<a id="ln-592" name="ln-592" href="#ln-592"></a><span class="w">        </span><span class="c">!! An M-element array containing the model residual errors.</span>
+<a id="ln-593" name="ln-593" href="#ln-593"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">params</span><span class="p">(:)</span>
+<a id="ln-594" name="ln-594" href="#ln-594"></a><span class="w">        </span><span class="c">!! An N-element array containing the model parameters.</span>
+<a id="ln-595" name="ln-595" href="#ln-595"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">c</span><span class="p">(:,:)</span>
+<a id="ln-596" name="ln-596" href="#ln-596"></a><span class="w">        </span><span class="c">!! The N-by-N covariance matrix.</span>
+<a id="ln-597" name="ln-597" href="#ln-597"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">alpha</span>
+<a id="ln-598" name="ln-598" href="#ln-598"></a><span class="w">        </span><span class="c">!! The significance level at which to evaluate the confidence </span>
+<a id="ln-599" name="ln-599" href="#ln-599"></a><span class="w">        </span><span class="c">!! intervals.  The default value is 0.05 such that a 95% </span>
+<a id="ln-600" name="ln-600" href="#ln-600"></a><span class="w">        </span><span class="c">!! confidence interval is calculated.</span>
+<a id="ln-601" name="ln-601" href="#ln-601"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">err</span>
+<a id="ln-602" name="ln-602" href="#ln-602"></a><span class="w">        </span><span class="c">!! A mechanism for communicating errors and warnings to the </span>
+<a id="ln-603" name="ln-603" href="#ln-603"></a><span class="w">        </span><span class="c">!! caller.  Possible warning and error codes are as follows.</span>
+<a id="ln-604" name="ln-604" href="#ln-604"></a><span class="w">        </span><span class="c">!! - FS_NO_ERROR: No errors encountered.</span>
+<a id="ln-605" name="ln-605" href="#ln-605"></a><span class="w">        </span><span class="c">!! - FS_ARRAY_SIZE_ERROR: Occurs if c is not sized correctly.</span>
+<a id="ln-606" name="ln-606" href="#ln-606"></a><span class="w">        </span><span class="c">!! - FS_INVALID_INPUT_ERROR: Occurs if order is less than 1.</span>
+<a id="ln-607" name="ln-607" href="#ln-607"></a><span class="w">        </span><span class="c">!! - FS_MEMORY_ERROR: Occurs if there is a memory allocation </span>
+<a id="ln-608" name="ln-608" href="#ln-608"></a><span class="w">        </span><span class="c">!!      error.</span>
+<a id="ln-609" name="ln-609" href="#ln-609"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">regression_statistics</span><span class="p">),</span><span class="w"> </span><span class="k">allocatable</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">rst</span><span class="p">(:)</span>
+<a id="ln-610" name="ln-610" href="#ln-610"></a><span class="w">        </span><span class="c">!! A regression_statistics object containing the analysis results.</span>
+<a id="ln-611" name="ln-611" href="#ln-611"></a>
+<a id="ln-612" name="ln-612" href="#ln-612"></a><span class="w">    </span><span class="c">! Parameters</span>
+<a id="ln-613" name="ln-613" href="#ln-613"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">p05</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.05d0</span>
+<a id="ln-614" name="ln-614" href="#ln-614"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">half</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.5d0</span>
+<a id="ln-615" name="ln-615" href="#ln-615"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">one</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d0</span>
+<a id="ln-616" name="ln-616" href="#ln-616"></a>
+<a id="ln-617" name="ln-617" href="#ln-617"></a><span class="w">    </span><span class="c">! Local Variables</span>
+<a id="ln-618" name="ln-618" href="#ln-618"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">i</span><span class="p">,</span><span class="w"> </span><span class="n">m</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">dof</span><span class="p">,</span><span class="w"> </span><span class="n">flag</span>
+<a id="ln-619" name="ln-619" href="#ln-619"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">ssr</span><span class="p">,</span><span class="w"> </span><span class="n">var</span><span class="p">,</span><span class="w"> </span><span class="n">talpha</span>
+<a id="ln-620" name="ln-620" href="#ln-620"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">t_distribution</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dist</span>
+<a id="ln-621" name="ln-621" href="#ln-621"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">errmgr</span>
+<a id="ln-622" name="ln-622" href="#ln-622"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">deferr</span>
+<a id="ln-623" name="ln-623" href="#ln-623"></a><span class="w">    </span>
+<a id="ln-624" name="ln-624" href="#ln-624"></a><span class="w">    </span><span class="c">! Initialization</span>
+<a id="ln-625" name="ln-625" href="#ln-625"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">err</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-626" name="ln-626" href="#ln-626"></a><span class="k">        </span><span class="n">errmgr</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">err</span>
+<a id="ln-627" name="ln-627" href="#ln-627"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-628" name="ln-628" href="#ln-628"></a><span class="k">        </span><span class="n">errmgr</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">deferr</span>
+<a id="ln-629" name="ln-629" href="#ln-629"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-630" name="ln-630" href="#ln-630"></a>
+<a id="ln-631" name="ln-631" href="#ln-631"></a><span class="w">    </span><span class="c">! Initialization</span>
+<a id="ln-632" name="ln-632" href="#ln-632"></a><span class="w">    </span><span class="n">m</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">resid</span><span class="p">)</span>
+<a id="ln-633" name="ln-633" href="#ln-633"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">params</span><span class="p">)</span>
+<a id="ln-634" name="ln-634" href="#ln-634"></a><span class="w">    </span><span class="n">dof</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">m</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">n</span>
+<a id="ln-635" name="ln-635" href="#ln-635"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">alpha</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-636" name="ln-636" href="#ln-636"></a><span class="k">        </span><span class="n">a</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">alpha</span>
+<a id="ln-637" name="ln-637" href="#ln-637"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-638" name="ln-638" href="#ln-638"></a><span class="k">        </span><span class="n">a</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">p05</span>
+<a id="ln-639" name="ln-639" href="#ln-639"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-640" name="ln-640" href="#ln-640"></a><span class="k">    allocate</span><span class="p">(</span><span class="n">rst</span><span class="p">(</span><span class="n">n</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
+<a id="ln-641" name="ln-641" href="#ln-641"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-642" name="ln-642" href="#ln-642"></a><span class="k">    end if</span>
+<a id="ln-643" name="ln-643" href="#ln-643"></a>
+<a id="ln-644" name="ln-644" href="#ln-644"></a><span class="w">    </span><span class="c">! Input Checking</span>
+<a id="ln-645" name="ln-645" href="#ln-645"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="p">.</span><span class="nb">or</span><span class="p">.</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">c</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-646" name="ln-646" href="#ln-646"></a><span class="k">    end if</span>
+<a id="ln-647" name="ln-647" href="#ln-647"></a>
+<a id="ln-648" name="ln-648" href="#ln-648"></a><span class="w">    </span><span class="c">! Process</span>
+<a id="ln-649" name="ln-649" href="#ln-649"></a><span class="w">    </span><span class="n">ssr</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">norm2</span><span class="p">(</span><span class="n">resid</span><span class="p">)</span><span class="o">**</span><span class="mi">2</span><span class="w">   </span><span class="c">! sum of the squares of the residual</span>
+<a id="ln-650" name="ln-650" href="#ln-650"></a><span class="w">    </span><span class="n">var</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">ssr</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">dof</span>
+<a id="ln-651" name="ln-651" href="#ln-651"></a><span class="w">    </span><span class="n">dist</span><span class="p">%</span><span class="n">dof</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="kt">real</span><span class="p">(</span><span class="n">dof</span><span class="p">,</span><span class="w"> </span><span class="n">real64</span><span class="p">)</span>
+<a id="ln-652" name="ln-652" href="#ln-652"></a><span class="w">    </span><span class="n">talpha</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">confidence_interval</span><span class="p">(</span><span class="n">dist</span><span class="p">,</span><span class="w"> </span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">one</span><span class="p">,</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
+<a id="ln-653" name="ln-653" href="#ln-653"></a><span class="w">    </span><span class="k">do </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
+<a id="ln-654" name="ln-654" href="#ln-654"></a><span class="w">        </span><span class="n">rst</span><span class="p">(</span><span class="n">i</span><span class="p">)%</span><span class="n">standard_error</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">sqrt</span><span class="p">(</span><span class="n">var</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">c</span><span class="p">(</span><span class="n">i</span><span class="p">,</span><span class="n">i</span><span class="p">))</span>
+<a id="ln-655" name="ln-655" href="#ln-655"></a><span class="w">        </span><span class="n">rst</span><span class="p">(</span><span class="n">i</span><span class="p">)%</span><span class="n">t_statistic</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">params</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">rst</span><span class="p">(</span><span class="n">i</span><span class="p">)%</span><span class="n">standard_error</span>
+<a id="ln-656" name="ln-656" href="#ln-656"></a><span class="w">        </span><span class="n">rst</span><span class="p">(</span><span class="n">i</span><span class="p">)%</span><span class="n">probability</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">regularized_beta</span><span class="p">(</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-657" name="ln-657" href="#ln-657"></a><span class="w">            </span><span class="n">half</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">dof</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-658" name="ln-658" href="#ln-658"></a><span class="w">            </span><span class="n">half</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-659" name="ln-659" href="#ln-659"></a><span class="w">            </span><span class="kt">real</span><span class="p">(</span><span class="n">dof</span><span class="p">,</span><span class="w"> </span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="p">(</span><span class="n">dof</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">(</span><span class="n">rst</span><span class="p">(</span><span class="n">i</span><span class="p">)%</span><span class="n">t_statistic</span><span class="p">)</span><span class="o">**</span><span class="mi">2</span><span class="p">)</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-660" name="ln-660" href="#ln-660"></a><span class="w">        </span><span class="p">)</span>
+<a id="ln-661" name="ln-661" href="#ln-661"></a><span class="w">        </span><span class="n">rst</span><span class="p">(</span><span class="n">i</span><span class="p">)%</span><span class="n">confidence_interval</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">talpha</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">rst</span><span class="p">(</span><span class="n">i</span><span class="p">)%</span><span class="n">standard_error</span>
+<a id="ln-662" name="ln-662" href="#ln-662"></a><span class="w">    </span><span class="k">end do</span>
+<a id="ln-663" name="ln-663" href="#ln-663"></a><span class="k">end function</span>
+<a id="ln-664" name="ln-664" href="#ln-664"></a>
+<a id="ln-665" name="ln-665" href="#ln-665"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-666" name="ln-666" href="#ln-666"></a><span class="k">subroutine </span><span class="n">jacobian</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">params</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-667" name="ln-667" href="#ln-667"></a><span class="w">    </span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">,</span><span class="w"> </span><span class="n">f0</span><span class="p">,</span><span class="w"> </span><span class="n">f1</span><span class="p">,</span><span class="w"> </span><span class="n">step</span><span class="p">,</span><span class="w"> </span><span class="n">err</span><span class="p">)</span>
+<a id="ln-668" name="ln-668" href="#ln-668"></a><span class="w">    </span><span class="c">!! Computes the Jacobian matrix for a nonlinear regression problem.</span>
+<a id="ln-669" name="ln-669" href="#ln-669"></a><span class="w">    </span><span class="k">procedure</span><span class="p">(</span><span class="n">regression_function</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">fun</span>
+<a id="ln-670" name="ln-670" href="#ln-670"></a><span class="w">        </span><span class="c">!! A pointer to the regression_function to evaluate.</span>
+<a id="ln-671" name="ln-671" href="#ln-671"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">xdata</span><span class="p">(:)</span>
+<a id="ln-672" name="ln-672" href="#ln-672"></a><span class="w">        </span><span class="c">!! The M-element array containing x-coordinate data.</span>
+<a id="ln-673" name="ln-673" href="#ln-673"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">params</span><span class="p">(:)</span>
+<a id="ln-674" name="ln-674" href="#ln-674"></a><span class="w">        </span><span class="c">!! The N-element array containing the model parameters.</span>
+<a id="ln-675" name="ln-675" href="#ln-675"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">jac</span><span class="p">(:,:)</span>
+<a id="ln-676" name="ln-676" href="#ln-676"></a><span class="w">        </span><span class="c">!! The M-by-N matrix where the Jacobian will be written.</span>
+<a id="ln-677" name="ln-677" href="#ln-677"></a><span class="w">    </span><span class="kt">logical</span><span class="p">,</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="k">stop</span>
+<a id="ln-678" name="ln-678" href="#ln-678"></a><span class="w">        </span><span class="c">!! A value that the user can set in fun forcing the</span>
+<a id="ln-679" name="ln-679" href="#ln-679"></a><span class="w">        </span><span class="c">!! evaluation process to stop prior to completion.</span>
+<a id="ln-680" name="ln-680" href="#ln-680"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">f0</span><span class="p">(:)</span>
+<a id="ln-681" name="ln-681" href="#ln-681"></a><span class="w">        </span><span class="c">!! An optional M-element array containing the model values</span>
+<a id="ln-682" name="ln-682" href="#ln-682"></a><span class="w">        </span><span class="c">!!  using the current parameters as defined in m.  This input </span>
+<a id="ln-683" name="ln-683" href="#ln-683"></a><span class="w">        </span><span class="c">!! can be used to prevent the routine from performing a </span>
+<a id="ln-684" name="ln-684" href="#ln-684"></a><span class="w">        </span><span class="c">!! function evaluation at the model parameter state defined in </span>
+<a id="ln-685" name="ln-685" href="#ln-685"></a><span class="w">        </span><span class="c">!! params.</span>
+<a id="ln-686" name="ln-686" href="#ln-686"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">f1</span><span class="p">(:)</span>
+<a id="ln-687" name="ln-687" href="#ln-687"></a><span class="w">        </span><span class="c">!! An optional M-element workspace array used for function</span>
+<a id="ln-688" name="ln-688" href="#ln-688"></a><span class="w">        </span><span class="c">!! evaluations.</span>
+<a id="ln-689" name="ln-689" href="#ln-689"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">step</span>
+<a id="ln-690" name="ln-690" href="#ln-690"></a><span class="w">        </span><span class="c">!! The differentiation step size.  The default is the square </span>
+<a id="ln-691" name="ln-691" href="#ln-691"></a><span class="w">        </span><span class="c">!! root of machine precision.</span>
+<a id="ln-692" name="ln-692" href="#ln-692"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">err</span>
+<a id="ln-693" name="ln-693" href="#ln-693"></a><span class="w">        </span><span class="c">!! A mechanism for communicating errors and warnings to the </span>
+<a id="ln-694" name="ln-694" href="#ln-694"></a><span class="w">        </span><span class="c">!! caller.  Possible warning and error codes are as follows.</span>
+<a id="ln-695" name="ln-695" href="#ln-695"></a><span class="w">        </span><span class="c">!! - FS_NO_ERROR: No errors encountered.</span>
+<a id="ln-696" name="ln-696" href="#ln-696"></a><span class="w">        </span><span class="c">!! - FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not </span>
+<a id="ln-697" name="ln-697" href="#ln-697"></a><span class="w">        </span><span class="c">!!      properly sized.</span>
+<a id="ln-698" name="ln-698" href="#ln-698"></a><span class="w">        </span><span class="c">!! - FS_MEMORY_ERROR: Occurs if there is a memory allocation </span>
+<a id="ln-699" name="ln-699" href="#ln-699"></a><span class="w">        </span><span class="c">!!      error.</span>
+<a id="ln-700" name="ln-700" href="#ln-700"></a>
+<a id="ln-701" name="ln-701" href="#ln-701"></a><span class="w">    </span><span class="c">! Local Variables</span>
+<a id="ln-702" name="ln-702" href="#ln-702"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">h</span>
+<a id="ln-703" name="ln-703" href="#ln-703"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">m</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">flag</span><span class="p">,</span><span class="w"> </span><span class="n">expected</span><span class="p">,</span><span class="w"> </span><span class="n">actual</span>
+<a id="ln-704" name="ln-704" href="#ln-704"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">f1p</span><span class="p">(:),</span><span class="w"> </span><span class="n">f0p</span><span class="p">(:)</span>
+<a id="ln-705" name="ln-705" href="#ln-705"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">allocatable</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">f1a</span><span class="p">(:),</span><span class="w"> </span><span class="n">f0a</span><span class="p">(:),</span><span class="w"> </span><span class="n">work</span><span class="p">(:)</span>
+<a id="ln-706" name="ln-706" href="#ln-706"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">errmgr</span>
+<a id="ln-707" name="ln-707" href="#ln-707"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">deferr</span>
+<a id="ln-708" name="ln-708" href="#ln-708"></a>
+<a id="ln-709" name="ln-709" href="#ln-709"></a><span class="w">    </span><span class="c">! Initialization</span>
+<a id="ln-710" name="ln-710" href="#ln-710"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">err</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-711" name="ln-711" href="#ln-711"></a><span class="k">        </span><span class="n">errmgr</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">err</span>
+<a id="ln-712" name="ln-712" href="#ln-712"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-713" name="ln-713" href="#ln-713"></a><span class="k">        </span><span class="n">errmgr</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">deferr</span>
+<a id="ln-714" name="ln-714" href="#ln-714"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-715" name="ln-715" href="#ln-715"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">step</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-716" name="ln-716" href="#ln-716"></a><span class="k">        </span><span class="n">h</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">step</span>
+<a id="ln-717" name="ln-717" href="#ln-717"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-718" name="ln-718" href="#ln-718"></a><span class="k">        </span><span class="n">h</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">sqrt</span><span class="p">(</span><span class="nb">epsilon</span><span class="p">(</span><span class="n">h</span><span class="p">))</span>
+<a id="ln-719" name="ln-719" href="#ln-719"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-720" name="ln-720" href="#ln-720"></a><span class="k">    </span><span class="n">m</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">xdata</span><span class="p">)</span>
+<a id="ln-721" name="ln-721" href="#ln-721"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">params</span><span class="p">)</span>
+<a id="ln-722" name="ln-722" href="#ln-722"></a>
+<a id="ln-723" name="ln-723" href="#ln-723"></a><span class="w">    </span><span class="c">! Input Size Checking</span>
+<a id="ln-724" name="ln-724" href="#ln-724"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">m</span><span class="w"> </span><span class="p">.</span><span class="nb">or</span><span class="p">.</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-725" name="ln-725" href="#ln-725"></a><span class="k">        call </span><span class="n">report_matrix_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;jacobian&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-726" name="ln-726" href="#ln-726"></a><span class="w">            </span><span class="s2">&quot;JAC&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">m</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="mi">1</span><span class="p">),</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">))</span>
+<a id="ln-727" name="ln-727" href="#ln-727"></a><span class="w">        </span><span class="k">return</span>
+<a id="ln-728" name="ln-728" href="#ln-728"></a><span class="k">    end if</span>
+<a id="ln-729" name="ln-729" href="#ln-729"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">f0</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-730" name="ln-730" href="#ln-730"></a><span class="w">        </span><span class="c">! Check Size</span>
+<a id="ln-731" name="ln-731" href="#ln-731"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">f0</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">m</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-732" name="ln-732" href="#ln-732"></a><span class="k">            call </span><span class="n">report_array_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;jacobian&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-733" name="ln-733" href="#ln-733"></a><span class="w">                </span><span class="s2">&quot;F0&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">m</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">f0</span><span class="p">))</span>
+<a id="ln-734" name="ln-734" href="#ln-734"></a><span class="w">            </span><span class="k">return</span>
+<a id="ln-735" name="ln-735" href="#ln-735"></a><span class="k">        end if</span>
+<a id="ln-736" name="ln-736" href="#ln-736"></a><span class="k">        </span><span class="n">f0p</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">m</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">f0</span>
+<a id="ln-737" name="ln-737" href="#ln-737"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-738" name="ln-738" href="#ln-738"></a><span class="w">        </span><span class="c">! Allocate space, and fill the array with the current function</span>
+<a id="ln-739" name="ln-739" href="#ln-739"></a><span class="w">        </span><span class="c">! results</span>
+<a id="ln-740" name="ln-740" href="#ln-740"></a><span class="w">        </span><span class="k">allocate</span><span class="p">(</span><span class="n">f0a</span><span class="p">(</span><span class="n">m</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
+<a id="ln-741" name="ln-741" href="#ln-741"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">go</span><span class="w"> </span><span class="k">to</span><span class="w"> </span><span class="mi">20</span>
+<a id="ln-742" name="ln-742" href="#ln-742"></a><span class="w">        </span><span class="n">f0p</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">m</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">f0a</span>
+<a id="ln-743" name="ln-743" href="#ln-743"></a><span class="w">        </span><span class="k">call </span><span class="n">fun</span><span class="p">(</span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">params</span><span class="p">,</span><span class="w"> </span><span class="n">f0p</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">)</span>
+<a id="ln-744" name="ln-744" href="#ln-744"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="k">stop</span><span class="p">)</span><span class="w"> </span><span class="k">return</span>
+<a id="ln-745" name="ln-745" href="#ln-745"></a><span class="k">    end if</span>
+<a id="ln-746" name="ln-746" href="#ln-746"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">f1</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-747" name="ln-747" href="#ln-747"></a><span class="w">        </span><span class="c">! Check Size</span>
+<a id="ln-748" name="ln-748" href="#ln-748"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">f1</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">m</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-749" name="ln-749" href="#ln-749"></a><span class="k">            call </span><span class="n">report_array_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;jacobian&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-750" name="ln-750" href="#ln-750"></a><span class="w">                </span><span class="s2">&quot;F1&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">m</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">f1</span><span class="p">))</span>
+<a id="ln-751" name="ln-751" href="#ln-751"></a><span class="w">            </span><span class="k">return</span>
+<a id="ln-752" name="ln-752" href="#ln-752"></a><span class="k">        end if</span>
+<a id="ln-753" name="ln-753" href="#ln-753"></a><span class="k">        </span><span class="n">f1p</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">m</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">f1</span>
+<a id="ln-754" name="ln-754" href="#ln-754"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-755" name="ln-755" href="#ln-755"></a><span class="w">        </span><span class="c">! Allocate space</span>
+<a id="ln-756" name="ln-756" href="#ln-756"></a><span class="w">        </span><span class="k">allocate</span><span class="p">(</span><span class="n">f1a</span><span class="p">(</span><span class="n">m</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
+<a id="ln-757" name="ln-757" href="#ln-757"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">go</span><span class="w"> </span><span class="k">to</span><span class="w"> </span><span class="mi">20</span>
+<a id="ln-758" name="ln-758" href="#ln-758"></a><span class="w">        </span><span class="n">f1p</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">m</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">f1a</span>
+<a id="ln-759" name="ln-759" href="#ln-759"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-760" name="ln-760" href="#ln-760"></a>
+<a id="ln-761" name="ln-761" href="#ln-761"></a><span class="w">    </span><span class="c">! Allocate a workspace array the same size as params</span>
+<a id="ln-762" name="ln-762" href="#ln-762"></a><span class="w">    </span><span class="k">allocate</span><span class="p">(</span><span class="n">work</span><span class="p">(</span><span class="n">n</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
+<a id="ln-763" name="ln-763" href="#ln-763"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">go</span><span class="w"> </span><span class="k">to</span><span class="w"> </span><span class="mi">20</span>
+<a id="ln-764" name="ln-764" href="#ln-764"></a>
+<a id="ln-765" name="ln-765" href="#ln-765"></a><span class="w">    </span><span class="c">! Compute the Jacobian</span>
+<a id="ln-766" name="ln-766" href="#ln-766"></a><span class="w">    </span><span class="k">call </span><span class="n">jacobian_finite_diff</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">params</span><span class="p">,</span><span class="w"> </span><span class="n">f0p</span><span class="p">,</span><span class="w"> </span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="n">f1p</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-767" name="ln-767" href="#ln-767"></a><span class="w">        </span><span class="k">stop</span><span class="p">,</span><span class="w"> </span><span class="n">h</span><span class="p">,</span><span class="w"> </span><span class="n">work</span><span class="p">)</span>
+<a id="ln-768" name="ln-768" href="#ln-768"></a>
+<a id="ln-769" name="ln-769" href="#ln-769"></a><span class="w">    </span><span class="c">! End</span>
+<a id="ln-770" name="ln-770" href="#ln-770"></a><span class="w">    </span><span class="k">return</span>
+<a id="ln-771" name="ln-771" href="#ln-771"></a>
+<a id="ln-772" name="ln-772" href="#ln-772"></a><span class="w">    </span><span class="c">! Memroy Allocation Error Handling</span>
+<a id="ln-773" name="ln-773" href="#ln-773"></a><span class="mi">20</span><span class="w">  </span><span class="k">continue</span>
+<a id="ln-774" name="ln-774" href="#ln-774"></a><span class="k">    call </span><span class="n">report_memory_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;jacobian&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
+<a id="ln-775" name="ln-775" href="#ln-775"></a><span class="w">    </span><span class="k">return</span>
+<a id="ln-776" name="ln-776" href="#ln-776"></a><span class="k">end subroutine</span>
+<a id="ln-777" name="ln-777" href="#ln-777"></a>
+<a id="ln-778" name="ln-778" href="#ln-778"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-779" name="ln-779" href="#ln-779"></a><span class="k">subroutine </span><span class="n">nonlinear_least_squares</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="n">params</span><span class="p">,</span><span class="w"> </span><span class="n">ymod</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-780" name="ln-780" href="#ln-780"></a><span class="w">    </span><span class="n">resid</span><span class="p">,</span><span class="w"> </span><span class="n">weights</span><span class="p">,</span><span class="w"> </span><span class="n">maxp</span><span class="p">,</span><span class="w"> </span><span class="n">minp</span><span class="p">,</span><span class="w"> </span><span class="n">stats</span><span class="p">,</span><span class="w"> </span><span class="n">alpha</span><span class="p">,</span><span class="w"> </span><span class="n">controls</span><span class="p">,</span><span class="w"> </span><span class="n">settings</span><span class="p">,</span><span class="w"> </span><span class="n">info</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-781" name="ln-781" href="#ln-781"></a><span class="w">    </span><span class="n">status</span><span class="p">,</span><span class="w"> </span><span class="n">err</span><span class="p">)</span>
+<a id="ln-782" name="ln-782" href="#ln-782"></a><span class="w">    </span><span class="c">!! Performs a nonlinear regression to fit a model using a version</span>
+<a id="ln-783" name="ln-783" href="#ln-783"></a><span class="w">    </span><span class="c">!! of the Levenberg-Marquardt algorithm.</span>
+<a id="ln-784" name="ln-784" href="#ln-784"></a><span class="w">    </span><span class="k">procedure</span><span class="p">(</span><span class="n">regression_function</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">fun</span>
+<a id="ln-785" name="ln-785" href="#ln-785"></a><span class="w">        </span><span class="c">!! A pointer to the regression_function to evaluate.</span>
+<a id="ln-786" name="ln-786" href="#ln-786"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span><span class="p">(:)</span>
+<a id="ln-787" name="ln-787" href="#ln-787"></a><span class="w">        </span><span class="c">!! The M-element array containing independent data.</span>
+<a id="ln-788" name="ln-788" href="#ln-788"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">y</span><span class="p">(:)</span>
+<a id="ln-789" name="ln-789" href="#ln-789"></a><span class="w">        </span><span class="c">!! The M-element array containing dependent data.</span>
+<a id="ln-790" name="ln-790" href="#ln-790"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">params</span><span class="p">(:)</span>
+<a id="ln-791" name="ln-791" href="#ln-791"></a><span class="w">        </span><span class="c">!! On input, the N-element array containing the initial estimate</span>
+<a id="ln-792" name="ln-792" href="#ln-792"></a><span class="w">        </span><span class="c">!! of the model parameters.  On output, the computed model </span>
+<a id="ln-793" name="ln-793" href="#ln-793"></a><span class="w">        </span><span class="c">!! parameters.</span>
+<a id="ln-794" name="ln-794" href="#ln-794"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">ymod</span><span class="p">(:)</span>
+<a id="ln-795" name="ln-795" href="#ln-795"></a><span class="w">        </span><span class="c">!! An M-element array where the modeled dependent data will</span>
+<a id="ln-796" name="ln-796" href="#ln-796"></a><span class="w">        </span><span class="c">!! be written.</span>
+<a id="ln-797" name="ln-797" href="#ln-797"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">resid</span><span class="p">(:)</span>
+<a id="ln-798" name="ln-798" href="#ln-798"></a><span class="w">        </span><span class="c">!! An M-element array where the model residuals will be</span>
+<a id="ln-799" name="ln-799" href="#ln-799"></a><span class="w">        </span><span class="c">!! written.</span>
+<a id="ln-800" name="ln-800" href="#ln-800"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">weights</span><span class="p">(:)</span>
+<a id="ln-801" name="ln-801" href="#ln-801"></a><span class="w">        </span><span class="c">!! An optional M-element array allowing the weighting of</span>
+<a id="ln-802" name="ln-802" href="#ln-802"></a><span class="w">        </span><span class="c">!! individual points.</span>
+<a id="ln-803" name="ln-803" href="#ln-803"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">maxp</span><span class="p">(:)</span>
+<a id="ln-804" name="ln-804" href="#ln-804"></a><span class="w">        </span><span class="c">!! An optional N-element array that can be used as upper limits </span>
+<a id="ln-805" name="ln-805" href="#ln-805"></a><span class="w">        </span><span class="c">!! on the parameter values.  If no upper limit is requested for</span>
+<a id="ln-806" name="ln-806" href="#ln-806"></a><span class="w">        </span><span class="c">!! a particular parameter, utilize a very large value.  The </span>
+<a id="ln-807" name="ln-807" href="#ln-807"></a><span class="w">        </span><span class="c">!! internal default is to utilize huge() as a value.</span>
+<a id="ln-808" name="ln-808" href="#ln-808"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">minp</span><span class="p">(:)</span>
+<a id="ln-809" name="ln-809" href="#ln-809"></a><span class="w">        </span><span class="c">!! An optional N-element array that can be used as lower limits </span>
+<a id="ln-810" name="ln-810" href="#ln-810"></a><span class="w">        </span><span class="c">!! on the parameter values.  If no lower limit is requested for</span>
+<a id="ln-811" name="ln-811" href="#ln-811"></a><span class="w">        </span><span class="c">!! a particalar parameter, utilize a very large magnitude, but </span>
+<a id="ln-812" name="ln-812" href="#ln-812"></a><span class="w">        </span><span class="c">!! negative, value.  The internal default is to utilize -huge() </span>
+<a id="ln-813" name="ln-813" href="#ln-813"></a><span class="w">        </span><span class="c">!! as a value.</span>
+<a id="ln-814" name="ln-814" href="#ln-814"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">regression_statistics</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">stats</span><span class="p">(:)</span>
+<a id="ln-815" name="ln-815" href="#ln-815"></a><span class="w">        </span><span class="c">!! An optional N-element array that, if supplied, will be used </span>
+<a id="ln-816" name="ln-816" href="#ln-816"></a><span class="w">        </span><span class="c">!! to return statistics about the fit for each parameter.</span>
+<a id="ln-817" name="ln-817" href="#ln-817"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">alpha</span>
+<a id="ln-818" name="ln-818" href="#ln-818"></a><span class="w">        </span><span class="c">!! The significance level at which to evaluate the confidence </span>
+<a id="ln-819" name="ln-819" href="#ln-819"></a><span class="w">        </span><span class="c">!! intervals.  The default value is 0.05 such that a 95% </span>
+<a id="ln-820" name="ln-820" href="#ln-820"></a><span class="w">        </span><span class="c">!! confidence interval is calculated.</span>
+<a id="ln-821" name="ln-821" href="#ln-821"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">iteration_controls</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">controls</span>
+<a id="ln-822" name="ln-822" href="#ln-822"></a><span class="w">        </span><span class="c">!! An optional input providing custom iteration controls.</span>
+<a id="ln-823" name="ln-823" href="#ln-823"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">lm_solver_options</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">settings</span>
+<a id="ln-824" name="ln-824" href="#ln-824"></a><span class="w">        </span><span class="c">!! An optional input providing custom settings for the solver.</span>
+<a id="ln-825" name="ln-825" href="#ln-825"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">convergence_info</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">info</span>
+<a id="ln-826" name="ln-826" href="#ln-826"></a><span class="w">        </span><span class="c">!! An optional output that can be used to gain information about</span>
+<a id="ln-827" name="ln-827" href="#ln-827"></a><span class="w">        </span><span class="c">!! the iterative solution and the nature of the convergence.</span>
+<a id="ln-828" name="ln-828" href="#ln-828"></a><span class="w">    </span><span class="k">procedure</span><span class="p">(</span><span class="n">iteration_update</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="p">,</span><span class="w"> </span><span class="k">optional</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">status</span>
+<a id="ln-829" name="ln-829" href="#ln-829"></a><span class="w">        </span><span class="c">!! An optional pointer to a routine that can be used to extract</span>
+<a id="ln-830" name="ln-830" href="#ln-830"></a><span class="w">        </span><span class="c">!! iteration information.</span>
+<a id="ln-831" name="ln-831" href="#ln-831"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">),</span><span class="w"> </span><span class="k">optional</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">err</span>
+<a id="ln-832" name="ln-832" href="#ln-832"></a><span class="w">        </span><span class="c">!! A mechanism for communicating errors and warnings to the </span>
+<a id="ln-833" name="ln-833" href="#ln-833"></a><span class="w">        </span><span class="c">!! caller.  Possible warning and error codes are as follows.</span>
+<a id="ln-834" name="ln-834" href="#ln-834"></a><span class="w">        </span><span class="c">!! - FS_NO_ERROR: No errors encountered.</span>
+<a id="ln-835" name="ln-835" href="#ln-835"></a><span class="w">        </span><span class="c">!! - FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not </span>
+<a id="ln-836" name="ln-836" href="#ln-836"></a><span class="w">        </span><span class="c">!!      properly sized.</span>
+<a id="ln-837" name="ln-837" href="#ln-837"></a><span class="w">        </span><span class="c">!! - FS_MEMORY_ERROR: Occurs if there is a memory allocation </span>
+<a id="ln-838" name="ln-838" href="#ln-838"></a><span class="w">        </span><span class="c">!!      error.</span>
+<a id="ln-839" name="ln-839" href="#ln-839"></a><span class="w">        </span><span class="c">!! - FS_UNDERDEFINED_PROBLEM_ERROR: Occurs if the problem posed </span>
+<a id="ln-840" name="ln-840" href="#ln-840"></a><span class="w">        </span><span class="c">!!      is underdetetermined (M &lt; N).</span>
+<a id="ln-841" name="ln-841" href="#ln-841"></a><span class="w">        </span><span class="c">!! - FS_TOLERANCE_TOO_SMALL_ERROR: Occurs if any supplied </span>
+<a id="ln-842" name="ln-842" href="#ln-842"></a><span class="w">        </span><span class="c">!!      tolerances are too small to be practical.</span>
+<a id="ln-843" name="ln-843" href="#ln-843"></a><span class="w">        </span><span class="c">!! - FS_TOO_FEW_ITERATION_ERROR: Occurs if too few iterations </span>
+<a id="ln-844" name="ln-844" href="#ln-844"></a><span class="w">        </span><span class="c">!!      are allowed.</span>
+<a id="ln-845" name="ln-845" href="#ln-845"></a>
+<a id="ln-846" name="ln-846" href="#ln-846"></a><span class="w">    </span><span class="c">! Parameters</span>
+<a id="ln-847" name="ln-847" href="#ln-847"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">too_small</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d-14</span>
+<a id="ln-848" name="ln-848" href="#ln-848"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">min_iter_count</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">2</span>
+<a id="ln-849" name="ln-849" href="#ln-849"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">min_fun_count</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">10</span>
+<a id="ln-850" name="ln-850" href="#ln-850"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">parameter</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">min_update_count</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span>
+<a id="ln-851" name="ln-851" href="#ln-851"></a>
+<a id="ln-852" name="ln-852" href="#ln-852"></a><span class="w">    </span><span class="c">! Local Variables</span>
+<a id="ln-853" name="ln-853" href="#ln-853"></a><span class="w">    </span><span class="kt">logical</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="k">stop</span>
+<a id="ln-854" name="ln-854" href="#ln-854"></a><span class="k">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">m</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">actual</span><span class="p">,</span><span class="w"> </span><span class="n">expected</span><span class="p">,</span><span class="w"> </span><span class="n">flag</span>
+<a id="ln-855" name="ln-855" href="#ln-855"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">w</span><span class="p">(:),</span><span class="w"> </span><span class="n">pmax</span><span class="p">(:),</span><span class="w"> </span><span class="n">pmin</span><span class="p">(:)</span>
+<a id="ln-856" name="ln-856" href="#ln-856"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">allocatable</span><span class="p">,</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">defaultWeights</span><span class="p">(:),</span><span class="w"> </span><span class="n">maxparam</span><span class="p">(:),</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-857" name="ln-857" href="#ln-857"></a><span class="w">        </span><span class="n">minparam</span><span class="p">(:),</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">(:,:)</span>
+<a id="ln-858" name="ln-858" href="#ln-858"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">iteration_controls</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">tol</span>
+<a id="ln-859" name="ln-859" href="#ln-859"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">lm_solver_options</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">opt</span>
+<a id="ln-860" name="ln-860" href="#ln-860"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">convergence_info</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">cInfo</span>
+<a id="ln-861" name="ln-861" href="#ln-861"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">errmgr</span>
+<a id="ln-862" name="ln-862" href="#ln-862"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">deferr</span>
+<a id="ln-863" name="ln-863" href="#ln-863"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">convergence_info</span><span class="p">),</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">defaultinfo</span>
+<a id="ln-864" name="ln-864" href="#ln-864"></a><span class="w">    </span><span class="k">type</span><span class="p">(</span><span class="n">convergence_info</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">inf</span>
+<a id="ln-865" name="ln-865" href="#ln-865"></a><span class="w">    </span>
+<a id="ln-866" name="ln-866" href="#ln-866"></a><span class="w">    </span><span class="c">! Initialization</span>
+<a id="ln-867" name="ln-867" href="#ln-867"></a><span class="w">    </span><span class="k">stop</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">false</span><span class="p">.</span>
+<a id="ln-868" name="ln-868" href="#ln-868"></a><span class="w">    </span><span class="n">m</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
+<a id="ln-869" name="ln-869" href="#ln-869"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">params</span><span class="p">)</span>
+<a id="ln-870" name="ln-870" href="#ln-870"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">info</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-871" name="ln-871" href="#ln-871"></a><span class="k">        </span><span class="n">inf</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">info</span>
+<a id="ln-872" name="ln-872" href="#ln-872"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-873" name="ln-873" href="#ln-873"></a><span class="k">        </span><span class="n">inf</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">defaultinfo</span>
+<a id="ln-874" name="ln-874" href="#ln-874"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-875" name="ln-875" href="#ln-875"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">err</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-876" name="ln-876" href="#ln-876"></a><span class="k">        </span><span class="n">errmgr</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">err</span>
+<a id="ln-877" name="ln-877" href="#ln-877"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-878" name="ln-878" href="#ln-878"></a><span class="k">        </span><span class="n">errmgr</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">deferr</span>
+<a id="ln-879" name="ln-879" href="#ln-879"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-880" name="ln-880" href="#ln-880"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">controls</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-881" name="ln-881" href="#ln-881"></a><span class="k">        </span><span class="n">tol</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">controls</span>
+<a id="ln-882" name="ln-882" href="#ln-882"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-883" name="ln-883" href="#ln-883"></a><span class="k">        call </span><span class="n">tol</span><span class="p">%</span><span class="n">set_to_default</span><span class="p">()</span>
+<a id="ln-884" name="ln-884" href="#ln-884"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-885" name="ln-885" href="#ln-885"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">settings</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-886" name="ln-886" href="#ln-886"></a><span class="k">        </span><span class="n">opt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">settings</span>
+<a id="ln-887" name="ln-887" href="#ln-887"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-888" name="ln-888" href="#ln-888"></a><span class="k">        call </span><span class="n">opt</span><span class="p">%</span><span class="n">set_to_default</span><span class="p">()</span>
+<a id="ln-889" name="ln-889" href="#ln-889"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-890" name="ln-890" href="#ln-890"></a>
+<a id="ln-891" name="ln-891" href="#ln-891"></a><span class="w">    </span><span class="c">! Input Checking</span>
+<a id="ln-892" name="ln-892" href="#ln-892"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">y</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">m</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-893" name="ln-893" href="#ln-893"></a><span class="k">        call </span><span class="n">report_array_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-894" name="ln-894" href="#ln-894"></a><span class="w">            </span><span class="s2">&quot;y&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">m</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">y</span><span class="p">))</span>
+<a id="ln-895" name="ln-895" href="#ln-895"></a><span class="w">        </span><span class="k">return</span>
+<a id="ln-896" name="ln-896" href="#ln-896"></a><span class="k">    end if</span>
+<a id="ln-897" name="ln-897" href="#ln-897"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">ymod</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">m</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-898" name="ln-898" href="#ln-898"></a><span class="k">        call </span><span class="n">report_array_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-899" name="ln-899" href="#ln-899"></a><span class="w">            </span><span class="s2">&quot;ymod&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">m</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">ymod</span><span class="p">))</span>
+<a id="ln-900" name="ln-900" href="#ln-900"></a><span class="w">        </span><span class="k">return</span>
+<a id="ln-901" name="ln-901" href="#ln-901"></a><span class="k">    end if</span>
+<a id="ln-902" name="ln-902" href="#ln-902"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">resid</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">m</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-903" name="ln-903" href="#ln-903"></a><span class="k">        call </span><span class="n">report_array_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-904" name="ln-904" href="#ln-904"></a><span class="w">            </span><span class="s2">&quot;resid&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">m</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">resid</span><span class="p">))</span>
+<a id="ln-905" name="ln-905" href="#ln-905"></a><span class="w">        </span><span class="k">return</span>
+<a id="ln-906" name="ln-906" href="#ln-906"></a><span class="k">    end if</span>
+<a id="ln-907" name="ln-907" href="#ln-907"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="n">m</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-908" name="ln-908" href="#ln-908"></a><span class="k">        call </span><span class="n">report_underdefined_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-909" name="ln-909" href="#ln-909"></a><span class="w">            </span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">m</span><span class="p">)</span>
+<a id="ln-910" name="ln-910" href="#ln-910"></a><span class="w">        </span><span class="k">return</span>
+<a id="ln-911" name="ln-911" href="#ln-911"></a><span class="k">    end if</span>
+<a id="ln-912" name="ln-912" href="#ln-912"></a>
+<a id="ln-913" name="ln-913" href="#ln-913"></a><span class="w">    </span><span class="c">! Tolerance Checking</span>
+<a id="ln-914" name="ln-914" href="#ln-914"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">tol</span><span class="p">%</span><span class="n">gradient_tolerance</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">too_small</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-915" name="ln-915" href="#ln-915"></a><span class="k">        call </span><span class="n">errmgr</span><span class="p">%</span><span class="n">report_error</span><span class="p">(</span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-916" name="ln-916" href="#ln-916"></a><span class="w">            </span><span class="s2">&quot;The gradient tolerance was found to be too small.&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-917" name="ln-917" href="#ln-917"></a><span class="w">            </span><span class="n">FS_TOLERANCE_TOO_SMALL_ERROR</span><span class="p">)</span>
+<a id="ln-918" name="ln-918" href="#ln-918"></a><span class="w">        </span><span class="k">return</span>
+<a id="ln-919" name="ln-919" href="#ln-919"></a><span class="k">    end if</span>
+<a id="ln-920" name="ln-920" href="#ln-920"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="n">tol</span><span class="p">%</span><span class="n">change_in_solution_tolerance</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">too_small</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-921" name="ln-921" href="#ln-921"></a><span class="k">        call </span><span class="n">errmgr</span><span class="p">%</span><span class="n">report_error</span><span class="p">(</span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-922" name="ln-922" href="#ln-922"></a><span class="w">            </span><span class="s2">&quot;The change in solution tolerance was found to be too small.&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-923" name="ln-923" href="#ln-923"></a><span class="w">            </span><span class="n">FS_TOLERANCE_TOO_SMALL_ERROR</span><span class="p">)</span>
+<a id="ln-924" name="ln-924" href="#ln-924"></a><span class="w">        </span><span class="k">return</span>
+<a id="ln-925" name="ln-925" href="#ln-925"></a><span class="k">    end if</span>
+<a id="ln-926" name="ln-926" href="#ln-926"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="n">tol</span><span class="p">%</span><span class="n">residual_tolerance</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">too_small</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-927" name="ln-927" href="#ln-927"></a><span class="k">        call </span><span class="n">errmgr</span><span class="p">%</span><span class="n">report_error</span><span class="p">(</span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-928" name="ln-928" href="#ln-928"></a><span class="w">            </span><span class="s2">&quot;The residual error tolerance was found to be too small.&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-929" name="ln-929" href="#ln-929"></a><span class="w">            </span><span class="n">FS_TOLERANCE_TOO_SMALL_ERROR</span><span class="p">)</span>
+<a id="ln-930" name="ln-930" href="#ln-930"></a><span class="w">        </span><span class="k">return</span>
+<a id="ln-931" name="ln-931" href="#ln-931"></a><span class="k">    end if</span>
+<a id="ln-932" name="ln-932" href="#ln-932"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="n">tol</span><span class="p">%</span><span class="n">iteration_improvement_tolerance</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">too_small</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-933" name="ln-933" href="#ln-933"></a><span class="k">        call </span><span class="n">errmgr</span><span class="p">%</span><span class="n">report_error</span><span class="p">(</span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-934" name="ln-934" href="#ln-934"></a><span class="w">            </span><span class="s2">&quot;The iteration improvement tolerance was found to be too small.&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-935" name="ln-935" href="#ln-935"></a><span class="w">            </span><span class="n">FS_TOLERANCE_TOO_SMALL_ERROR</span><span class="p">)</span>
+<a id="ln-936" name="ln-936" href="#ln-936"></a><span class="w">        </span><span class="k">return</span>
+<a id="ln-937" name="ln-937" href="#ln-937"></a><span class="k">    end if</span>
+<a id="ln-938" name="ln-938" href="#ln-938"></a>
+<a id="ln-939" name="ln-939" href="#ln-939"></a><span class="w">    </span><span class="c">! Iteration Count Checking</span>
+<a id="ln-940" name="ln-940" href="#ln-940"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">tol</span><span class="p">%</span><span class="n">max_iteration_count</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">min_iter_count</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-941" name="ln-941" href="#ln-941"></a><span class="k">        call </span><span class="n">report_iteration_count_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-942" name="ln-942" href="#ln-942"></a><span class="w">            </span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-943" name="ln-943" href="#ln-943"></a><span class="w">            </span><span class="s2">&quot;Too few iterations were specified.&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-944" name="ln-944" href="#ln-944"></a><span class="w">            </span><span class="n">min_iter_count</span><span class="p">)</span>
+<a id="ln-945" name="ln-945" href="#ln-945"></a><span class="w">        </span><span class="k">return</span>
+<a id="ln-946" name="ln-946" href="#ln-946"></a><span class="k">    end if</span>
+<a id="ln-947" name="ln-947" href="#ln-947"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="n">tol</span><span class="p">%</span><span class="n">max_function_evaluations</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">min_fun_count</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-948" name="ln-948" href="#ln-948"></a><span class="k">        call </span><span class="n">report_iteration_count_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-949" name="ln-949" href="#ln-949"></a><span class="w">            </span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-950" name="ln-950" href="#ln-950"></a><span class="w">            </span><span class="s2">&quot;Too few function evaluations were specified.&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-951" name="ln-951" href="#ln-951"></a><span class="w">            </span><span class="n">min_fun_count</span><span class="p">)</span>
+<a id="ln-952" name="ln-952" href="#ln-952"></a><span class="w">        </span><span class="k">return</span>
+<a id="ln-953" name="ln-953" href="#ln-953"></a><span class="k">    end if</span>
+<a id="ln-954" name="ln-954" href="#ln-954"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="n">tol</span><span class="p">%</span><span class="n">max_iteration_between_updates</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">min_update_count</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-955" name="ln-955" href="#ln-955"></a><span class="k">        call </span><span class="n">report_iteration_count_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-956" name="ln-956" href="#ln-956"></a><span class="w">            </span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-957" name="ln-957" href="#ln-957"></a><span class="w">            </span><span class="s2">&quot;Too few iterations between updates were specified.&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-958" name="ln-958" href="#ln-958"></a><span class="w">            </span><span class="n">min_update_count</span><span class="p">)</span>
+<a id="ln-959" name="ln-959" href="#ln-959"></a><span class="w">        </span><span class="k">return</span>
+<a id="ln-960" name="ln-960" href="#ln-960"></a><span class="k">    end if</span>
+<a id="ln-961" name="ln-961" href="#ln-961"></a>
+<a id="ln-962" name="ln-962" href="#ln-962"></a><span class="w">    </span><span class="c">! Optional Array Arguments (weights, parameter limits, etc.)</span>
+<a id="ln-963" name="ln-963" href="#ln-963"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">weights</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-964" name="ln-964" href="#ln-964"></a><span class="k">        if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">weights</span><span class="p">)</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">m</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-965" name="ln-965" href="#ln-965"></a><span class="k">            call </span><span class="n">report_array_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-966" name="ln-966" href="#ln-966"></a><span class="w">                </span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;weights&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">m</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">weights</span><span class="p">))</span>
+<a id="ln-967" name="ln-967" href="#ln-967"></a><span class="w">            </span><span class="k">return</span>
+<a id="ln-968" name="ln-968" href="#ln-968"></a><span class="k">        end if</span>
+<a id="ln-969" name="ln-969" href="#ln-969"></a><span class="k">        </span><span class="n">w</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">m</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">weights</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">m</span><span class="p">)</span>
+<a id="ln-970" name="ln-970" href="#ln-970"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-971" name="ln-971" href="#ln-971"></a><span class="k">        allocate</span><span class="p">(</span><span class="n">defaultWeights</span><span class="p">(</span><span class="n">m</span><span class="p">),</span><span class="w"> </span><span class="n">source</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d0</span><span class="p">,</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
+<a id="ln-972" name="ln-972" href="#ln-972"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">go</span><span class="w"> </span><span class="k">to</span><span class="w"> </span><span class="mi">50</span>
+<a id="ln-973" name="ln-973" href="#ln-973"></a><span class="w">        </span><span class="n">w</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">m</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">defaultWeights</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">m</span><span class="p">)</span>
+<a id="ln-974" name="ln-974" href="#ln-974"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-975" name="ln-975" href="#ln-975"></a>
+<a id="ln-976" name="ln-976" href="#ln-976"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">maxp</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-977" name="ln-977" href="#ln-977"></a><span class="k">        if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">maxp</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-978" name="ln-978" href="#ln-978"></a><span class="k">            call </span><span class="n">report_array_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-979" name="ln-979" href="#ln-979"></a><span class="w">                </span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;maxp&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">maxp</span><span class="p">))</span>
+<a id="ln-980" name="ln-980" href="#ln-980"></a><span class="w">            </span><span class="k">return</span>
+<a id="ln-981" name="ln-981" href="#ln-981"></a><span class="k">        end if</span>
+<a id="ln-982" name="ln-982" href="#ln-982"></a><span class="k">        </span><span class="n">pmax</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">maxp</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">)</span>
+<a id="ln-983" name="ln-983" href="#ln-983"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-984" name="ln-984" href="#ln-984"></a><span class="k">        allocate</span><span class="p">(</span><span class="n">maxparam</span><span class="p">(</span><span class="n">n</span><span class="p">),</span><span class="w"> </span><span class="n">source</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">huge</span><span class="p">(</span><span class="mf">1.0d0</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
+<a id="ln-985" name="ln-985" href="#ln-985"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">go</span><span class="w"> </span><span class="k">to</span><span class="w"> </span><span class="mi">50</span>
+<a id="ln-986" name="ln-986" href="#ln-986"></a><span class="w">        </span><span class="n">pmax</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">maxparam</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">)</span>
+<a id="ln-987" name="ln-987" href="#ln-987"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-988" name="ln-988" href="#ln-988"></a>
+<a id="ln-989" name="ln-989" href="#ln-989"></a><span class="k">    if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">minp</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-990" name="ln-990" href="#ln-990"></a><span class="k">        if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">minp</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-991" name="ln-991" href="#ln-991"></a><span class="k">            call </span><span class="n">report_array_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-992" name="ln-992" href="#ln-992"></a><span class="w">                </span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;minp&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">minp</span><span class="p">))</span>
+<a id="ln-993" name="ln-993" href="#ln-993"></a><span class="w">            </span><span class="k">return</span>
+<a id="ln-994" name="ln-994" href="#ln-994"></a><span class="k">        end if</span>
+<a id="ln-995" name="ln-995" href="#ln-995"></a><span class="k">        </span><span class="n">pmin</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">minp</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">)</span>
+<a id="ln-996" name="ln-996" href="#ln-996"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-997" name="ln-997" href="#ln-997"></a><span class="k">        allocate</span><span class="p">(</span><span class="n">minparam</span><span class="p">(</span><span class="n">n</span><span class="p">),</span><span class="w"> </span><span class="n">source</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="o">-</span><span class="nb">huge</span><span class="p">(</span><span class="mf">1.0d0</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
+<a id="ln-998" name="ln-998" href="#ln-998"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">go</span><span class="w"> </span><span class="k">to</span><span class="w"> </span><span class="mi">50</span>
+<a id="ln-999" name="ln-999" href="#ln-999"></a><span class="w">        </span><span class="n">pmin</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">minparam</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">)</span>
+<a id="ln-1000" name="ln-1000" href="#ln-1000"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-1001" name="ln-1001" href="#ln-1001"></a>
+<a id="ln-1002" name="ln-1002" href="#ln-1002"></a><span class="w">    </span><span class="c">! Local Memory Allocations</span>
+<a id="ln-1003" name="ln-1003" href="#ln-1003"></a><span class="w">    </span><span class="k">allocate</span><span class="p">(</span><span class="n">JtWJ</span><span class="p">(</span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
+<a id="ln-1004" name="ln-1004" href="#ln-1004"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">go</span><span class="w"> </span><span class="k">to</span><span class="w"> </span><span class="mi">50</span>
+<a id="ln-1005" name="ln-1005" href="#ln-1005"></a>
+<a id="ln-1006" name="ln-1006" href="#ln-1006"></a><span class="w">    </span><span class="c">! Process</span>
+<a id="ln-1007" name="ln-1007" href="#ln-1007"></a><span class="w">    </span><span class="k">call </span><span class="n">lm_solve</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="n">params</span><span class="p">,</span><span class="w"> </span><span class="n">w</span><span class="p">,</span><span class="w"> </span><span class="n">pmax</span><span class="p">,</span><span class="w"> </span><span class="n">pmin</span><span class="p">,</span><span class="w"> </span><span class="n">tol</span><span class="p">,</span><span class="w"> </span><span class="n">opt</span><span class="p">,</span><span class="w"> </span><span class="n">ymod</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1008" name="ln-1008" href="#ln-1008"></a><span class="w">        </span><span class="n">resid</span><span class="p">,</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="n">inf</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">,</span><span class="w"> </span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="n">status</span><span class="p">)</span>
+<a id="ln-1009" name="ln-1009" href="#ln-1009"></a>
+<a id="ln-1010" name="ln-1010" href="#ln-1010"></a><span class="w">    </span><span class="c">! Statistical Parameters</span>
+<a id="ln-1011" name="ln-1011" href="#ln-1011"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">stats</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-1012" name="ln-1012" href="#ln-1012"></a><span class="k">        if</span><span class="w"> </span><span class="p">(</span><span class="n">size</span><span class="p">(</span><span class="n">stats</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-1013" name="ln-1013" href="#ln-1013"></a><span class="k">            call </span><span class="n">report_array_size_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1014" name="ln-1014" href="#ln-1014"></a><span class="w">                </span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;stats&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">stats</span><span class="p">))</span>
+<a id="ln-1015" name="ln-1015" href="#ln-1015"></a><span class="w">            </span><span class="k">return</span>
+<a id="ln-1016" name="ln-1016" href="#ln-1016"></a><span class="k">        end if</span>
+<a id="ln-1017" name="ln-1017" href="#ln-1017"></a>
+<a id="ln-1018" name="ln-1018" href="#ln-1018"></a><span class="w">        </span><span class="c">! Compute the covariance matrix</span>
+<a id="ln-1019" name="ln-1019" href="#ln-1019"></a><span class="w">        </span><span class="k">call </span><span class="n">mtx_inverse</span><span class="p">(</span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="n">err</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">errmgr</span><span class="p">)</span>
+<a id="ln-1020" name="ln-1020" href="#ln-1020"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">errmgr</span><span class="p">%</span><span class="n">has_error_occurred</span><span class="p">())</span><span class="w"> </span><span class="k">return</span>
+<a id="ln-1021" name="ln-1021" href="#ln-1021"></a>
+<a id="ln-1022" name="ln-1022" href="#ln-1022"></a><span class="w">        </span><span class="c">! Compute the statistics</span>
+<a id="ln-1023" name="ln-1023" href="#ln-1023"></a><span class="w">        </span><span class="n">stats</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">calculate_regression_statistics</span><span class="p">(</span><span class="n">resid</span><span class="p">,</span><span class="w"> </span><span class="n">params</span><span class="p">,</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1024" name="ln-1024" href="#ln-1024"></a><span class="w">            </span><span class="n">alpha</span><span class="p">,</span><span class="w"> </span><span class="n">errmgr</span><span class="p">)</span>
+<a id="ln-1025" name="ln-1025" href="#ln-1025"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-1026" name="ln-1026" href="#ln-1026"></a>
+<a id="ln-1027" name="ln-1027" href="#ln-1027"></a><span class="w">    </span><span class="c">! End</span>
+<a id="ln-1028" name="ln-1028" href="#ln-1028"></a><span class="w">    </span><span class="k">return</span>
+<a id="ln-1029" name="ln-1029" href="#ln-1029"></a>
+<a id="ln-1030" name="ln-1030" href="#ln-1030"></a><span class="w">    </span><span class="c">! Memory Error Handler</span>
+<a id="ln-1031" name="ln-1031" href="#ln-1031"></a><span class="mi">50</span><span class="w">      </span><span class="k">continue</span>
+<a id="ln-1032" name="ln-1032" href="#ln-1032"></a><span class="k">    call </span><span class="n">report_memory_error</span><span class="p">(</span><span class="n">errmgr</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;nonlinear_least_squares&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
+<a id="ln-1033" name="ln-1033" href="#ln-1033"></a><span class="w">    </span><span class="k">return</span>
+<a id="ln-1034" name="ln-1034" href="#ln-1034"></a><span class="k">end subroutine</span>
+<a id="ln-1035" name="ln-1035" href="#ln-1035"></a>
+<a id="ln-1036" name="ln-1036" href="#ln-1036"></a><span class="c">! ******************************************************************************</span>
+<a id="ln-1037" name="ln-1037" href="#ln-1037"></a><span class="c">! SETTINGS DEFAULTS</span>
+<a id="ln-1038" name="ln-1038" href="#ln-1038"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-1039" name="ln-1039" href="#ln-1039"></a><span class="c">! Sets up default tolerances.</span>
+<a id="ln-1040" name="ln-1040" href="#ln-1040"></a><span class="k">subroutine </span><span class="n">lm_set_default_tolerances</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
+<a id="ln-1041" name="ln-1041" href="#ln-1041"></a><span class="w">    </span><span class="c">! Arguments</span>
+<a id="ln-1042" name="ln-1042" href="#ln-1042"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">iteration_controls</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span>
+<a id="ln-1043" name="ln-1043" href="#ln-1043"></a>
+<a id="ln-1044" name="ln-1044" href="#ln-1044"></a><span class="w">    </span><span class="c">! Set defaults</span>
+<a id="ln-1045" name="ln-1045" href="#ln-1045"></a><span class="w">    </span><span class="n">x</span><span class="p">%</span><span class="n">max_iteration_count</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">500</span>
+<a id="ln-1046" name="ln-1046" href="#ln-1046"></a><span class="w">    </span><span class="n">x</span><span class="p">%</span><span class="n">max_function_evaluations</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">5000</span>
+<a id="ln-1047" name="ln-1047" href="#ln-1047"></a><span class="w">    </span><span class="n">x</span><span class="p">%</span><span class="n">max_iteration_between_updates</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">10</span>
+<a id="ln-1048" name="ln-1048" href="#ln-1048"></a><span class="w">    </span><span class="n">x</span><span class="p">%</span><span class="n">gradient_tolerance</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d-8</span>
+<a id="ln-1049" name="ln-1049" href="#ln-1049"></a><span class="w">    </span><span class="n">x</span><span class="p">%</span><span class="n">residual_tolerance</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.5d-2</span>
+<a id="ln-1050" name="ln-1050" href="#ln-1050"></a><span class="w">    </span><span class="n">x</span><span class="p">%</span><span class="n">change_in_solution_tolerance</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d-6</span>
+<a id="ln-1051" name="ln-1051" href="#ln-1051"></a><span class="w">    </span><span class="n">x</span><span class="p">%</span><span class="n">iteration_improvement_tolerance</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d-1</span>
+<a id="ln-1052" name="ln-1052" href="#ln-1052"></a><span class="k">end subroutine</span>
+<a id="ln-1053" name="ln-1053" href="#ln-1053"></a>
+<a id="ln-1054" name="ln-1054" href="#ln-1054"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-1055" name="ln-1055" href="#ln-1055"></a><span class="c">! Sets up default solver settings.</span>
+<a id="ln-1056" name="ln-1056" href="#ln-1056"></a><span class="k">subroutine </span><span class="n">lm_set_default_settings</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
+<a id="ln-1057" name="ln-1057" href="#ln-1057"></a><span class="w">    </span><span class="c">! Arguments</span>
+<a id="ln-1058" name="ln-1058" href="#ln-1058"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">lm_solver_options</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span>
+<a id="ln-1059" name="ln-1059" href="#ln-1059"></a>
+<a id="ln-1060" name="ln-1060" href="#ln-1060"></a><span class="w">    </span><span class="c">! Set defaults</span>
+<a id="ln-1061" name="ln-1061" href="#ln-1061"></a><span class="w">    </span><span class="n">x</span><span class="p">%</span><span class="n">method</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">FS_LEVENBERG_MARQUARDT_UPDATE</span>
+<a id="ln-1062" name="ln-1062" href="#ln-1062"></a><span class="w">    </span><span class="n">x</span><span class="p">%</span><span class="n">finite_difference_step_size</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">sqrt</span><span class="p">(</span><span class="nb">epsilon</span><span class="p">(</span><span class="mf">1.0d0</span><span class="p">))</span>
+<a id="ln-1063" name="ln-1063" href="#ln-1063"></a><span class="w">    </span><span class="n">x</span><span class="p">%</span><span class="n">damping_increase_factor</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="mf">1.0d0</span>
+<a id="ln-1064" name="ln-1064" href="#ln-1064"></a><span class="w">    </span><span class="n">x</span><span class="p">%</span><span class="n">damping_decrease_factor</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">9.0d0</span>
+<a id="ln-1065" name="ln-1065" href="#ln-1065"></a><span class="k">end subroutine</span>
+<a id="ln-1066" name="ln-1066" href="#ln-1066"></a>
+<a id="ln-1067" name="ln-1067" href="#ln-1067"></a><span class="c">! ******************************************************************************</span>
+<a id="ln-1068" name="ln-1068" href="#ln-1068"></a><span class="c">! PRIVATE ROUTINES</span>
+<a id="ln-1069" name="ln-1069" href="#ln-1069"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-1070" name="ln-1070" href="#ln-1070"></a><span class="c">! Computes the Jacobian matrix via a forward difference.</span>
+<a id="ln-1071" name="ln-1071" href="#ln-1071"></a><span class="c">!</span>
+<a id="ln-1072" name="ln-1072" href="#ln-1072"></a><span class="c">! Inputs:</span>
+<a id="ln-1073" name="ln-1073" href="#ln-1073"></a><span class="c">! - fun: The function to evaluate</span>
+<a id="ln-1074" name="ln-1074" href="#ln-1074"></a><span class="c">! - xdata: The independent coordinate data to fit (M-by-1)</span>
+<a id="ln-1075" name="ln-1075" href="#ln-1075"></a><span class="c">! - params: The model parameters (N-by-1)</span>
+<a id="ln-1076" name="ln-1076" href="#ln-1076"></a><span class="c">! - f0: The current model estimate (M-by-1)</span>
+<a id="ln-1077" name="ln-1077" href="#ln-1077"></a><span class="c">! - step: The differentiation step size</span>
+<a id="ln-1078" name="ln-1078" href="#ln-1078"></a><span class="c">!</span>
+<a id="ln-1079" name="ln-1079" href="#ln-1079"></a><span class="c">! Outputs:</span>
+<a id="ln-1080" name="ln-1080" href="#ln-1080"></a><span class="c">! - jac: The Jacobian matrix (M-by-N)</span>
+<a id="ln-1081" name="ln-1081" href="#ln-1081"></a><span class="c">! - f1: A workspace array for the model output (M-by-1)</span>
+<a id="ln-1082" name="ln-1082" href="#ln-1082"></a><span class="c">! - stop: A flag allowing the user to terminate model execution</span>
+<a id="ln-1083" name="ln-1083" href="#ln-1083"></a><span class="c">! - work: A workspace array for the model parameters (N-by-1)</span>
+<a id="ln-1084" name="ln-1084" href="#ln-1084"></a><span class="k">subroutine </span><span class="n">jacobian_finite_diff</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">params</span><span class="p">,</span><span class="w"> </span><span class="n">f0</span><span class="p">,</span><span class="w"> </span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="n">f1</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1085" name="ln-1085" href="#ln-1085"></a><span class="w">    </span><span class="k">stop</span><span class="p">,</span><span class="w"> </span><span class="n">step</span><span class="p">,</span><span class="w"> </span><span class="n">work</span><span class="p">)</span>
+<a id="ln-1086" name="ln-1086" href="#ln-1086"></a><span class="w">    </span><span class="c">! Arguments</span>
+<a id="ln-1087" name="ln-1087" href="#ln-1087"></a><span class="w">    </span><span class="k">procedure</span><span class="p">(</span><span class="n">regression_function</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">fun</span>
+<a id="ln-1088" name="ln-1088" href="#ln-1088"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">xdata</span><span class="p">(:),</span><span class="w"> </span><span class="n">params</span><span class="p">(:)</span>
+<a id="ln-1089" name="ln-1089" href="#ln-1089"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">f0</span><span class="p">(:)</span>
+<a id="ln-1090" name="ln-1090" href="#ln-1090"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">jac</span><span class="p">(:,:)</span>
+<a id="ln-1091" name="ln-1091" href="#ln-1091"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">f1</span><span class="p">(:),</span><span class="w"> </span><span class="n">work</span><span class="p">(:)</span>
+<a id="ln-1092" name="ln-1092" href="#ln-1092"></a><span class="w">    </span><span class="kt">logical</span><span class="p">,</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="k">stop</span>
+<a id="ln-1093" name="ln-1093" href="#ln-1093"></a><span class="k">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">step</span>
+<a id="ln-1094" name="ln-1094" href="#ln-1094"></a>
+<a id="ln-1095" name="ln-1095" href="#ln-1095"></a><span class="w">    </span><span class="c">! Local Variables</span>
+<a id="ln-1096" name="ln-1096" href="#ln-1096"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">i</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
+<a id="ln-1097" name="ln-1097" href="#ln-1097"></a>
+<a id="ln-1098" name="ln-1098" href="#ln-1098"></a><span class="w">    </span><span class="c">! Initialization</span>
+<a id="ln-1099" name="ln-1099" href="#ln-1099"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">params</span><span class="p">)</span>
+<a id="ln-1100" name="ln-1100" href="#ln-1100"></a>
+<a id="ln-1101" name="ln-1101" href="#ln-1101"></a><span class="w">    </span><span class="c">! Cycle over each column of the Jacobian and calculate the derivative</span>
+<a id="ln-1102" name="ln-1102" href="#ln-1102"></a><span class="w">    </span><span class="c">! via a forward difference scheme</span>
+<a id="ln-1103" name="ln-1103" href="#ln-1103"></a><span class="w">    </span><span class="c">!</span>
+<a id="ln-1104" name="ln-1104" href="#ln-1104"></a><span class="w">    </span><span class="c">! J(i,j) = df(i) / dx(j)</span>
+<a id="ln-1105" name="ln-1105" href="#ln-1105"></a><span class="w">    </span><span class="n">work</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">params</span>
+<a id="ln-1106" name="ln-1106" href="#ln-1106"></a><span class="w">    </span><span class="k">do </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
+<a id="ln-1107" name="ln-1107" href="#ln-1107"></a><span class="w">        </span><span class="n">work</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">work</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">step</span>
+<a id="ln-1108" name="ln-1108" href="#ln-1108"></a><span class="w">        </span><span class="k">call </span><span class="n">fun</span><span class="p">(</span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">work</span><span class="p">,</span><span class="w"> </span><span class="n">f1</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">)</span>
+<a id="ln-1109" name="ln-1109" href="#ln-1109"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="k">stop</span><span class="p">)</span><span class="w"> </span><span class="k">return</span>
+<a id="ln-1110" name="ln-1110" href="#ln-1110"></a>
+<a id="ln-1111" name="ln-1111" href="#ln-1111"></a><span class="k">        </span><span class="n">jac</span><span class="p">(:,</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">f1</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">f0</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">step</span>
+<a id="ln-1112" name="ln-1112" href="#ln-1112"></a><span class="w">        </span><span class="n">work</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">params</span><span class="p">(</span><span class="n">i</span><span class="p">)</span>
+<a id="ln-1113" name="ln-1113" href="#ln-1113"></a><span class="w">    </span><span class="k">end do</span>
+<a id="ln-1114" name="ln-1114" href="#ln-1114"></a><span class="k">end subroutine</span>
+<a id="ln-1115" name="ln-1115" href="#ln-1115"></a>
+<a id="ln-1116" name="ln-1116" href="#ln-1116"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-1117" name="ln-1117" href="#ln-1117"></a><span class="c">! Computes a rank-1 update to the Jacobian matrix</span>
+<a id="ln-1118" name="ln-1118" href="#ln-1118"></a><span class="c">!</span>
+<a id="ln-1119" name="ln-1119" href="#ln-1119"></a><span class="c">! Inputs:</span>
+<a id="ln-1120" name="ln-1120" href="#ln-1120"></a><span class="c">! - pOld: previous set of parameters (N-by-1)</span>
+<a id="ln-1121" name="ln-1121" href="#ln-1121"></a><span class="c">! - yOld: model evaluation at previous set of parameters (M-by-1)</span>
+<a id="ln-1122" name="ln-1122" href="#ln-1122"></a><span class="c">! - jac: current Jacobian estimate (M-by-N)</span>
+<a id="ln-1123" name="ln-1123" href="#ln-1123"></a><span class="c">! - p: current set of parameters (N-by-1)</span>
+<a id="ln-1124" name="ln-1124" href="#ln-1124"></a><span class="c">! - y: model evaluation at current set of parameters (M-by-1)</span>
+<a id="ln-1125" name="ln-1125" href="#ln-1125"></a><span class="c">! </span>
+<a id="ln-1126" name="ln-1126" href="#ln-1126"></a><span class="c">! Outputs:</span>
+<a id="ln-1127" name="ln-1127" href="#ln-1127"></a><span class="c">! - jac: updated Jacobian matrix (M-by-N) (dy * dp**T + J)</span>
+<a id="ln-1128" name="ln-1128" href="#ln-1128"></a><span class="c">! - dp: p - pOld (N-by-1)</span>
+<a id="ln-1129" name="ln-1129" href="#ln-1129"></a><span class="c">! - dy: (y - yOld - J * dp) / (dp&#39; * dp) (M-by-1)</span>
+<a id="ln-1130" name="ln-1130" href="#ln-1130"></a><span class="k">subroutine </span><span class="n">broyden_update</span><span class="p">(</span><span class="n">pOld</span><span class="p">,</span><span class="w"> </span><span class="n">yOld</span><span class="p">,</span><span class="w"> </span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="n">dp</span><span class="p">,</span><span class="w"> </span><span class="n">dy</span><span class="p">)</span>
+<a id="ln-1131" name="ln-1131" href="#ln-1131"></a><span class="w">    </span><span class="c">! Arguments</span>
+<a id="ln-1132" name="ln-1132" href="#ln-1132"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">pOld</span><span class="p">(:),</span><span class="w"> </span><span class="n">yOld</span><span class="p">(:),</span><span class="w"> </span><span class="n">p</span><span class="p">(:),</span><span class="w"> </span><span class="n">y</span><span class="p">(:)</span>
+<a id="ln-1133" name="ln-1133" href="#ln-1133"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">jac</span><span class="p">(:,:)</span>
+<a id="ln-1134" name="ln-1134" href="#ln-1134"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dp</span><span class="p">(:),</span><span class="w"> </span><span class="n">dy</span><span class="p">(:)</span>
+<a id="ln-1135" name="ln-1135" href="#ln-1135"></a>
+<a id="ln-1136" name="ln-1136" href="#ln-1136"></a><span class="w">    </span><span class="c">! Local Variables</span>
+<a id="ln-1137" name="ln-1137" href="#ln-1137"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">h2</span>
+<a id="ln-1138" name="ln-1138" href="#ln-1138"></a>
+<a id="ln-1139" name="ln-1139" href="#ln-1139"></a><span class="w">    </span><span class="c">! Process</span>
+<a id="ln-1140" name="ln-1140" href="#ln-1140"></a><span class="w">    </span><span class="n">dp</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">p</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">pOld</span>
+<a id="ln-1141" name="ln-1141" href="#ln-1141"></a><span class="w">    </span><span class="n">h2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">dot_product</span><span class="p">(</span><span class="n">dp</span><span class="p">,</span><span class="w"> </span><span class="n">dp</span><span class="p">)</span>
+<a id="ln-1142" name="ln-1142" href="#ln-1142"></a><span class="w">    </span><span class="n">dy</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">yOld</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="nb">matmul</span><span class="p">(</span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="n">dp</span><span class="p">)</span>
+<a id="ln-1143" name="ln-1143" href="#ln-1143"></a><span class="w">    </span><span class="n">dy</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">dy</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">h2</span>
+<a id="ln-1144" name="ln-1144" href="#ln-1144"></a><span class="w">    </span><span class="k">call </span><span class="n">rank1_update</span><span class="p">(</span><span class="mf">1.0d0</span><span class="p">,</span><span class="w"> </span><span class="n">dy</span><span class="p">,</span><span class="w"> </span><span class="n">dp</span><span class="p">,</span><span class="w"> </span><span class="n">jac</span><span class="p">)</span>
+<a id="ln-1145" name="ln-1145" href="#ln-1145"></a><span class="k">end subroutine</span>
+<a id="ln-1146" name="ln-1146" href="#ln-1146"></a>
+<a id="ln-1147" name="ln-1147" href="#ln-1147"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-1148" name="ln-1148" href="#ln-1148"></a><span class="c">! Updates the Levenberg-Marquardt matrix by either computing a new Jacobian</span>
+<a id="ln-1149" name="ln-1149" href="#ln-1149"></a><span class="c">! matrix or performing a rank-1 update to the existing Jacobian matrix.</span>
+<a id="ln-1150" name="ln-1150" href="#ln-1150"></a><span class="c">!</span>
+<a id="ln-1151" name="ln-1151" href="#ln-1151"></a><span class="c">! Inputs:</span>
+<a id="ln-1152" name="ln-1152" href="#ln-1152"></a><span class="c">! - fun: The function to evaluate</span>
+<a id="ln-1153" name="ln-1153" href="#ln-1153"></a><span class="c">! - xdata: The independent coordinate data to fit (M-by-1)</span>
+<a id="ln-1154" name="ln-1154" href="#ln-1154"></a><span class="c">! - ydata: The dependent coordinate data to fit (M-by-1)</span>
+<a id="ln-1155" name="ln-1155" href="#ln-1155"></a><span class="c">! - pOld: previous set of parameters (N-by-1)</span>
+<a id="ln-1156" name="ln-1156" href="#ln-1156"></a><span class="c">! - yOld: model evaluation at previous set of parameters (M-by-1)</span>
+<a id="ln-1157" name="ln-1157" href="#ln-1157"></a><span class="c">! - dX2: The previous change in the Chi-squared criteria</span>
+<a id="ln-1158" name="ln-1158" href="#ln-1158"></a><span class="c">! - jac: current Jacobian estimate (M-by-N)</span>
+<a id="ln-1159" name="ln-1159" href="#ln-1159"></a><span class="c">! - p: current set of parameters (N-by-1)</span>
+<a id="ln-1160" name="ln-1160" href="#ln-1160"></a><span class="c">! - weights: A weighting vector (M-by-1)</span>
+<a id="ln-1161" name="ln-1161" href="#ln-1161"></a><span class="c">! - neval: Current number of function evaluations</span>
+<a id="ln-1162" name="ln-1162" href="#ln-1162"></a><span class="c">! - update: Set to true to force an update of the Jacobian; else, set to</span>
+<a id="ln-1163" name="ln-1163" href="#ln-1163"></a><span class="c">!       false to let the program choose based upon the change in the </span>
+<a id="ln-1164" name="ln-1164" href="#ln-1164"></a><span class="c">!       Chi-squared parameter.</span>
+<a id="ln-1165" name="ln-1165" href="#ln-1165"></a><span class="c">! - step: The differentiation step size</span>
+<a id="ln-1166" name="ln-1166" href="#ln-1166"></a><span class="c">!</span>
+<a id="ln-1167" name="ln-1167" href="#ln-1167"></a><span class="c">! Outputs:</span>
+<a id="ln-1168" name="ln-1168" href="#ln-1168"></a><span class="c">! - JtWJ: linearized Hessian matrix (inverse of the covariance matrix) (N-by-N)</span>
+<a id="ln-1169" name="ln-1169" href="#ln-1169"></a><span class="c">! - JtWdy: linearized fitting vector (N-by-1)</span>
+<a id="ln-1170" name="ln-1170" href="#ln-1170"></a><span class="c">! - X2: Updated Chi-squared criteria</span>
+<a id="ln-1171" name="ln-1171" href="#ln-1171"></a><span class="c">! - yNew: model evaluated with parameters of p (M-by-1)</span>
+<a id="ln-1172" name="ln-1172" href="#ln-1172"></a><span class="c">! - jac: updated Jacobian matrix (M-by-N)</span>
+<a id="ln-1173" name="ln-1173" href="#ln-1173"></a><span class="c">! - neval: updated count of function evaluations</span>
+<a id="ln-1174" name="ln-1174" href="#ln-1174"></a><span class="c">! - stop: A flag allowing the user to terminate model execution</span>
+<a id="ln-1175" name="ln-1175" href="#ln-1175"></a><span class="c">! - work: A workspace array (N+M-by-1)</span>
+<a id="ln-1176" name="ln-1176" href="#ln-1176"></a><span class="c">! - mwork: A workspace matrix (N-by-M)</span>
+<a id="ln-1177" name="ln-1177" href="#ln-1177"></a><span class="c">! - update: Reset to false if a Jacobian evaluation was performed.</span>
+<a id="ln-1178" name="ln-1178" href="#ln-1178"></a><span class="k">subroutine </span><span class="n">lm_matrix</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">ydata</span><span class="p">,</span><span class="w"> </span><span class="n">pOld</span><span class="p">,</span><span class="w"> </span><span class="n">yOld</span><span class="p">,</span><span class="w"> </span><span class="n">dX2</span><span class="p">,</span><span class="w"> </span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">weights</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1179" name="ln-1179" href="#ln-1179"></a><span class="w">    </span><span class="n">neval</span><span class="p">,</span><span class="w"> </span><span class="n">update</span><span class="p">,</span><span class="w"> </span><span class="n">step</span><span class="p">,</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">,</span><span class="w"> </span><span class="n">X2</span><span class="p">,</span><span class="w"> </span><span class="n">yNew</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">,</span><span class="w"> </span><span class="n">work</span><span class="p">,</span><span class="w"> </span><span class="n">mwork</span><span class="p">)</span>
+<a id="ln-1180" name="ln-1180" href="#ln-1180"></a><span class="w">    </span><span class="c">! Arguments</span>
+<a id="ln-1181" name="ln-1181" href="#ln-1181"></a><span class="w">    </span><span class="k">procedure</span><span class="p">(</span><span class="n">regression_function</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">fun</span>
+<a id="ln-1182" name="ln-1182" href="#ln-1182"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">xdata</span><span class="p">(:),</span><span class="w"> </span><span class="n">ydata</span><span class="p">(:),</span><span class="w"> </span><span class="n">pOld</span><span class="p">(:),</span><span class="w"> </span><span class="n">yOld</span><span class="p">(:),</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1183" name="ln-1183" href="#ln-1183"></a><span class="w">        </span><span class="n">p</span><span class="p">(:),</span><span class="w"> </span><span class="n">weights</span><span class="p">(:)</span>
+<a id="ln-1184" name="ln-1184" href="#ln-1184"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dX2</span><span class="p">,</span><span class="w"> </span><span class="n">step</span>
+<a id="ln-1185" name="ln-1185" href="#ln-1185"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">jac</span><span class="p">(:,:)</span>
+<a id="ln-1186" name="ln-1186" href="#ln-1186"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">neval</span>
+<a id="ln-1187" name="ln-1187" href="#ln-1187"></a><span class="w">    </span><span class="kt">logical</span><span class="p">,</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">update</span>
+<a id="ln-1188" name="ln-1188" href="#ln-1188"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">(:,:),</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">(:)</span>
+<a id="ln-1189" name="ln-1189" href="#ln-1189"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">X2</span><span class="p">,</span><span class="w"> </span><span class="n">mwork</span><span class="p">(:,:),</span><span class="w"> </span><span class="n">yNew</span><span class="p">(:)</span>
+<a id="ln-1190" name="ln-1190" href="#ln-1190"></a><span class="w">    </span><span class="kt">logical</span><span class="p">,</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="k">stop</span>
+<a id="ln-1191" name="ln-1191" href="#ln-1191"></a><span class="k">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">),</span><span class="w"> </span><span class="k">target</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">work</span><span class="p">(:)</span>
+<a id="ln-1192" name="ln-1192" href="#ln-1192"></a>
+<a id="ln-1193" name="ln-1193" href="#ln-1193"></a><span class="w">    </span><span class="c">! Local Variables</span>
+<a id="ln-1194" name="ln-1194" href="#ln-1194"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">m</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
+<a id="ln-1195" name="ln-1195" href="#ln-1195"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">w1</span><span class="p">(:),</span><span class="w"> </span><span class="n">w2</span><span class="p">(:)</span>
+<a id="ln-1196" name="ln-1196" href="#ln-1196"></a>
+<a id="ln-1197" name="ln-1197" href="#ln-1197"></a><span class="w">    </span><span class="c">! Initialization</span>
+<a id="ln-1198" name="ln-1198" href="#ln-1198"></a><span class="w">    </span><span class="n">m</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">xdata</span><span class="p">)</span>
+<a id="ln-1199" name="ln-1199" href="#ln-1199"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">p</span><span class="p">)</span>
+<a id="ln-1200" name="ln-1200" href="#ln-1200"></a><span class="w">    </span><span class="n">w1</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">m</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">work</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">m</span><span class="p">)</span>
+<a id="ln-1201" name="ln-1201" href="#ln-1201"></a><span class="w">    </span><span class="n">w2</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">work</span><span class="p">(</span><span class="n">m</span><span class="o">+</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="o">+</span><span class="n">m</span><span class="p">)</span>
+<a id="ln-1202" name="ln-1202" href="#ln-1202"></a>
+<a id="ln-1203" name="ln-1203" href="#ln-1203"></a><span class="w">    </span><span class="c">! Perform the next function evaluation</span>
+<a id="ln-1204" name="ln-1204" href="#ln-1204"></a><span class="w">    </span><span class="k">call </span><span class="n">fun</span><span class="p">(</span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">yNew</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">)</span>
+<a id="ln-1205" name="ln-1205" href="#ln-1205"></a><span class="w">    </span><span class="n">neval</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">neval</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span>
+<a id="ln-1206" name="ln-1206" href="#ln-1206"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="k">stop</span><span class="p">)</span><span class="w"> </span><span class="k">return</span>
+<a id="ln-1207" name="ln-1207" href="#ln-1207"></a>
+<a id="ln-1208" name="ln-1208" href="#ln-1208"></a><span class="w">    </span><span class="c">! Update or recompute the Jacobian matrix</span>
+<a id="ln-1209" name="ln-1209" href="#ln-1209"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">dX2</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="p">.</span><span class="nb">or</span><span class="p">.</span><span class="w"> </span><span class="n">update</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-1210" name="ln-1210" href="#ln-1210"></a><span class="w">        </span><span class="c">! Recompute the Jacobian</span>
+<a id="ln-1211" name="ln-1211" href="#ln-1211"></a><span class="w">        </span><span class="k">call </span><span class="n">jacobian_finite_diff</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">yNew</span><span class="p">,</span><span class="w"> </span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="n">w1</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1212" name="ln-1212" href="#ln-1212"></a><span class="w">            </span><span class="k">stop</span><span class="p">,</span><span class="w"> </span><span class="n">step</span><span class="p">,</span><span class="w"> </span><span class="n">w2</span><span class="p">)</span>
+<a id="ln-1213" name="ln-1213" href="#ln-1213"></a><span class="w">        </span><span class="n">neval</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">neval</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">n</span>
+<a id="ln-1214" name="ln-1214" href="#ln-1214"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="k">stop</span><span class="p">)</span><span class="w"> </span><span class="k">return</span>
+<a id="ln-1215" name="ln-1215" href="#ln-1215"></a><span class="k">        </span><span class="n">update</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">false</span><span class="p">.</span>
+<a id="ln-1216" name="ln-1216" href="#ln-1216"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-1217" name="ln-1217" href="#ln-1217"></a><span class="w">        </span><span class="c">! Simply perform a rank-1 update to the Jacobian</span>
+<a id="ln-1218" name="ln-1218" href="#ln-1218"></a><span class="w">        </span><span class="k">call </span><span class="n">broyden_update</span><span class="p">(</span><span class="n">pOld</span><span class="p">,</span><span class="w"> </span><span class="n">yOld</span><span class="p">,</span><span class="w"> </span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">yNew</span><span class="p">,</span><span class="w"> </span><span class="n">w2</span><span class="p">,</span><span class="w"> </span><span class="n">w1</span><span class="p">)</span>
+<a id="ln-1219" name="ln-1219" href="#ln-1219"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-1220" name="ln-1220" href="#ln-1220"></a>
+<a id="ln-1221" name="ln-1221" href="#ln-1221"></a><span class="w">    </span><span class="c">! Update the Chi-squared estimate</span>
+<a id="ln-1222" name="ln-1222" href="#ln-1222"></a><span class="w">    </span><span class="n">w1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">ydata</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">yNew</span>
+<a id="ln-1223" name="ln-1223" href="#ln-1223"></a><span class="w">    </span><span class="n">X2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">dot_product</span><span class="p">(</span><span class="n">w1</span><span class="p">,</span><span class="w"> </span><span class="n">w1</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">weights</span><span class="p">)</span>
+<a id="ln-1224" name="ln-1224" href="#ln-1224"></a>
+<a id="ln-1225" name="ln-1225" href="#ln-1225"></a><span class="w">    </span><span class="c">! Compute J**T * (W .* dY)</span>
+<a id="ln-1226" name="ln-1226" href="#ln-1226"></a><span class="w">    </span><span class="n">w1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">w1</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">weights</span>
+<a id="ln-1227" name="ln-1227" href="#ln-1227"></a><span class="w">    </span><span class="k">call </span><span class="n">mtx_mult</span><span class="p">(.</span><span class="n">true</span><span class="p">.,</span><span class="w"> </span><span class="mf">1.0d0</span><span class="p">,</span><span class="w"> </span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="n">w1</span><span class="p">,</span><span class="w"> </span><span class="mf">0.0d0</span><span class="p">,</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">)</span>
+<a id="ln-1228" name="ln-1228" href="#ln-1228"></a>
+<a id="ln-1229" name="ln-1229" href="#ln-1229"></a><span class="w">    </span><span class="c">! Update the Hessian</span>
+<a id="ln-1230" name="ln-1230" href="#ln-1230"></a><span class="w">    </span><span class="c">! First: J**T * W = MWORK</span>
+<a id="ln-1231" name="ln-1231" href="#ln-1231"></a><span class="w">    </span><span class="c">! Second: (J**T * W) * J</span>
+<a id="ln-1232" name="ln-1232" href="#ln-1232"></a><span class="w">    </span><span class="k">call </span><span class="n">diag_mtx_mult</span><span class="p">(.</span><span class="n">false</span><span class="p">.,</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.,</span><span class="w"> </span><span class="mf">1.0d0</span><span class="p">,</span><span class="w"> </span><span class="n">weights</span><span class="p">,</span><span class="w"> </span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="mf">0.0d0</span><span class="p">,</span><span class="w"> </span><span class="n">mwork</span><span class="p">)</span>
+<a id="ln-1233" name="ln-1233" href="#ln-1233"></a><span class="w">    </span><span class="k">call </span><span class="n">mtx_mult</span><span class="p">(.</span><span class="n">false</span><span class="p">.,</span><span class="w"> </span><span class="p">.</span><span class="n">false</span><span class="p">.,</span><span class="w"> </span><span class="mf">1.0d0</span><span class="p">,</span><span class="w"> </span><span class="n">mwork</span><span class="p">,</span><span class="w"> </span><span class="n">jac</span><span class="p">,</span><span class="w"> </span><span class="mf">0.0d0</span><span class="p">,</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">)</span>
+<a id="ln-1234" name="ln-1234" href="#ln-1234"></a><span class="k">end subroutine</span>
+<a id="ln-1235" name="ln-1235" href="#ln-1235"></a>
+<a id="ln-1236" name="ln-1236" href="#ln-1236"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-1237" name="ln-1237" href="#ln-1237"></a><span class="c">! Performs a single iteration of the Levenberg-Marquardt algorithm.</span>
+<a id="ln-1238" name="ln-1238" href="#ln-1238"></a><span class="c">!</span>
+<a id="ln-1239" name="ln-1239" href="#ln-1239"></a><span class="c">! Inputs:</span>
+<a id="ln-1240" name="ln-1240" href="#ln-1240"></a><span class="c">! - fun: The function to evaluate</span>
+<a id="ln-1241" name="ln-1241" href="#ln-1241"></a><span class="c">! - xdata: The independent coordinate data to fit (M-by-1)</span>
+<a id="ln-1242" name="ln-1242" href="#ln-1242"></a><span class="c">! - ydata: The dependent coordinate data to fit (M-by-1)</span>
+<a id="ln-1243" name="ln-1243" href="#ln-1243"></a><span class="c">! - p: current set of parameters (N-by-1)</span>
+<a id="ln-1244" name="ln-1244" href="#ln-1244"></a><span class="c">! - neval: current number of function evaluations</span>
+<a id="ln-1245" name="ln-1245" href="#ln-1245"></a><span class="c">! - niter: current iteration number</span>
+<a id="ln-1246" name="ln-1246" href="#ln-1246"></a><span class="c">! - update: set to 1 to use Marquardt&#39;s modification; else, </span>
+<a id="ln-1247" name="ln-1247" href="#ln-1247"></a><span class="c">! - step: the differentiation step size</span>
+<a id="ln-1248" name="ln-1248" href="#ln-1248"></a><span class="c">! - lambda: LM damping parameter</span>
+<a id="ln-1249" name="ln-1249" href="#ln-1249"></a><span class="c">! - maxP: maximum limits on the parameters.  Use huge() or larger for no constraints (N-by-1)</span>
+<a id="ln-1250" name="ln-1250" href="#ln-1250"></a><span class="c">! - minP: minimum limits on the parameters.  Use -huge() or smaller for no constraints (N-by-1)</span>
+<a id="ln-1251" name="ln-1251" href="#ln-1251"></a><span class="c">! - weights: a weighting vector (M-by-1)</span>
+<a id="ln-1252" name="ln-1252" href="#ln-1252"></a><span class="c">! - JtWJ: linearized Hessian matrix (inverse of the covariance matrix) (N-by-N)</span>
+<a id="ln-1253" name="ln-1253" href="#ln-1253"></a><span class="c">! - JtWdy: linearized fitting vector (N-by-1)</span>
+<a id="ln-1254" name="ln-1254" href="#ln-1254"></a><span class="c">!</span>
+<a id="ln-1255" name="ln-1255" href="#ln-1255"></a><span class="c">! Outputs:</span>
+<a id="ln-1256" name="ln-1256" href="#ln-1256"></a><span class="c">! - JtWJ: overwritten LU factorization of the original matrix (N-by-N)</span>
+<a id="ln-1257" name="ln-1257" href="#ln-1257"></a><span class="c">! - h: The new estimate of the change in parameter (N-by-1)</span>
+<a id="ln-1258" name="ln-1258" href="#ln-1258"></a><span class="c">! - pNew: The new parameter estimates (N-by-1)</span>
+<a id="ln-1259" name="ln-1259" href="#ln-1259"></a><span class="c">! - deltaY: The new difference between data and model (M-by-1)</span>
+<a id="ln-1260" name="ln-1260" href="#ln-1260"></a><span class="c">! - yNew: model evaluated with parameters of pNew (M-by-1)</span>
+<a id="ln-1261" name="ln-1261" href="#ln-1261"></a><span class="c">! - neval: updated count of function evaluations</span>
+<a id="ln-1262" name="ln-1262" href="#ln-1262"></a><span class="c">! - niter: updated current iteration number</span>
+<a id="ln-1263" name="ln-1263" href="#ln-1263"></a><span class="c">! - X2: updated Chi-squared criteria</span>
+<a id="ln-1264" name="ln-1264" href="#ln-1264"></a><span class="c">! - stop: A flag allowing the user to terminate model execution</span>
+<a id="ln-1265" name="ln-1265" href="#ln-1265"></a><span class="c">! - iwork: A workspace array (N-by-1)</span>
+<a id="ln-1266" name="ln-1266" href="#ln-1266"></a><span class="c">! - err: An error handling mechanism</span>
+<a id="ln-1267" name="ln-1267" href="#ln-1267"></a><span class="k">subroutine </span><span class="n">lm_iter</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">ydata</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">neval</span><span class="p">,</span><span class="w"> </span><span class="n">niter</span><span class="p">,</span><span class="w"> </span><span class="n">update</span><span class="p">,</span><span class="w"> </span><span class="n">lambda</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1268" name="ln-1268" href="#ln-1268"></a><span class="w">    </span><span class="n">maxP</span><span class="p">,</span><span class="w"> </span><span class="n">minP</span><span class="p">,</span><span class="w"> </span><span class="n">weights</span><span class="p">,</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">,</span><span class="w"> </span><span class="n">h</span><span class="p">,</span><span class="w"> </span><span class="n">pNew</span><span class="p">,</span><span class="w"> </span><span class="n">deltaY</span><span class="p">,</span><span class="w"> </span><span class="n">yNew</span><span class="p">,</span><span class="w"> </span><span class="n">X2</span><span class="p">,</span><span class="w"> </span><span class="n">X2Old</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1269" name="ln-1269" href="#ln-1269"></a><span class="w">    </span><span class="n">alpha</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">,</span><span class="w"> </span><span class="n">iwork</span><span class="p">,</span><span class="w"> </span><span class="n">err</span><span class="p">,</span><span class="w"> </span><span class="n">status</span><span class="p">)</span>
+<a id="ln-1270" name="ln-1270" href="#ln-1270"></a><span class="w">    </span><span class="c">! Arguments</span>
+<a id="ln-1271" name="ln-1271" href="#ln-1271"></a><span class="w">    </span><span class="k">procedure</span><span class="p">(</span><span class="n">regression_function</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">fun</span>
+<a id="ln-1272" name="ln-1272" href="#ln-1272"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">xdata</span><span class="p">(:),</span><span class="w"> </span><span class="n">ydata</span><span class="p">(:),</span><span class="w"> </span><span class="n">p</span><span class="p">(:),</span><span class="w"> </span><span class="n">maxP</span><span class="p">(:),</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1273" name="ln-1273" href="#ln-1273"></a><span class="w">        </span><span class="n">minP</span><span class="p">(:),</span><span class="w"> </span><span class="n">weights</span><span class="p">(:),</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">(:)</span>
+<a id="ln-1274" name="ln-1274" href="#ln-1274"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">lambda</span><span class="p">,</span><span class="w"> </span><span class="n">X2Old</span>
+<a id="ln-1275" name="ln-1275" href="#ln-1275"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">neval</span><span class="p">,</span><span class="w"> </span><span class="n">niter</span>
+<a id="ln-1276" name="ln-1276" href="#ln-1276"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">update</span>
+<a id="ln-1277" name="ln-1277" href="#ln-1277"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">(:,:)</span>
+<a id="ln-1278" name="ln-1278" href="#ln-1278"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">h</span><span class="p">(:),</span><span class="w"> </span><span class="n">pNew</span><span class="p">(:),</span><span class="w"> </span><span class="n">deltaY</span><span class="p">(:),</span><span class="w"> </span><span class="n">yNew</span><span class="p">(:)</span>
+<a id="ln-1279" name="ln-1279" href="#ln-1279"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">X2</span><span class="p">,</span><span class="w"> </span><span class="n">alpha</span>
+<a id="ln-1280" name="ln-1280" href="#ln-1280"></a><span class="w">    </span><span class="kt">logical</span><span class="p">,</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="k">stop</span>
+<a id="ln-1281" name="ln-1281" href="#ln-1281"></a><span class="k">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">iwork</span><span class="p">(:)</span>
+<a id="ln-1282" name="ln-1282" href="#ln-1282"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">err</span>
+<a id="ln-1283" name="ln-1283" href="#ln-1283"></a><span class="w">    </span><span class="k">procedure</span><span class="p">(</span><span class="n">iteration_update</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="p">,</span><span class="w"> </span><span class="k">optional</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">status</span>
+<a id="ln-1284" name="ln-1284" href="#ln-1284"></a>
+<a id="ln-1285" name="ln-1285" href="#ln-1285"></a><span class="w">    </span><span class="c">! Local Variables</span>
+<a id="ln-1286" name="ln-1286" href="#ln-1286"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">i</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
+<a id="ln-1287" name="ln-1287" href="#ln-1287"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dpJh</span>
+<a id="ln-1288" name="ln-1288" href="#ln-1288"></a>
+<a id="ln-1289" name="ln-1289" href="#ln-1289"></a><span class="w">    </span><span class="c">! Initialization</span>
+<a id="ln-1290" name="ln-1290" href="#ln-1290"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">p</span><span class="p">)</span>
+<a id="ln-1291" name="ln-1291" href="#ln-1291"></a>
+<a id="ln-1292" name="ln-1292" href="#ln-1292"></a><span class="w">    </span><span class="c">! Increment the iteration counter</span>
+<a id="ln-1293" name="ln-1293" href="#ln-1293"></a><span class="w">    </span><span class="n">niter</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">niter</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span>
+<a id="ln-1294" name="ln-1294" href="#ln-1294"></a>
+<a id="ln-1295" name="ln-1295" href="#ln-1295"></a><span class="w">    </span><span class="c">! Solve the linear system to determine the change in parameters</span>
+<a id="ln-1296" name="ln-1296" href="#ln-1296"></a><span class="w">    </span><span class="c">! A is N-by-N and is stored in JtWJ</span>
+<a id="ln-1297" name="ln-1297" href="#ln-1297"></a><span class="w">    </span><span class="c">! b is N-by-1</span>
+<a id="ln-1298" name="ln-1298" href="#ln-1298"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">update</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">FS_LEVENBERG_MARQUARDT_UPDATE</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-1299" name="ln-1299" href="#ln-1299"></a><span class="w">        </span><span class="c">! Compute: h = A \ b</span>
+<a id="ln-1300" name="ln-1300" href="#ln-1300"></a><span class="w">        </span><span class="c">! A = J**T * W * J + lambda * diag(J**T * W * J)</span>
+<a id="ln-1301" name="ln-1301" href="#ln-1301"></a><span class="w">        </span><span class="c">! b = J**T * W * dy</span>
+<a id="ln-1302" name="ln-1302" href="#ln-1302"></a><span class="w">        </span><span class="k">do </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
+<a id="ln-1303" name="ln-1303" href="#ln-1303"></a><span class="w">            </span><span class="n">JtWJ</span><span class="p">(</span><span class="n">i</span><span class="p">,</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">(</span><span class="n">i</span><span class="p">,</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="p">(</span><span class="mf">1.0d0</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">lambda</span><span class="p">)</span>
+<a id="ln-1304" name="ln-1304" href="#ln-1304"></a><span class="w">            </span><span class="n">h</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">(</span><span class="n">i</span><span class="p">)</span>
+<a id="ln-1305" name="ln-1305" href="#ln-1305"></a><span class="w">        </span><span class="k">end do</span>
+<a id="ln-1306" name="ln-1306" href="#ln-1306"></a><span class="k">    else</span>
+<a id="ln-1307" name="ln-1307" href="#ln-1307"></a><span class="w">        </span><span class="c">! Compute: h = A \ b</span>
+<a id="ln-1308" name="ln-1308" href="#ln-1308"></a><span class="w">        </span><span class="c">! A = J**T * W * J + lambda * I</span>
+<a id="ln-1309" name="ln-1309" href="#ln-1309"></a><span class="w">        </span><span class="c">! b = J**T * W * dy</span>
+<a id="ln-1310" name="ln-1310" href="#ln-1310"></a><span class="w">        </span><span class="k">do </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
+<a id="ln-1311" name="ln-1311" href="#ln-1311"></a><span class="w">            </span><span class="n">JtWJ</span><span class="p">(</span><span class="n">i</span><span class="p">,</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">(</span><span class="n">i</span><span class="p">,</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">lambda</span>
+<a id="ln-1312" name="ln-1312" href="#ln-1312"></a><span class="w">            </span><span class="n">h</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">(</span><span class="n">i</span><span class="p">)</span>
+<a id="ln-1313" name="ln-1313" href="#ln-1313"></a><span class="w">        </span><span class="k">end do</span>
+<a id="ln-1314" name="ln-1314" href="#ln-1314"></a><span class="k">    end if</span>
+<a id="ln-1315" name="ln-1315" href="#ln-1315"></a><span class="k">    call </span><span class="n">lu_factor</span><span class="p">(</span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="n">iwork</span><span class="p">,</span><span class="w"> </span><span class="n">err</span><span class="p">)</span><span class="w">        </span><span class="c">! overwrites JtWJ with [L\U]</span>
+<a id="ln-1316" name="ln-1316" href="#ln-1316"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">err</span><span class="p">%</span><span class="n">has_error_occurred</span><span class="p">())</span><span class="w"> </span><span class="k">return</span><span class="w">    </span><span class="c">! if JtWJ is singular</span>
+<a id="ln-1317" name="ln-1317" href="#ln-1317"></a><span class="w">    </span><span class="k">call </span><span class="n">solve_lu</span><span class="p">(</span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="n">iwork</span><span class="p">,</span><span class="w"> </span><span class="n">h</span><span class="p">)</span><span class="w">           </span><span class="c">! solution stored in h</span>
+<a id="ln-1318" name="ln-1318" href="#ln-1318"></a>
+<a id="ln-1319" name="ln-1319" href="#ln-1319"></a><span class="w">    </span><span class="c">! Compute the new attempted solution, and apply any constraints</span>
+<a id="ln-1320" name="ln-1320" href="#ln-1320"></a><span class="w">    </span><span class="k">do </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
+<a id="ln-1321" name="ln-1321" href="#ln-1321"></a><span class="w">        </span><span class="n">pNew</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">min</span><span class="p">(</span><span class="nb">max</span><span class="p">(</span><span class="n">minP</span><span class="p">(</span><span class="n">i</span><span class="p">),</span><span class="w"> </span><span class="n">h</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">p</span><span class="p">(</span><span class="n">i</span><span class="p">)),</span><span class="w"> </span><span class="n">maxP</span><span class="p">(</span><span class="n">i</span><span class="p">))</span>
+<a id="ln-1322" name="ln-1322" href="#ln-1322"></a><span class="w">    </span><span class="k">end do</span>
+<a id="ln-1323" name="ln-1323" href="#ln-1323"></a>
+<a id="ln-1324" name="ln-1324" href="#ln-1324"></a><span class="w">    </span><span class="c">! Update the residual error</span>
+<a id="ln-1325" name="ln-1325" href="#ln-1325"></a><span class="w">    </span><span class="k">call </span><span class="n">fun</span><span class="p">(</span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">pNew</span><span class="p">,</span><span class="w"> </span><span class="n">yNew</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">)</span>
+<a id="ln-1326" name="ln-1326" href="#ln-1326"></a><span class="w">    </span><span class="n">neval</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">neval</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span>
+<a id="ln-1327" name="ln-1327" href="#ln-1327"></a><span class="w">    </span><span class="n">deltaY</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">ydata</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">yNew</span>
+<a id="ln-1328" name="ln-1328" href="#ln-1328"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="k">stop</span><span class="p">)</span><span class="w"> </span><span class="k">return</span>
+<a id="ln-1329" name="ln-1329" href="#ln-1329"></a>
+<a id="ln-1330" name="ln-1330" href="#ln-1330"></a><span class="w">    </span><span class="c">! Update the Chi-squared estimate</span>
+<a id="ln-1331" name="ln-1331" href="#ln-1331"></a><span class="w">    </span><span class="n">X2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">dot_product</span><span class="p">(</span><span class="n">deltaY</span><span class="p">,</span><span class="w"> </span><span class="n">deltaY</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">weights</span><span class="p">)</span>
+<a id="ln-1332" name="ln-1332" href="#ln-1332"></a>
+<a id="ln-1333" name="ln-1333" href="#ln-1333"></a><span class="w">    </span><span class="c">! Perform a quadratic line update in the H direction, if necessary</span>
+<a id="ln-1334" name="ln-1334" href="#ln-1334"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">update</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">FS_QUADRATIC_UPDATE</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-1335" name="ln-1335" href="#ln-1335"></a><span class="k">        </span><span class="n">dpJh</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">dot_product</span><span class="p">(</span><span class="n">JtWdy</span><span class="p">,</span><span class="w"> </span><span class="n">h</span><span class="p">)</span>
+<a id="ln-1336" name="ln-1336" href="#ln-1336"></a><span class="w">        </span><span class="n">alpha</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">abs</span><span class="p">(</span><span class="n">dpJh</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="p">(</span><span class="mf">0.5d0</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="p">(</span><span class="n">X2</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">X2Old</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mf">2.0d0</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">dpJh</span><span class="p">))</span>
+<a id="ln-1337" name="ln-1337" href="#ln-1337"></a><span class="w">        </span><span class="n">h</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">alpha</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">h</span>
+<a id="ln-1338" name="ln-1338" href="#ln-1338"></a>
+<a id="ln-1339" name="ln-1339" href="#ln-1339"></a><span class="w">        </span><span class="k">do </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="n">n</span>
+<a id="ln-1340" name="ln-1340" href="#ln-1340"></a><span class="w">            </span><span class="n">pNew</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">min</span><span class="p">(</span><span class="nb">max</span><span class="p">(</span><span class="n">minP</span><span class="p">(</span><span class="n">i</span><span class="p">),</span><span class="w"> </span><span class="n">p</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">h</span><span class="p">(</span><span class="n">i</span><span class="p">)),</span><span class="w"> </span><span class="n">maxP</span><span class="p">(</span><span class="n">i</span><span class="p">))</span>
+<a id="ln-1341" name="ln-1341" href="#ln-1341"></a><span class="w">        </span><span class="k">end do</span>
+<a id="ln-1342" name="ln-1342" href="#ln-1342"></a>
+<a id="ln-1343" name="ln-1343" href="#ln-1343"></a><span class="k">        call </span><span class="n">fun</span><span class="p">(</span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">pNew</span><span class="p">,</span><span class="w"> </span><span class="n">yNew</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">)</span>
+<a id="ln-1344" name="ln-1344" href="#ln-1344"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="k">stop</span><span class="p">)</span><span class="w"> </span><span class="k">return</span>
+<a id="ln-1345" name="ln-1345" href="#ln-1345"></a><span class="k">        </span><span class="n">neval</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">neval</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span>
+<a id="ln-1346" name="ln-1346" href="#ln-1346"></a><span class="w">        </span><span class="n">deltaY</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">ydata</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">yNew</span>
+<a id="ln-1347" name="ln-1347" href="#ln-1347"></a><span class="w">        </span><span class="n">X2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">dot_product</span><span class="p">(</span><span class="n">deltaY</span><span class="p">,</span><span class="w"> </span><span class="n">deltaY</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">weights</span><span class="p">)</span>
+<a id="ln-1348" name="ln-1348" href="#ln-1348"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-1349" name="ln-1349" href="#ln-1349"></a>
+<a id="ln-1350" name="ln-1350" href="#ln-1350"></a><span class="w">    </span><span class="c">! Update the status of the iteration, if needed</span>
+<a id="ln-1351" name="ln-1351" href="#ln-1351"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">present</span><span class="p">(</span><span class="n">status</span><span class="p">))</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-1352" name="ln-1352" href="#ln-1352"></a><span class="k">        call </span><span class="n">status</span><span class="p">(</span><span class="n">niter</span><span class="p">,</span><span class="w"> </span><span class="n">yNew</span><span class="p">,</span><span class="w"> </span><span class="n">deltaY</span><span class="p">,</span><span class="w"> </span><span class="n">pNew</span><span class="p">,</span><span class="w"> </span><span class="n">h</span><span class="p">)</span>
+<a id="ln-1353" name="ln-1353" href="#ln-1353"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-1354" name="ln-1354" href="#ln-1354"></a><span class="k">end subroutine</span>
+<a id="ln-1355" name="ln-1355" href="#ln-1355"></a>
+<a id="ln-1356" name="ln-1356" href="#ln-1356"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-1357" name="ln-1357" href="#ln-1357"></a><span class="c">! A Levenberg-Marquardt solver.</span>
+<a id="ln-1358" name="ln-1358" href="#ln-1358"></a><span class="c">!</span>
+<a id="ln-1359" name="ln-1359" href="#ln-1359"></a><span class="c">! Inputs:</span>
+<a id="ln-1360" name="ln-1360" href="#ln-1360"></a><span class="c">! - fun: The function to evaluate</span>
+<a id="ln-1361" name="ln-1361" href="#ln-1361"></a><span class="c">! - xdata: The independent coordinate data to fit (M-by-1)</span>
+<a id="ln-1362" name="ln-1362" href="#ln-1362"></a><span class="c">! - ydata: The dependent coordinate data to fit (M-by-1)</span>
+<a id="ln-1363" name="ln-1363" href="#ln-1363"></a><span class="c">! - p: current set of parameters (N-by-1)</span>
+<a id="ln-1364" name="ln-1364" href="#ln-1364"></a><span class="c">! - weights: a weighting vector (M-by-1)</span>
+<a id="ln-1365" name="ln-1365" href="#ln-1365"></a><span class="c">! - maxP: maximum limits on the parameters.  Use huge() or larger for no constraints (N-by-1)</span>
+<a id="ln-1366" name="ln-1366" href="#ln-1366"></a><span class="c">! - minP: minimum limits on the parameters.  Use -huge() or smaller for no constraints (N-by-1)</span>
+<a id="ln-1367" name="ln-1367" href="#ln-1367"></a><span class="c">! - controls: an iteration_controls instance containing solution tolerances</span>
+<a id="ln-1368" name="ln-1368" href="#ln-1368"></a><span class="c">!</span>
+<a id="ln-1369" name="ln-1369" href="#ln-1369"></a><span class="c">! Outputs:</span>
+<a id="ln-1370" name="ln-1370" href="#ln-1370"></a><span class="c">! - p: solution (N-by-1)</span>
+<a id="ln-1371" name="ln-1371" href="#ln-1371"></a><span class="c">! - y: model results at p (M-by-1)</span>
+<a id="ln-1372" name="ln-1372" href="#ln-1372"></a><span class="c">! - resid: residual (ydata - y) (M-by-1)</span>
+<a id="ln-1373" name="ln-1373" href="#ln-1373"></a><span class="c">! - JtWJ: linearized Hessian matrix (inverse of the covariance matrix) (N-by-N)</span>
+<a id="ln-1374" name="ln-1374" href="#ln-1374"></a><span class="c">! - opt: a convergence_info object containing information regarding </span>
+<a id="ln-1375" name="ln-1375" href="#ln-1375"></a><span class="c">!       convergence of the iteration</span>
+<a id="ln-1376" name="ln-1376" href="#ln-1376"></a><span class="c">! - stop: A flag allowing the user to terminate model execution</span>
+<a id="ln-1377" name="ln-1377" href="#ln-1377"></a><span class="c">! - err: An error handling object</span>
+<a id="ln-1378" name="ln-1378" href="#ln-1378"></a><span class="k">subroutine </span><span class="n">lm_solve</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">ydata</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">weights</span><span class="p">,</span><span class="w"> </span><span class="n">maxP</span><span class="p">,</span><span class="w"> </span><span class="n">minP</span><span class="p">,</span><span class="w"> </span><span class="n">controls</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1379" name="ln-1379" href="#ln-1379"></a><span class="w">    </span><span class="n">opt</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="n">resid</span><span class="p">,</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="n">info</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">,</span><span class="w"> </span><span class="n">err</span><span class="p">,</span><span class="w"> </span><span class="n">status</span><span class="p">)</span>
+<a id="ln-1380" name="ln-1380" href="#ln-1380"></a><span class="w">    </span><span class="c">! Arguments</span>
+<a id="ln-1381" name="ln-1381" href="#ln-1381"></a><span class="w">    </span><span class="k">procedure</span><span class="p">(</span><span class="n">regression_function</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">fun</span>
+<a id="ln-1382" name="ln-1382" href="#ln-1382"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">xdata</span><span class="p">(:),</span><span class="w"> </span><span class="n">ydata</span><span class="p">(:),</span><span class="w"> </span><span class="n">weights</span><span class="p">(:),</span><span class="w"> </span><span class="n">maxP</span><span class="p">(:),</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1383" name="ln-1383" href="#ln-1383"></a><span class="w">        </span><span class="n">minP</span><span class="p">(:)</span>
+<a id="ln-1384" name="ln-1384" href="#ln-1384"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">p</span><span class="p">(:)</span>
+<a id="ln-1385" name="ln-1385" href="#ln-1385"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">iteration_controls</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">controls</span>
+<a id="ln-1386" name="ln-1386" href="#ln-1386"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">lm_solver_options</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">opt</span>
+<a id="ln-1387" name="ln-1387" href="#ln-1387"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">y</span><span class="p">(:),</span><span class="w"> </span><span class="n">resid</span><span class="p">(:),</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">(:,:)</span>
+<a id="ln-1388" name="ln-1388" href="#ln-1388"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">convergence_info</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">info</span>
+<a id="ln-1389" name="ln-1389" href="#ln-1389"></a><span class="w">    </span><span class="kt">logical</span><span class="p">,</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="k">stop</span>
+<a id="ln-1390" name="ln-1390" href="#ln-1390"></a><span class="k">    class</span><span class="p">(</span><span class="n">errors</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">err</span>
+<a id="ln-1391" name="ln-1391" href="#ln-1391"></a><span class="w">    </span><span class="k">procedure</span><span class="p">(</span><span class="n">iteration_update</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="p">,</span><span class="w"> </span><span class="k">optional</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">status</span>
+<a id="ln-1392" name="ln-1392" href="#ln-1392"></a>
+<a id="ln-1393" name="ln-1393" href="#ln-1393"></a><span class="w">    </span><span class="c">! Local Variables</span>
+<a id="ln-1394" name="ln-1394" href="#ln-1394"></a><span class="w">    </span><span class="kt">logical</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">update</span>
+<a id="ln-1395" name="ln-1395" href="#ln-1395"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">i</span><span class="p">,</span><span class="w"> </span><span class="n">m</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">dof</span><span class="p">,</span><span class="w"> </span><span class="n">flag</span><span class="p">,</span><span class="w"> </span><span class="n">neval</span><span class="p">,</span><span class="w"> </span><span class="n">niter</span><span class="p">,</span><span class="w"> </span><span class="n">nupdate</span>
+<a id="ln-1396" name="ln-1396" href="#ln-1396"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dX2</span><span class="p">,</span><span class="w"> </span><span class="n">X2</span><span class="p">,</span><span class="w"> </span><span class="n">X2Old</span><span class="p">,</span><span class="w"> </span><span class="n">X2Try</span><span class="p">,</span><span class="w"> </span><span class="n">lambda</span><span class="p">,</span><span class="w"> </span><span class="n">alpha</span><span class="p">,</span><span class="w"> </span><span class="n">nu</span><span class="p">,</span><span class="w"> </span><span class="n">step</span>
+<a id="ln-1397" name="ln-1397" href="#ln-1397"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">allocatable</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">pOld</span><span class="p">(:),</span><span class="w"> </span><span class="n">yOld</span><span class="p">(:),</span><span class="w"> </span><span class="n">J</span><span class="p">(:,:),</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">(:),</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1398" name="ln-1398" href="#ln-1398"></a><span class="w">        </span><span class="n">work</span><span class="p">(:),</span><span class="w"> </span><span class="n">mwork</span><span class="p">(:,:),</span><span class="w"> </span><span class="n">pTry</span><span class="p">(:),</span><span class="w"> </span><span class="n">yTemp</span><span class="p">(:),</span><span class="w"> </span><span class="n">JtWJc</span><span class="p">(:,:),</span><span class="w"> </span><span class="n">h</span><span class="p">(:)</span>
+<a id="ln-1399" name="ln-1399" href="#ln-1399"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">allocatable</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">iwork</span><span class="p">(:)</span>
+<a id="ln-1400" name="ln-1400" href="#ln-1400"></a><span class="w">    </span><span class="kt">character</span><span class="p">(</span><span class="nb">len</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">:),</span><span class="w"> </span><span class="k">allocatable</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">errmsg</span>
+<a id="ln-1401" name="ln-1401" href="#ln-1401"></a>
+<a id="ln-1402" name="ln-1402" href="#ln-1402"></a><span class="w">    </span><span class="c">! Initialization</span>
+<a id="ln-1403" name="ln-1403" href="#ln-1403"></a><span class="w">    </span><span class="n">update</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.</span>
+<a id="ln-1404" name="ln-1404" href="#ln-1404"></a><span class="w">    </span><span class="n">m</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">xdata</span><span class="p">)</span>
+<a id="ln-1405" name="ln-1405" href="#ln-1405"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">p</span><span class="p">)</span>
+<a id="ln-1406" name="ln-1406" href="#ln-1406"></a><span class="w">    </span><span class="n">dof</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">m</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">n</span>
+<a id="ln-1407" name="ln-1407" href="#ln-1407"></a><span class="w">    </span><span class="n">niter</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span>
+<a id="ln-1408" name="ln-1408" href="#ln-1408"></a><span class="w">    </span><span class="n">step</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">opt</span><span class="p">%</span><span class="n">finite_difference_step_size</span>
+<a id="ln-1409" name="ln-1409" href="#ln-1409"></a><span class="w">    </span><span class="k">stop</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">false</span><span class="p">.</span>
+<a id="ln-1410" name="ln-1410" href="#ln-1410"></a><span class="w">    </span><span class="n">info</span><span class="p">%</span><span class="n">user_requested_stop</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">false</span><span class="p">.</span>
+<a id="ln-1411" name="ln-1411" href="#ln-1411"></a><span class="w">    </span><span class="n">nupdate</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span>
+<a id="ln-1412" name="ln-1412" href="#ln-1412"></a>
+<a id="ln-1413" name="ln-1413" href="#ln-1413"></a><span class="w">    </span><span class="c">! Local Memory Allocation</span>
+<a id="ln-1414" name="ln-1414" href="#ln-1414"></a><span class="w">    </span><span class="k">allocate</span><span class="p">(</span><span class="n">pOld</span><span class="p">(</span><span class="n">n</span><span class="p">),</span><span class="w"> </span><span class="n">source</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.0d0</span><span class="p">,</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
+<a id="ln-1415" name="ln-1415" href="#ln-1415"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">allocate</span><span class="p">(</span><span class="n">yOld</span><span class="p">(</span><span class="n">m</span><span class="p">),</span><span class="w"> </span><span class="n">source</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">0.0d0</span><span class="p">,</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
+<a id="ln-1416" name="ln-1416" href="#ln-1416"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">allocate</span><span class="p">(</span><span class="n">J</span><span class="p">(</span><span class="n">m</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
+<a id="ln-1417" name="ln-1417" href="#ln-1417"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">allocate</span><span class="p">(</span><span class="n">JtWdy</span><span class="p">(</span><span class="n">n</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
+<a id="ln-1418" name="ln-1418" href="#ln-1418"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">allocate</span><span class="p">(</span><span class="n">work</span><span class="p">(</span><span class="n">m</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">n</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
+<a id="ln-1419" name="ln-1419" href="#ln-1419"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">allocate</span><span class="p">(</span><span class="n">mwork</span><span class="p">(</span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">m</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
+<a id="ln-1420" name="ln-1420" href="#ln-1420"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">allocate</span><span class="p">(</span><span class="n">pTry</span><span class="p">(</span><span class="n">n</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
+<a id="ln-1421" name="ln-1421" href="#ln-1421"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">allocate</span><span class="p">(</span><span class="n">h</span><span class="p">(</span><span class="n">n</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
+<a id="ln-1422" name="ln-1422" href="#ln-1422"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">allocate</span><span class="p">(</span><span class="n">yTemp</span><span class="p">(</span><span class="n">m</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
+<a id="ln-1423" name="ln-1423" href="#ln-1423"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">allocate</span><span class="p">(</span><span class="n">JtWJc</span><span class="p">(</span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
+<a id="ln-1424" name="ln-1424" href="#ln-1424"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">allocate</span><span class="p">(</span><span class="n">iwork</span><span class="p">(</span><span class="n">n</span><span class="p">),</span><span class="w"> </span><span class="nb">stat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">flag</span><span class="p">)</span>
+<a id="ln-1425" name="ln-1425" href="#ln-1425"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">flag</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">go</span><span class="w"> </span><span class="k">to</span><span class="w"> </span><span class="mi">10</span>
+<a id="ln-1426" name="ln-1426" href="#ln-1426"></a>
+<a id="ln-1427" name="ln-1427" href="#ln-1427"></a><span class="w">    </span><span class="c">! Perform an initial function evaluation</span>
+<a id="ln-1428" name="ln-1428" href="#ln-1428"></a><span class="w">    </span><span class="k">call </span><span class="n">fun</span><span class="p">(</span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">)</span>
+<a id="ln-1429" name="ln-1429" href="#ln-1429"></a><span class="w">    </span><span class="n">neval</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span>
+<a id="ln-1430" name="ln-1430" href="#ln-1430"></a>
+<a id="ln-1431" name="ln-1431" href="#ln-1431"></a><span class="w">    </span><span class="c">! Evaluate the problem matrices</span>
+<a id="ln-1432" name="ln-1432" href="#ln-1432"></a><span class="w">    </span><span class="k">call </span><span class="n">lm_matrix</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">ydata</span><span class="p">,</span><span class="w"> </span><span class="n">pOld</span><span class="p">,</span><span class="w"> </span><span class="n">yOld</span><span class="p">,</span><span class="w"> </span><span class="mf">1.0d0</span><span class="p">,</span><span class="w"> </span><span class="n">J</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">weights</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1433" name="ln-1433" href="#ln-1433"></a><span class="w">        </span><span class="n">neval</span><span class="p">,</span><span class="w"> </span><span class="n">update</span><span class="p">,</span><span class="w"> </span><span class="n">step</span><span class="p">,</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">,</span><span class="w"> </span><span class="n">X2</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">,</span><span class="w"> </span><span class="n">work</span><span class="p">,</span><span class="w"> </span><span class="n">mwork</span><span class="p">)</span>
+<a id="ln-1434" name="ln-1434" href="#ln-1434"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="k">stop</span><span class="p">)</span><span class="w"> </span><span class="k">go</span><span class="w"> </span><span class="k">to</span><span class="w"> </span><span class="mi">5</span>
+<a id="ln-1435" name="ln-1435" href="#ln-1435"></a><span class="w">    </span><span class="n">X2Old</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">X2</span>
+<a id="ln-1436" name="ln-1436" href="#ln-1436"></a><span class="w">    </span><span class="n">JtWJc</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">JtWJ</span>
+<a id="ln-1437" name="ln-1437" href="#ln-1437"></a>
+<a id="ln-1438" name="ln-1438" href="#ln-1438"></a><span class="w">    </span><span class="c">! Determine an initial value for lambda</span>
+<a id="ln-1439" name="ln-1439" href="#ln-1439"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">opt</span><span class="p">%</span><span class="n">method</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">FS_LEVENBERG_MARQUARDT_UPDATE</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-1440" name="ln-1440" href="#ln-1440"></a><span class="k">        </span><span class="n">lambda</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d-2</span>
+<a id="ln-1441" name="ln-1441" href="#ln-1441"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-1442" name="ln-1442" href="#ln-1442"></a><span class="k">        call </span><span class="n">extract_diagonal</span><span class="p">(</span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="n">work</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">))</span>
+<a id="ln-1443" name="ln-1443" href="#ln-1443"></a><span class="w">        </span><span class="n">lambda</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">1.0d-2</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="nb">maxval</span><span class="p">(</span><span class="n">work</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">))</span>
+<a id="ln-1444" name="ln-1444" href="#ln-1444"></a><span class="w">        </span><span class="n">nu</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">2.0d0</span>
+<a id="ln-1445" name="ln-1445" href="#ln-1445"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-1446" name="ln-1446" href="#ln-1446"></a>
+<a id="ln-1447" name="ln-1447" href="#ln-1447"></a><span class="w">    </span><span class="c">! Main Loop</span>
+<a id="ln-1448" name="ln-1448" href="#ln-1448"></a><span class="w">    </span><span class="n">main</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="k">do while</span><span class="w"> </span><span class="p">(</span><span class="n">niter</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">controls</span><span class="p">%</span><span class="n">max_iteration_count</span><span class="p">)</span>
+<a id="ln-1449" name="ln-1449" href="#ln-1449"></a><span class="w">        </span><span class="c">! Compute the linear solution at the current solution estimate and</span>
+<a id="ln-1450" name="ln-1450" href="#ln-1450"></a><span class="w">        </span><span class="c">! update the new parameter estimates</span>
+<a id="ln-1451" name="ln-1451" href="#ln-1451"></a><span class="w">        </span><span class="k">call </span><span class="n">lm_iter</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">ydata</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">neval</span><span class="p">,</span><span class="w"> </span><span class="n">niter</span><span class="p">,</span><span class="w"> </span><span class="n">opt</span><span class="p">%</span><span class="n">method</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1452" name="ln-1452" href="#ln-1452"></a><span class="w">            </span><span class="n">lambda</span><span class="p">,</span><span class="w"> </span><span class="n">maxP</span><span class="p">,</span><span class="w"> </span><span class="n">minP</span><span class="p">,</span><span class="w"> </span><span class="n">weights</span><span class="p">,</span><span class="w"> </span><span class="n">JtWJc</span><span class="p">,</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">,</span><span class="w"> </span><span class="n">h</span><span class="p">,</span><span class="w"> </span><span class="n">pTry</span><span class="p">,</span><span class="w"> </span><span class="n">resid</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1453" name="ln-1453" href="#ln-1453"></a><span class="w">            </span><span class="n">yTemp</span><span class="p">,</span><span class="w"> </span><span class="n">X2Try</span><span class="p">,</span><span class="w"> </span><span class="n">X2Old</span><span class="p">,</span><span class="w"> </span><span class="n">alpha</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">,</span><span class="w"> </span><span class="n">iwork</span><span class="p">,</span><span class="w"> </span><span class="n">err</span><span class="p">,</span><span class="w"> </span><span class="n">status</span><span class="p">)</span>
+<a id="ln-1454" name="ln-1454" href="#ln-1454"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="k">stop</span><span class="p">)</span><span class="w"> </span><span class="k">go</span><span class="w"> </span><span class="k">to</span><span class="w"> </span><span class="mi">5</span>
+<a id="ln-1455" name="ln-1455" href="#ln-1455"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">err</span><span class="p">%</span><span class="n">has_error_occurred</span><span class="p">())</span><span class="w"> </span><span class="k">return</span>
+<a id="ln-1456" name="ln-1456" href="#ln-1456"></a>
+<a id="ln-1457" name="ln-1457" href="#ln-1457"></a><span class="w">        </span><span class="c">! Update the Chi-squared estimate, update the damping parameter</span>
+<a id="ln-1458" name="ln-1458" href="#ln-1458"></a><span class="w">        </span><span class="c">! lambda, and, if necessary, update the matrices</span>
+<a id="ln-1459" name="ln-1459" href="#ln-1459"></a><span class="w">        </span><span class="k">call </span><span class="n">lm_update</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">ydata</span><span class="p">,</span><span class="w"> </span><span class="n">pOld</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">pTry</span><span class="p">,</span><span class="w"> </span><span class="n">yOld</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="n">h</span><span class="p">,</span><span class="w"> </span><span class="n">dX2</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1460" name="ln-1460" href="#ln-1460"></a><span class="w">            </span><span class="n">X2Old</span><span class="p">,</span><span class="w"> </span><span class="n">X2</span><span class="p">,</span><span class="w"> </span><span class="n">X2Try</span><span class="p">,</span><span class="w"> </span><span class="n">lambda</span><span class="p">,</span><span class="w"> </span><span class="n">alpha</span><span class="p">,</span><span class="w"> </span><span class="n">nu</span><span class="p">,</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">,</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="n">J</span><span class="p">,</span><span class="w"> </span><span class="n">weights</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1461" name="ln-1461" href="#ln-1461"></a><span class="w">            </span><span class="n">niter</span><span class="p">,</span><span class="w"> </span><span class="n">neval</span><span class="p">,</span><span class="w"> </span><span class="n">update</span><span class="p">,</span><span class="w"> </span><span class="n">step</span><span class="p">,</span><span class="w"> </span><span class="n">work</span><span class="p">,</span><span class="w"> </span><span class="n">mwork</span><span class="p">,</span><span class="w"> </span><span class="n">controls</span><span class="p">,</span><span class="w"> </span><span class="n">opt</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">)</span>
+<a id="ln-1462" name="ln-1462" href="#ln-1462"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="k">stop</span><span class="p">)</span><span class="w"> </span><span class="k">go</span><span class="w"> </span><span class="k">to</span><span class="w"> </span><span class="mi">5</span>
+<a id="ln-1463" name="ln-1463" href="#ln-1463"></a><span class="w">        </span><span class="n">JtWJc</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">JtWJ</span>
+<a id="ln-1464" name="ln-1464" href="#ln-1464"></a>
+<a id="ln-1465" name="ln-1465" href="#ln-1465"></a><span class="w">        </span><span class="c">! Determine the matrix update scheme</span>
+<a id="ln-1466" name="ln-1466" href="#ln-1466"></a><span class="w">        </span><span class="n">nupdate</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">nupdate</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span>
+<a id="ln-1467" name="ln-1467" href="#ln-1467"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">opt</span><span class="p">%</span><span class="n">method</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">FS_QUADRATIC_UPDATE</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-1468" name="ln-1468" href="#ln-1468"></a><span class="k">            </span><span class="n">update</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">mod</span><span class="p">(</span><span class="n">niter</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="mi">0</span>
+<a id="ln-1469" name="ln-1469" href="#ln-1469"></a><span class="w">        </span><span class="k">else if</span><span class="w"> </span><span class="p">(</span><span class="n">nupdate</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="n">controls</span><span class="p">%</span><span class="n">max_iteration_between_updates</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-1470" name="ln-1470" href="#ln-1470"></a><span class="k">            </span><span class="n">update</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.</span>
+<a id="ln-1471" name="ln-1471" href="#ln-1471"></a><span class="w">            </span><span class="n">nupdate</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span>
+<a id="ln-1472" name="ln-1472" href="#ln-1472"></a><span class="w">        </span><span class="k">end if</span>
+<a id="ln-1473" name="ln-1473" href="#ln-1473"></a>
+<a id="ln-1474" name="ln-1474" href="#ln-1474"></a><span class="w">        </span><span class="c">! Test for convergence</span>
+<a id="ln-1475" name="ln-1475" href="#ln-1475"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">lm_check_convergence</span><span class="p">(</span><span class="n">controls</span><span class="p">,</span><span class="w"> </span><span class="n">dof</span><span class="p">,</span><span class="w"> </span><span class="n">resid</span><span class="p">,</span><span class="w"> </span><span class="n">niter</span><span class="p">,</span><span class="w"> </span><span class="n">neval</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1476" name="ln-1476" href="#ln-1476"></a><span class="w">            </span><span class="n">JtWdy</span><span class="p">,</span><span class="w"> </span><span class="n">h</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">X2</span><span class="p">,</span><span class="w"> </span><span class="n">info</span><span class="p">))</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1477" name="ln-1477" href="#ln-1477"></a><span class="w">        </span><span class="k">then</span>
+<a id="ln-1478" name="ln-1478" href="#ln-1478"></a><span class="k">            exit </span><span class="n">main</span>
+<a id="ln-1479" name="ln-1479" href="#ln-1479"></a><span class="w">        </span><span class="k">end if</span>
+<a id="ln-1480" name="ln-1480" href="#ln-1480"></a><span class="k">    end do </span><span class="n">main</span>
+<a id="ln-1481" name="ln-1481" href="#ln-1481"></a>
+<a id="ln-1482" name="ln-1482" href="#ln-1482"></a><span class="w">    </span><span class="c">! End</span>
+<a id="ln-1483" name="ln-1483" href="#ln-1483"></a><span class="w">    </span><span class="k">return</span>
+<a id="ln-1484" name="ln-1484" href="#ln-1484"></a>
+<a id="ln-1485" name="ln-1485" href="#ln-1485"></a><span class="w">    </span><span class="c">! User Requested End</span>
+<a id="ln-1486" name="ln-1486" href="#ln-1486"></a><span class="mi">5</span><span class="w">       </span><span class="k">continue</span>
+<a id="ln-1487" name="ln-1487" href="#ln-1487"></a><span class="k">    </span><span class="n">info</span><span class="p">%</span><span class="n">user_requested_stop</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.</span>
+<a id="ln-1488" name="ln-1488" href="#ln-1488"></a><span class="w">    </span><span class="k">return</span>
+<a id="ln-1489" name="ln-1489" href="#ln-1489"></a>
+<a id="ln-1490" name="ln-1490" href="#ln-1490"></a><span class="w">    </span><span class="c">! Memory Error Handling</span>
+<a id="ln-1491" name="ln-1491" href="#ln-1491"></a><span class="mi">10</span><span class="w">      </span><span class="k">continue</span>
+<a id="ln-1492" name="ln-1492" href="#ln-1492"></a><span class="k">    allocate</span><span class="p">(</span><span class="kt">character</span><span class="p">(</span><span class="nb">len</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">512</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">errmsg</span><span class="p">)</span>
+<a id="ln-1493" name="ln-1493" href="#ln-1493"></a><span class="w">    </span><span class="k">write</span><span class="p">(</span><span class="n">errmsg</span><span class="p">,</span><span class="w"> </span><span class="mi">100</span><span class="p">)</span><span class="w"> </span><span class="s2">&quot;Memory allocation error code &quot;</span><span class="p">,</span><span class="w"> </span><span class="n">flag</span><span class="p">,</span><span class="w"> </span><span class="s2">&quot;.&quot;</span>
+<a id="ln-1494" name="ln-1494" href="#ln-1494"></a><span class="w">    </span><span class="k">call </span><span class="n">err</span><span class="p">%</span><span class="n">report_error</span><span class="p">(</span><span class="s2">&quot;lm_solve&quot;</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1495" name="ln-1495" href="#ln-1495"></a><span class="w">        </span><span class="nb">trim</span><span class="p">(</span><span class="n">errmsg</span><span class="p">),</span><span class="w"> </span><span class="n">FS_MEMORY_ERROR</span><span class="p">)</span>
+<a id="ln-1496" name="ln-1496" href="#ln-1496"></a><span class="w">    </span><span class="k">return</span>
+<a id="ln-1497" name="ln-1497" href="#ln-1497"></a>
+<a id="ln-1498" name="ln-1498" href="#ln-1498"></a><span class="w">    </span><span class="c">! Formatting</span>
+<a id="ln-1499" name="ln-1499" href="#ln-1499"></a><span class="mi">100</span><span class="w">     </span><span class="k">format</span><span class="p">(</span><span class="n">A</span><span class="p">,</span><span class="w"> </span><span class="n">I0</span><span class="p">,</span><span class="w"> </span><span class="n">A</span><span class="p">)</span>
+<a id="ln-1500" name="ln-1500" href="#ln-1500"></a><span class="k">end subroutine</span>
+<a id="ln-1501" name="ln-1501" href="#ln-1501"></a>
+<a id="ln-1502" name="ln-1502" href="#ln-1502"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-1503" name="ln-1503" href="#ln-1503"></a><span class="c">!</span>
+<a id="ln-1504" name="ln-1504" href="#ln-1504"></a><span class="k">subroutine </span><span class="n">lm_update</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">ydata</span><span class="p">,</span><span class="w"> </span><span class="n">pOld</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">pTry</span><span class="p">,</span><span class="w"> </span><span class="n">yOld</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="n">h</span><span class="p">,</span><span class="w"> </span><span class="n">dX2</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1505" name="ln-1505" href="#ln-1505"></a><span class="w">    </span><span class="n">X2old</span><span class="p">,</span><span class="w"> </span><span class="n">X2</span><span class="p">,</span><span class="w"> </span><span class="n">X2try</span><span class="p">,</span><span class="w"> </span><span class="n">lambda</span><span class="p">,</span><span class="w"> </span><span class="n">alpha</span><span class="p">,</span><span class="w"> </span><span class="n">nu</span><span class="p">,</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">,</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="n">J</span><span class="p">,</span><span class="w"> </span><span class="n">weights</span><span class="p">,</span><span class="w"> </span><span class="n">niter</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1506" name="ln-1506" href="#ln-1506"></a><span class="w">    </span><span class="n">neval</span><span class="p">,</span><span class="w"> </span><span class="n">update</span><span class="p">,</span><span class="w"> </span><span class="n">step</span><span class="p">,</span><span class="w"> </span><span class="n">work</span><span class="p">,</span><span class="w"> </span><span class="n">mwork</span><span class="p">,</span><span class="w"> </span><span class="n">controls</span><span class="p">,</span><span class="w"> </span><span class="n">opt</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">)</span>
+<a id="ln-1507" name="ln-1507" href="#ln-1507"></a><span class="w">    </span><span class="c">! Arguments</span>
+<a id="ln-1508" name="ln-1508" href="#ln-1508"></a><span class="w">    </span><span class="k">procedure</span><span class="p">(</span><span class="n">regression_function</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">),</span><span class="w"> </span><span class="k">pointer</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">fun</span>
+<a id="ln-1509" name="ln-1509" href="#ln-1509"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">xdata</span><span class="p">(:),</span><span class="w"> </span><span class="n">ydata</span><span class="p">(:),</span><span class="w"> </span><span class="n">X2try</span><span class="p">,</span><span class="w"> </span><span class="n">h</span><span class="p">(:),</span><span class="w"> </span><span class="n">step</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1510" name="ln-1510" href="#ln-1510"></a><span class="w">        </span><span class="n">pTry</span><span class="p">(:),</span><span class="w"> </span><span class="n">weights</span><span class="p">(:),</span><span class="w"> </span><span class="n">alpha</span>
+<a id="ln-1511" name="ln-1511" href="#ln-1511"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">pOld</span><span class="p">(:),</span><span class="w"> </span><span class="n">p</span><span class="p">(:),</span><span class="w"> </span><span class="n">yOld</span><span class="p">(:),</span><span class="w"> </span><span class="n">y</span><span class="p">(:),</span><span class="w"> </span><span class="n">lambda</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1512" name="ln-1512" href="#ln-1512"></a><span class="w">        </span><span class="n">JtWdy</span><span class="p">(:),</span><span class="w"> </span><span class="n">dX2</span><span class="p">,</span><span class="w"> </span><span class="n">X2</span><span class="p">,</span><span class="w"> </span><span class="n">X2old</span><span class="p">,</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">(:,:),</span><span class="w"> </span><span class="n">J</span><span class="p">(:,:),</span><span class="w"> </span><span class="n">nu</span>
+<a id="ln-1513" name="ln-1513" href="#ln-1513"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">work</span><span class="p">(:),</span><span class="w"> </span><span class="n">mwork</span><span class="p">(:,:)</span>
+<a id="ln-1514" name="ln-1514" href="#ln-1514"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">niter</span>
+<a id="ln-1515" name="ln-1515" href="#ln-1515"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">neval</span>
+<a id="ln-1516" name="ln-1516" href="#ln-1516"></a><span class="w">    </span><span class="kt">logical</span><span class="p">,</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">inout</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">update</span>
+<a id="ln-1517" name="ln-1517" href="#ln-1517"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">iteration_controls</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">controls</span>
+<a id="ln-1518" name="ln-1518" href="#ln-1518"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">lm_solver_options</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">opt</span>
+<a id="ln-1519" name="ln-1519" href="#ln-1519"></a><span class="w">    </span><span class="kt">logical</span><span class="p">,</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="k">stop</span>
+<a id="ln-1520" name="ln-1520" href="#ln-1520"></a>
+<a id="ln-1521" name="ln-1521" href="#ln-1521"></a><span class="w">    </span><span class="c">! Local Variables</span>
+<a id="ln-1522" name="ln-1522" href="#ln-1522"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">n</span>
+<a id="ln-1523" name="ln-1523" href="#ln-1523"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">rho</span>
+<a id="ln-1524" name="ln-1524" href="#ln-1524"></a>
+<a id="ln-1525" name="ln-1525" href="#ln-1525"></a><span class="w">    </span><span class="c">! Initialization</span>
+<a id="ln-1526" name="ln-1526" href="#ln-1526"></a><span class="w">    </span><span class="n">n</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">p</span><span class="p">)</span>
+<a id="ln-1527" name="ln-1527" href="#ln-1527"></a>
+<a id="ln-1528" name="ln-1528" href="#ln-1528"></a><span class="w">    </span><span class="c">! Process</span>
+<a id="ln-1529" name="ln-1529" href="#ln-1529"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">opt</span><span class="p">%</span><span class="n">method</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">FS_LEVENBERG_MARQUARDT_UPDATE</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-1530" name="ln-1530" href="#ln-1530"></a><span class="k">        call </span><span class="n">extract_diagonal</span><span class="p">(</span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="n">work</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">))</span>
+<a id="ln-1531" name="ln-1531" href="#ln-1531"></a><span class="w">        </span><span class="n">work</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">lambda</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">work</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">h</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">JtWdy</span>
+<a id="ln-1532" name="ln-1532" href="#ln-1532"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-1533" name="ln-1533" href="#ln-1533"></a><span class="k">        </span><span class="n">work</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">lambda</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">h</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">JtWdy</span>
+<a id="ln-1534" name="ln-1534" href="#ln-1534"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-1535" name="ln-1535" href="#ln-1535"></a><span class="k">    </span><span class="n">rho</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">X2</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">X2try</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="nb">abs</span><span class="p">(</span><span class="nb">dot_product</span><span class="p">(</span><span class="n">h</span><span class="p">,</span><span class="w"> </span><span class="n">work</span><span class="p">(</span><span class="mi">1</span><span class="p">:</span><span class="n">n</span><span class="p">)))</span>
+<a id="ln-1536" name="ln-1536" href="#ln-1536"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">rho</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="n">controls</span><span class="p">%</span><span class="n">iteration_improvement_tolerance</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-1537" name="ln-1537" href="#ln-1537"></a><span class="w">        </span><span class="c">! Things are getting better at an acceptable rate</span>
+<a id="ln-1538" name="ln-1538" href="#ln-1538"></a><span class="w">        </span><span class="n">dX2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">X2</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">X2old</span>
+<a id="ln-1539" name="ln-1539" href="#ln-1539"></a><span class="w">        </span><span class="n">X2old</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">X2</span>
+<a id="ln-1540" name="ln-1540" href="#ln-1540"></a><span class="w">        </span><span class="n">pOld</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">p</span>
+<a id="ln-1541" name="ln-1541" href="#ln-1541"></a><span class="w">        </span><span class="n">yOld</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">y</span>
+<a id="ln-1542" name="ln-1542" href="#ln-1542"></a><span class="w">        </span><span class="n">p</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">pTry</span>
+<a id="ln-1543" name="ln-1543" href="#ln-1543"></a>
+<a id="ln-1544" name="ln-1544" href="#ln-1544"></a><span class="w">        </span><span class="c">! Recompute the matrices</span>
+<a id="ln-1545" name="ln-1545" href="#ln-1545"></a><span class="w">        </span><span class="k">call </span><span class="n">lm_matrix</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">ydata</span><span class="p">,</span><span class="w"> </span><span class="n">pOld</span><span class="p">,</span><span class="w"> </span><span class="n">yOld</span><span class="p">,</span><span class="w"> </span><span class="n">dX2</span><span class="p">,</span><span class="w"> </span><span class="n">J</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">weights</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1546" name="ln-1546" href="#ln-1546"></a><span class="w">            </span><span class="n">neval</span><span class="p">,</span><span class="w"> </span><span class="n">update</span><span class="p">,</span><span class="w"> </span><span class="n">step</span><span class="p">,</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">,</span><span class="w"> </span><span class="n">X2</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">,</span><span class="w"> </span><span class="n">work</span><span class="p">,</span><span class="w"> </span><span class="n">mwork</span><span class="p">)</span>
+<a id="ln-1547" name="ln-1547" href="#ln-1547"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="k">stop</span><span class="p">)</span><span class="w"> </span><span class="k">return</span>
+<a id="ln-1548" name="ln-1548" href="#ln-1548"></a>
+<a id="ln-1549" name="ln-1549" href="#ln-1549"></a><span class="w">        </span><span class="c">! Decrease lambda</span>
+<a id="ln-1550" name="ln-1550" href="#ln-1550"></a><span class="w">        </span><span class="k">select case</span><span class="w"> </span><span class="p">(</span><span class="n">opt</span><span class="p">%</span><span class="n">method</span><span class="p">)</span>
+<a id="ln-1551" name="ln-1551" href="#ln-1551"></a><span class="w">        </span><span class="k">case</span><span class="w"> </span><span class="p">(</span><span class="n">FS_LEVENBERG_MARQUARDT_UPDATE</span><span class="p">)</span>
+<a id="ln-1552" name="ln-1552" href="#ln-1552"></a><span class="w">            </span><span class="n">lambda</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">max</span><span class="p">(</span><span class="n">lambda</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">opt</span><span class="p">%</span><span class="n">damping_decrease_factor</span><span class="p">,</span><span class="w"> </span><span class="mf">1.0d-7</span><span class="p">)</span>
+<a id="ln-1553" name="ln-1553" href="#ln-1553"></a><span class="w">        </span><span class="k">case</span><span class="w"> </span><span class="p">(</span><span class="n">FS_QUADRATIC_UPDATE</span><span class="p">)</span>
+<a id="ln-1554" name="ln-1554" href="#ln-1554"></a><span class="w">            </span><span class="n">lambda</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">max</span><span class="p">(</span><span class="n">lambda</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="p">(</span><span class="mf">1.0d0</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">alpha</span><span class="p">),</span><span class="w"> </span><span class="mf">1.0d-7</span><span class="p">)</span>
+<a id="ln-1555" name="ln-1555" href="#ln-1555"></a><span class="w">        </span><span class="k">case</span><span class="w"> </span><span class="p">(</span><span class="n">FS_NIELSEN_UPDATE</span><span class="p">)</span>
+<a id="ln-1556" name="ln-1556" href="#ln-1556"></a><span class="w">            </span><span class="n">lambda</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">lambda</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="nb">max</span><span class="p">(</span><span class="mf">1.0d0</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="mf">3.0d0</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1557" name="ln-1557" href="#ln-1557"></a><span class="w">                </span><span class="mf">1.0d0</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="p">(</span><span class="mf">2.0d0</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">rho</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mf">1.0d0</span><span class="o">**</span><span class="mi">3</span><span class="p">))</span>
+<a id="ln-1558" name="ln-1558" href="#ln-1558"></a><span class="w">            </span><span class="n">nu</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">2.0d0</span>
+<a id="ln-1559" name="ln-1559" href="#ln-1559"></a><span class="w">        </span><span class="k">end select</span>
+<a id="ln-1560" name="ln-1560" href="#ln-1560"></a><span class="k">    else</span>
+<a id="ln-1561" name="ln-1561" href="#ln-1561"></a><span class="w">        </span><span class="c">! The iteration is not improving in a satisfactory manner</span>
+<a id="ln-1562" name="ln-1562" href="#ln-1562"></a><span class="w">        </span><span class="n">X2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">X2old</span>
+<a id="ln-1563" name="ln-1563" href="#ln-1563"></a><span class="w">        </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="nb">mod</span><span class="p">(</span><span class="n">niter</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="o">/=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-1564" name="ln-1564" href="#ln-1564"></a><span class="k">            call </span><span class="n">lm_matrix</span><span class="p">(</span><span class="n">fun</span><span class="p">,</span><span class="w"> </span><span class="n">xdata</span><span class="p">,</span><span class="w"> </span><span class="n">ydata</span><span class="p">,</span><span class="w"> </span><span class="n">pOld</span><span class="p">,</span><span class="w"> </span><span class="n">yOld</span><span class="p">,</span><span class="w"> </span><span class="o">-</span><span class="mf">1.0d0</span><span class="p">,</span><span class="w"> </span><span class="n">J</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1565" name="ln-1565" href="#ln-1565"></a><span class="w">                </span><span class="n">weights</span><span class="p">,</span><span class="w"> </span><span class="n">neval</span><span class="p">,</span><span class="w"> </span><span class="n">update</span><span class="p">,</span><span class="w"> </span><span class="n">step</span><span class="p">,</span><span class="w"> </span><span class="n">JtWJ</span><span class="p">,</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">,</span><span class="w"> </span><span class="n">dX2</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="k">stop</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1566" name="ln-1566" href="#ln-1566"></a><span class="w">                </span><span class="n">work</span><span class="p">,</span><span class="w"> </span><span class="n">mwork</span><span class="p">)</span>
+<a id="ln-1567" name="ln-1567" href="#ln-1567"></a><span class="w">            </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="k">stop</span><span class="p">)</span><span class="w"> </span><span class="k">return</span>
+<a id="ln-1568" name="ln-1568" href="#ln-1568"></a><span class="k">        end if</span>
+<a id="ln-1569" name="ln-1569" href="#ln-1569"></a>
+<a id="ln-1570" name="ln-1570" href="#ln-1570"></a><span class="w">        </span><span class="c">! Increase lambda</span>
+<a id="ln-1571" name="ln-1571" href="#ln-1571"></a><span class="w">        </span><span class="k">select case</span><span class="w"> </span><span class="p">(</span><span class="n">opt</span><span class="p">%</span><span class="n">method</span><span class="p">)</span>
+<a id="ln-1572" name="ln-1572" href="#ln-1572"></a><span class="w">        </span><span class="k">case</span><span class="w"> </span><span class="p">(</span><span class="n">FS_LEVENBERG_MARQUARDT_UPDATE</span><span class="p">)</span>
+<a id="ln-1573" name="ln-1573" href="#ln-1573"></a><span class="w">            </span><span class="n">lambda</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">min</span><span class="p">(</span><span class="n">lambda</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">opt</span><span class="p">%</span><span class="n">damping_increase_factor</span><span class="p">,</span><span class="w"> </span><span class="mf">1.0d7</span><span class="p">)</span>
+<a id="ln-1574" name="ln-1574" href="#ln-1574"></a><span class="w">        </span><span class="k">case</span><span class="w"> </span><span class="p">(</span><span class="n">FS_QUADRATIC_UPDATE</span><span class="p">)</span>
+<a id="ln-1575" name="ln-1575" href="#ln-1575"></a><span class="w">            </span><span class="n">lambda</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">lambda</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="nb">abs</span><span class="p">((</span><span class="n">X2try</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">X2</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="mf">2.0d0</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">alpha</span><span class="p">)</span>
+<a id="ln-1576" name="ln-1576" href="#ln-1576"></a><span class="w">        </span><span class="k">case</span><span class="w"> </span><span class="p">(</span><span class="n">FS_NIELSEN_UPDATE</span><span class="p">)</span>
+<a id="ln-1577" name="ln-1577" href="#ln-1577"></a><span class="w">            </span><span class="n">lambda</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">lambda</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">nu</span>
+<a id="ln-1578" name="ln-1578" href="#ln-1578"></a><span class="w">            </span><span class="n">nu</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mf">2.0d0</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">nu</span>
+<a id="ln-1579" name="ln-1579" href="#ln-1579"></a><span class="w">        </span><span class="k">end select</span>
+<a id="ln-1580" name="ln-1580" href="#ln-1580"></a><span class="k">    end if</span>
+<a id="ln-1581" name="ln-1581" href="#ln-1581"></a><span class="k">end subroutine</span>
+<a id="ln-1582" name="ln-1582" href="#ln-1582"></a>
+<a id="ln-1583" name="ln-1583" href="#ln-1583"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-1584" name="ln-1584" href="#ln-1584"></a><span class="c">! Checks the Levenberg-Marquardt solution against the convergence criteria.</span>
+<a id="ln-1585" name="ln-1585" href="#ln-1585"></a><span class="c">!</span>
+<a id="ln-1586" name="ln-1586" href="#ln-1586"></a><span class="c">! Inputs:</span>
+<a id="ln-1587" name="ln-1587" href="#ln-1587"></a><span class="c">! - controls: the solution controls and convergence criteria</span>
+<a id="ln-1588" name="ln-1588" href="#ln-1588"></a><span class="c">! - dof: the statistical degrees of freedom of the system (M - N)</span>
+<a id="ln-1589" name="ln-1589" href="#ln-1589"></a><span class="c">! - resid: the residual error (M-by-1)</span>
+<a id="ln-1590" name="ln-1590" href="#ln-1590"></a><span class="c">! - niter: the number of iterations</span>
+<a id="ln-1591" name="ln-1591" href="#ln-1591"></a><span class="c">! - neval: the number of function evaluations</span>
+<a id="ln-1592" name="ln-1592" href="#ln-1592"></a><span class="c">! - JtWdy: linearized fitting vector (N-by-1)</span>
+<a id="ln-1593" name="ln-1593" href="#ln-1593"></a><span class="c">! - h: the change in parameter (solution) values (N-by-1)</span>
+<a id="ln-1594" name="ln-1594" href="#ln-1594"></a><span class="c">! - p: the parameter (solution) values (N-by-1)</span>
+<a id="ln-1595" name="ln-1595" href="#ln-1595"></a><span class="c">! - X2: the Chi-squared estimate</span>
+<a id="ln-1596" name="ln-1596" href="#ln-1596"></a><span class="c">!</span>
+<a id="ln-1597" name="ln-1597" href="#ln-1597"></a><span class="c">! Outputs:</span>
+<a id="ln-1598" name="ln-1598" href="#ln-1598"></a><span class="c">! - info: The convergence information.</span>
+<a id="ln-1599" name="ln-1599" href="#ln-1599"></a><span class="c">! - rst: True if convergence was achieved; else, false.</span>
+<a id="ln-1600" name="ln-1600" href="#ln-1600"></a><span class="k">function </span><span class="n">lm_check_convergence</span><span class="p">(</span><span class="n">controls</span><span class="p">,</span><span class="w"> </span><span class="n">dof</span><span class="p">,</span><span class="w"> </span><span class="n">resid</span><span class="p">,</span><span class="w"> </span><span class="n">niter</span><span class="p">,</span><span class="w"> </span><span class="n">neval</span><span class="p">,</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1601" name="ln-1601" href="#ln-1601"></a><span class="w">    </span><span class="n">JtWdy</span><span class="p">,</span><span class="w"> </span><span class="n">h</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">X2</span><span class="p">,</span><span class="w"> </span><span class="n">info</span><span class="p">)</span><span class="w"> </span><span class="k">result</span><span class="p">(</span><span class="n">rst</span><span class="p">)</span>
+<a id="ln-1602" name="ln-1602" href="#ln-1602"></a><span class="w">    </span><span class="c">! Arguments</span>
+<a id="ln-1603" name="ln-1603" href="#ln-1603"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">iteration_controls</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">controls</span>
+<a id="ln-1604" name="ln-1604" href="#ln-1604"></a><span class="w">    </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">resid</span><span class="p">(:),</span><span class="w"> </span><span class="n">JtWdy</span><span class="p">(:),</span><span class="w"> </span><span class="n">h</span><span class="p">(:),</span><span class="w"> </span><span class="n">p</span><span class="p">(:),</span><span class="w"> </span><span class="n">X2</span>
+<a id="ln-1605" name="ln-1605" href="#ln-1605"></a><span class="w">    </span><span class="kt">integer</span><span class="p">(</span><span class="n">int32</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">in</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">dof</span><span class="p">,</span><span class="w"> </span><span class="n">niter</span><span class="p">,</span><span class="w"> </span><span class="n">neval</span>
+<a id="ln-1606" name="ln-1606" href="#ln-1606"></a><span class="w">    </span><span class="k">class</span><span class="p">(</span><span class="n">convergence_info</span><span class="p">),</span><span class="w"> </span><span class="k">intent</span><span class="p">(</span><span class="n">out</span><span class="p">)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">info</span>
+<a id="ln-1607" name="ln-1607" href="#ln-1607"></a><span class="w">    </span><span class="kt">logical</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">rst</span>
+<a id="ln-1608" name="ln-1608" href="#ln-1608"></a>
+<a id="ln-1609" name="ln-1609" href="#ln-1609"></a><span class="w">    </span><span class="c">! Initialization</span>
+<a id="ln-1610" name="ln-1610" href="#ln-1610"></a><span class="w">    </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">false</span><span class="p">.</span>
+<a id="ln-1611" name="ln-1611" href="#ln-1611"></a>
+<a id="ln-1612" name="ln-1612" href="#ln-1612"></a><span class="w">    </span><span class="c">! Iteration Checks</span>
+<a id="ln-1613" name="ln-1613" href="#ln-1613"></a><span class="w">    </span><span class="n">info</span><span class="p">%</span><span class="n">iteration_count</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">niter</span>
+<a id="ln-1614" name="ln-1614" href="#ln-1614"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">niter</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="n">controls</span><span class="p">%</span><span class="n">max_iteration_count</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-1615" name="ln-1615" href="#ln-1615"></a><span class="k">        </span><span class="n">info</span><span class="p">%</span><span class="n">reach_iteration_limit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.</span>
+<a id="ln-1616" name="ln-1616" href="#ln-1616"></a><span class="w">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.</span>
+<a id="ln-1617" name="ln-1617" href="#ln-1617"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-1618" name="ln-1618" href="#ln-1618"></a><span class="k">        </span><span class="n">info</span><span class="p">%</span><span class="n">reach_iteration_limit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">false</span><span class="p">.</span>
+<a id="ln-1619" name="ln-1619" href="#ln-1619"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-1620" name="ln-1620" href="#ln-1620"></a>
+<a id="ln-1621" name="ln-1621" href="#ln-1621"></a><span class="k">    </span><span class="n">info</span><span class="p">%</span><span class="n">function_evaluation_count</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">neval</span>
+<a id="ln-1622" name="ln-1622" href="#ln-1622"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">neval</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="n">controls</span><span class="p">%</span><span class="n">max_function_evaluations</span><span class="p">)</span><span class="w"> </span><span class="k">then</span>
+<a id="ln-1623" name="ln-1623" href="#ln-1623"></a><span class="k">        </span><span class="n">info</span><span class="p">%</span><span class="n">reach_function_evaluation_limit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.</span>
+<a id="ln-1624" name="ln-1624" href="#ln-1624"></a><span class="w">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.</span>
+<a id="ln-1625" name="ln-1625" href="#ln-1625"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-1626" name="ln-1626" href="#ln-1626"></a><span class="k">        </span><span class="n">info</span><span class="p">%</span><span class="n">reach_function_evaluation_limit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">false</span><span class="p">.</span>
+<a id="ln-1627" name="ln-1627" href="#ln-1627"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-1628" name="ln-1628" href="#ln-1628"></a>
+<a id="ln-1629" name="ln-1629" href="#ln-1629"></a><span class="k">    </span><span class="n">info</span><span class="p">%</span><span class="n">gradient_value</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">maxval</span><span class="p">(</span><span class="nb">abs</span><span class="p">(</span><span class="n">JtWdy</span><span class="p">))</span>
+<a id="ln-1630" name="ln-1630" href="#ln-1630"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">info</span><span class="p">%</span><span class="n">gradient_value</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">controls</span><span class="p">%</span><span class="n">gradient_tolerance</span><span class="w"> </span><span class="p">.</span><span class="nb">and</span><span class="p">.</span><span class="w"> </span><span class="n">niter</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="mi">2</span><span class="p">)</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1631" name="ln-1631" href="#ln-1631"></a><span class="w">    </span><span class="k">then</span>
+<a id="ln-1632" name="ln-1632" href="#ln-1632"></a><span class="k">        </span><span class="n">info</span><span class="p">%</span><span class="n">converge_on_gradient</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.</span>
+<a id="ln-1633" name="ln-1633" href="#ln-1633"></a><span class="w">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.</span>
+<a id="ln-1634" name="ln-1634" href="#ln-1634"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-1635" name="ln-1635" href="#ln-1635"></a><span class="k">        </span><span class="n">info</span><span class="p">%</span><span class="n">converge_on_gradient</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">false</span><span class="p">.</span>
+<a id="ln-1636" name="ln-1636" href="#ln-1636"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-1637" name="ln-1637" href="#ln-1637"></a>
+<a id="ln-1638" name="ln-1638" href="#ln-1638"></a><span class="k">    </span><span class="n">info</span><span class="p">%</span><span class="n">solution_change_value</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">maxval</span><span class="p">(</span><span class="nb">abs</span><span class="p">(</span><span class="n">h</span><span class="p">)</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="p">(</span><span class="nb">abs</span><span class="p">(</span><span class="n">p</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mf">1.0d-12</span><span class="p">))</span>
+<a id="ln-1639" name="ln-1639" href="#ln-1639"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">info</span><span class="p">%</span><span class="n">solution_change_value</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1640" name="ln-1640" href="#ln-1640"></a><span class="w">        </span><span class="n">controls</span><span class="p">%</span><span class="n">change_in_solution_tolerance</span><span class="w"> </span><span class="p">.</span><span class="nb">and</span><span class="p">.</span><span class="w"> </span><span class="n">niter</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="mi">2</span><span class="p">)</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1641" name="ln-1641" href="#ln-1641"></a><span class="w">    </span><span class="k">then</span>
+<a id="ln-1642" name="ln-1642" href="#ln-1642"></a><span class="k">        </span><span class="n">info</span><span class="p">%</span><span class="n">converge_on_solution_change</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.</span>
+<a id="ln-1643" name="ln-1643" href="#ln-1643"></a><span class="w">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.</span>
+<a id="ln-1644" name="ln-1644" href="#ln-1644"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-1645" name="ln-1645" href="#ln-1645"></a><span class="k">        </span><span class="n">info</span><span class="p">%</span><span class="n">converge_on_solution_change</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">false</span><span class="p">.</span>
+<a id="ln-1646" name="ln-1646" href="#ln-1646"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-1647" name="ln-1647" href="#ln-1647"></a>
+<a id="ln-1648" name="ln-1648" href="#ln-1648"></a><span class="k">    </span><span class="n">info</span><span class="p">%</span><span class="n">residual_value</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">X2</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">dof</span>
+<a id="ln-1649" name="ln-1649" href="#ln-1649"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">info</span><span class="p">%</span><span class="n">residual_value</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">controls</span><span class="p">%</span><span class="n">residual_tolerance</span><span class="w"> </span><span class="p">.</span><span class="nb">and</span><span class="p">.</span><span class="w"> </span><span class="n">niter</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="mi">2</span><span class="p">)</span><span class="w"> </span><span class="p">&amp;</span>
+<a id="ln-1650" name="ln-1650" href="#ln-1650"></a><span class="w">    </span><span class="k">then</span>
+<a id="ln-1651" name="ln-1651" href="#ln-1651"></a><span class="k">        </span><span class="n">info</span><span class="p">%</span><span class="n">converge_on_residual_parameter</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.</span>
+<a id="ln-1652" name="ln-1652" href="#ln-1652"></a><span class="w">        </span><span class="n">rst</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">true</span><span class="p">.</span>
+<a id="ln-1653" name="ln-1653" href="#ln-1653"></a><span class="w">    </span><span class="k">else</span>
+<a id="ln-1654" name="ln-1654" href="#ln-1654"></a><span class="k">        </span><span class="n">info</span><span class="p">%</span><span class="n">converge_on_residual_parameter</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">.</span><span class="n">false</span><span class="p">.</span>
+<a id="ln-1655" name="ln-1655" href="#ln-1655"></a><span class="w">    </span><span class="k">end if</span>
+<a id="ln-1656" name="ln-1656" href="#ln-1656"></a><span class="k">end function</span>
+<a id="ln-1657" name="ln-1657" href="#ln-1657"></a>
+<a id="ln-1658" name="ln-1658" href="#ln-1658"></a><span class="c">! ------------------------------------------------------------------------------</span>
+<a id="ln-1659" name="ln-1659" href="#ln-1659"></a><span class="k">end module</span>
 </pre></div>
 
       </section>
@@ -1826,7 +1828,7 @@ <h2><span class="anchor" id="src"></span>Source Code</h2>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/sourcefile/fstats_sampling.f90.html b/doc/sourcefile/fstats_sampling.f90.html
index 2e851f9..d1fc825 100644
--- a/doc/sourcefile/fstats_sampling.f90.html
+++ b/doc/sourcefile/fstats_sampling.f90.html
@@ -74,7 +74,7 @@ <h1>fstats_sampling.f90
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 2.8% of total for source files.">78 statements</a>
+                 title=" 2.7% of total for source files.">78 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -307,7 +307,7 @@ <h2><span class="anchor" id="src"></span>Source Code</h2>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/sourcefile/fstats_smoothing.f90.html b/doc/sourcefile/fstats_smoothing.f90.html
index 3ffb58b..45d3fc1 100644
--- a/doc/sourcefile/fstats_smoothing.f90.html
+++ b/doc/sourcefile/fstats_smoothing.f90.html
@@ -74,7 +74,7 @@ <h1>fstats_smoothing.f90
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 7.7% of total for source files.">215 statements</a>
+                 title=" 7.5% of total for source files.">215 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -458,7 +458,7 @@ <h2><span class="anchor" id="src"></span>Source Code</h2>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/sourcefile/fstats_special_functions.f90.html b/doc/sourcefile/fstats_special_functions.f90.html
index 4e3e03d..a8ec150 100644
--- a/doc/sourcefile/fstats_special_functions.f90.html
+++ b/doc/sourcefile/fstats_special_functions.f90.html
@@ -74,7 +74,7 @@ <h1>fstats_special_functions.f90
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title=" 6.1% of total for source files.">169 statements</a>
+                 title=" 5.9% of total for source files.">169 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -476,7 +476,7 @@ <h2><span class="anchor" id="src"></span>Source Code</h2>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/sourcefile/fstats_types.f90.html b/doc/sourcefile/fstats_types.f90.html
new file mode 100644
index 0000000..427b262
--- /dev/null
+++ b/doc/sourcefile/fstats_types.f90.html
@@ -0,0 +1,212 @@
+<!-- -*- mode: jinja2 -*- -->
+
+<!DOCTYPE html>
+<html lang="en">
+  <head>
+    <meta charset="utf-8">
+    <meta http-equiv="X-UA-Compatible" content="IE=edge">
+    <meta name="viewport" content="width=device-width, initial-scale=1">
+      <meta name="description" content="FSTATS is a modern Fortran statistical library containing routines for computing basic statistical properties, hypothesis testing, regression, special functions, and experimental design.">
+    <meta name="author" content="Jason Christopherson" >
+    <link rel="icon" href="../favicon.png">
+
+    <title>fstats_types.f90 &ndash; FSTATS</title>
+
+    <link href="https://cdn.jsdelivr.net/npm/bootstrap@5.1.3/dist/css/bootstrap.min.css" rel="stylesheet"
+          integrity="sha384-1BmE4kWBq78iYhFldvKuhfTAU6auU8tT94WrHftjDbrCEXSU1oBoqyl2QvZ6jIW3" crossorigin="anonymous">
+    <link href="../css/pygments.css" rel="stylesheet">
+    <link href="../css/font-awesome.min.css" rel="stylesheet">
+    <link href="../css/local.css" rel="stylesheet">
+      <link  href="../tipuesearch/tipuesearch.css" rel="stylesheet">
+
+    <script src="https://code.jquery.com/jquery-3.7.1.min.js" integrity="sha256-/JqT3SQfawRcv/BIHPThkBvs0OEvtFFmqPF/lYI/Cxo=" crossorigin="anonymous"></script>
+    <script src="../js/svg-pan-zoom.min.js"></script>
+  </head>
+
+  <body>
+
+    <!-- Fixed navbar -->
+    <div class="container-fluid mb-sm-4 mb-xl-2">
+      <nav class="navbar navbar-expand-lg navbar-dark bg-dark fixed-top">
+        <div class="container">
+          <a class="navbar-brand" href="../index.html">FSTATS </a>
+          <button type="button" class="navbar-toggler" data-bs-toggle="collapse" data-bs-target="#navbar"
+                  aria-expanded="false" aria-controls="navbar" aria-label="Toggle navigation">
+                  <span class="navbar-toggler-icon">
+          </button>
+
+          <div id="navbar" class="navbar-collapse collapse">
+            <ul class="navbar-nav">
+                  <li class="nav-item">
+                    <a class="nav-link" href="../lists/files.html">Source Files</a>
+                  </li>
+                <li class="nav-item">
+                  <a class="nav-link" href="../lists/modules.html">Modules</a>
+                </li>
+                <li class="nav-item">
+                  <a class="nav-link" href="../lists/procedures.html">Procedures</a>
+                </li>
+                <li class="nav-item">
+                  <a class="nav-link" href="../lists/types.html">Derived Types</a>
+                </li>
+            </ul>
+              <div class="d-flex align-items-end flex-grow-1">
+                <form action="../search.html" role="search" class="ms-auto">
+                  <input type="text" class="form-control" aria-label="Search" placeholder="Search" name="q" id="tipue_search_input" autocomplete="off" required>
+                </form>
+              </div>
+          </div><!--/.nav-collapse -->
+        </div>
+      </nav>
+    </div>
+
+    <div class="container">
+  <div class="row">
+    <h1>fstats_types.f90
+      <small>Source File</small>
+      
+    </h1>
+      <div class="container p-2 mb-4 bg-light border rounded-3">
+    <div class="row align-items-center justify-content-between" id="info-bar">
+      <div class="col">
+        <ul class="list-inline" style="margin-bottom:0px;display:inline">
+
+            <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
+              <a data-bs-toggle="tooltip"
+                 data-bs-placement="bottom" data-html="true"
+                 title=" 0.2% of total for source files.">7 statements</a>
+            </li>
+
+            <li class="list-inline-item" id="source-file">
+              <i class="fa fa-code"></i>
+              <a href="../src/fstats_types.f90"> Source File</a>
+            </li>
+        </ul>
+      </div>
+      <div class="col">
+        <nav aria-label="breadcrumb">
+          <ol class="breadcrumb justify-content-end mb-0">
+            <li class="breadcrumb-item active" aria-current="page">fstats_types.f90</li>
+          </ol>
+        </nav>
+      </div>
+    </div>
+  </div>
+  <script>
+    $(function () {
+    $('[data-bs-toggle="tooltip"]').tooltip()
+    })
+  </script>
+
+  </div>
+  <div class="row">
+    <div class="col-md-3 hidden-xs hidden-sm visible-md visible-lg">
+        <div id="sidebar">
+      <h3>Contents</h3>
+  
+  
+  
+  
+  
+      <div class="card mb-4">
+      <a data-bs-toggle="collapse" href="#mods-0"
+         aria-expanded="false" aria-controls="mods-0">
+         <h4 class="card-header bg-primary text-white">Modules</h4>
+      </a>
+      <div id="mods-0" class="collapse">
+        <div class="list-group list-group-flush">
+            <a class="list-group-item" href="../module/fstats_types.html">fstats_types</a>
+        </div>
+      </div>
+    </div>
+
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+    <div class="card card-primary">
+      <div class="card-header text-left"><h3 class="card-title">Source Code</h3></div>
+      <div class="list-group">
+        <a class="list-group-item" href="../sourcefile/fstats_types.f90.html#src">fstats_types.f90</a>
+      </div>
+    </div>
+
+
+  </div>
+
+    </div>
+    <div class="col-md-9" id='text'>
+      
+      <br>
+
+      <section>
+        <h2><span class="anchor" id="src"></span>Source Code</h2>
+        <div class="hl codehilite"><pre><span></span><a id="ln-1" name="ln-1" href="#ln-1"></a><span class="k">module </span><span class="n">fstats_types</span>
+<a id="ln-2" name="ln-2" href="#ln-2"></a><span class="w">    </span><span class="k">use </span><span class="n">iso_fortran_env</span>
+<a id="ln-3" name="ln-3" href="#ln-3"></a><span class="w">    </span><span class="k">implicit none</span>
+<a id="ln-4" name="ln-4" href="#ln-4"></a>
+<a id="ln-5" name="ln-5" href="#ln-5"></a><span class="k">    type </span><span class="n">array_container</span>
+<a id="ln-6" name="ln-6" href="#ln-6"></a><span class="w">        </span><span class="c">!! Provides a container for a real-valued array.  A practical use of</span>
+<a id="ln-7" name="ln-7" href="#ln-7"></a><span class="w">        </span><span class="c">!! this construct is in the construction of jagged arrays.</span>
+<a id="ln-8" name="ln-8" href="#ln-8"></a><span class="w">        </span><span class="kt">real</span><span class="p">(</span><span class="n">real64</span><span class="p">),</span><span class="w"> </span><span class="k">allocatable</span><span class="p">,</span><span class="w"> </span><span class="k">dimension</span><span class="p">(:)</span><span class="w"> </span><span class="kd">::</span><span class="w"> </span><span class="n">x</span>
+<a id="ln-9" name="ln-9" href="#ln-9"></a><span class="w">            </span><span class="c">!! The array.</span>
+<a id="ln-10" name="ln-10" href="#ln-10"></a><span class="w">    </span><span class="k">end type</span>
+<a id="ln-11" name="ln-11" href="#ln-11"></a><span class="k">end module</span>
+</pre></div>
+
+      </section>
+    </div>
+  </div>
+
+      <hr>
+    </div> <!-- /container -->
+    <footer>
+      <div class="container">
+        <div class="row justify-content-between">
+          <div class="col"><p>FSTATS was developed by Jason Christopherson<br>&copy; 2024 
+</p>
+          </div>
+          <div class="col">
+            <p class="text-end">
+              Documentation generated by
+              <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
+ on 2024-04-16 13:46              </p>
+          </div>
+        </div>
+        <br>
+      </div> <!-- /container -->
+    </footer>
+
+    <!-- Bootstrap core JavaScript -->
+    <!-- Placed at the end of the document so the pages load faster -->
+    <script src="https://cdn.jsdelivr.net/npm/bootstrap@5.1.3/dist/js/bootstrap.bundle.min.js"
+            integrity="sha384-ka7Sk0Gln4gmtz2MlQnikT1wXgYsOg+OMhuP+IlRH9sENBO0LRn5q+8nbTov4+1p" crossorigin="anonymous"></script>    
+
+    <!-- MathJax JavaScript
+             ================================================== -->
+             <!-- Placed at the end of the document so the pages load faster -->
+        <script type="text/x-mathjax-config">
+          MathJax.Hub.Config({
+          TeX: { extensions: ['AMSmath.js','AMSsymbols.js','noErrors.js','noUndefined.js'], equationNumbers: { autoNumber: 'AMS' } },
+          jax: ['input/TeX','input/MathML','output/HTML-CSS'],
+          extensions: ['tex2jax.js','mml2jax.js','MathMenu.js','MathZoom.js']
+          });
+        </script>
+        <script src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML"></script>
+
+          <script src="../tipuesearch/tipuesearch_content.js"></script>
+          <script src="../tipuesearch/tipuesearch_set.js"></script>
+          <script src="../tipuesearch/tipuesearch.js"></script>
+
+  </body>
+</html>
\ No newline at end of file
diff --git a/doc/src/fstats.f90 b/doc/src/fstats.f90
index 17ddec2..3c1bb24 100644
--- a/doc/src/fstats.f90
+++ b/doc/src/fstats.f90
@@ -49,7 +49,7 @@ module fstats
     public :: digamma
     public :: incomplete_gamma_upper
     public :: incomplete_gamma_lower
-    public :: coefficient_matrix
+    public :: design_matrix
     public :: covariance_matrix
     public :: linear_least_squares
     public :: regression_statistics
@@ -78,6 +78,8 @@ module fstats
     public :: box_muller_sample
     public :: rejection_sample
     public :: lowess
+    public :: pooled_variance
+    public :: bartletts_test
     public :: FS_LEVENBERG_MARQUARDT_UPDATE
     public :: FS_QUADRATIC_UPDATE
     public :: FS_NIELSEN_UPDATE
diff --git a/doc/src/fstats_descriptive_statistics.f90 b/doc/src/fstats_descriptive_statistics.f90
index b6a376e..591904a 100644
--- a/doc/src/fstats_descriptive_statistics.f90
+++ b/doc/src/fstats_descriptive_statistics.f90
@@ -3,6 +3,7 @@ module fstats_descriptive_statistics
     use linalg, only : sort
     use ferror
     use fstats_errors
+    use fstats_types
     implicit none
     private
     public :: mean
@@ -12,7 +13,13 @@ module fstats_descriptive_statistics
     public :: quantile
     public :: trimmed_mean
     public :: covariance
+    public :: pooled_variance
     
+    interface pooled_variance
+        !! Computes the pooled estimate of variance.
+        module procedure :: pooled_variance_1
+        module procedure :: pooled_variance_2
+    end interface
 contains
 ! ------------------------------------------------------------------------------
 pure function mean(x) result(rst)
@@ -237,5 +244,53 @@ pure function covariance(x, y) result(rst)
     end if
 end function
 
+! ------------------------------------------------------------------------------
+pure function pooled_variance_1(si, ni) result(rst)
+    !! Computes the pooled estimate of variance.
+    real(real64), intent(in), dimension(:) :: si
+        !! An N-element array containing the estimates for each of the N
+        !! variances.
+    integer(int32), intent(in), dimension(size(si)) :: ni
+        !! An N-element array containing the number of data points in each
+        !! of the data sets used to compute the variances in si.
+    real(real64) :: rst
+        !! The pooled variance.
+
+    ! Local Variables
+    integer(int32) :: i, k, n
+
+    ! Process
+    k = size(si)
+    rst = 0.0d0
+    n = 0
+    do i = 1, k
+        n = n + ni(i)
+        rst = rst + (ni(i) - 1.0d0) * si(i)
+    end do
+    rst = rst / real(n - k, real64)
+end function
+
+pure function pooled_variance_2(x) result(rst)
+    !! Computes the pooled estimate of variance.
+    type(array_container), intent(in), dimension(:) :: x
+        !! An array of arrays of data.
+    real(real64) :: rst
+        !! The pooled variance.
+
+    ! Local Variables
+    integer(int32) :: i, k, n, ni
+
+    ! Process
+    k = size(x)
+    n = 0
+    rst = 0.0d0
+    do i = 1, k
+        ni = size(x(i)%x)
+        n = n + ni
+        rst = rst + variance(x(i)%x) * (ni - 1.0)
+    end do
+    rst = rst / real(n - k, real64)
+end function
+
 ! ------------------------------------------------------------------------------
 end module
\ No newline at end of file
diff --git a/doc/src/fstats_hypothesis.f90 b/doc/src/fstats_hypothesis.f90
index d6eb068..7f278c4 100644
--- a/doc/src/fstats_hypothesis.f90
+++ b/doc/src/fstats_hypothesis.f90
@@ -5,12 +5,14 @@ module fstats_hypothesis
     use fstats_special_functions
     use fstats_distributions
     use fstats_descriptive_statistics
+    use fstats_types
     private
     public :: confidence_interval
     public :: t_test_equal_variance
     public :: t_test_unequal_variance
     public :: t_test_paired
     public :: f_test
+    public :: bartletts_test
 
     interface confidence_interval
         !! Computes the confidence interval for the specified distribution.
@@ -279,13 +281,13 @@ subroutine f_test(x1, x2, stat, p, dof1, dof2)
         !! A measure of the degrees of freedom.
 
     ! Parameters
-    real(real64), parameter :: half = 0.5d0
     real(real64), parameter :: one = 1.0d0
     real(real64), parameter :: two = 2.0d0
 
     ! Local Variables
     integer(int32) :: n1, n2
-    real(real64) :: v1, v2, m1, m2, a, b, x
+    real(real64) :: v1, v2, m1, m2
+    type(f_distribution) :: dist
 
     ! Compute the F-statistic
     n1 = size(x1)
@@ -304,12 +306,64 @@ subroutine f_test(x1, x2, stat, p, dof1, dof2)
         dof2 = n1 - one
     end if
 
-    ! Compute the probability
-    a = half * dof2
-    b = half * dof1
-    x = dof2 / (dof2 + dof1 * stat)
-    p = two * regularized_beta(a, b, x)
-    if (p > one) p = two - p
+    dist%d1 = dof1
+    dist%d2 = dof2
+    p = two * (one - dist%cdf(stat))
+end subroutine
+
+! ------------------------------------------------------------------------------
+subroutine bartletts_test(x, stat, p)
+    !! Computes Bartlett's test statistic as follows.
+    !!
+    !! $$ \chi^{2} = \frac{(N - k) \ln(S_{p}^{2}) \sum_{i = 1}^{k} 
+    !! \left(n_{i} - 1 \right) \ln(S_{i}^{2})}{1 + 
+    !! \frac{1}{3 \left( k - 1 \right)} \left( \sum_{i = 1}^{k} 
+    !! \left( \frac{1}{n_{i} - 1} \right) - \frac{1}{N - k} \right)} $$
+    !!
+    !! Where \( N = \sum_{i = 1}^{k} n_{i} \) and \( S_{p}^{2} \) is the pooled
+    !! variance.
+    type(array_container), intent(in), dimension(:) :: x
+        !! The arrays of data to analyze.
+    real(real64), intent(out) :: stat
+        !! The Bartlett's test statistic.
+    real(real64), intent(out) :: p
+        !! The probability value that the variances of each data set are
+        !! equivalent.  A low p-value, less than some significance level,
+        !! indicates a non-equivalance of variances.
+
+    ! Local Variables
+    integer(int32) :: i, n, k, ni
+    real(real64) :: si, sp, numer, denom
+    type(chi_squared_distribution) :: dist
+
+    ! Initialization
+    k = size(x)
+    n = 0
+    do i = 1, k
+        n = n + size(x(i)%x)
+    end do
+
+    ! Compute the statistic
+    n = 0
+    sp = 0.0d0
+    numer = 0.0d0
+    denom = 0.0d0
+    do i = 1, k
+        ni = size(x(i)%x)
+        n = n + ni
+        si = variance(x(i)%x)
+        sp = sp + (ni - 1.0d0) * si
+        numer = numer + (ni - 1.0d0) * log(variance(x(i)%x))
+        denom = denom + 1.0d0 / (ni - 1.0d0)
+    end do
+    sp = sp / real(n - k, real64)
+    stat = ((n - k) * log(sp) - numer) / &
+        (1.0d0 + (1.0d0 / (3.0d0 * k - 3.0d0)) * &
+        (denom - 1.0d0 / real(n - k, real64)))
+
+    ! Compute the p-value
+    dist%dof = k - 1
+    p = 1.0d0 - dist%cdf(stat)
 end subroutine
 
 ! ------------------------------------------------------------------------------
diff --git a/doc/src/fstats_regression.f90 b/doc/src/fstats_regression.f90
index 9e05a76..5b79337 100644
--- a/doc/src/fstats_regression.f90
+++ b/doc/src/fstats_regression.f90
@@ -19,7 +19,7 @@ module fstats_regression
     public :: r_squared
     public :: adjusted_r_squared
     public :: correlation
-    public :: coefficient_matrix
+    public :: design_matrix
     public :: covariance_matrix
     public :: linear_least_squares
     public :: calculate_regression_statistics
@@ -293,16 +293,18 @@ pure function correlation(x, y) result(rst)
 end function
 
 ! ------------------------------------------------------------------------------
-subroutine coefficient_matrix(order, intercept, x, c, err)
-    !! Computes the coefficient matrix \( X \) to the linear 
+subroutine design_matrix(order, intercept, x, c, err)
+    !! Computes the design matrix \( X \) for the linear 
     !! least-squares regression problem of \( X \beta = y \), where 
-    !! \( X \) is the coefficient matrix computed here, \( \beta \) is 
+    !! \( X \) is the matrix computed here, \( \beta \) is 
     !! the vector of coefficients to be determined, and \( y \) is the 
     !! vector of measured dependent variables.
     !!
     !! See Also
     !!
     !! - [Wikipedia](https://en.wikipedia.org/wiki/Linear_regression)
+    !! - [Wikipedia](https://en.wikipedia.org/wiki/Vandermonde_matrix)
+    !! - [Wikipedia](https://en.wikipedia.org/wiki/Design_matrix)
     integer(int32), intent(in) :: order
         !! The order of the equation to fit.  This value must be
         !! at least one (linear equation), but can be higher as desired.
@@ -343,12 +345,12 @@ subroutine coefficient_matrix(order, intercept, x, c, err)
 
     ! Input Check
     if (order < 1) then
-        call errmgr%report_error("coefficient_matrix", &
+        call errmgr%report_error("design_matrix", &
             "The model order must be at least one.", FS_INVALID_INPUT_ERROR)
         return
     end if
     if (size(c, 1) /= npts .or. size(c, 2) /= ncols) then
-        call report_matrix_size_error(errmgr, "coefficient_matrix", &
+        call report_matrix_size_error(errmgr, "design_matrix", &
             "c", npts, ncols, size(c, 1), size(c, 2))
         return
     end if
@@ -372,7 +374,7 @@ subroutine coefficient_matrix(order, intercept, x, c, err)
 subroutine covariance_matrix(x, c, err)
     !! Computes the covariance matrix \( C \) where 
     !! \( C = \left( X^{T} X \right)^{-1} \) and \( X \) is computed
-    !! by coefficient_matrix.
+    !! by design_matrix.
     !!
     !! See Also
     !!
@@ -380,7 +382,7 @@ subroutine covariance_matrix(x, c, err)
     !! - [Wikipedia - Regression](https://en.wikipedia.org/wiki/Linear_regression)
     real(real64), intent(in) :: x(:,:)
         !! An M-by-N matrix containing the formatted independent data
-        !!  matrix \( X \) as computed by coefficient_matrix.
+        !!  matrix \( X \) as computed by design_matrix.
     real(real64), intent(out) :: c(:,:)
         !! The N-by-N covariance matrix.
     class(errors), intent(inout), optional, target :: err
@@ -551,7 +553,7 @@ subroutine linear_least_squares(order, intercept, x, y, coeffs, &
     end if
 
     ! Compute the coefficient matrix
-    call coefficient_matrix(order, intercept, x, a, errmgr)
+    call design_matrix(order, intercept, x, a, errmgr)
     if (errmgr%has_error_occurred()) return
 
     ! Compute the covariance matrix
diff --git a/doc/src/fstats_types.f90 b/doc/src/fstats_types.f90
new file mode 100644
index 0000000..62cff8f
--- /dev/null
+++ b/doc/src/fstats_types.f90
@@ -0,0 +1,11 @@
+module fstats_types
+    use iso_fortran_env
+    implicit none
+
+    type array_container
+        !! Provides a container for a real-valued array.  A practical use of
+        !! this construct is in the construction of jagged arrays.
+        real(real64), allocatable, dimension(:) :: x
+            !! The array.
+    end type
+end module
\ No newline at end of file
diff --git a/doc/tipuesearch/tipuesearch_content.js b/doc/tipuesearch/tipuesearch_content.js
index 32829f5..f2b201e 100644
--- a/doc/tipuesearch/tipuesearch_content.js
+++ b/doc/tipuesearch/tipuesearch_content.js
@@ -1 +1 @@
-var tipuesearch = {"pages":[{"title":" FSTATS ","text":"FSTATS Developer Info Jason Christopherson","tags":"home","loc":"index.html"},{"title":"bootstrap_regression_statistics – FSTATS ","text":"type, public :: bootstrap_regression_statistics A container for regression-related statistical information as \ncomputed in a bootstrap, or equivalent, calculation. Components Type Visibility Attributes Name Initial real(kind=real64), public :: lower_confidence_interval The lower limit of the confidence interval for the parameter. real(kind=real64), public :: probability The probability that the coefficient is not statistically \nimportant.  A statistically important coefficient will have a \nlow probability (p-value), typically 0.05 or lower; however, a \np-value of up to ~0.2 may be acceptable dependent upon the \nproblem.  Typically any p-value larger than ~0.2 indicates the \nparameter is not statistically important for the model. real(kind=real64), public :: standard_error The standard error for the model coefficient. real(kind=real64), public :: t_statistic The T-statistic for the model coefficient. real(kind=real64), public :: upper_confidence_interval The upper limit of the confidence interval for the parameter.","tags":"","loc":"type\\bootstrap_regression_statistics.html"},{"title":"bootstrap_statistics – FSTATS ","text":"type, public :: bootstrap_statistics A collection of statistics resulting from the bootstrap process. Components Type Visibility Attributes Name Initial real(kind=real64), public :: bias The bias in the statistic. real(kind=real64), public :: lower_confidence_interval The lower confidence limit on the statistic. real(kind=real64), public, allocatable, dimension(:) :: population An array of the population values generated by the bootstrap\nprocess. real(kind=real64), public :: standard_error The standard error of the statistic. real(kind=real64), public :: statistic_value The value of the statistic of interest. real(kind=real64), public :: upper_confidence_interval The upper confidence limit on the statistic.","tags":"","loc":"type\\bootstrap_statistics.html"},{"title":"binomial_distribution – FSTATS ","text":"type, public, extends( distribution ) :: binomial_distribution Defines a binomial distribution.  The binomial distribution describes\nthe probability p of getting k successes in n independent trials. Components Type Visibility Attributes Name Initial integer(kind=int32), public :: n The number of independent trials. real(kind=real64), public :: p The success probability for each trial.  This parameter must\nexist on the set [0, 1]. Type-Bound Procedures procedure, public :: cdf => bd_cdf private pure elemental function bd_cdf(this, x) result(rst) Computes the cumulative distribution funtion. The CDF for a binomial distribution is given as , which is simply\nthe regularized incomplete beta function. Arguments Type Intent Optional Attributes Name class( binomial_distribution ), intent(in) :: this The binomial_distribution object. real(kind=real64), intent(in) :: x The value at which to evaluate the function.  This parameter\nis the number k successes in the n independent trials.  As\nsuch, this parameter must exist on the set [0, n]. Return Value real(kind=real64) The value of the function. procedure, public :: mean => bd_mean private pure function bd_mean(this) result(rst) Computes the mean of the distribution. Arguments Type Intent Optional Attributes Name class( binomial_distribution ), intent(in) :: this The binomial_distribution object. Return Value real(kind=real64) The mean. procedure, public :: median => bd_median private pure function bd_median(this) result(rst) Computes the median of the distribution. Arguments Type Intent Optional Attributes Name class( binomial_distribution ), intent(in) :: this The binomial_distribution object. Return Value real(kind=real64) The median. procedure, public :: mode => bd_mode private pure function bd_mode(this) result(rst) Computes the mode of the distribution. Arguments Type Intent Optional Attributes Name class( binomial_distribution ), intent(in) :: this The binomial_distribution object. Return Value real(kind=real64) The mode. procedure, public :: pdf => bd_pdf private pure elemental function bd_pdf(this, x) result(rst) Computes the probability mass function. The PMF for a binomial distribution is given as . Arguments Type Intent Optional Attributes Name class( binomial_distribution ), intent(in) :: this The binomial_distribution object. real(kind=real64), intent(in) :: x The value at which to evaluate the function.  This parameter\nis the number k successes in the n independent trials.  As\nsuch, this parameter must exist on the set [0, n]. Return Value real(kind=real64) The value of the function. procedure, public :: variance => bd_variance private pure function bd_variance(this) result(rst) Computes the variance of the distribution. Arguments Type Intent Optional Attributes Name class( binomial_distribution ), intent(in) :: this The binomial_distribution object. Return Value real(kind=real64) The variance.","tags":"","loc":"type\\binomial_distribution.html"},{"title":"chi_squared_distribution – FSTATS ","text":"type, public, extends( distribution ) :: chi_squared_distribution Defines a Chi-squared distribution. Components Type Visibility Attributes Name Initial integer(kind=int32), public :: dof The number of degrees of freedom. Type-Bound Procedures procedure, public :: cdf => cs_cdf private pure elemental function cs_cdf(this, x) result(rst) Computes the cumulative distribution function. The CDF for a Chi-squared distribution is given as . Arguments Type Intent Optional Attributes Name class( chi_squared_distribution ), intent(in) :: this The chi_squared_distribution object. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The value of the function. procedure, public :: mean => cs_mean private pure function cs_mean(this) result(rst) Computes the mean of the distribution. Arguments Type Intent Optional Attributes Name class( chi_squared_distribution ), intent(in) :: this The chi_squared_distribution object. Return Value real(kind=real64) The mean. procedure, public :: median => cs_median private pure function cs_median(this) result(rst) Computes the median of the distribution. Arguments Type Intent Optional Attributes Name class( chi_squared_distribution ), intent(in) :: this The chi_squared_distribution object. Return Value real(kind=real64) The median. procedure, public :: mode => cs_mode private pure function cs_mode(this) result(rst) Computes the mode of the distribution. Arguments Type Intent Optional Attributes Name class( chi_squared_distribution ), intent(in) :: this The chi_squared_distribution object. Return Value real(kind=real64) The mode. procedure, public :: pdf => cs_pdf private pure elemental function cs_pdf(this, x) result(rst) Computes the probability density function. The PDF for a Chi-squared distribution is given as . Arguments Type Intent Optional Attributes Name class( chi_squared_distribution ), intent(in) :: this The chi_squared_distribution object. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The value of the function. procedure, public :: variance => cs_variance private pure function cs_variance(this) result(rst) Computes the variance of the distribution. Arguments Type Intent Optional Attributes Name class( chi_squared_distribution ), intent(in) :: this The chi_squared_distribution object. Return Value real(kind=real64) The variance.","tags":"","loc":"type\\chi_squared_distribution.html"},{"title":"distribution – FSTATS ","text":"type, public :: distribution Defines a probability distribution. Type-Bound Procedures procedure( distribution_function ), public, deferred, pass :: cdf Computes the cumulative distribution function. pure elemental function distribution_function(this, x) result(rst) Prototype Defines the interface for a probability distribution function. Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: this The distribution object. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The value of the function. procedure( distribution_property ), public, deferred, pass :: mean Computes the mean of the distribution. pure function distribution_property(this) result(rst) Prototype Computes the value of a distribution property. Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: this The distribution object. Return Value real(kind=real64) The property value. procedure( distribution_property ), public, deferred, pass :: median Computes the median of the distribution. pure function distribution_property(this) result(rst) Prototype Computes the value of a distribution property. Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: this The distribution object. Return Value real(kind=real64) The property value. procedure( distribution_property ), public, deferred, pass :: mode Computes the mode of the distribution. pure function distribution_property(this) result(rst) Prototype Computes the value of a distribution property. Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: this The distribution object. Return Value real(kind=real64) The property value. procedure( distribution_function ), public, deferred, pass :: pdf Computes the probability density function. pure elemental function distribution_function(this, x) result(rst) Prototype Defines the interface for a probability distribution function. Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: this The distribution object. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The value of the function. procedure( distribution_property ), public, deferred, pass :: variance Computes the variance of the distribution. pure function distribution_property(this) result(rst) Prototype Computes the value of a distribution property. Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: this The distribution object. Return Value real(kind=real64) The property value.","tags":"","loc":"type\\distribution.html"},{"title":"f_distribution – FSTATS ","text":"type, public, extends( distribution ) :: f_distribution Defines an F-distribution. Components Type Visibility Attributes Name Initial real(kind=real64), public :: d1 The measure of degrees of freedom for the first data set. real(kind=real64), public :: d2 The measure of degrees of freedom for the second data set. Type-Bound Procedures procedure, public :: cdf => fd_cdf private pure elemental function fd_cdf(this, x) result(rst) Computes the cumulative distribution function. The CDF for a F distribution is given as . Arguments Type Intent Optional Attributes Name class( f_distribution ), intent(in) :: this The f_distribution object. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The value of the function. procedure, public :: mean => fd_mean private pure function fd_mean(this) result(rst) Computes the mean of the distribution. Arguments Type Intent Optional Attributes Name class( f_distribution ), intent(in) :: this The f_distribution object. Return Value real(kind=real64) The mean. procedure, public :: median => fd_median private pure function fd_median(this) result(rst) Computes the median of the distribution. Arguments Type Intent Optional Attributes Name class( f_distribution ), intent(in) :: this The f_distribution object. Return Value real(kind=real64) The median. procedure, public :: mode => fd_mode private pure function fd_mode(this) result(rst) Computes the mode of the distribution. Arguments Type Intent Optional Attributes Name class( f_distribution ), intent(in) :: this The f_distribution object. Return Value real(kind=real64) The mode. procedure, public :: pdf => fd_pdf private pure elemental function fd_pdf(this, x) result(rst) Computes the probability density function. The PDF for a F distribution is given as . Arguments Type Intent Optional Attributes Name class( f_distribution ), intent(in) :: this The f_distribution object. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The value of the function. procedure, public :: variance => fd_variance private pure function fd_variance(this) result(rst) Computes the variance of the distribution. Arguments Type Intent Optional Attributes Name class( f_distribution ), intent(in) :: this The f_distribution object. Return Value real(kind=real64) The variance.","tags":"","loc":"type\\f_distribution.html"},{"title":"normal_distribution – FSTATS ","text":"type, public, extends( distribution ) :: normal_distribution Defines a normal distribution. Components Type Visibility Attributes Name Initial real(kind=real64), public :: mean_value The mean value of the distribution. real(kind=real64), public :: standard_deviation The standard deviation of the distribution. Type-Bound Procedures procedure, public :: cdf => nd_cdf private pure elemental function nd_cdf(this, x) result(rst) Computes the cumulative distribution function. The CDF for a normal distribution is given as . Arguments Type Intent Optional Attributes Name class( normal_distribution ), intent(in) :: this The normal_distribution object. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The value of the function. procedure, public :: mean => nd_mean private pure function nd_mean(this) result(rst) Computes the mean of the distribution. Arguments Type Intent Optional Attributes Name class( normal_distribution ), intent(in) :: this The normal_distribution object. Return Value real(kind=real64) The mean procedure, public :: median => nd_median private pure function nd_median(this) result(rst) Computes the median of the distribution. Arguments Type Intent Optional Attributes Name class( normal_distribution ), intent(in) :: this The normal_distribution object. Return Value real(kind=real64) The median. procedure, public :: mode => nd_mode private pure function nd_mode(this) result(rst) Computes the mode of the distribution. Arguments Type Intent Optional Attributes Name class( normal_distribution ), intent(in) :: this The normal_distribution object. Return Value real(kind=real64) The mode. procedure, public :: pdf => nd_pdf private pure elemental function nd_pdf(this, x) result(rst) Computes the probability density function. The PDF for a normal distribution is given as . Arguments Type Intent Optional Attributes Name class( normal_distribution ), intent(in) :: this The normal_distribution object. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The value of the function. procedure, public :: standardize => nd_standardize private  subroutine nd_standardize(this) Standardizes the normal distribution to a mean of 0 and a \nstandard deviation of 1. Arguments Type Intent Optional Attributes Name class( normal_distribution ), intent(inout) :: this The normal_distribution object. procedure, public :: variance => nd_variance private pure function nd_variance(this) result(rst) Computes the variance of the distribution. Arguments Type Intent Optional Attributes Name class( normal_distribution ), intent(in) :: this The normal_distribution object. Return Value real(kind=real64) The variance.","tags":"","loc":"type\\normal_distribution.html"},{"title":"t_distribution – FSTATS ","text":"type, public, extends( distribution ) :: t_distribution Defines Student's T-Distribution. Components Type Visibility Attributes Name Initial real(kind=real64), public :: dof The number of degrees of freedom. Type-Bound Procedures procedure, public :: cdf => td_cdf private pure elemental function td_cdf(this, x) result(rst) Computes the cumulative distribution function. The CDF for Student's T-Distribution is given as where . Arguments Type Intent Optional Attributes Name class( t_distribution ), intent(in) :: this The t_distribution object. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The value of the function. procedure, public :: mean => td_mean private pure function td_mean(this) result(rst) Computes the mean of the distribution. Arguments Type Intent Optional Attributes Name class( t_distribution ), intent(in) :: this The t_distribution object. Return Value real(kind=real64) The mean. procedure, public :: median => td_median private pure function td_median(this) result(rst) Computes the median of the distribution. Arguments Type Intent Optional Attributes Name class( t_distribution ), intent(in) :: this The t_distribution object. Return Value real(kind=real64) procedure, public :: mode => td_mode private pure function td_mode(this) result(rst) Computes the mode of the distribution. Arguments Type Intent Optional Attributes Name class( t_distribution ), intent(in) :: this The t_distribution object. Return Value real(kind=real64) The mode. procedure, public :: pdf => td_pdf private pure elemental function td_pdf(this, x) result(rst) Computes the probability density function. The PDF for Student's T-Distribution is given as . Arguments Type Intent Optional Attributes Name class( t_distribution ), intent(in) :: this The t_distribution object. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The value of the function. procedure, public :: variance => td_variance private pure function td_variance(this) result(rst) Computes the variance of the distribution. Arguments Type Intent Optional Attributes Name class( t_distribution ), intent(in) :: this The t_distribution object. Return Value real(kind=real64) The variance.","tags":"","loc":"type\\t_distribution.html"},{"title":"convergence_info – FSTATS ","text":"type, public :: convergence_info Provides information regarding convergence status. Components Type Visibility Attributes Name Initial logical, public :: converge_on_gradient True if convergence on the gradient was achieved; else, false. logical, public :: converge_on_residual_parameter True if convergence on the residual error parameter was achieved; \nelse, false. logical, public :: converge_on_solution_change True if convergence on the change in solution was achieved; else,\nfalse. integer(kind=int32), public :: function_evaluation_count The function evaluation count. real(kind=real64), public :: gradient_value The value of the gradient test parameter. integer(kind=int32), public :: iteration_count The iteration count. logical, public :: reach_function_evaluation_limit True if the solution did not converge in the allowed number of\nfunction evaluations. logical, public :: reach_iteration_limit True if the solution did not converge in the allowed number of \niterations. real(kind=real64), public :: residual_value The value of the residual error parameter. real(kind=real64), public :: solution_change_value The value of the change in solution parameter. logical, public :: user_requested_stop True if the user requested the stop; else, false.","tags":"","loc":"type\\convergence_info.html"},{"title":"iteration_controls – FSTATS ","text":"type, public :: iteration_controls Provides a collection of iteration control parameters. Components Type Visibility Attributes Name Initial real(kind=real64), public :: change_in_solution_tolerance Defines a tolerance on the change in parameter values. real(kind=real64), public :: gradient_tolerance Defines a tolerance on the gradient of the fitted function. real(kind=real64), public :: iteration_improvement_tolerance Defines a tolerance to ensure adequate improvement on each \niteration. integer(kind=int32), public :: max_function_evaluations Defines the maximum number of function evaluations allowed. integer(kind=int32), public :: max_iteration_between_updates Defines how many iterations can pass before a re-evaluation of \nthe Jacobian matrix is forced. integer(kind=int32), public :: max_iteration_count Defines the maximum number of iterations allowed. real(kind=real64), public :: residual_tolerance Defines a tolerance on the metric associated with the residual \nerror. Type-Bound Procedures procedure, public :: set_to_default => lm_set_default_tolerances private  subroutine lm_set_default_tolerances(x) Arguments Type Intent Optional Attributes Name class( iteration_controls ), intent(inout) :: x","tags":"","loc":"type\\iteration_controls.html"},{"title":"lm_solver_options – FSTATS ","text":"type, public :: lm_solver_options Options to control the Levenberg-Marquardt solver. Components Type Visibility Attributes Name Initial real(kind=real64), public :: damping_decrease_factor The factor to use when decreasing the damping parameter. real(kind=real64), public :: damping_increase_factor The factor to use when increasing the damping parameter. real(kind=real64), public :: finite_difference_step_size The step size used for the finite difference calculations of the\nJacobian matrix. integer(kind=int32), public :: method The solver method to utilize.\n- FS_LEVENBERG_MARQUARDT_UPDATE:\n- FS_QUADRATIC_UPDATE:\n- FS_NIELSEN_UDPATE: Type-Bound Procedures procedure, public :: set_to_default => lm_set_default_settings private  subroutine lm_set_default_settings(x) Arguments Type Intent Optional Attributes Name class( lm_solver_options ), intent(inout) :: x","tags":"","loc":"type\\lm_solver_options.html"},{"title":"regression_statistics – FSTATS ","text":"type, public :: regression_statistics A container for regression-related statistical information. Components Type Visibility Attributes Name Initial real(kind=real64), public :: confidence_interval The confidence interval for the parameter at the level \ndetermined by the regression process. real(kind=real64), public :: probability The probability that the coefficient is not statistically \nimportant.  A statistically important coefficient will have a \nlow probability (p-value), typically 0.05 or lower; however, a \np-value of up to ~0.2 may be acceptable dependent upon the \nproblem.  Typically any p-value larger than ~0.2 indicates the \nparameter is not statistically important for the model. real(kind=real64), public :: standard_error The standard error for the model coefficient. real(kind=real64), public :: t_statistic The T-statistic for the model coefficient.","tags":"","loc":"type\\regression_statistics.html"},{"title":"anova_factor – FSTATS ","text":"type, public :: anova_factor Defines an ANOVA factor result. Components Type Visibility Attributes Name Initial real(kind=real64), public :: dof The number of degrees of freedome. real(kind=real64), public :: f_statistic The F-statistic. real(kind=real64), public :: probability The variance probability term. real(kind=real64), public :: sum_of_squares The sum of the squares. real(kind=real64), public :: variance The estimate of variance.","tags":"","loc":"type\\anova_factor.html"},{"title":"single_factor_anova_table – FSTATS ","text":"type, public :: single_factor_anova_table Defines a single-factor ANOVA results table. Components Type Visibility Attributes Name Initial type( anova_factor ), public :: main_factor The main, or main factor, results. real(kind=real64), public :: overall_mean The overall mean value. real(kind=real64), public :: total_dof The total number of degrees of freedom. real(kind=real64), public :: total_sum_of_squares The total sum of squares. real(kind=real64), public :: total_variance The total variance estimate. type( anova_factor ), public :: within_factor The within-treatement (error) results.","tags":"","loc":"type\\single_factor_anova_table.html"},{"title":"two_factor_anova_table – FSTATS ","text":"type, public :: two_factor_anova_table Defines a two-factor ANOVA results table. Components Type Visibility Attributes Name Initial type( anova_factor ), public :: interaction The interaction effects. type( anova_factor ), public :: main_factor_1 The first main-factor results. type( anova_factor ), public :: main_factor_2 The second main-factor results. real(kind=real64), public :: overall_mean The overall mean value. real(kind=real64), public :: total_dof The total number of degrees of freedom. real(kind=real64), public :: total_sum_of_squares The total sum of squares. real(kind=real64), public :: total_variance The total variance estimate. type( anova_factor ), public :: within_factor The within (error) factor results.","tags":"","loc":"type\\two_factor_anova_table.html"},{"title":"bootstrap – FSTATS","text":"public  function bootstrap(stat, x, method, nsamples, alpha) result(rst) Performs a bootstrap calculation on the supplied data set for the given\nstatistic.  The default implementation utlizes a random resampling with \nreplacement.  Other resampling methods may be defined by specifying an \nappropriate routine by means of the method input. Arguments Type Intent Optional Attributes Name procedure( bootstrap_statistic_routine ), intent(in), pointer :: stat The routine used to compute the desired statistic. real(kind=real64), intent(in), dimension(:) :: x The N-element data set. procedure( bootstrap_resampling_routine ), intent(in), optional, pointer :: method An optional pointer to the method to use for resampling of the data.\nIf no method is supplied, a random resampling is utilized. integer(kind=int32), intent(in), optional :: nsamples An optional input, that if supplied, specifies the number of \nresampling runs to perform.  The default is 10 000. real(kind=real64), intent(in), optional :: alpha An optional input, that if supplied, defines the significance level\nto use for the analysis.  The default is 0.05. Return Value type( bootstrap_statistics ) The resulting bootstrap_statistics type containing the confidence\nintervals, bias, standard error, etc. for the analyzed statistic.","tags":"","loc":"proc\\bootstrap.html"},{"title":"bootstrap_linear_least_squares – FSTATS","text":"public  subroutine bootstrap_linear_least_squares(order, intercept, x, y, coeffs, ymod, resid, nsamples, stats, bias, alpha, method, bscoeffs, err) Computes a linear least-squares regression to fit a set of data.\nBootstrapping is utilized to gain insight into the quality of \nthe fit.  Resampling for the bootstrap process is a random resampling \nwith replacement process with the range of values limited by the \nstandard deviation of the original data set. Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: order The order of the equation to fit.  This value must be at \nleast one (linear equation), but can be higher as desired, \nas long as there is sufficient data. logical, intent(in) :: intercept Set to true if the intercept is being computed as part of \nthe regression; else, false. real(kind=real64), intent(in), dimension(:) :: x An N-element array containing the independent variable\nmeasurement points. real(kind=real64), intent(in), dimension(:) :: y An N-element array containing the dependent variable\nmeasurement points. real(kind=real64), intent(out), dimension(:) :: coeffs An ORDER+1 element array where the coefficients will\nbe written. real(kind=real64), intent(out), dimension(:) :: ymod An N-element array where the modeled data will be written. real(kind=real64), intent(out), dimension(:) :: resid An N-element array where the residual error data will be \nwritten (modeled - actual). integer(kind=int32), intent(in), optional :: nsamples The number of bootstrapping samples to utilize. type( bootstrap_regression_statistics ), intent(out), optional, dimension(:) :: stats An M-element array of bootstrap_regression_statistics items \nwhere M = ORDER + 1 when intercept is set to true; however, \nif intercept is set to false, M = ORDER. real(kind=real64), intent(out), optional, dimension(:) :: bias An ORDER+1 element array where an estimate of the bias of\neach coefficient is returned based upon the results of the\nbootstrapping analysis.  The bias is computed as the difference \nbetween the mean of the boostrap population results for the given \nparameter and the original estimate of the given parameter. real(kind=real64), intent(in), optional :: alpha The significance level at which to evaluate the confidence \nintervals.  The default value is 0.05 such that a 95% \nconfidence interval is calculated. procedure( bootstrap_resampling_routine ), intent(in), optional, pointer :: method An optional pointer to the method to use for resampling of the data.\nIf no method is supplied, a random resampling is utilized. real(kind=real64), intent(out), optional, allocatable, target, dimension(:,:) :: bscoeffs An optional, allocatable matrix, containing the bootstrap \ndistributions for each parameter stored in each row of the matrix\nsuch that the resulting matrix is NCOEFFS -by- NSAMPLES. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not \n     approriately sized.\n- FS_INVALID_INPUT_ERROR: Occurs if order is less than 1.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error.","tags":"","loc":"proc\\bootstrap_linear_least_squares.html"},{"title":"bootstrap_nonlinear_least_squares – FSTATS","text":"public  subroutine bootstrap_nonlinear_least_squares(fun, x, y, params, ymod, resid, nsamples, weights, maxp, minp, stats, alpha, controls, settings, info, bias, method, bscoeffs, err) Performs a nonlinear regression to fit a model using a version\nof the Levenberg-Marquardt algorithm.  Bootstrapping is utilized to gain \ninsight into the quality of the fit.  Resampling for the bootstrap \nprocess is a random resampling with replacement process with the \nrange of values limited by the standard deviation of the original \ndata set. Arguments Type Intent Optional Attributes Name procedure( regression_function ), intent(in), pointer :: fun A pointer to the regression_function to evaluate. real(kind=real64), intent(in) :: x (:) The M-element array containing independent data. real(kind=real64), intent(in) :: y (:) The M-element array containing dependent data. real(kind=real64), intent(inout) :: params (:) On input, the N-element array containing the initial estimate\nof the model parameters.  On output, the computed model \nparameters. real(kind=real64), intent(out) :: ymod (:) An M-element array where the modeled dependent data will\nbe written. real(kind=real64), intent(out) :: resid (:) An M-element array where the model residuals will be\nwritten. integer(kind=int32), intent(in), optional :: nsamples The number of bootstrapping samples to utilize. real(kind=real64), intent(in), optional, target :: weights (:) An optional M-element array allowing the weighting of\nindividual points. real(kind=real64), intent(in), optional, target :: maxp (:) An optional N-element array that can be used as upper limits \non the parameter values.  If no upper limit is requested for\na particular parameter, utilize a very large value.  The \ninternal default is to utilize huge() as a value. real(kind=real64), intent(in), optional, target :: minp (:) An optional N-element array that can be used as lower limits \non the parameter values.  If no lower limit is requested for\na particalar parameter, utilize a very large magnitude, but \nnegative, value.  The internal default is to utilize -huge() \nas a value. type( bootstrap_regression_statistics ), intent(out), optional :: stats (:) An optional N-element array that, if supplied, will be used \nto return statistics about the fit for each parameter. real(kind=real64), intent(in), optional :: alpha The significance level at which to evaluate the confidence \nintervals.  The default value is 0.05 such that a 95% \nconfidence interval is calculated. type( iteration_controls ), intent(in), optional :: controls An optional input providing custom iteration controls. type( lm_solver_options ), intent(in), optional :: settings An optional input providing custom settings for the solver. type( convergence_info ), intent(out), optional, target :: info An optional output that can be used to gain information about\nthe iterative solution and the nature of the convergence. real(kind=real64), intent(out), optional, dimension(:) :: bias An optional N-element array that, if supplied, will be used to \nprovide an estimate of the bias of each model parameter based upon\nthe results of the bootstrapping analysis.  The bias is computed as \nthe difference between the mean of the boostrap population results \nfor the given parameter and the original estimate of the given \nparameter. procedure( bootstrap_resampling_routine ), intent(in), optional, pointer :: method An optional pointer to the method to use for resampling of the data.\nIf no method is supplied, a random resampling is utilized. real(kind=real64), intent(out), optional, allocatable, target, dimension(:,:) :: bscoeffs An optional, allocatable matrix, containing the bootstrap \ndistributions for each parameter stored in each row of the matrix\nsuch that the resulting matrix is NCOEFFS -by- NSAMPLES. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not \n     properly sized.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error.\n- FS_UNDERDEFINED_PROBLEM_ERROR: Occurs if the problem posed \n     is underdetetermined (M < N).\n- FS_TOLERANCE_TOO_SMALL_ERROR: Occurs if any supplied \n     tolerances are too small to be practical.\n- FS_TOO_FEW_ITERATION_ERROR: Occurs if too few iterations \n     are allowed.","tags":"","loc":"proc\\bootstrap_nonlinear_least_squares.html"},{"title":"random_resample – FSTATS","text":"public  subroutine random_resample(x, xn) Random resampling, with replacement, based upon a normal distribution. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The N-element array to resample. real(kind=real64), intent(out), dimension(size(x)) :: xn An N-element array where the resampled data set will be written.","tags":"","loc":"proc\\random_resample.html"},{"title":"scaled_random_resample – FSTATS","text":"public  subroutine scaled_random_resample(x, xn) A random resampling, scaled by the standard deviation of the original\ndata, but based upon a normal distribution. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The N-element array to resample. real(kind=real64), intent(out), dimension(size(x)) :: xn An N-element array where the resampled data set will be written.","tags":"","loc":"proc\\scaled_random_resample.html"},{"title":"bootstrap_resampling_routine – FSTATS","text":"interface public  subroutine bootstrap_resampling_routine(x, xn) Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The N-element array to resample. real(kind=real64), intent(out), dimension(size(x)) :: xn An N-element array where the resampled data set will be \nwritten. Description Defines the signature of a subroutine used to compute a \nresampling of data for bootstrapping purposes.","tags":"","loc":"interface\\bootstrap_resampling_routine.html"},{"title":"bootstrap_statistic_routine – FSTATS","text":"interface public  function bootstrap_statistic_routine(x) result(rst) Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The array of data to analyze. Return Value real(kind=real64) The resulting statistic. Description Defines the signature of a function for computing the desired\nbootstrap statistic.","tags":"","loc":"interface\\bootstrap_statistic_routine.html"},{"title":"covariance – FSTATS","text":"public pure function covariance(x, y) result(rst) Computes the sample covariance of two data sets. The covariance computed is the sample covariance such that . Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The first N-element data set. real(kind=real64), intent(in), dimension(size(x)) :: y The second N-element data set. Return Value real(kind=real64) The covariance.","tags":"","loc":"proc\\covariance.html"},{"title":"mean – FSTATS","text":"public pure function mean(x) result(rst) Computes the mean of the values in an array. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:) The array of values to analyze. Return Value real(kind=real64) The result.","tags":"","loc":"proc\\mean.html"},{"title":"median – FSTATS","text":"public  function median(x) result(rst) Computes the median of the values in an array. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(inout) :: x (:) The array of values to analyze.  On output, this array is sorted into\nascending order. Return Value real(kind=real64) The result.","tags":"","loc":"proc\\median.html"},{"title":"quantile – FSTATS","text":"public pure function quantile(x, q) result(rst) Computes the specified quantile of a data set using the SAS \nMethod 4. See Also Wikipedia Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:) An N-element array containing the data. real(kind=real64), intent(in) :: q The quantile to compute (e.g. 0.25 computes the 25% quantile). Return Value real(kind=real64) The result.","tags":"","loc":"proc\\quantile.html"},{"title":"standard_deviation – FSTATS","text":"public pure function standard_deviation(x) result(rst) Computes the sample standard deviation of the values in an array. The value computed is the sample standard deviation. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:) The array of values to analyze. Return Value real(kind=real64) The result.","tags":"","loc":"proc\\standard_deviation.html"},{"title":"trimmed_mean – FSTATS","text":"public  function trimmed_mean(x, p) result(rst) Computes the trimmed mean of a data set. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(inout), dimension(:) :: x An N-element array containing the data.  On output, the\narray is sorted into ascending order. real(kind=real64), intent(in), optional :: p An optional parameter specifying the percentage of values\nfrom either end of the distribution to remove.  The default\nis 0.05 such that the bottom 5% and top 5% are removed. Return Value real(kind=real64) The trimmed mean.","tags":"","loc":"proc\\trimmed_mean.html"},{"title":"variance – FSTATS","text":"public pure function variance(x) result(rst) Computes the sample variance of the values in an array. The variance computed is the sample variance such that . Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:) The array of values to analyze. Return Value real(kind=real64)","tags":"","loc":"proc\\variance.html"},{"title":"distribution_function – FSTATS","text":"interface public pure elemental function distribution_function(this, x) result(rst) Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: this The distribution object. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The value of the function. Description Defines the interface for a probability distribution function.","tags":"","loc":"interface\\distribution_function.html"},{"title":"distribution_property – FSTATS","text":"interface public pure function distribution_property(this) result(rst) Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: this The distribution object. Return Value real(kind=real64) The property value. Description Computes the value of a distribution property.","tags":"","loc":"interface\\distribution_property.html"},{"title":"rejection_sample – FSTATS","text":"public  function rejection_sample(tdist, n, xmin, xmax) result(rst) Uses rejection sampling to randomly sample a target distribution. Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: tdist The distribution to sample integer(kind=int32), intent(in) :: n The number of samples to make. real(kind=real64), intent(in) :: xmin The minimum range to explore. real(kind=real64), intent(in) :: xmax The maximum range to explore. Return Value real(kind=real64), allocatable, dimension(:) An N-element array containing the N samples from the \ndistribution.","tags":"","loc":"proc\\rejection_sample.html"},{"title":"box_muller_sample – FSTATS","text":"public interface box_muller_sample Generates random, normally distributed values via the Box-Muller \ntransform. Module Procedures private  function box_muller_sample_scalar(mu, sigma) result(rst) Generates a pair of independent, standard, normally distributed\nrandom values using the Box-Muller transform. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: mu The mean of the distribution. real(kind=real64), intent(in) :: sigma The standard deviation of the distribution. Return Value real(kind=real64), (2) The pair of random values. private  function box_muller_array(mu, sigma, n) result(rst) Generates an array of normally distributed random values sampled\nby the Box-Muller transform. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: mu The mean of the distribution. real(kind=real64), intent(in) :: sigma The standard deviation of the distribution. integer(kind=int32), intent(in) :: n The number of Box-Muller pairs to generate. Return Value real(kind=real64), allocatable, dimension(:) A 2N-element array containing the N Box-Muller pairs.","tags":"","loc":"interface\\box_muller_sample.html"},{"title":"beta – FSTATS","text":"public pure elemental function beta(a, b) result(rst) Computes the beta function. The beta function is related to the gamma function\nby the following relationship. . See Also Wikipedia Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: a The first argument of the function. real(kind=real64), intent(in) :: b The second argument of the function. Return Value real(kind=real64) The value of the beta function at and .","tags":"","loc":"proc\\beta.html"},{"title":"digamma – FSTATS","text":"public pure elemental function digamma(x) result(rst) Computes the digamma function. The digamma function is defined as: See Also Wikipedia Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The function value.","tags":"","loc":"proc\\digamma.html"},{"title":"incomplete_beta – FSTATS","text":"public pure elemental function incomplete_beta(a, b, x) result(rst) Computes the incomplete beta function. The incomplete beta function is defind as: . See Also Wikipedia Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: a The first argument of the function. real(kind=real64), intent(in) :: b The second argument of the function. real(kind=real64), intent(in) :: x The upper limit of the integration. Return Value real(kind=real64) The value of the incomplete beta function.","tags":"","loc":"proc\\incomplete_beta.html"},{"title":"incomplete_gamma_lower – FSTATS","text":"public pure elemental function incomplete_gamma_lower(a, x) result(rst) Computes the lower incomplete gamma function. The lower incomplete gamma function is defined as: See Also Wikipedia Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: a The coefficient value. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The function value.","tags":"","loc":"proc\\incomplete_gamma_lower.html"},{"title":"incomplete_gamma_upper – FSTATS","text":"public pure elemental function incomplete_gamma_upper(a, x) result(rst) Computes the upper incomplete gamma function. The upper incomplete gamma function is defined as: See Also Wikipedia Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: a The coefficient value. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The function value.","tags":"","loc":"proc\\incomplete_gamma_upper.html"},{"title":"regularized_beta – FSTATS","text":"public pure elemental function regularized_beta(a, b, x) result(rst) Computes the regularized beta function. The regularized beta function is defined as the ratio between\nthe incomplete beta function and the beta function. . See Also Wikipedia Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: a The first argument of the function. real(kind=real64), intent(in) :: b The second argument of the function. real(kind=real64), intent(in) :: x The upper limit of the integration. Return Value real(kind=real64) The value of the regularized beta function.","tags":"","loc":"proc\\regularized_beta.html"},{"title":"adjusted_r_squared – FSTATS","text":"public  function adjusted_r_squared(p, x, xm, err) result(rst) Computes the adjusted R-squared value for a data set. The adjusted R-squared provides a mechanism for tempering the effects\nof extra explanatory variables on the traditional R-squared \ncalculation.  It is computed by noting the sample size and \nthe number of variables . . See Also: Wikipedia Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: p The number of variables. real(kind=real64), intent(in) :: x (:) An N-element array containing the dependent variables from \nthe data set. real(kind=real64), intent(in) :: xm (:) An N-element array containing the corresponding modeled \nvalues. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings\nto the caller.  Possible warning and error codes are as \nfollows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if x and xm are not the \n  same size. Return Value real(kind=real64) The result.","tags":"","loc":"proc\\adjusted_r_squared.html"},{"title":"calculate_regression_statistics – FSTATS","text":"public  function calculate_regression_statistics(resid, params, c, alpha, err) result(rst) Computes statistics for the quality of fit for a regression \nmodel. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: resid (:) An M-element array containing the model residual errors. real(kind=real64), intent(in) :: params (:) An N-element array containing the model parameters. real(kind=real64), intent(in) :: c (:,:) The N-by-N covariance matrix. real(kind=real64), intent(in), optional :: alpha The significance level at which to evaluate the confidence \nintervals.  The default value is 0.05 such that a 95% \nconfidence interval is calculated. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if c is not sized correctly.\n- FS_INVALID_INPUT_ERROR: Occurs if order is less than 1.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error. Return Value type( regression_statistics ), allocatable, (:) A regression_statistics object containing the analysis results.","tags":"","loc":"proc\\calculate_regression_statistics.html"},{"title":"correlation – FSTATS","text":"public pure function correlation(x, y) result(rst) Computes the sample correlation coefficient (an estimate to the \npopulation Pearson correlation) as follows. . Where, & are the sample standard deviations of\nx and y respectively. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The first N-element data set. real(kind=real64), intent(in), dimension(size(x)) :: y The second N-element data set. Return Value real(kind=real64) The correlation coefficient.","tags":"","loc":"proc\\correlation.html"},{"title":"r_squared – FSTATS","text":"public  function r_squared(x, xm, err) result(rst) Computes the R-squared value for a data set. The R-squared value is computed by determining the sum of the squares\nof the residuals: The total sum of the squares: . \nThe R-squared value is then: . See Also: Wikipedia Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:) An N-element array containing the dependent variables from \nthe data set. real(kind=real64), intent(in) :: xm (:) An N-element array containing the corresponding modeled \nvalues. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings\nto the caller.  Possible warning and error codes are as \nfollows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if x and xm are not the \n  same size. Return Value real(kind=real64) The result.","tags":"","loc":"proc\\r_squared.html"},{"title":"coefficient_matrix – FSTATS","text":"public  subroutine coefficient_matrix(order, intercept, x, c, err) Computes the coefficient matrix to the linear \nleast-squares regression problem of , where is the coefficient matrix computed here, is \nthe vector of coefficients to be determined, and is the \nvector of measured dependent variables. See Also Wikipedia Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: order The order of the equation to fit.  This value must be\nat least one (linear equation), but can be higher as desired. logical, intent(in) :: intercept Set to true if the intercept is being computed\nas part of the regression; else, false. real(kind=real64), intent(in) :: x (:) An N-element array containing the independent variable\nmeasurement points. real(kind=real64), intent(out) :: c (:,:) An N-by-K matrix where the results will be written.  K\nmust equal order + 1 in the event intercept is true; \nhowever, if intercept is false, K must equal order. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if c is not properly sized.\n- FS_INVALID_INPUT_ERROR: Occurs if order is less than 1.","tags":"","loc":"proc\\coefficient_matrix.html"},{"title":"covariance_matrix – FSTATS","text":"public  subroutine covariance_matrix(x, c, err) Computes the covariance matrix where and is computed\nby coefficient_matrix. See Also Wikipedia Wikipedia - Regression Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:,:) An M-by-N matrix containing the formatted independent data\n matrix as computed by coefficient_matrix. real(kind=real64), intent(out) :: c (:,:) The N-by-N covariance matrix. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if any of the matrices are not \n     sized correctly.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error.","tags":"","loc":"proc\\covariance_matrix.html"},{"title":"jacobian – FSTATS","text":"public  subroutine jacobian(fun, xdata, params, jac, stop, f0, f1, step, err) Computes the Jacobian matrix for a nonlinear regression problem. Arguments Type Intent Optional Attributes Name procedure( regression_function ), intent(in), pointer :: fun A pointer to the regression_function to evaluate. real(kind=real64), intent(in) :: xdata (:) The M-element array containing x-coordinate data. real(kind=real64), intent(in) :: params (:) The N-element array containing the model parameters. real(kind=real64), intent(out) :: jac (:,:) The M-by-N matrix where the Jacobian will be written. logical, intent(out) :: stop A value that the user can set in fun forcing the\nevaluation process to stop prior to completion. real(kind=real64), intent(in), optional, target :: f0 (:) An optional M-element array containing the model values\n using the current parameters as defined in m.  This input \ncan be used to prevent the routine from performing a \nfunction evaluation at the model parameter state defined in \nparams. real(kind=real64), intent(out), optional, target :: f1 (:) An optional M-element workspace array used for function\nevaluations. real(kind=real64), intent(in), optional :: step The differentiation step size.  The default is the square \nroot of machine precision. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not \n     properly sized.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error.","tags":"","loc":"proc\\jacobian.html"},{"title":"linear_least_squares – FSTATS","text":"public  subroutine linear_least_squares(order, intercept, x, y, coeffs, ymod, resid, stats, alpha, err) Computes a linear least-squares regression to fit a set of data. See Also Wikipedia SPC Excel Understanding Regression Statistics Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: order The order of the equation to fit.  This value must be at \nleast one (linear equation), but can be higher as desired, \nas long as there is sufficient data. logical, intent(in) :: intercept Set to true if the intercept is being computed as part of \nthe regression; else, false. real(kind=real64), intent(in) :: x (:) An N-element array containing the independent variable\nmeasurement points. real(kind=real64), intent(in) :: y (:) An N-element array containing the dependent variable\nmeasurement points. real(kind=real64), intent(out) :: coeffs (:) An ORDER+1 element array where the coefficients will be written. real(kind=real64), intent(out) :: ymod (:) An N-element array where the modeled data will be written. real(kind=real64), intent(out) :: resid (:) An N-element array where the residual error data will be \nwritten (modeled - actual). type( regression_statistics ), intent(out), optional :: stats (:) An M-element array of regression_statistics items where \nM = ORDER + 1 when intercept is set to true; however, if \nintercept is set to false, M = ORDER. real(kind=real64), intent(in), optional :: alpha The significance level at which to evaluate the confidence \nintervals.  The default value is 0.05 such that a 95% \nconfidence interval is calculated. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not \n     approriately sized.\n- FS_INVALID_INPUT_ERROR: Occurs if order is less than 1.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error.","tags":"","loc":"proc\\linear_least_squares.html"},{"title":"nonlinear_least_squares – FSTATS","text":"public  subroutine nonlinear_least_squares(fun, x, y, params, ymod, resid, weights, maxp, minp, stats, alpha, controls, settings, info, status, err) Performs a nonlinear regression to fit a model using a version\nof the Levenberg-Marquardt algorithm. Arguments Type Intent Optional Attributes Name procedure( regression_function ), intent(in), pointer :: fun A pointer to the regression_function to evaluate. real(kind=real64), intent(in) :: x (:) The M-element array containing independent data. real(kind=real64), intent(in) :: y (:) The M-element array containing dependent data. real(kind=real64), intent(inout) :: params (:) On input, the N-element array containing the initial estimate\nof the model parameters.  On output, the computed model \nparameters. real(kind=real64), intent(out) :: ymod (:) An M-element array where the modeled dependent data will\nbe written. real(kind=real64), intent(out) :: resid (:) An M-element array where the model residuals will be\nwritten. real(kind=real64), intent(in), optional, target :: weights (:) An optional M-element array allowing the weighting of\nindividual points. real(kind=real64), intent(in), optional, target :: maxp (:) An optional N-element array that can be used as upper limits \non the parameter values.  If no upper limit is requested for\na particular parameter, utilize a very large value.  The \ninternal default is to utilize huge() as a value. real(kind=real64), intent(in), optional, target :: minp (:) An optional N-element array that can be used as lower limits \non the parameter values.  If no lower limit is requested for\na particalar parameter, utilize a very large magnitude, but \nnegative, value.  The internal default is to utilize -huge() \nas a value. type( regression_statistics ), intent(out), optional :: stats (:) An optional N-element array that, if supplied, will be used \nto return statistics about the fit for each parameter. real(kind=real64), intent(in), optional :: alpha The significance level at which to evaluate the confidence \nintervals.  The default value is 0.05 such that a 95% \nconfidence interval is calculated. type( iteration_controls ), intent(in), optional :: controls An optional input providing custom iteration controls. type( lm_solver_options ), intent(in), optional :: settings An optional input providing custom settings for the solver. type( convergence_info ), intent(out), optional, target :: info An optional output that can be used to gain information about\nthe iterative solution and the nature of the convergence. procedure( iteration_update ), intent(in), optional, pointer :: status An optional pointer to a routine that can be used to extract\niteration information. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not \n     properly sized.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error.\n- FS_UNDERDEFINED_PROBLEM_ERROR: Occurs if the problem posed \n     is underdetetermined (M < N).\n- FS_TOLERANCE_TOO_SMALL_ERROR: Occurs if any supplied \n     tolerances are too small to be practical.\n- FS_TOO_FEW_ITERATION_ERROR: Occurs if too few iterations \n     are allowed.","tags":"","loc":"proc\\nonlinear_least_squares.html"},{"title":"iteration_update – FSTATS","text":"interface public  subroutine iteration_update(iter, funvals, resid, params, step) Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: iter real(kind=real64), intent(in) :: funvals (:) real(kind=real64), intent(in) :: resid (:) real(kind=real64), intent(in) :: params (:) real(kind=real64), intent(in) :: step (:)","tags":"","loc":"interface\\iteration_update.html"},{"title":"regression_function – FSTATS","text":"interface public  subroutine regression_function(xdata, params, resid, stop) Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: xdata real(kind=real64), intent(in), dimension(:) :: params real(kind=real64), intent(out), dimension(:) :: resid logical, intent(out) :: stop","tags":"","loc":"interface\\regression_function.html"},{"title":"allan_variance – FSTATS","text":"public  function allan_variance(x, dt, err) result(rst) Computes the Allan variance of a data set. Remarks This implementation computes the fully overlapped Allan variance \nusing the method presented by Yadav et. al. Yadav, Shrikanth & Shastri, Saurav & Chakravarthi, Ghanashyam & Kumar, \nViraj & Rao, Divya & Agrawal, Vinod. (2018). A Fast, Parallel Algorithm \nfor Fully Overlapped Allan Variance and Total Variance for Analysis and \nModeling of Noise in Inertial Sensors. IEEE Sensors Letters. PP. 1-1. \n10.1109/LSENS.2018.2829799. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The N-element data set to analyze. real(kind=real64), intent(in), optional :: dt An optional input specifying the time increment between \nsamples in x.  If not specified, this value is set to 1. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error. Return Value real(kind=real64), allocatable, dimension(:,:) An M-by-2 array containing the results where M is N / 2 - 1\nif N is even; else, M is (N - 1) / 2 - 1 if N is odd.  The \nfirst column contains the averaging times associated with \nthe M results stored in the second column.","tags":"","loc":"proc\\allan_variance.html"},{"title":"difference – FSTATS","text":"public pure function difference(x) result(rst) Computes the difference between elements in an array. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The N-element array on which to operate. Return Value real(kind=real64), allocatable, dimension(:) The (N-1)-element array containing the differences between adjacent\nelements.","tags":"","loc":"proc\\difference.html"},{"title":"factorial – FSTATS","text":"public pure elemental function factorial(x) result(rst) Computes the factorial of X. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x The value whose factorial is to be computed. Return Value real(kind=real64) The result.","tags":"","loc":"proc\\factorial.html"},{"title":"f_test – FSTATS","text":"public  subroutine f_test(x1, x2, stat, p, dof1, dof2) Computes the F-test and returns the probability (two-tailed) that\nthe variances of two data sets are not significantly different. See Also Wikipedia Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x1 (:) An N-element array containing the first data set. real(kind=real64), intent(in) :: x2 (:) An M-element array containing the second data set. real(kind=real64), intent(out) :: stat The F-statistic. real(kind=real64), intent(out) :: p The probability value that the two samples are likely to\nhave come from the two underlying populations that \nhave the same variance. real(kind=real64), intent(out) :: dof1 A measure of the degrees of freedom. real(kind=real64), intent(out) :: dof2 A measure of the degrees of freedom.","tags":"","loc":"proc\\f_test.html"},{"title":"t_test_equal_variance – FSTATS","text":"public  subroutine t_test_equal_variance(x1, x2, stat, p, dof) Computes the 2-tailed Student's T-Test for two data sets of \nassumed equivalent variances. See Also Wikipedia Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x1 (:) An N-element array containing the first data set. real(kind=real64), intent(in) :: x2 (:) An M-element array containing the second data set. real(kind=real64), intent(out) :: stat The Student-'s T-Test statistic. real(kind=real64), intent(out) :: p The probability value that the two samples are likely to\nhave come from two underlying populations that \nhave the same mean. real(kind=real64), intent(out) :: dof The degrees of freedom.","tags":"","loc":"proc\\t_test_equal_variance.html"},{"title":"t_test_paired – FSTATS","text":"public  subroutine t_test_paired(x1, x2, stat, p, dof, err) Computes the 2-tailed Student's T-Test for two paired data sets. See Also Wikipedia Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x1 (:) An N-element array containing the first data set. real(kind=real64), intent(in) :: x2 (:) An N-element array containing the second data set. real(kind=real64), intent(out) :: stat The Student-'s T-Test statistic. real(kind=real64), intent(out) :: p The probability value that the two samples are likely to\nhave come from  two underlying populations that \nhave the same mean. real(kind=real64), intent(out) :: dof The degrees of freedom. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if x1 and x2 are not the same \n  length.","tags":"","loc":"proc\\t_test_paired.html"},{"title":"t_test_unequal_variance – FSTATS","text":"public  subroutine t_test_unequal_variance(x1, x2, stat, p, dof) Computes the 2-tailed Student's T-Test for two data sets of \nassumed non-equivalent variances. See Also Wikipedia Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x1 (:) An N-element array containing the first data set. real(kind=real64), intent(in) :: x2 (:) An M-element array containing the second data set. real(kind=real64), intent(out) :: stat The Student-'s T-Test statistic. real(kind=real64), intent(out) :: p The probability value that the two samples are likely to\nhave come from two underlying populations that \nhave the same mean. real(kind=real64), intent(out) :: dof The degrees of freedom.","tags":"","loc":"proc\\t_test_unequal_variance.html"},{"title":"confidence_interval – FSTATS","text":"public interface confidence_interval Computes the confidence interval for the specified distribution. See Also Wikipedia Module Procedures private pure function confidence_interval_scalar(dist, alpha, s, n) result(rst) Computes the confidence interval for the specified distribution. Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: dist The distribution object defining the probability distribution\nto establish the confidence level. real(kind=real64), intent(in) :: alpha The probability value of interest.  For instance, use a value of 0.05\nfor a confidence level of 95%. real(kind=real64), intent(in) :: s The sample standard deviation. integer(kind=int32), intent(in) :: n The number of samples in the data set. Return Value real(kind=real64) The result. private pure function confidence_interval_array(dist, alpha, x) result(rst) Computes the confidence interval for the specified distribution. Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: dist The distribution object defining the probability distribution\nto establish the confidence level. real(kind=real64), intent(in) :: alpha The probability value of interest.  For instance, use a value of 0.05\nfor a confidence level of 95%. real(kind=real64), intent(in) :: x (:) An N-element array containing the data to analyze. Return Value real(kind=real64) The result.","tags":"","loc":"interface\\confidence_interval.html"},{"title":"report_array_size_error – FSTATS","text":"public  subroutine report_array_size_error(err, fname, name, expect, actual) Reports an array size error. Arguments Type Intent Optional Attributes Name class(errors), intent(inout) :: err The error handling object. character(len=*), intent(in) :: fname The name of the routine in which the error occurred. character(len=*), intent(in) :: name The name of the array. integer(kind=int32), intent(in) :: expect The expected size of the array. integer(kind=int32), intent(in) :: actual The actual size of the array. Variables Type Visibility Attributes Name Initial character(len=MESSAGE_SIZE), public :: msg","tags":"","loc":"proc\\report_array_size_error.html"},{"title":"report_arrays_not_same_size_error – FSTATS","text":"public  subroutine report_arrays_not_same_size_error(err, fname, name1, name2, size1, size2) Reports an error relating to two arrays not being the same size\nwhen they should be the same size. Arguments Type Intent Optional Attributes Name class(errors), intent(inout) :: err The error handling object. character(len=*), intent(in) :: fname The name of the routine in which the error occurred. character(len=*), intent(in) :: name1 The name of the first array. character(len=*), intent(in) :: name2 The name of the second array. integer(kind=int32), intent(in) :: size1 The size of the first array. integer(kind=int32), intent(in) :: size2 The size of the second array. Variables Type Visibility Attributes Name Initial character(len=MESSAGE_SIZE), public :: msg","tags":"","loc":"proc\\report_arrays_not_same_size_error.html"},{"title":"report_iteration_count_error – FSTATS","text":"public  subroutine report_iteration_count_error(err, fname, msg, mincount) Reports an iteration count error. Arguments Type Intent Optional Attributes Name class(errors), intent(inout) :: err The error handling object. character(len=*) :: fname The name of the routine in which the error occurred. character(len=*) :: msg The error message. integer(kind=int32), intent(in) :: mincount The minimum iteration count expected. Variables Type Visibility Attributes Name Initial character(len=MESSAGE_SIZE), public :: emsg","tags":"","loc":"proc\\report_iteration_count_error.html"},{"title":"report_matrix_size_error – FSTATS","text":"public  subroutine report_matrix_size_error(err, fname, name, expect_rows, expect_cols, actual_rows, actual_cols) Reports a matrix size error. Arguments Type Intent Optional Attributes Name class(errors), intent(inout) :: err The error handling object. character(len=*), intent(in) :: fname The name of the routine in which the error occurred. character(len=*), intent(in) :: name The name of the matrix. integer(kind=int32), intent(in) :: expect_rows The expected number of rows. integer(kind=int32), intent(in) :: expect_cols The expected number of columns. integer(kind=int32), intent(in) :: actual_rows The actual number of rows. integer(kind=int32), intent(in) :: actual_cols The actual number of columns. Variables Type Visibility Attributes Name Initial character(len=MESSAGE_SIZE), public :: msg","tags":"","loc":"proc\\report_matrix_size_error.html"},{"title":"report_memory_error – FSTATS","text":"public  subroutine report_memory_error(err, fname, code) Reports a memory allocation related error. Arguments Type Intent Optional Attributes Name class(errors), intent(inout) :: err The error handling object. character(len=*), intent(in) :: fname The name of the routine in which the error occurred. integer(kind=int32), intent(in) :: code The error code returned by the allocation routine. Variables Type Visibility Attributes Name Initial character(len=MESSAGE_SIZE), public :: msg","tags":"","loc":"proc\\report_memory_error.html"},{"title":"report_underdefined_error – FSTATS","text":"public  subroutine report_underdefined_error(err, fname, expect, actual) Reports an underdefined problem error. Arguments Type Intent Optional Attributes Name class(errors), intent(inout) :: err The error handling object. character(len=*), intent(in) :: fname The name of the routine in which the error occurred. integer(kind=int32), intent(in) :: expect The expected minimum number of equations. integer(kind=int32), intent(in) :: actual The actual number of equations. Variables Type Visibility Attributes Name Initial character(len=MESSAGE_SIZE), public :: msg","tags":"","loc":"proc\\report_underdefined_error.html"},{"title":"lowess – FSTATS","text":"public  subroutine lowess(x, y, ys, fsmooth, nstps, del, rweights, resid, err) Computes the smoothing of a data set using a robust locally weighted\nscatterplot smoothing (LOWESS) algorithm.  Fitted values are computed at\neach of the supplied x values. Remarks The code is a reimplementation of the LOWESS library.  For a detailed\nunderstanding, see [this]\n(http://www.aliquote.org/cours/2012_biomed/biblio/Cleveland1979.pdf) \npaper by William Cleveland. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x An N-element array containing the independent variable data.  This\narray must be monotonically increasing. real(kind=real64), intent(in), dimension(:) :: y An N-element array containing the dependent variable data. real(kind=real64), intent(out), dimension(:) :: ys An N-element array where the smoothed results will be written. real(kind=real64), intent(in), optional :: fsmooth An optional input that specifies the amount of smoothing. Specifically, this value is the fraction of points used to compute\neach value.  As this value increases, the output becomes smoother.\nChoosing a value in the range of 0.2 to 0.8 typically results in a\ngood fit.  The default value is 0.2. integer(kind=int32), intent(in), optional :: nstps An optional input that specifies the numb of iterations.  If set to\nzero, a non-robust fit is returned.  The default value is set to 2. real(kind=real64), intent(in), optional :: del real(kind=real64), intent(out), optional, dimension(:), target :: rweights An optional N-element array, that if supplied, will be used to\nreturn the weights given to each data point. real(kind=real64), intent(out), optional, dimension(:), target :: resid An optional N-element array, that if supplied, will be used to \nreturn the residual. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not \n     approriately sized.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation error.","tags":"","loc":"proc\\lowess.html"},{"title":"full_factorial – FSTATS","text":"public  subroutine full_factorial(vars, tbl, err) Computes a table with values scaled from 1 to N describing a \nfull-factorial design. program example use iso_fortran_env use fstats implicit none ! Local Variables integer ( int32 ) :: i , vars ( 3 ), tbl ( 24 , 3 ) ! Define the number of design points for each of the 3 factors to study vars = [ 2 , 4 , 3 ] ! Determine the design table call full_factorial ( vars , tbl ) ! Display the table do i = 1 , size ( tbl , 1 ) print * , tbl ( i ,:) end do end program The above program produces the following output. 1           1           1\n1           1           2\n1           1           3\n1           2           1\n1           2           2\n1           2           3\n1           3           1\n1           3           2\n1           3           3\n1           4           1\n1           4           2\n1           4           3\n2           1           1\n2           1           2\n2           1           3\n2           2           1\n2           2           2\n2           2           3\n2           3           1\n2           3           2\n2           3           3\n2           4           1\n2           4           2\n2           4           3 Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: vars (:) An M-element array containing the M factors to study. Each of the M entries to the array is expected to contain \nthe number of options for that particular factor to explore. \nThis value must be greater than or equal to 1. integer(kind=int32), intent(out) :: tbl (:,:) A table where the design will be written.  Use \nget_full_factorial_matrix_size to determine the appropriate \ntable size. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_INVALID_INPUT_ERROR: Occurs if any items in vars are \n     less than 1.\n- FS_ARRAY_SIZE_ERROR: Occurs if tbl is not properly sized.","tags":"","loc":"proc\\full_factorial.html"},{"title":"get_full_factorial_matrix_size – FSTATS","text":"public  subroutine get_full_factorial_matrix_size(vars, m, n, err) Computes the appropriate size for a full-factorial design table. Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: vars (:) An M-element array containing the M factors to study.  Each \nof the M entries to the array is expected to contain the \nnumber of options for that particular factor to explore. This value must be greater than or equal to 1. integer(kind=int32), intent(out) :: m The number of rows for the table. integer(kind=int32), intent(out) :: n The number of columns for the table. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_INVALID_INPUT_ERROR: Occurs if any items in vars are \n     less than 1.","tags":"","loc":"proc\\get_full_factorial_matrix_size.html"},{"title":"anova – FSTATS","text":"public interface anova Performs an analysis of variance (ANOVA) on the supplied data \nset. The following example illustrates a single-factor ANOVA on a \ndata set. program example use iso_fortran_env use fstats implicit none ! Local Variables character , parameter :: tab = achar ( 9 ) real ( real64 ) :: x ( 10 , 2 ) type ( single_factor_anova_table ) :: tbl ! Define the data x = reshape ( & [ & 3.086d3 , 3.082d3 , 3.069d3 , 3.072d3 , 3.045d3 , 3.070d3 , 3.079d3 , & 3.050d3 , 3.062d3 , 3.062d3 , 3.075d3 , 3.061d3 , 3.063d3 , 3.038d3 , & 3.070d3 , 3.062d3 , 3.070d3 , 3.049d3 , 3.042d3 , 3.063d3 & ], & [ 10 , 2 ] & ) ! Perform the ANOVA tbl = anova ( x ) ! Print out the table print '(A)' , \"Description\" // tab // \"DOF\" // tab // \"Sum of Sq.\" // & tab // \"Variance\" // tab // \"F-Stat\" // tab // \"P-Value\" print '(AF2.0AF5.1AF5.1AF5.3AF5.3)' , \"Main Factor: \" // tab , & tbl % main_factor % dof , tab , & tbl % main_factor % sum_of_squares , tab // tab , & tbl % main_factor % variance , tab // tab , & tbl % main_factor % f_statistic , tab , & tbl % main_factor % probability print '(AF3.0AF6.1AF5.1)' , \"Within: \" // tab , & tbl % within_factor % dof , tab , & tbl % within_factor % sum_of_squares , tab // tab , & tbl % within_factor % variance print '(AF3.0AF6.1AF5.1)' , \"Total: \" // tab // tab , & tbl % total_dof , tab , & tbl % total_sum_of_squares , tab // tab , & tbl % total_variance print '(AF6.1)' , \"Overall Mean: \" , tbl % overall_mean end program The above program produces the following output. Description     DOF     Sum of Sq.      Variance        F-Stat  P-Value\nMain Factor:    1.      352.8           352.8           2.147   0.160\nWithin:         18.     2958.2          164.3\nTotal:          19.     3311.0          174.3\nOverall Mean: 3063.5 See Also Wikipedia SPC Excel Single Factor ANOVA SPC Excel Gage R&R SPC Excel Understanding Regression Statistics NIST - Two Way ANOVA Module Procedures private  function anova_1_factor(x) result(rst) Performs an analysis of variance (ANOVA) on the supplied data set. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:,:) An M-by-N matrix containing the M replications of the N test \npoints of interest. Return Value type( single_factor_anova_table ) A single_factor_anova_table instance containing the ANOVA results. private  function anova_2_factor(x) result(rst) Performs an analysis of variance (ANOVA) on the supplied data set. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:,:,:) An M-by-N-by-K array containing the M replications of the\nN first factor results, and the K second factor results. Return Value type( two_factor_anova_table ) A two_factor_anova_table instance containing the ANOVA results. private  function anova_model_fit(nmodelparams, ymeas, ymod, err) result(rst) Performs an analysis of variance (ANOVA) on the supplied data set. Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: nmodelparams The number of model parameters. real(kind=real64), intent(in) :: ymeas (:) An N-element array containing the measured dependent variable data. real(kind=real64), intent(in) :: ymod (:) An N-element array containing the modeled dependent variable data. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if ymeas and ymod are not the \n  same length.\n- FS_MEMORY_ERROR: Occurs if a memory error is encountered. Return Value type( single_factor_anova_table ) A single_factor_anova_table instance containing the ANOVA results.","tags":"","loc":"interface\\anova.html"},{"title":"fstats_bootstrap – FSTATS","text":"Uses omp_lib linalg fstats_errors fstats_distributions fstats_regression fstats_descriptive_statistics iso_fortran_env fstats_special_functions Interfaces interface public  subroutine bootstrap_resampling_routine(x, xn) Defines the signature of a subroutine used to compute a \nresampling of data for bootstrapping purposes. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The N-element array to resample. real(kind=real64), intent(out), dimension(size(x)) :: xn An N-element array where the resampled data set will be \nwritten. interface public  function bootstrap_statistic_routine(x) result(rst) Defines the signature of a function for computing the desired\nbootstrap statistic. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The array of data to analyze. Return Value real(kind=real64) The resulting statistic. Derived Types type, public :: bootstrap_regression_statistics A container for regression-related statistical information as \ncomputed in a bootstrap, or equivalent, calculation. Components Type Visibility Attributes Name Initial real(kind=real64), public :: lower_confidence_interval The lower limit of the confidence interval for the parameter. real(kind=real64), public :: probability The probability that the coefficient is not statistically \nimportant.  A statistically important coefficient will have a \nlow probability (p-value), typically 0.05 or lower; however, a \np-value of up to ~0.2 may be acceptable dependent upon the \nproblem.  Typically any p-value larger than ~0.2 indicates the \nparameter is not statistically important for the model. Read more… real(kind=real64), public :: standard_error The standard error for the model coefficient. real(kind=real64), public :: t_statistic The T-statistic for the model coefficient. Read more… real(kind=real64), public :: upper_confidence_interval The upper limit of the confidence interval for the parameter. type, public :: bootstrap_statistics A collection of statistics resulting from the bootstrap process. Components Type Visibility Attributes Name Initial real(kind=real64), public :: bias The bias in the statistic. real(kind=real64), public :: lower_confidence_interval The lower confidence limit on the statistic. real(kind=real64), public, allocatable, dimension(:) :: population An array of the population values generated by the bootstrap\nprocess. real(kind=real64), public :: standard_error The standard error of the statistic. real(kind=real64), public :: statistic_value The value of the statistic of interest. real(kind=real64), public :: upper_confidence_interval The upper confidence limit on the statistic. Functions public  function bootstrap (stat, x, method, nsamples, alpha) result(rst) Performs a bootstrap calculation on the supplied data set for the given\nstatistic.  The default implementation utlizes a random resampling with \nreplacement.  Other resampling methods may be defined by specifying an \nappropriate routine by means of the method input. Arguments Type Intent Optional Attributes Name procedure( bootstrap_statistic_routine ), intent(in), pointer :: stat The routine used to compute the desired statistic. real(kind=real64), intent(in), dimension(:) :: x The N-element data set. procedure( bootstrap_resampling_routine ), intent(in), optional, pointer :: method An optional pointer to the method to use for resampling of the data.\nIf no method is supplied, a random resampling is utilized. integer(kind=int32), intent(in), optional :: nsamples An optional input, that if supplied, specifies the number of \nresampling runs to perform.  The default is 10 000. real(kind=real64), intent(in), optional :: alpha An optional input, that if supplied, defines the significance level\nto use for the analysis.  The default is 0.05. Return Value type( bootstrap_statistics ) The resulting bootstrap_statistics type containing the confidence\nintervals, bias, standard error, etc. for the analyzed statistic. Subroutines public  subroutine bootstrap_linear_least_squares (order, intercept, x, y, coeffs, ymod, resid, nsamples, stats, bias, alpha, method, bscoeffs, err) Computes a linear least-squares regression to fit a set of data.\nBootstrapping is utilized to gain insight into the quality of \nthe fit.  Resampling for the bootstrap process is a random resampling \nwith replacement process with the range of values limited by the \nstandard deviation of the original data set. Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: order The order of the equation to fit.  This value must be at \nleast one (linear equation), but can be higher as desired, \nas long as there is sufficient data. logical, intent(in) :: intercept Set to true if the intercept is being computed as part of \nthe regression; else, false. real(kind=real64), intent(in), dimension(:) :: x An N-element array containing the independent variable\nmeasurement points. real(kind=real64), intent(in), dimension(:) :: y An N-element array containing the dependent variable\nmeasurement points. real(kind=real64), intent(out), dimension(:) :: coeffs An ORDER+1 element array where the coefficients will\nbe written. real(kind=real64), intent(out), dimension(:) :: ymod An N-element array where the modeled data will be written. real(kind=real64), intent(out), dimension(:) :: resid An N-element array where the residual error data will be \nwritten (modeled - actual). integer(kind=int32), intent(in), optional :: nsamples The number of bootstrapping samples to utilize. type( bootstrap_regression_statistics ), intent(out), optional, dimension(:) :: stats An M-element array of bootstrap_regression_statistics items \nwhere M = ORDER + 1 when intercept is set to true; however, \nif intercept is set to false, M = ORDER. real(kind=real64), intent(out), optional, dimension(:) :: bias An ORDER+1 element array where an estimate of the bias of\neach coefficient is returned based upon the results of the\nbootstrapping analysis.  The bias is computed as the difference \nbetween the mean of the boostrap population results for the given \nparameter and the original estimate of the given parameter. real(kind=real64), intent(in), optional :: alpha The significance level at which to evaluate the confidence \nintervals.  The default value is 0.05 such that a 95% \nconfidence interval is calculated. procedure( bootstrap_resampling_routine ), intent(in), optional, pointer :: method An optional pointer to the method to use for resampling of the data.\nIf no method is supplied, a random resampling is utilized. real(kind=real64), intent(out), optional, allocatable, target, dimension(:,:) :: bscoeffs An optional, allocatable matrix, containing the bootstrap \ndistributions for each parameter stored in each row of the matrix\nsuch that the resulting matrix is NCOEFFS -by- NSAMPLES. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not \n     approriately sized.\n- FS_INVALID_INPUT_ERROR: Occurs if order is less than 1.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error. public  subroutine bootstrap_nonlinear_least_squares (fun, x, y, params, ymod, resid, nsamples, weights, maxp, minp, stats, alpha, controls, settings, info, bias, method, bscoeffs, err) Performs a nonlinear regression to fit a model using a version\nof the Levenberg-Marquardt algorithm.  Bootstrapping is utilized to gain \ninsight into the quality of the fit.  Resampling for the bootstrap \nprocess is a random resampling with replacement process with the \nrange of values limited by the standard deviation of the original \ndata set. Arguments Type Intent Optional Attributes Name procedure( regression_function ), intent(in), pointer :: fun A pointer to the regression_function to evaluate. real(kind=real64), intent(in) :: x (:) The M-element array containing independent data. real(kind=real64), intent(in) :: y (:) The M-element array containing dependent data. real(kind=real64), intent(inout) :: params (:) On input, the N-element array containing the initial estimate\nof the model parameters.  On output, the computed model \nparameters. real(kind=real64), intent(out) :: ymod (:) An M-element array where the modeled dependent data will\nbe written. real(kind=real64), intent(out) :: resid (:) An M-element array where the model residuals will be\nwritten. integer(kind=int32), intent(in), optional :: nsamples The number of bootstrapping samples to utilize. real(kind=real64), intent(in), optional, target :: weights (:) An optional M-element array allowing the weighting of\nindividual points. real(kind=real64), intent(in), optional, target :: maxp (:) An optional N-element array that can be used as upper limits \non the parameter values.  If no upper limit is requested for\na particular parameter, utilize a very large value.  The \ninternal default is to utilize huge() as a value. real(kind=real64), intent(in), optional, target :: minp (:) An optional N-element array that can be used as lower limits \non the parameter values.  If no lower limit is requested for\na particalar parameter, utilize a very large magnitude, but \nnegative, value.  The internal default is to utilize -huge() \nas a value. type( bootstrap_regression_statistics ), intent(out), optional :: stats (:) An optional N-element array that, if supplied, will be used \nto return statistics about the fit for each parameter. real(kind=real64), intent(in), optional :: alpha The significance level at which to evaluate the confidence \nintervals.  The default value is 0.05 such that a 95% \nconfidence interval is calculated. type( iteration_controls ), intent(in), optional :: controls An optional input providing custom iteration controls. type( lm_solver_options ), intent(in), optional :: settings An optional input providing custom settings for the solver. type( convergence_info ), intent(out), optional, target :: info An optional output that can be used to gain information about\nthe iterative solution and the nature of the convergence. real(kind=real64), intent(out), optional, dimension(:) :: bias An optional N-element array that, if supplied, will be used to \nprovide an estimate of the bias of each model parameter based upon\nthe results of the bootstrapping analysis.  The bias is computed as \nthe difference between the mean of the boostrap population results \nfor the given parameter and the original estimate of the given \nparameter. procedure( bootstrap_resampling_routine ), intent(in), optional, pointer :: method An optional pointer to the method to use for resampling of the data.\nIf no method is supplied, a random resampling is utilized. real(kind=real64), intent(out), optional, allocatable, target, dimension(:,:) :: bscoeffs An optional, allocatable matrix, containing the bootstrap \ndistributions for each parameter stored in each row of the matrix\nsuch that the resulting matrix is NCOEFFS -by- NSAMPLES. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not \n     properly sized.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error.\n- FS_UNDERDEFINED_PROBLEM_ERROR: Occurs if the problem posed \n     is underdetetermined (M < N).\n- FS_TOLERANCE_TOO_SMALL_ERROR: Occurs if any supplied \n     tolerances are too small to be practical.\n- FS_TOO_FEW_ITERATION_ERROR: Occurs if too few iterations \n     are allowed. public  subroutine random_resample (x, xn) Random resampling, with replacement, based upon a normal distribution. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The N-element array to resample. real(kind=real64), intent(out), dimension(size(x)) :: xn An N-element array where the resampled data set will be written. public  subroutine scaled_random_resample (x, xn) A random resampling, scaled by the standard deviation of the original\ndata, but based upon a normal distribution. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The N-element array to resample. real(kind=real64), intent(out), dimension(size(x)) :: xn An N-element array where the resampled data set will be written.","tags":"","loc":"module\\fstats_bootstrap.html"},{"title":"fstats_descriptive_statistics – FSTATS","text":"Uses linalg fstats_errors ferror iso_fortran_env Functions public pure function covariance (x, y) result(rst) Computes the sample covariance of two data sets. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The first N-element data set. real(kind=real64), intent(in), dimension(size(x)) :: y The second N-element data set. Return Value real(kind=real64) The covariance. public pure function mean (x) result(rst) Computes the mean of the values in an array. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:) The array of values to analyze. Return Value real(kind=real64) The result. public  function median (x) result(rst) Computes the median of the values in an array. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(inout) :: x (:) The array of values to analyze.  On output, this array is sorted into\nascending order. Return Value real(kind=real64) The result. public pure function quantile (x, q) result(rst) Computes the specified quantile of a data set using the SAS \nMethod 4. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:) An N-element array containing the data. real(kind=real64), intent(in) :: q The quantile to compute (e.g. 0.25 computes the 25% quantile). Return Value real(kind=real64) The result. public pure function standard_deviation (x) result(rst) Computes the sample standard deviation of the values in an array. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:) The array of values to analyze. Return Value real(kind=real64) The result. public  function trimmed_mean (x, p) result(rst) Computes the trimmed mean of a data set. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(inout), dimension(:) :: x An N-element array containing the data.  On output, the\narray is sorted into ascending order. real(kind=real64), intent(in), optional :: p An optional parameter specifying the percentage of values\nfrom either end of the distribution to remove.  The default\nis 0.05 such that the bottom 5% and top 5% are removed. Return Value real(kind=real64) The trimmed mean. public pure function variance (x) result(rst) Computes the sample variance of the values in an array. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:) The array of values to analyze. Return Value real(kind=real64)","tags":"","loc":"module\\fstats_descriptive_statistics.html"},{"title":"fstats_distributions – FSTATS","text":"Uses fstats_special_functions fstats_helper_routines ieee_arithmetic iso_fortran_env Interfaces interface public pure elemental function distribution_function(this, x) result(rst) Defines the interface for a probability distribution function. Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: this The distribution object. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The value of the function. interface public pure function distribution_property(this) result(rst) Computes the value of a distribution property. Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: this The distribution object. Return Value real(kind=real64) The property value. Derived Types type, public, extends( distribution ) :: binomial_distribution Defines a binomial distribution.  The binomial distribution describes\nthe probability p of getting k successes in n independent trials. Components Type Visibility Attributes Name Initial integer(kind=int32), public :: n The number of independent trials. real(kind=real64), public :: p The success probability for each trial.  This parameter must\nexist on the set [0, 1]. Type-Bound Procedures procedure, public :: cdf => bd_cdf procedure, public :: mean => bd_mean procedure, public :: median => bd_median procedure, public :: mode => bd_mode procedure, public :: pdf => bd_pdf procedure, public :: variance => bd_variance type, public, extends( distribution ) :: chi_squared_distribution Defines a Chi-squared distribution. Components Type Visibility Attributes Name Initial integer(kind=int32), public :: dof The number of degrees of freedom. Type-Bound Procedures procedure, public :: cdf => cs_cdf procedure, public :: mean => cs_mean procedure, public :: median => cs_median procedure, public :: mode => cs_mode procedure, public :: pdf => cs_pdf procedure, public :: variance => cs_variance type, public :: distribution Defines a probability distribution. Type-Bound Procedures procedure( distribution_function ), public, deferred, pass :: cdf ..\\..\\ Computes the cumulative distribution function.<\\p> procedure( distribution_property ), public, deferred, pass :: mean ..\\..\\ Computes the mean of the distribution.<\\p> procedure( distribution_property ), public, deferred, pass :: median ..\\..\\ Computes the median of the distribution.<\\p> procedure( distribution_property ), public, deferred, pass :: mode ..\\..\\ Computes the mode of the distribution.<\\p> procedure( distribution_function ), public, deferred, pass :: pdf ..\\..\\ Computes the probability density function.<\\p> procedure( distribution_property ), public, deferred, pass :: variance ..\\..\\ Computes the variance of the distribution.<\\p> type, public, extends( distribution ) :: f_distribution Defines an F-distribution. Components Type Visibility Attributes Name Initial real(kind=real64), public :: d1 The measure of degrees of freedom for the first data set. real(kind=real64), public :: d2 The measure of degrees of freedom for the second data set. Type-Bound Procedures procedure, public :: cdf => fd_cdf procedure, public :: mean => fd_mean procedure, public :: median => fd_median procedure, public :: mode => fd_mode procedure, public :: pdf => fd_pdf procedure, public :: variance => fd_variance type, public, extends( distribution ) :: normal_distribution Defines a normal distribution. Components Type Visibility Attributes Name Initial real(kind=real64), public :: mean_value The mean value of the distribution. real(kind=real64), public :: standard_deviation The standard deviation of the distribution. Type-Bound Procedures procedure, public :: cdf => nd_cdf procedure, public :: mean => nd_mean procedure, public :: median => nd_median procedure, public :: mode => nd_mode procedure, public :: pdf => nd_pdf procedure, public :: standardize => nd_standardize procedure, public :: variance => nd_variance type, public, extends( distribution ) :: t_distribution Defines Student's T-Distribution. Components Type Visibility Attributes Name Initial real(kind=real64), public :: dof The number of degrees of freedom. Type-Bound Procedures procedure, public :: cdf => td_cdf procedure, public :: mean => td_mean procedure, public :: median => td_median procedure, public :: mode => td_mode procedure, public :: pdf => td_pdf procedure, public :: variance => td_variance","tags":"","loc":"module\\fstats_distributions.html"},{"title":"fstats_sampling – FSTATS","text":"Uses linalg fstats_distributions iso_fortran_env Interfaces public        interface box_muller_sample Generates random, normally distributed values via the Box-Muller \ntransform. private  function box_muller_sample_scalar(mu, sigma) result(rst) Generates a pair of independent, standard, normally distributed\nrandom values using the Box-Muller transform. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: mu The mean of the distribution. real(kind=real64), intent(in) :: sigma The standard deviation of the distribution. Return Value real(kind=real64), (2) The pair of random values. private  function box_muller_array(mu, sigma, n) result(rst) Generates an array of normally distributed random values sampled\nby the Box-Muller transform. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: mu The mean of the distribution. real(kind=real64), intent(in) :: sigma The standard deviation of the distribution. integer(kind=int32), intent(in) :: n The number of Box-Muller pairs to generate. Return Value real(kind=real64), allocatable, dimension(:) A 2N-element array containing the N Box-Muller pairs. Functions public  function rejection_sample (tdist, n, xmin, xmax) result(rst) Uses rejection sampling to randomly sample a target distribution. Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: tdist The distribution to sample integer(kind=int32), intent(in) :: n The number of samples to make. real(kind=real64), intent(in) :: xmin The minimum range to explore. real(kind=real64), intent(in) :: xmax The maximum range to explore. Return Value real(kind=real64), allocatable, dimension(:) An N-element array containing the N samples from the \ndistribution.","tags":"","loc":"module\\fstats_sampling.html"},{"title":"fstats_special_functions – FSTATS","text":"Uses ieee_arithmetic iso_fortran_env Functions public pure elemental function beta (a, b) result(rst) Computes the beta function. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: a The first argument of the function. real(kind=real64), intent(in) :: b The second argument of the function. Return Value real(kind=real64) The value of the beta function at and . public pure elemental function digamma (x) result(rst) Computes the digamma function. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The function value. public pure elemental function incomplete_beta (a, b, x) result(rst) Computes the incomplete beta function. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: a The first argument of the function. real(kind=real64), intent(in) :: b The second argument of the function. real(kind=real64), intent(in) :: x The upper limit of the integration. Return Value real(kind=real64) The value of the incomplete beta function. public pure elemental function incomplete_gamma_lower (a, x) result(rst) Computes the lower incomplete gamma function. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: a The coefficient value. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The function value. public pure elemental function incomplete_gamma_upper (a, x) result(rst) Computes the upper incomplete gamma function. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: a The coefficient value. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The function value. public pure elemental function regularized_beta (a, b, x) result(rst) Computes the regularized beta function. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: a The first argument of the function. real(kind=real64), intent(in) :: b The second argument of the function. real(kind=real64), intent(in) :: x The upper limit of the integration. Return Value real(kind=real64) The value of the regularized beta function.","tags":"","loc":"module\\fstats_special_functions.html"},{"title":"fstats_regression – FSTATS","text":"Uses linalg fstats_errors fstats_distributions blas fstats_descriptive_statistics iso_fortran_env fstats_special_functions fstats_hypothesis ferror Variables Type Visibility Attributes Name Initial integer(kind=int32), public, parameter :: FS_LEVENBERG_MARQUARDT_UPDATE = 1 integer(kind=int32), public, parameter :: FS_NIELSEN_UPDATE = 3 integer(kind=int32), public, parameter :: FS_QUADRATIC_UPDATE = 2 Interfaces interface public  subroutine iteration_update(iter, funvals, resid, params, step) Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: iter real(kind=real64), intent(in) :: funvals (:) real(kind=real64), intent(in) :: resid (:) real(kind=real64), intent(in) :: params (:) real(kind=real64), intent(in) :: step (:) interface public  subroutine regression_function(xdata, params, resid, stop) Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: xdata real(kind=real64), intent(in), dimension(:) :: params real(kind=real64), intent(out), dimension(:) :: resid logical, intent(out) :: stop Derived Types type, public :: convergence_info Provides information regarding convergence status. Components Type Visibility Attributes Name Initial logical, public :: converge_on_gradient True if convergence on the gradient was achieved; else, false. logical, public :: converge_on_residual_parameter True if convergence on the residual error parameter was achieved; \nelse, false. logical, public :: converge_on_solution_change True if convergence on the change in solution was achieved; else,\nfalse. integer(kind=int32), public :: function_evaluation_count The function evaluation count. real(kind=real64), public :: gradient_value The value of the gradient test parameter. integer(kind=int32), public :: iteration_count The iteration count. logical, public :: reach_function_evaluation_limit True if the solution did not converge in the allowed number of\nfunction evaluations. logical, public :: reach_iteration_limit True if the solution did not converge in the allowed number of \niterations. real(kind=real64), public :: residual_value The value of the residual error parameter. real(kind=real64), public :: solution_change_value The value of the change in solution parameter. logical, public :: user_requested_stop True if the user requested the stop; else, false. type, public :: iteration_controls Provides a collection of iteration control parameters. Components Type Visibility Attributes Name Initial real(kind=real64), public :: change_in_solution_tolerance Defines a tolerance on the change in parameter values. real(kind=real64), public :: gradient_tolerance Defines a tolerance on the gradient of the fitted function. real(kind=real64), public :: iteration_improvement_tolerance Defines a tolerance to ensure adequate improvement on each \niteration. integer(kind=int32), public :: max_function_evaluations Defines the maximum number of function evaluations allowed. integer(kind=int32), public :: max_iteration_between_updates Defines how many iterations can pass before a re-evaluation of \nthe Jacobian matrix is forced. integer(kind=int32), public :: max_iteration_count Defines the maximum number of iterations allowed. real(kind=real64), public :: residual_tolerance Defines a tolerance on the metric associated with the residual \nerror. Type-Bound Procedures procedure, public :: set_to_default => lm_set_default_tolerances type, public :: lm_solver_options Options to control the Levenberg-Marquardt solver. Components Type Visibility Attributes Name Initial real(kind=real64), public :: damping_decrease_factor The factor to use when decreasing the damping parameter. real(kind=real64), public :: damping_increase_factor The factor to use when increasing the damping parameter. real(kind=real64), public :: finite_difference_step_size The step size used for the finite difference calculations of the\nJacobian matrix. integer(kind=int32), public :: method The solver method to utilize.\n- FS_LEVENBERG_MARQUARDT_UPDATE:\n- FS_QUADRATIC_UPDATE:\n- FS_NIELSEN_UDPATE: Type-Bound Procedures procedure, public :: set_to_default => lm_set_default_settings type, public :: regression_statistics A container for regression-related statistical information. Components Type Visibility Attributes Name Initial real(kind=real64), public :: confidence_interval The confidence interval for the parameter at the level \ndetermined by the regression process. Read more… real(kind=real64), public :: probability The probability that the coefficient is not statistically \nimportant.  A statistically important coefficient will have a \nlow probability (p-value), typically 0.05 or lower; however, a \np-value of up to ~0.2 may be acceptable dependent upon the \nproblem.  Typically any p-value larger than ~0.2 indicates the \nparameter is not statistically important for the model. Read more… real(kind=real64), public :: standard_error The standard error for the model coefficient. Read more… real(kind=real64), public :: t_statistic The T-statistic for the model coefficient. Read more… Functions public  function adjusted_r_squared (p, x, xm, err) result(rst) Computes the adjusted R-squared value for a data set. Read more… Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: p The number of variables. real(kind=real64), intent(in) :: x (:) An N-element array containing the dependent variables from \nthe data set. real(kind=real64), intent(in) :: xm (:) An N-element array containing the corresponding modeled \nvalues. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings\nto the caller.  Possible warning and error codes are as \nfollows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if x and xm are not the \n  same size. Return Value real(kind=real64) The result. public  function calculate_regression_statistics (resid, params, c, alpha, err) result(rst) Computes statistics for the quality of fit for a regression \nmodel. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: resid (:) An M-element array containing the model residual errors. real(kind=real64), intent(in) :: params (:) An N-element array containing the model parameters. real(kind=real64), intent(in) :: c (:,:) The N-by-N covariance matrix. real(kind=real64), intent(in), optional :: alpha The significance level at which to evaluate the confidence \nintervals.  The default value is 0.05 such that a 95% \nconfidence interval is calculated. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if c is not sized correctly.\n- FS_INVALID_INPUT_ERROR: Occurs if order is less than 1.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error. Return Value type( regression_statistics ), allocatable, (:) A regression_statistics object containing the analysis results. public pure function correlation (x, y) result(rst) Computes the sample correlation coefficient (an estimate to the \npopulation Pearson correlation) as follows. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The first N-element data set. real(kind=real64), intent(in), dimension(size(x)) :: y The second N-element data set. Return Value real(kind=real64) The correlation coefficient. public  function r_squared (x, xm, err) result(rst) Computes the R-squared value for a data set. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:) An N-element array containing the dependent variables from \nthe data set. real(kind=real64), intent(in) :: xm (:) An N-element array containing the corresponding modeled \nvalues. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings\nto the caller.  Possible warning and error codes are as \nfollows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if x and xm are not the \n  same size. Return Value real(kind=real64) The result. Subroutines public  subroutine coefficient_matrix (order, intercept, x, c, err) Computes the coefficient matrix to the linear \nleast-squares regression problem of , where is the coefficient matrix computed here, is \nthe vector of coefficients to be determined, and is the \nvector of measured dependent variables. Read more… Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: order The order of the equation to fit.  This value must be\nat least one (linear equation), but can be higher as desired. logical, intent(in) :: intercept Set to true if the intercept is being computed\nas part of the regression; else, false. real(kind=real64), intent(in) :: x (:) An N-element array containing the independent variable\nmeasurement points. real(kind=real64), intent(out) :: c (:,:) An N-by-K matrix where the results will be written.  K\nmust equal order + 1 in the event intercept is true; \nhowever, if intercept is false, K must equal order. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if c is not properly sized.\n- FS_INVALID_INPUT_ERROR: Occurs if order is less than 1. public  subroutine covariance_matrix (x, c, err) Computes the covariance matrix where and is computed\nby coefficient_matrix. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:,:) An M-by-N matrix containing the formatted independent data\n matrix as computed by coefficient_matrix. real(kind=real64), intent(out) :: c (:,:) The N-by-N covariance matrix. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if any of the matrices are not \n     sized correctly.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error. public  subroutine jacobian (fun, xdata, params, jac, stop, f0, f1, step, err) Computes the Jacobian matrix for a nonlinear regression problem. Arguments Type Intent Optional Attributes Name procedure( regression_function ), intent(in), pointer :: fun A pointer to the regression_function to evaluate. real(kind=real64), intent(in) :: xdata (:) The M-element array containing x-coordinate data. real(kind=real64), intent(in) :: params (:) The N-element array containing the model parameters. real(kind=real64), intent(out) :: jac (:,:) The M-by-N matrix where the Jacobian will be written. logical, intent(out) :: stop A value that the user can set in fun forcing the\nevaluation process to stop prior to completion. real(kind=real64), intent(in), optional, target :: f0 (:) An optional M-element array containing the model values\n using the current parameters as defined in m.  This input \ncan be used to prevent the routine from performing a \nfunction evaluation at the model parameter state defined in \nparams. real(kind=real64), intent(out), optional, target :: f1 (:) An optional M-element workspace array used for function\nevaluations. real(kind=real64), intent(in), optional :: step The differentiation step size.  The default is the square \nroot of machine precision. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not \n     properly sized.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error. public  subroutine linear_least_squares (order, intercept, x, y, coeffs, ymod, resid, stats, alpha, err) Computes a linear least-squares regression to fit a set of data. Read more… Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: order The order of the equation to fit.  This value must be at \nleast one (linear equation), but can be higher as desired, \nas long as there is sufficient data. logical, intent(in) :: intercept Set to true if the intercept is being computed as part of \nthe regression; else, false. real(kind=real64), intent(in) :: x (:) An N-element array containing the independent variable\nmeasurement points. real(kind=real64), intent(in) :: y (:) An N-element array containing the dependent variable\nmeasurement points. real(kind=real64), intent(out) :: coeffs (:) An ORDER+1 element array where the coefficients will be written. real(kind=real64), intent(out) :: ymod (:) An N-element array where the modeled data will be written. real(kind=real64), intent(out) :: resid (:) An N-element array where the residual error data will be \nwritten (modeled - actual). type( regression_statistics ), intent(out), optional :: stats (:) An M-element array of regression_statistics items where \nM = ORDER + 1 when intercept is set to true; however, if \nintercept is set to false, M = ORDER. real(kind=real64), intent(in), optional :: alpha The significance level at which to evaluate the confidence \nintervals.  The default value is 0.05 such that a 95% \nconfidence interval is calculated. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not \n     approriately sized.\n- FS_INVALID_INPUT_ERROR: Occurs if order is less than 1.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error. public  subroutine nonlinear_least_squares (fun, x, y, params, ymod, resid, weights, maxp, minp, stats, alpha, controls, settings, info, status, err) Performs a nonlinear regression to fit a model using a version\nof the Levenberg-Marquardt algorithm. Arguments Type Intent Optional Attributes Name procedure( regression_function ), intent(in), pointer :: fun A pointer to the regression_function to evaluate. real(kind=real64), intent(in) :: x (:) The M-element array containing independent data. real(kind=real64), intent(in) :: y (:) The M-element array containing dependent data. real(kind=real64), intent(inout) :: params (:) On input, the N-element array containing the initial estimate\nof the model parameters.  On output, the computed model \nparameters. real(kind=real64), intent(out) :: ymod (:) An M-element array where the modeled dependent data will\nbe written. real(kind=real64), intent(out) :: resid (:) An M-element array where the model residuals will be\nwritten. real(kind=real64), intent(in), optional, target :: weights (:) An optional M-element array allowing the weighting of\nindividual points. real(kind=real64), intent(in), optional, target :: maxp (:) An optional N-element array that can be used as upper limits \non the parameter values.  If no upper limit is requested for\na particular parameter, utilize a very large value.  The \ninternal default is to utilize huge() as a value. real(kind=real64), intent(in), optional, target :: minp (:) An optional N-element array that can be used as lower limits \non the parameter values.  If no lower limit is requested for\na particalar parameter, utilize a very large magnitude, but \nnegative, value.  The internal default is to utilize -huge() \nas a value. type( regression_statistics ), intent(out), optional :: stats (:) An optional N-element array that, if supplied, will be used \nto return statistics about the fit for each parameter. real(kind=real64), intent(in), optional :: alpha The significance level at which to evaluate the confidence \nintervals.  The default value is 0.05 such that a 95% \nconfidence interval is calculated. type( iteration_controls ), intent(in), optional :: controls An optional input providing custom iteration controls. type( lm_solver_options ), intent(in), optional :: settings An optional input providing custom settings for the solver. type( convergence_info ), intent(out), optional, target :: info An optional output that can be used to gain information about\nthe iterative solution and the nature of the convergence. procedure( iteration_update ), intent(in), optional, pointer :: status An optional pointer to a routine that can be used to extract\niteration information. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not \n     properly sized.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error.\n- FS_UNDERDEFINED_PROBLEM_ERROR: Occurs if the problem posed \n     is underdetetermined (M < N).\n- FS_TOLERANCE_TOO_SMALL_ERROR: Occurs if any supplied \n     tolerances are too small to be practical.\n- FS_TOO_FEW_ITERATION_ERROR: Occurs if too few iterations \n     are allowed.","tags":"","loc":"module\\fstats_regression.html"},{"title":"fstats_allan – FSTATS","text":"Uses fstats_errors iso_fortran_env Functions public  function allan_variance (x, dt, err) result(rst) Computes the Allan variance of a data set. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The N-element data set to analyze. real(kind=real64), intent(in), optional :: dt An optional input specifying the time increment between \nsamples in x.  If not specified, this value is set to 1. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error. Return Value real(kind=real64), allocatable, dimension(:,:) An M-by-2 array containing the results where M is N / 2 - 1\nif N is even; else, M is (N - 1) / 2 - 1 if N is odd.  The \nfirst column contains the averaging times associated with \nthe M results stored in the second column.","tags":"","loc":"module\\fstats_allan.html"},{"title":"fstats_helper_routines – FSTATS","text":"Uses iso_fortran_env Functions public pure function difference (x) result(rst) Computes the difference between elements in an array. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The N-element array on which to operate. Return Value real(kind=real64), allocatable, dimension(:) The (N-1)-element array containing the differences between adjacent\nelements. public pure elemental function factorial (x) result(rst) Computes the factorial of X. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x The value whose factorial is to be computed. Return Value real(kind=real64) The result.","tags":"","loc":"module\\fstats_helper_routines.html"},{"title":"fstats_hypothesis – FSTATS","text":"Uses fstats_errors fstats_distributions fstats_descriptive_statistics iso_fortran_env fstats_special_functions ieee_arithmetic Interfaces public        interface confidence_interval Computes the confidence interval for the specified distribution. See Also Wikipedia private pure function confidence_interval_scalar(dist, alpha, s, n) result(rst) Computes the confidence interval for the specified distribution. Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: dist The distribution object defining the probability distribution\nto establish the confidence level. real(kind=real64), intent(in) :: alpha The probability value of interest.  For instance, use a value of 0.05\nfor a confidence level of 95%. real(kind=real64), intent(in) :: s The sample standard deviation. integer(kind=int32), intent(in) :: n The number of samples in the data set. Return Value real(kind=real64) The result. private pure function confidence_interval_array(dist, alpha, x) result(rst) Computes the confidence interval for the specified distribution. Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: dist The distribution object defining the probability distribution\nto establish the confidence level. real(kind=real64), intent(in) :: alpha The probability value of interest.  For instance, use a value of 0.05\nfor a confidence level of 95%. real(kind=real64), intent(in) :: x (:) An N-element array containing the data to analyze. Return Value real(kind=real64) The result. Subroutines public  subroutine f_test (x1, x2, stat, p, dof1, dof2) Computes the F-test and returns the probability (two-tailed) that\nthe variances of two data sets are not significantly different. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x1 (:) An N-element array containing the first data set. real(kind=real64), intent(in) :: x2 (:) An M-element array containing the second data set. real(kind=real64), intent(out) :: stat The F-statistic. real(kind=real64), intent(out) :: p The probability value that the two samples are likely to\nhave come from the two underlying populations that \nhave the same variance. real(kind=real64), intent(out) :: dof1 A measure of the degrees of freedom. real(kind=real64), intent(out) :: dof2 A measure of the degrees of freedom. public  subroutine t_test_equal_variance (x1, x2, stat, p, dof) Computes the 2-tailed Student's T-Test for two data sets of \nassumed equivalent variances. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x1 (:) An N-element array containing the first data set. real(kind=real64), intent(in) :: x2 (:) An M-element array containing the second data set. real(kind=real64), intent(out) :: stat The Student-'s T-Test statistic. real(kind=real64), intent(out) :: p The probability value that the two samples are likely to\nhave come from two underlying populations that \nhave the same mean. real(kind=real64), intent(out) :: dof The degrees of freedom. public  subroutine t_test_paired (x1, x2, stat, p, dof, err) Computes the 2-tailed Student's T-Test for two paired data sets. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x1 (:) An N-element array containing the first data set. real(kind=real64), intent(in) :: x2 (:) An N-element array containing the second data set. real(kind=real64), intent(out) :: stat The Student-'s T-Test statistic. real(kind=real64), intent(out) :: p The probability value that the two samples are likely to\nhave come from  two underlying populations that \nhave the same mean. real(kind=real64), intent(out) :: dof The degrees of freedom. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if x1 and x2 are not the same \n  length. public  subroutine t_test_unequal_variance (x1, x2, stat, p, dof) Computes the 2-tailed Student's T-Test for two data sets of \nassumed non-equivalent variances. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x1 (:) An N-element array containing the first data set. real(kind=real64), intent(in) :: x2 (:) An M-element array containing the second data set. real(kind=real64), intent(out) :: stat The Student-'s T-Test statistic. real(kind=real64), intent(out) :: p The probability value that the two samples are likely to\nhave come from two underlying populations that \nhave the same mean. real(kind=real64), intent(out) :: dof The degrees of freedom.","tags":"","loc":"module\\fstats_hypothesis.html"},{"title":"fstats_errors – FSTATS","text":"Uses ferror iso_fortran_env Variables Type Visibility Attributes Name Initial integer(kind=int32), public, parameter :: FS_ARRAY_SIZE_ERROR = 10000 integer(kind=int32), public, parameter :: FS_INVALID_INPUT_ERROR = 10002 integer(kind=int32), public, parameter :: FS_MATRIX_SIZE_ERROR = 10001 integer(kind=int32), public, parameter :: FS_MEMORY_ERROR = 10003 integer(kind=int32), public, parameter :: FS_NO_ERROR = 0 integer(kind=int32), public, parameter :: FS_TOLERANCE_TOO_SMALL_ERROR = 10005 integer(kind=int32), public, parameter :: FS_TOO_FEW_ITERATION_ERROR = 10006 integer(kind=int32), public, parameter :: FS_UNDERDEFINED_PROBLEM_ERROR = 10004 Subroutines public  subroutine report_array_size_error (err, fname, name, expect, actual) Reports an array size error. Arguments Type Intent Optional Attributes Name class(errors), intent(inout) :: err The error handling object. character(len=*), intent(in) :: fname The name of the routine in which the error occurred. character(len=*), intent(in) :: name The name of the array. integer(kind=int32), intent(in) :: expect The expected size of the array. integer(kind=int32), intent(in) :: actual The actual size of the array. public  subroutine report_arrays_not_same_size_error (err, fname, name1, name2, size1, size2) Reports an error relating to two arrays not being the same size\nwhen they should be the same size. Arguments Type Intent Optional Attributes Name class(errors), intent(inout) :: err The error handling object. character(len=*), intent(in) :: fname The name of the routine in which the error occurred. character(len=*), intent(in) :: name1 The name of the first array. character(len=*), intent(in) :: name2 The name of the second array. integer(kind=int32), intent(in) :: size1 The size of the first array. integer(kind=int32), intent(in) :: size2 The size of the second array. public  subroutine report_iteration_count_error (err, fname, msg, mincount) Reports an iteration count error. Arguments Type Intent Optional Attributes Name class(errors), intent(inout) :: err The error handling object. character(len=*) :: fname The name of the routine in which the error occurred. character(len=*) :: msg The error message. integer(kind=int32), intent(in) :: mincount The minimum iteration count expected. public  subroutine report_matrix_size_error (err, fname, name, expect_rows, expect_cols, actual_rows, actual_cols) Reports a matrix size error. Arguments Type Intent Optional Attributes Name class(errors), intent(inout) :: err The error handling object. character(len=*), intent(in) :: fname The name of the routine in which the error occurred. character(len=*), intent(in) :: name The name of the matrix. integer(kind=int32), intent(in) :: expect_rows The expected number of rows. integer(kind=int32), intent(in) :: expect_cols The expected number of columns. integer(kind=int32), intent(in) :: actual_rows The actual number of rows. integer(kind=int32), intent(in) :: actual_cols The actual number of columns. public  subroutine report_memory_error (err, fname, code) Reports a memory allocation related error. Arguments Type Intent Optional Attributes Name class(errors), intent(inout) :: err The error handling object. character(len=*), intent(in) :: fname The name of the routine in which the error occurred. integer(kind=int32), intent(in) :: code The error code returned by the allocation routine. public  subroutine report_underdefined_error (err, fname, expect, actual) Reports an underdefined problem error. Arguments Type Intent Optional Attributes Name class(errors), intent(inout) :: err The error handling object. character(len=*), intent(in) :: fname The name of the routine in which the error occurred. integer(kind=int32), intent(in) :: expect The expected minimum number of equations. integer(kind=int32), intent(in) :: actual The actual number of equations.","tags":"","loc":"module\\fstats_errors.html"},{"title":"fstats_smoothing – FSTATS","text":"Uses linalg fstats_errors ferror iso_fortran_env Subroutines public  subroutine lowess (x, y, ys, fsmooth, nstps, del, rweights, resid, err) Computes the smoothing of a data set using a robust locally weighted\nscatterplot smoothing (LOWESS) algorithm.  Fitted values are computed at\neach of the supplied x values. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x An N-element array containing the independent variable data.  This\narray must be monotonically increasing. real(kind=real64), intent(in), dimension(:) :: y An N-element array containing the dependent variable data. real(kind=real64), intent(out), dimension(:) :: ys An N-element array where the smoothed results will be written. real(kind=real64), intent(in), optional :: fsmooth An optional input that specifies the amount of smoothing. Specifically, this value is the fraction of points used to compute\neach value.  As this value increases, the output becomes smoother.\nChoosing a value in the range of 0.2 to 0.8 typically results in a\ngood fit.  The default value is 0.2. integer(kind=int32), intent(in), optional :: nstps An optional input that specifies the numb of iterations.  If set to\nzero, a non-robust fit is returned.  The default value is set to 2. real(kind=real64), intent(in), optional :: del real(kind=real64), intent(out), optional, dimension(:), target :: rweights An optional N-element array, that if supplied, will be used to\nreturn the weights given to each data point. real(kind=real64), intent(out), optional, dimension(:), target :: resid An optional N-element array, that if supplied, will be used to \nreturn the residual. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not \n     approriately sized.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation error.","tags":"","loc":"module\\fstats_smoothing.html"},{"title":"fstats – FSTATS","text":"FSTATS is a modern Fortran statistical library containing routines for \ncomputing basic statistical properties, hypothesis testing, regression, \nspecial functions, and experimental design. Uses fstats_anova fstats_distributions fstats_allan fstats_bootstrap fstats_regression fstats_experimental_design fstats_smoothing fstats_descriptive_statistics iso_fortran_env fstats_special_functions fstats_sampling fstats_helper_routines fstats_hypothesis","tags":"","loc":"module\\fstats.html"},{"title":"fstats_experimental_design – FSTATS","text":"Uses fstats_errors iso_fortran_env Subroutines public  subroutine full_factorial (vars, tbl, err) Computes a table with values scaled from 1 to N describing a \nfull-factorial design. Read more… Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: vars (:) An M-element array containing the M factors to study. Each of the M entries to the array is expected to contain \nthe number of options for that particular factor to explore. \nThis value must be greater than or equal to 1. integer(kind=int32), intent(out) :: tbl (:,:) A table where the design will be written.  Use \nget_full_factorial_matrix_size to determine the appropriate \ntable size. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_INVALID_INPUT_ERROR: Occurs if any items in vars are \n     less than 1.\n- FS_ARRAY_SIZE_ERROR: Occurs if tbl is not properly sized. public  subroutine get_full_factorial_matrix_size (vars, m, n, err) Computes the appropriate size for a full-factorial design table. Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: vars (:) An M-element array containing the M factors to study.  Each \nof the M entries to the array is expected to contain the \nnumber of options for that particular factor to explore. This value must be greater than or equal to 1. integer(kind=int32), intent(out) :: m The number of rows for the table. integer(kind=int32), intent(out) :: n The number of columns for the table. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_INVALID_INPUT_ERROR: Occurs if any items in vars are \n     less than 1.","tags":"","loc":"module\\fstats_experimental_design.html"},{"title":"fstats_anova – FSTATS","text":"Uses fstats_errors fstats_descriptive_statistics iso_fortran_env fstats_special_functions ieee_arithmetic ferror Interfaces public        interface anova Performs an analysis of variance (ANOVA) on the supplied data \nset. The following example illustrates a single-factor ANOVA on a \ndata set. program example use iso_fortran_env use fstats implicit none ! Local Variables character , parameter :: tab = achar ( 9 ) real ( real64 ) :: x ( 10 , 2 ) type ( single_factor_anova_table ) :: tbl ! Define the data x = reshape ( & [ & 3.086d3 , 3.082d3 , 3.069d3 , 3.072d3 , 3.045d3 , 3.070d3 , 3.079d3 , & 3.050d3 , 3.062d3 , 3.062d3 , 3.075d3 , 3.061d3 , 3.063d3 , 3.038d3 , & 3.070d3 , 3.062d3 , 3.070d3 , 3.049d3 , 3.042d3 , 3.063d3 & ], & [ 10 , 2 ] & ) ! Perform the ANOVA tbl = anova ( x ) ! Print out the table print '(A)' , \"Description\" // tab // \"DOF\" // tab // \"Sum of Sq.\" // & tab // \"Variance\" // tab // \"F-Stat\" // tab // \"P-Value\" print '(AF2.0AF5.1AF5.1AF5.3AF5.3)' , \"Main Factor: \" // tab , & tbl % main_factor % dof , tab , & tbl % main_factor % sum_of_squares , tab // tab , & tbl % main_factor % variance , tab // tab , & tbl % main_factor % f_statistic , tab , & tbl % main_factor % probability print '(AF3.0AF6.1AF5.1)' , \"Within: \" // tab , & tbl % within_factor % dof , tab , & tbl % within_factor % sum_of_squares , tab // tab , & tbl % within_factor % variance print '(AF3.0AF6.1AF5.1)' , \"Total: \" // tab // tab , & tbl % total_dof , tab , & tbl % total_sum_of_squares , tab // tab , & tbl % total_variance print '(AF6.1)' , \"Overall Mean: \" , tbl % overall_mean end program The above program produces the following output. Description     DOF     Sum of Sq.      Variance        F-Stat  P-Value\nMain Factor:    1.      352.8           352.8           2.147   0.160\nWithin:         18.     2958.2          164.3\nTotal:          19.     3311.0          174.3\nOverall Mean: 3063.5 See Also Wikipedia SPC Excel Single Factor ANOVA SPC Excel Gage R&R SPC Excel Understanding Regression Statistics NIST - Two Way ANOVA private  function anova_1_factor(x) result(rst) Performs an analysis of variance (ANOVA) on the supplied data set. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:,:) An M-by-N matrix containing the M replications of the N test \npoints of interest. Return Value type( single_factor_anova_table ) A single_factor_anova_table instance containing the ANOVA results. private  function anova_2_factor(x) result(rst) Performs an analysis of variance (ANOVA) on the supplied data set. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:,:,:) An M-by-N-by-K array containing the M replications of the\nN first factor results, and the K second factor results. Return Value type( two_factor_anova_table ) A two_factor_anova_table instance containing the ANOVA results. private  function anova_model_fit(nmodelparams, ymeas, ymod, err) result(rst) Performs an analysis of variance (ANOVA) on the supplied data set. Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: nmodelparams The number of model parameters. real(kind=real64), intent(in) :: ymeas (:) An N-element array containing the measured dependent variable data. real(kind=real64), intent(in) :: ymod (:) An N-element array containing the modeled dependent variable data. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if ymeas and ymod are not the \n  same length.\n- FS_MEMORY_ERROR: Occurs if a memory error is encountered. Return Value type( single_factor_anova_table ) A single_factor_anova_table instance containing the ANOVA results. Derived Types type, public :: anova_factor Defines an ANOVA factor result. Components Type Visibility Attributes Name Initial real(kind=real64), public :: dof The number of degrees of freedome. real(kind=real64), public :: f_statistic The F-statistic. real(kind=real64), public :: probability The variance probability term. real(kind=real64), public :: sum_of_squares The sum of the squares. real(kind=real64), public :: variance The estimate of variance. type, public :: single_factor_anova_table Defines a single-factor ANOVA results table. Components Type Visibility Attributes Name Initial type( anova_factor ), public :: main_factor The main, or main factor, results. real(kind=real64), public :: overall_mean The overall mean value. real(kind=real64), public :: total_dof The total number of degrees of freedom. real(kind=real64), public :: total_sum_of_squares The total sum of squares. real(kind=real64), public :: total_variance The total variance estimate. type( anova_factor ), public :: within_factor The within-treatement (error) results. type, public :: two_factor_anova_table Defines a two-factor ANOVA results table. Components Type Visibility Attributes Name Initial type( anova_factor ), public :: interaction The interaction effects. type( anova_factor ), public :: main_factor_1 The first main-factor results. type( anova_factor ), public :: main_factor_2 The second main-factor results. real(kind=real64), public :: overall_mean The overall mean value. real(kind=real64), public :: total_dof The total number of degrees of freedom. real(kind=real64), public :: total_sum_of_squares The total sum of squares. real(kind=real64), public :: total_variance The total variance estimate. type( anova_factor ), public :: within_factor The within (error) factor results.","tags":"","loc":"module\\fstats_anova.html"},{"title":"fstats_bootstrap.f90 – FSTATS","text":"Source Code module fstats_bootstrap use iso_fortran_env use fstats_errors use omp_lib use fstats_distributions use fstats_descriptive_statistics use fstats_special_functions use fstats_regression use linalg , only : sort implicit none private public :: bootstrap_resampling_routine public :: bootstrap_statistic_routine public :: random_resample public :: scaled_random_resample public :: bootstrap_statistics public :: bootstrap public :: bootstrap_regression_statistics public :: bootstrap_linear_least_squares public :: bootstrap_nonlinear_least_squares ! REFERENCES: ! - https://medium.com/@m21413108/bootstrapping-maximum-entropy-non-parametric-boot-python-3b1e23ea589d ! - https://cran.r-project.org/web/packages/meboot/vignettes/meboot.pdf ! - https://gist.github.com/christianjauregui/314456688a3c2fead43a48be3a47dad6 type bootstrap_regression_statistics !! A container for regression-related statistical information as !! computed in a bootstrap, or equivalent, calculation. real ( real64 ) :: standard_error !! The standard error for the model coefficient. real ( real64 ) :: t_statistic !! The T-statistic for the model coefficient. !! !!  t_o = \\frac{ \\beta_{i} }{E_{s}(\\beta_{i})}  real ( real64 ) :: probability !! The probability that the coefficient is not statistically !! important.  A statistically important coefficient will have a !! low probability (p-value), typically 0.05 or lower; however, a !! p-value of up to ~0.2 may be acceptable dependent upon the !! problem.  Typically any p-value larger than ~0.2 indicates the !! parameter is not statistically important for the model. !! !!  p = t_{|t_o|, df_{residual}}  real ( real64 ) :: upper_confidence_interval !! The upper limit of the confidence interval for the parameter. real ( real64 ) :: lower_confidence_interval !! The lower limit of the confidence interval for the parameter. end type type bootstrap_statistics !! A collection of statistics resulting from the bootstrap process. real ( real64 ) :: statistic_value !! The value of the statistic of interest. real ( real64 ) :: upper_confidence_interval !! The upper confidence limit on the statistic. real ( real64 ) :: lower_confidence_interval !! The lower confidence limit on the statistic. real ( real64 ) :: bias !! The bias in the statistic. real ( real64 ) :: standard_error !! The standard error of the statistic. real ( real64 ), allocatable , dimension (:) :: population !! An array of the population values generated by the bootstrap !! process. end type interface subroutine bootstrap_resampling_routine ( x , xn ) !! Defines the signature of a subroutine used to compute a !! resampling of data for bootstrapping purposes. use iso_fortran_env , only : real64 real ( real64 ), intent ( in ), dimension (:) :: x !! The N-element array to resample. real ( real64 ), intent ( out ), dimension ( size ( x )) :: xn !! An N-element array where the resampled data set will be !! written. end subroutine function bootstrap_statistic_routine ( x ) result ( rst ) !! Defines the signature of a function for computing the desired !! bootstrap statistic. use iso_fortran_env , only : real64 real ( real64 ), intent ( in ), dimension (:) :: x !! The array of data to analyze. real ( real64 ) :: rst !! The resulting statistic. end function end interface contains ! ****************************************************************************** ! RESAMPLING ! ------------------------------------------------------------------------------ subroutine random_resample ( x , xn ) !! Random resampling, with replacement, based upon a normal distribution. real ( real64 ), intent ( in ), dimension (:) :: x !! The N-element array to resample. real ( real64 ), intent ( out ), dimension ( size ( x )) :: xn !! An N-element array where the resampled data set will be written. ! Parameters real ( real64 ), parameter :: scale = 1.25d0 ! Local Variables integer ( int32 ) :: i , n real ( real64 ) :: xmin , xmax , rng ! Process n = size ( x ) xmin = x ( 1 ) xmax = x ( 1 ) do i = 2 , n xmin = min ( xmin , x ( i )) xmax = max ( xmax , x ( i )) end do rng = ( xmax - xmin ) call random_number ( xn ) xn = xn * rng + xmin end subroutine ! ------------------------------------------------------------------------------ subroutine scaled_random_resample ( x , xn ) !! A random resampling, scaled by the standard deviation of the original !! data, but based upon a normal distribution. real ( real64 ), intent ( in ), dimension (:) :: x !! The N-element array to resample. real ( real64 ), intent ( out ), dimension ( size ( x )) :: xn !! An N-element array where the resampled data set will be written. ! Parameters real ( real64 ), parameter :: half = 0.5d0 ! Local Variables integer ( int32 ) :: n real ( real64 ) :: eps ! Process n = size ( x ) eps = standard_deviation ( x ) / sqrt ( real ( n , real64 )) call random_number ( xn ) xn = eps * ( xn - half ) + x end subroutine ! ****************************************************************************** ! BOOTSTRAPPING ! ------------------------------------------------------------------------------ function bootstrap ( stat , x , method , nsamples , alpha ) result ( rst ) !! Performs a bootstrap calculation on the supplied data set for the given !! statistic.  The default implementation utlizes a random resampling with !! replacement.  Other resampling methods may be defined by specifying an !! appropriate routine by means of the method input. procedure ( bootstrap_statistic_routine ), pointer , intent ( in ) :: stat !! The routine used to compute the desired statistic. real ( real64 ), intent ( in ), dimension (:) :: x !! The N-element data set. procedure ( bootstrap_resampling_routine ), pointer , intent ( in ), optional :: method !! An optional pointer to the method to use for resampling of the data. !! If no method is supplied, a random resampling is utilized. integer ( int32 ), intent ( in ), optional :: nsamples !! An optional input, that if supplied, specifies the number of !! resampling runs to perform.  The default is 10 000. real ( real64 ), intent ( in ), optional :: alpha !! An optional input, that if supplied, defines the significance level !! to use for the analysis.  The default is 0.05. type ( bootstrap_statistics ) :: rst !! The resulting bootstrap_statistics type containing the confidence !! intervals, bias, standard error, etc. for the analyzed statistic. ! Parameters real ( real64 ), parameter :: half = 0.5d0 real ( real64 ), parameter :: p05 = 5.0d-2 ! Local Variables integer ( int32 ) :: i , i1 , i2 , n , ns real ( real64 ) :: a real ( real64 ), allocatable , dimension (:) :: xn procedure ( bootstrap_resampling_routine ), pointer :: resample ! Initialization n = size ( x ) if ( present ( method )) then resample => method else resample => random_resample end if if ( present ( nsamples )) then ns = nsamples else ns = 10000 end if if ( present ( alpha )) then a = alpha else a = p05 end if allocate ( rst % population ( ns )) i1 = floor ( half * a * ns , int32 ) i2 = ns - i1 + 1 ! Analyze the basic data set rst % statistic_value = stat ( x ) rst % population ( 1 ) = rst % statistic_value ! Resampling Process #ifdef USEOPENMP ! Use OpenMP to run operations in parallel !$OMP PARALLEL DO PRIVATE(xn) SHARED(rst) do i = 2 , ns ! Per-thread memory allocation if (. not . allocated ( xn )) allocate ( xn ( n )) ! Resample the data call resample ( x , xn ) ! Compute the statistic rst % population ( i ) = stat ( xn ) end do !$OMP END PARALLEL DO #else ! OpenMP is not available - run in a serial manner allocate ( xn ( n )) do i = 2 , ns ! Resample the data call resample ( x , xn ) ! Compute the statistic for the resampled data rst % population ( i ) = stat ( xn ) end do #endif ! Compute the relevant quantities on the resampled statistic call sort ( rst % population , . true .) rst % upper_confidence_interval = rst % population ( i2 ) rst % lower_confidence_interval = rst % population ( i1 ) rst % bias = mean ( rst % population ) - rst % statistic_value rst % standard_error = standard_deviation ( rst % population ) end function ! ****************************************************************************** ! LINEAR REGRESSION ! ------------------------------------------------------------------------------ subroutine bootstrap_linear_least_squares ( order , intercept , x , y , & coeffs , ymod , resid , nsamples , stats , bias , alpha , method , bscoeffs , err ) !! Computes a linear least-squares regression to fit a set of data. !! Bootstrapping is utilized to gain insight into the quality of !! the fit.  Resampling for the bootstrap process is a random resampling !! with replacement process with the range of values limited by the !! standard deviation of the original data set. integer ( int32 ), intent ( in ) :: order !! The order of the equation to fit.  This value must be at !! least one (linear equation), but can be higher as desired, !! as long as there is sufficient data. logical , intent ( in ) :: intercept !! Set to true if the intercept is being computed as part of !! the regression; else, false. real ( real64 ), intent ( in ), dimension (:) :: x !! An N-element array containing the independent variable !! measurement points. real ( real64 ), intent ( in ), dimension (:) :: y !! An N-element array containing the dependent variable !! measurement points. real ( real64 ), intent ( out ), dimension (:) :: coeffs !! An ORDER+1 element array where the coefficients will !! be written. real ( real64 ), intent ( out ), dimension (:) :: ymod !! An N-element array where the modeled data will be written. real ( real64 ), intent ( out ), dimension (:) :: resid !! An N-element array where the residual error data will be !! written (modeled - actual). integer ( int32 ), intent ( in ), optional :: nsamples !! The number of bootstrapping samples to utilize. type ( bootstrap_regression_statistics ), intent ( out ), optional , & dimension (:) :: stats !! An M-element array of bootstrap_regression_statistics items !! where M = ORDER + 1 when intercept is set to true; however, !! if intercept is set to false, M = ORDER. real ( real64 ), intent ( out ), optional , dimension (:) :: bias !! An ORDER+1 element array where an estimate of the bias of !! each coefficient is returned based upon the results of the !! bootstrapping analysis.  The bias is computed as the difference !! between the mean of the boostrap population results for the given !! parameter and the original estimate of the given parameter. real ( real64 ), intent ( in ), optional :: alpha !! The significance level at which to evaluate the confidence !! intervals.  The default value is 0.05 such that a 95% !! confidence interval is calculated. procedure ( bootstrap_resampling_routine ), pointer , intent ( in ), optional :: method !! An optional pointer to the method to use for resampling of the data. !! If no method is supplied, a random resampling is utilized. real ( real64 ), intent ( out ), optional , allocatable , target , dimension (:,:) :: bscoeffs !! An optional, allocatable matrix, containing the bootstrap !! distributions for each parameter stored in each row of the matrix !! such that the resulting matrix is NCOEFFS -by- NSAMPLES. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings to the !! caller.  Possible warning and error codes are as follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not !!      approriately sized. !! - FS_INVALID_INPUT_ERROR: Occurs if order is less than 1. !! - FS_MEMORY_ERROR: Occurs if there is a memory allocation !!      error. ! Parameters real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: p05 = 5.0d-2 ! Local Variables integer ( int32 ) :: i , j , n , ns , nc , ncoeffs , flag , nthreads , thread real ( real64 ) :: alph real ( real64 ), allocatable , dimension (:) :: fLocal , yLocal , rLocal real ( real64 ), allocatable , target , dimension (:,:) :: coeffstorage real ( real64 ), pointer , dimension (:,:) :: allcoeffs class ( errors ), pointer :: errmgr type ( errors ), target :: deferr procedure ( bootstrap_resampling_routine ), pointer :: resample ! Initialization if ( present ( err )) then errmgr => err else errmgr => deferr end if if ( present ( nsamples )) then ns = nsamples else ns = 1000 end if if ( present ( alpha )) then alph = alpha else alph = p05 end if if ( present ( method )) then resample => method else resample => scaled_random_resample end if n = size ( x ) ncoeffs = order + 1 nc = order if ( intercept ) nc = nc + 1 nthreads = omp_get_num_threads () ! Compute the fit call linear_least_squares ( order , intercept , x , y , coeffs , & ymod , resid , alpha = alph , err = errmgr ) if ( errmgr % has_error_occurred ()) return ! Memory Allocations if ( present ( bscoeffs )) then allocate ( bscoeffs ( ncoeffs , ns ), source = zero , stat = flag ) if ( flag /= 0 ) then call report_memory_error ( errmgr , \"bootstrap_linear_least_squares\" , & flag ) return end if allcoeffs => bscoeffs else allocate ( coeffstorage ( ncoeffs , ns ), source = zero , stat = flag ) if ( flag /= 0 ) then call report_memory_error ( errmgr , \"bootstrap_linear_least_squares\" , & flag ) return end if allcoeffs => coeffstorage end if allcoeffs (:, 1 ) = coeffs ! Cycle over each data set and perform the fit #ifdef USEOPENMP !$OMP PARALLEL DO PRIVATE(fLocal, yLocal, rLocal) SHARED(allcoeffs) do i = 2 , ns ! Get the current thread number ! The +1 is because OpenMP is zero-based for thread numbering thread = omp_get_thread_num () + 1 ! Allocate local arrays on a per-thread basis if (. not . allocated ( fLocal )) allocate ( fLocal ( n )) if (. not . allocated ( yLocal )) allocate ( yLocal ( n )) if (. not . allocated ( rLocal )) allocate ( rLocal ( n )) ! Compute a random data set call resample ( y , yLocal ) ! Compute the fit of the perturbed data set call linear_least_squares ( order , intercept , x , yLocal , & allcoeffs (:, i ), fLocal , rLocal , alpha = alph ) end do !$OMP END PARALLEL DO #else ! OpenMP is not available - run in a serial manner allocate ( fLocal ( n ), yLocal ( n ), rLocal ( n )) do i = 2 , ns ! Compute a random data set call resample ( y , yLocal ) ! Compute the fit of the perturbed data set call linear_least_squares ( order , intercept , x , yLocal , & allcoeffs (:, i ), fLocal , rLocal , alpha = alph ) end do #endif ! Perform statistics calculations, if needed if ( present ( stats )) then call compute_stats ( coeffs , allcoeffs , alph , intercept , stats ) end if ! Compute the bias for each parameter, if needed if ( present ( bias )) then ! Verify the size of the array if ( size ( bias ) /= ncoeffs ) then call report_array_size_error ( errmgr , & \"bootstrap_linear_least_squares\" , \"bias\" , ncoeffs , size ( bias )) return end if ! Perform the calculations do i = 1 , ncoeffs bias ( i ) = mean ( allcoeffs ( i ,:)) - coeffs ( i ) end do end if end subroutine ! ****************************************************************************** ! NONLINEAR REGRESSION ! ------------------------------------------------------------------------------ subroutine bootstrap_nonlinear_least_squares ( fun , x , y , params , ymod , resid , & nsamples , weights , maxp , minp , stats , alpha , controls , settings , info , & bias , method , bscoeffs , err ) !! Performs a nonlinear regression to fit a model using a version !! of the Levenberg-Marquardt algorithm.  Bootstrapping is utilized to gain !! insight into the quality of the fit.  Resampling for the bootstrap !! process is a random resampling with replacement process with the !! range of values limited by the standard deviation of the original !! data set. procedure ( regression_function ), intent ( in ), pointer :: fun !! A pointer to the regression_function to evaluate. real ( real64 ), intent ( in ) :: x (:) !! The M-element array containing independent data. real ( real64 ), intent ( in ) :: y (:) !! The M-element array containing dependent data. real ( real64 ), intent ( inout ) :: params (:) !! On input, the N-element array containing the initial estimate !! of the model parameters.  On output, the computed model !! parameters. real ( real64 ), intent ( out ) :: ymod (:) !! An M-element array where the modeled dependent data will !! be written. real ( real64 ), intent ( out ) :: resid (:) !! An M-element array where the model residuals will be !! written. integer ( int32 ), intent ( in ), optional :: nsamples !! The number of bootstrapping samples to utilize. real ( real64 ), intent ( in ), optional , target :: weights (:) !! An optional M-element array allowing the weighting of !! individual points. real ( real64 ), intent ( in ), optional , target :: maxp (:) !! An optional N-element array that can be used as upper limits !! on the parameter values.  If no upper limit is requested for !! a particular parameter, utilize a very large value.  The !! internal default is to utilize huge() as a value. real ( real64 ), intent ( in ), optional , target :: minp (:) !! An optional N-element array that can be used as lower limits !! on the parameter values.  If no lower limit is requested for !! a particalar parameter, utilize a very large magnitude, but !! negative, value.  The internal default is to utilize -huge() !! as a value. type ( bootstrap_regression_statistics ), intent ( out ), optional :: stats (:) !! An optional N-element array that, if supplied, will be used !! to return statistics about the fit for each parameter. real ( real64 ), intent ( in ), optional :: alpha !! The significance level at which to evaluate the confidence !! intervals.  The default value is 0.05 such that a 95% !! confidence interval is calculated. type ( iteration_controls ), intent ( in ), optional :: controls !! An optional input providing custom iteration controls. type ( lm_solver_options ), intent ( in ), optional :: settings !! An optional input providing custom settings for the solver. type ( convergence_info ), intent ( out ), optional , target :: info !! An optional output that can be used to gain information about !! the iterative solution and the nature of the convergence. real ( real64 ), intent ( out ), optional , dimension (:) :: bias !! An optional N-element array that, if supplied, will be used to !! provide an estimate of the bias of each model parameter based upon !! the results of the bootstrapping analysis.  The bias is computed as !! the difference between the mean of the boostrap population results !! for the given parameter and the original estimate of the given !! parameter. procedure ( bootstrap_resampling_routine ), pointer , intent ( in ), optional :: method !! An optional pointer to the method to use for resampling of the data. !! If no method is supplied, a random resampling is utilized. real ( real64 ), intent ( out ), optional , allocatable , target , dimension (:,:) :: bscoeffs !! An optional, allocatable matrix, containing the bootstrap !! distributions for each parameter stored in each row of the matrix !! such that the resulting matrix is NCOEFFS -by- NSAMPLES. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings to the !! caller.  Possible warning and error codes are as follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not !!      properly sized. !! - FS_MEMORY_ERROR: Occurs if there is a memory allocation !!      error. !! - FS_UNDERDEFINED_PROBLEM_ERROR: Occurs if the problem posed !!      is underdetetermined (M < N). !! - FS_TOLERANCE_TOO_SMALL_ERROR: Occurs if any supplied !!      tolerances are too small to be practical. !! - FS_TOO_FEW_ITERATION_ERROR: Occurs if too few iterations !!      are allowed. ! Parameters real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: p05 = 5.0d-2 ! Local Variables integer ( int32 ) :: i , n , ns , nparams , flag real ( real64 ) :: alph real ( real64 ), allocatable , dimension (:) :: fLocal , yLocal , rLocal real ( real64 ), allocatable , target , dimension (:,:) :: coeffstorage real ( real64 ), pointer , dimension (:,:) :: allcoeffs procedure ( bootstrap_resampling_routine ), pointer :: resample class ( errors ), pointer :: errmgr type ( errors ), target :: deferr ! Initialization if ( present ( err )) then errmgr => err else errmgr => deferr end if if ( present ( nsamples )) then ns = nsamples else ns = 1000 end if if ( present ( alpha )) then alph = alpha else alph = p05 end if if ( present ( method )) then resample => method else resample => scaled_random_resample end if n = size ( x ) nparams = size ( params ) ! Compute the fit call nonlinear_least_squares ( fun , x , y , params , ymod , resid , & weights = weights , maxp = maxp , minp = minp , alpha = alph , & controls = controls , settings = settings , info = info , err = err ) ! Memory Allocations if ( present ( bscoeffs )) then allocate ( bscoeffs ( nparams , ns ), source = zero , stat = flag ) if ( flag /= 0 ) then call report_memory_error ( errmgr , & \"bootstrap_nonlinear_least_squares\" , flag ) return end if allcoeffs => bscoeffs else allocate ( coeffstorage ( nparams , ns ), source = zero , stat = flag ) if ( flag /= 0 ) then call report_memory_error ( errmgr , & \"bootstrap_nonlinear_least_squares\" , flag ) return end if allcoeffs => coeffstorage end if allcoeffs (:, 1 ) = params ! Define initial guesses for each step.  Base upon the results of the ! initial analysis as this should provide a strong starting point for ! subsequent analysis do i = 1 , nparams allcoeffs ( i ,:) = params ( i ) end do ! Cycle over each data set and perform the fit #ifdef USEOPENMP !$OMP PARALLEL DO PRIVATE(fLocal, yLocal, rLocal) do i = 2 , ns ! Allocate local arrays on a per-thread basis if (. not . allocated ( fLocal )) allocate ( fLocal ( n )) if (. not . allocated ( yLocal )) allocate ( yLocal ( n )) if (. not . allocated ( rLocal )) allocate ( rLocal ( n )) ! Compute a random data set call resample ( y , yLocal ) ! Compute the fit of the perturbed data set call nonlinear_least_squares ( fun , x , yLocal , allcoeffs (:, i ), fLocal , & rLocal , weights = weights , maxp = maxp , minp = minp , alpha = alph , & controls = controls , settings = settings , info = info ) end do !$OMP END PARALLEL DO #else ! OpenMP is not available - run in a serial manner allocate ( fLocal ( n ), yLocal ( n ), rLocal ( n )) do i = 2 , ns ! Compute a random data set call resample ( y , yLocal ) ! Compute the fit of the perturbed data set call nonlinear_least_squares ( fun , x , yLocal , allcoeffs (:, i ), fLocal , & rLocal , weights = weights , maxp = maxp , minp = minp , alpha = alph , & controls = controls , settings = settings , info = info ) end do #endif ! Perform the statistics calculations, if needed if ( present ( stats )) then ! Verify the size of stats if ( size ( stats ) /= nparams ) then call report_array_size_error ( errmgr , & \"bootstrap_nonlinear_least_squares\" , \"stats\" , & nparams , size ( stats )) return end if ! Perform the calculations call compute_stats ( params , allcoeffs , alph , . true ., stats ) end if ! Compute the bias for each parameter, if needed if ( present ( bias )) then ! Verify the size of the array if ( size ( bias ) /= nparams ) then call report_array_size_error ( errmgr , & \"bootstrap_nonlinear_least_squares\" , \"bias\" , & nparams , size ( bias )) return end if ! Perform the calculations do i = 1 , nparams bias ( i ) = mean ( allcoeffs ( i ,:)) - params ( i ) end do end if end subroutine ! ****************************************************************************** ! PRIVATE HELPER ROUTINES ! ------------------------------------------------------------------------------ subroutine compute_stats ( mdl , coeffs , alpha , intercept , stats ) ! Arguments real ( real64 ), intent ( in ), dimension (:) :: mdl real ( real64 ), intent ( inout ), dimension (:,:) :: coeffs real ( real64 ), intent ( in ) :: alpha logical , intent ( in ) :: intercept type ( bootstrap_regression_statistics ), intent ( out ), dimension (:) :: stats ! Parameters real ( real64 ), parameter :: half = 0.5d0 ! Local Variables integer ( int32 ) :: i , j , i1 , i2 , ncoeffs , nc , nsamples real ( real64 ) :: ms type ( t_distribution ) :: dist ! Initialization ncoeffs = size ( coeffs , 1 ) nsamples = size ( coeffs , 2 ) nc = ncoeffs if (. not . intercept ) nc = ncoeffs - 1 i1 = floor ( half * alpha * nsamples , int32 ) i2 = nsamples - i1 + 1 dist % dof = real ( nsamples - nc ) ! Process j = 1 if ( intercept ) j = 0 do i = 1 , nc j = j + 1 ms = trimmed_mean ( coeffs ( j ,:), p = half * alpha ) ! As we have a distribution of mean values, the standard deviation ! of this population yields the standard error estimate for the ! overall problem stats ( i )% standard_error = standard_deviation ( coeffs ( j ,:)) ! As before, this is a distribution of mean values.  The CI can ! be directly estimated by considering the values of the bottom ! alpha/2 and top alpha/2 terms. stats ( i )% upper_confidence_interval = coeffs ( j , i2 ) stats ( i )% lower_confidence_interval = coeffs ( j , i1 ) ! Compute the remaining parameters stats ( i )% t_statistic = mdl ( j ) / stats ( i )% standard_error stats ( i )% probability = regularized_beta ( half * dist % dof , half , & dist % dof / ( dist % dof + ( stats ( i )% t_statistic ) ** 2 )) end do end subroutine ! ------------------------------------------------------------------------------ end module","tags":"","loc":"sourcefile\\fstats_bootstrap.f90.html"},{"title":"fstats_descriptive_statistics.f90 – FSTATS","text":"Source Code module fstats_descriptive_statistics use iso_fortran_env use linalg , only : sort use ferror use fstats_errors implicit none private public :: mean public :: variance public :: standard_deviation public :: median public :: quantile public :: trimmed_mean public :: covariance contains ! ------------------------------------------------------------------------------ pure function mean ( x ) result ( rst ) !! Computes the mean of the values in an array. real ( real64 ), intent ( in ) :: x (:) !! The array of values to analyze. real ( real64 ) :: rst !! The result. ! Parameters real ( real64 ), parameter :: zero = 0.0d0 ! Local Variables integer ( int32 ) :: i , n ! Process n = size ( x ) if ( n == 0 ) then rst = zero else rst = x ( 1 ) do i = 2 , n rst = rst + ( x ( i ) - rst ) / i end do end if end function ! ------------------------------------------------------------------------------ pure function variance ( x ) result ( rst ) !! Computes the sample variance of the values in an array. !! !! The variance computed is the sample variance such that !!  s&#94;2 = \\frac{\\Sigma \\left( x_{i} - \\bar{x} \\right)&#94;2}{n - 1} . real ( real64 ), intent ( in ) :: x (:) !! The array of values to analyze. real ( real64 ) :: rst ! Parameters real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: one = 1.0d0 ! Local Variables integer ( int32 ) :: i , n real ( real64 ) :: oldMean , newMean ! Process n = size ( x ) if ( n <= 1 ) then rst = zero else oldMean = x ( 1 ) rst = zero do i = 2 , n newMean = oldMean + ( x ( i ) - oldMean ) / i rst = rst + ( x ( i ) - oldMean ) * ( x ( i ) - newMean ) oldMean = newMean end do rst = rst / ( n - one ) end if end function ! ------------------------------------------------------------------------------ pure function standard_deviation ( x ) result ( rst ) !! Computes the sample standard deviation of the values in an array. !! !! The value computed is the sample standard deviation. !!  s = \\sqrt{ \\frac{\\Sigma \\left( x_{i} - \\bar{x} \\right)&#94;2}{n - 1} }  real ( real64 ), intent ( in ) :: x (:) !! The array of values to analyze. real ( real64 ) :: rst !! The result. ! Process rst = sqrt ( variance ( x )) end function ! ------------------------------------------------------------------------------ function median ( x ) result ( rst ) !! Computes the median of the values in an array. real ( real64 ), intent ( inout ) :: x (:) !! The array of values to analyze.  On output, this array is sorted into !! ascending order. real ( real64 ) :: rst !! The result. ! Parameters real ( real64 ), parameter :: half = 0.5d0 ! Local Variables integer ( int32 ) :: n , nmid , nmidp1 , flag , iflag ! Initialization n = size ( x ) nmid = n / 2 nmidp1 = nmid + 1 iflag = n - 2 * nmid ! Sort the array in ascending order call sort ( x , . true .) ! Find the median if ( iflag == 0 ) then rst = half * ( x ( nmid ) + x ( nmidp1 )) else rst = x ( nmidp1 ) end if end function ! ------------------------------------------------------------------------------ ! REF: https://fortranwiki.org/fortran/show/Quartiles ! ! This is the method used by Minitab pure function quantile ( x , q ) result ( rst ) !! Computes the specified quantile of a data set using the SAS !! Method 4. !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Quantile) real ( real64 ), intent ( in ) :: x (:) !! An N-element array containing the data. real ( real64 ), intent ( in ) :: q !! The quantile to compute (e.g. 0.25 computes the 25% quantile). real ( real64 ) :: rst !! The result. ! Parameters real ( real64 ), parameter :: one = 1.0d0 ! Local Variables real ( real64 ) :: a , b , c , tol integer ( int32 ) :: n , ib ! Initialization tol = sqrt ( epsilon ( tol )) n = size ( x ) ! Process a = ( n + one ) * q b = mod ( a , one ) c = a - b ib = int ( c , int32 ) if (( ib + 1 ) > n ) then rst = ( one - b ) * x ( ib ) + b * x ( n ) else rst = ( one - b ) * x ( ib ) + b * x ( ib + 1 ) end if end function ! ------------------------------------------------------------------------------ function trimmed_mean ( x , p ) result ( rst ) !! Computes the trimmed mean of a data set. real ( real64 ), intent ( inout ), dimension (:) :: x !! An N-element array containing the data.  On output, the !! array is sorted into ascending order. real ( real64 ), intent ( in ), optional :: p !! An optional parameter specifying the percentage of values !! from either end of the distribution to remove.  The default !! is 0.05 such that the bottom 5% and top 5% are removed. real ( real64 ) :: rst !! The trimmed mean. ! Local Variables integer ( int32 ) :: i1 , i2 , n real ( real64 ) :: pv ! Initialization if ( present ( p )) then pv = abs ( p ) else pv = 0.05d0 end if ! Sort the array into ascending order call sort ( x , . true .) ! Find the limiting indices n = size ( x ) i1 = max ( floor ( n * pv , int32 ), 1 ) i2 = min ( n , n - i1 + 1 ) rst = mean ( x ( i1 : i2 )) end function ! ------------------------------------------------------------------------------ pure function covariance ( x , y ) result ( rst ) !! Computes the sample covariance of two data sets. !! !! The covariance computed is the sample covariance such that !!  q_{jk} = \\frac{\\Sigma \\left( x_{i} - \\bar{x} \\right) !! \\left( y_{i} - \\bar{y} \\right)}{n - 1} . real ( real64 ), intent ( in ), dimension (:) :: x !! The first N-element data set. real ( real64 ), intent ( in ), dimension ( size ( x )) :: y !! The second N-element data set. real ( real64 ) :: rst !! The covariance. ! Parameters real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: one = 1.0d0 ! Local Variables integer ( int32 ) :: i , n real ( real64 ) :: meanX , meanY ! Process n = size ( x ) if ( n <= 1 ) then rst = zero else ! Compute the means meanX = x ( 1 ) meanY = y ( 1 ) do i = 2 , n meanX = meanX + ( x ( i ) - meanX ) / i meanY = meanY + ( y ( i ) - meanY ) / i end do ! Compute the covariance rst = sum (( x - meanX ) * ( y - meanY )) / ( n - one ) end if end function ! ------------------------------------------------------------------------------ end module","tags":"","loc":"sourcefile\\fstats_descriptive_statistics.f90.html"},{"title":"fstats_distributions.f90 – FSTATS","text":"Source Code module fstats_distributions use iso_fortran_env use ieee_arithmetic use fstats_special_functions use fstats_helper_routines implicit none private public :: distribution public :: distribution_function public :: distribution_property public :: t_distribution public :: normal_distribution public :: f_distribution public :: chi_squared_distribution public :: binomial_distribution real ( real64 ), parameter :: pi = 2.0d0 * acos ( 0.0d0 ) type , abstract :: distribution !! Defines a probability distribution. contains procedure ( distribution_function ), deferred , pass :: pdf !! Computes the probability density function. procedure ( distribution_function ), deferred , pass :: cdf !! Computes the cumulative distribution function. procedure ( distribution_property ), deferred , pass :: mean !! Computes the mean of the distribution. procedure ( distribution_property ), deferred , pass :: median !! Computes the median of the distribution. procedure ( distribution_property ), deferred , pass :: mode !! Computes the mode of the distribution. procedure ( distribution_property ), deferred , pass :: variance !! Computes the variance of the distribution. end type interface pure elemental function distribution_function ( this , x ) result ( rst ) !! Defines the interface for a probability distribution function. use iso_fortran_env , only : real64 import distribution class ( distribution ), intent ( in ) :: this !! The distribution object. real ( real64 ), intent ( in ) :: x !! The value at which to evaluate the function. real ( real64 ) :: rst !! The value of the function. end function pure function distribution_property ( this ) result ( rst ) !! Computes the value of a distribution property. use iso_fortran_env , only : real64 import distribution class ( distribution ), intent ( in ) :: this !! The distribution object. real ( real64 ) :: rst !! The property value. end function end interface ! ------------------------------------------------------------------------------ type , extends ( distribution ) :: t_distribution !! Defines Student's T-Distribution. real ( real64 ) :: dof !! The number of degrees of freedom. contains procedure , public :: pdf => td_pdf procedure , public :: cdf => td_cdf procedure , public :: mean => td_mean procedure , public :: median => td_median procedure , public :: mode => td_mode procedure , public :: variance => td_variance end type ! ------------------------------------------------------------------------------ type , extends ( distribution ) :: normal_distribution !! Defines a normal distribution. real ( real64 ) :: standard_deviation !! The standard deviation of the distribution. real ( real64 ) :: mean_value !! The mean value of the distribution. contains procedure , public :: pdf => nd_pdf procedure , public :: cdf => nd_cdf procedure , public :: mean => nd_mean procedure , public :: median => nd_median procedure , public :: mode => nd_mode procedure , public :: variance => nd_variance procedure , public :: standardize => nd_standardize end type ! ------------------------------------------------------------------------------ type , extends ( distribution ) :: f_distribution !! Defines an F-distribution. real ( real64 ) :: d1 !! The measure of degrees of freedom for the first data set. real ( real64 ) :: d2 !! The measure of degrees of freedom for the second data set. contains procedure , public :: pdf => fd_pdf procedure , public :: cdf => fd_cdf procedure , public :: mean => fd_mean procedure , public :: median => fd_median procedure , public :: mode => fd_mode procedure , public :: variance => fd_variance end type ! ------------------------------------------------------------------------------ type , extends ( distribution ) :: chi_squared_distribution !! Defines a Chi-squared distribution. integer ( int32 ) :: dof !! The number of degrees of freedom. contains procedure , public :: pdf => cs_pdf procedure , public :: cdf => cs_cdf procedure , public :: mean => cs_mean procedure , public :: median => cs_median procedure , public :: mode => cs_mode procedure , public :: variance => cs_variance end type ! ------------------------------------------------------------------------------ type , extends ( distribution ) :: binomial_distribution !! Defines a binomial distribution.  The binomial distribution describes !! the probability p of getting k successes in n independent trials. integer ( int32 ) :: n !! The number of independent trials. real ( real64 ) :: p !! The success probability for each trial.  This parameter must !! exist on the set [0, 1]. contains procedure , public :: pdf => bd_pdf procedure , public :: cdf => bd_cdf procedure , public :: mean => bd_mean procedure , public :: median => bd_median procedure , public :: mode => bd_mode procedure , public :: variance => bd_variance end type ! ------------------------------------------------------------------------------ contains ! ****************************************************************************** ! STUDENT'S T-DISTRIBUTION ! ------------------------------------------------------------------------------ ! REF: https://en.wikipedia.org/wiki/Student%27s_t-distribution pure elemental function td_pdf ( this , x ) result ( rst ) !! Computes the probability density function. !! !! The PDF for Student's T-Distribution is given as !!  f(t) = \\frac{ \\Gamma \\left( \\frac{\\nu + 1}{2} \\right) } !! { \\sqrt{\\nu \\pi} \\Gamma \\left( \\frac{\\nu}{2} \\right) } !! \\left( 1 + \\frac{t&#94;2}{\\nu} \\right)&#94;{-(\\nu + 1) / 2} . class ( t_distribution ), intent ( in ) :: this !! The t_distribution object. real ( real64 ), intent ( in ) :: x !! The value at which to evaluate the function. real ( real64 ) :: rst !! The value of the function. ! Process rst = gamma (( this % dof + 1.0d0 ) / 2.0d0 ) / & ( sqrt ( this % dof * pi ) * gamma ( this % dof / 2.0d0 )) * & ( 1.0d0 + x ** 2 / this % dof ) ** ( - 0.5d0 * ( 1.0d0 + this % dof )) end function ! ------------------------------------------------------------------------------ pure elemental function td_cdf ( this , x ) result ( rst ) !! Computes the cumulative distribution function. !! !! The CDF for Student's T-Distribution is given as !!  F(t) = \\int_{-\\infty}&#94;{t} f(u) \\,du = 1 - \\frac{1}{2} I_{x(t)} !! \\left( \\frac{\\nu}{2}, \\frac{1}{2} \\right)  !! where  x(t) = \\frac{\\nu}{\\nu + t&#94;2} . class ( t_distribution ), intent ( in ) :: this !! The t_distribution object. real ( real64 ), intent ( in ) :: x !! The value at which to evaluate the function. real ( real64 ) :: rst !! The value of the function. ! Process real ( real64 ) :: t t = this % dof / ( this % dof + x ** 2 ) rst = 1.0d0 - 0.5d0 * regularized_beta ( 0.5d0 * this % dof , 0.5d0 , t ) if ( x < 0 ) rst = 1.0d0 - rst end function ! ------------------------------------------------------------------------------ pure function td_mean ( this ) result ( rst ) !! Computes the mean of the distribution. class ( t_distribution ), intent ( in ) :: this !! The t_distribution object. real ( real64 ) :: rst !! The mean. ! Process if ( this % dof < 1.0d0 ) then rst = ieee_value ( rst , IEEE_QUIET_NAN ) else rst = 0.0d0 end if end function ! ------------------------------------------------------------------------------ pure function td_median ( this ) result ( rst ) !! Computes the median of the distribution. class ( t_distribution ), intent ( in ) :: this !! The t_distribution object. real ( real64 ) :: rst ! Process rst = 0.0d0 end function ! ------------------------------------------------------------------------------ pure function td_mode ( this ) result ( rst ) !! Computes the mode of the distribution. class ( t_distribution ), intent ( in ) :: this !! The t_distribution object. real ( real64 ) :: rst !! The mode. ! Process rst = 0.0d0 end function ! ------------------------------------------------------------------------------ pure function td_variance ( this ) result ( rst ) !! Computes the variance of the distribution. class ( t_distribution ), intent ( in ) :: this !! The t_distribution object. real ( real64 ) :: rst !! The variance. ! Process if ( this % dof <= 1.0d0 ) then rst = ieee_value ( rst , IEEE_QUIET_NAN ) else if ( this % dof > 1.0d0 . and . this % dof <= 2.0d0 ) then rst = ieee_value ( rst , IEEE_POSITIVE_INF ) else rst = this % dof / ( this % dof - 2.0d0 ) end if end function ! ****************************************************************************** ! NORMAL DISTRIBUTION ! ------------------------------------------------------------------------------ pure elemental function nd_pdf ( this , x ) result ( rst ) !! Computes the probability density function. !! !! The PDF for a normal distribution is given as !!  f(x) = \\frac{1}{\\sigma \\sqrt{2 \\pi}} \\exp \\left(-\\frac{1}{2} !! \\left( \\frac{x - \\mu}{\\sigma} \\right)&#94;2 \\right) . class ( normal_distribution ), intent ( in ) :: this !! The normal_distribution object. real ( real64 ), intent ( in ) :: x !! The value at which to evaluate the function. real ( real64 ) :: rst !! The value of the function. rst = exp ( - 0.5d0 * (( x - this % mean_value ) / this % standard_deviation ) ** 2 ) / & ( this % standard_deviation * sqrt ( 2.0d0 * pi )) end function ! ------------------------------------------------------------------------------ pure elemental function nd_cdf ( this , x ) result ( rst ) !! Computes the cumulative distribution function. !! !! The CDF for a normal distribution is given as !!  F(x) = \\frac{1}{2} \\left( 1 + erf \\left( \\frac{x - \\mu} !! {\\sigma \\sqrt{2}} \\right) \\right) . class ( normal_distribution ), intent ( in ) :: this !! The normal_distribution object. real ( real64 ), intent ( in ) :: x !! The value at which to evaluate the function. real ( real64 ) :: rst !! The value of the function. rst = 0.5d0 * ( 1.0d0 + erf (( x - this % mean_value ) / & ( this % standard_deviation * sqrt ( 2.0d0 )))) end function ! ------------------------------------------------------------------------------ pure function nd_mean ( this ) result ( rst ) !! Computes the mean of the distribution. class ( normal_distribution ), intent ( in ) :: this !! The normal_distribution object. real ( real64 ) :: rst !! The mean rst = this % mean_value end function ! ------------------------------------------------------------------------------ pure function nd_median ( this ) result ( rst ) !! Computes the median of the distribution. class ( normal_distribution ), intent ( in ) :: this !! The normal_distribution object. real ( real64 ) :: rst !! The median. rst = this % mean_value end function ! ------------------------------------------------------------------------------ pure function nd_mode ( this ) result ( rst ) !! Computes the mode of the distribution. class ( normal_distribution ), intent ( in ) :: this !! The normal_distribution object. real ( real64 ) :: rst !! The mode. rst = this % mean_value end function ! ------------------------------------------------------------------------------ pure function nd_variance ( this ) result ( rst ) !! Computes the variance of the distribution. class ( normal_distribution ), intent ( in ) :: this !! The normal_distribution object. real ( real64 ) :: rst !! The variance. rst = this % standard_deviation ** 2 end function ! ------------------------------------------------------------------------------ subroutine nd_standardize ( this ) !! Standardizes the normal distribution to a mean of 0 and a !! standard deviation of 1. class ( normal_distribution ), intent ( inout ) :: this !! The normal_distribution object. this % mean_value = 0.0d0 this % standard_deviation = 1.0d0 end subroutine ! ****************************************************************************** ! F DISTRIBUTION ! ------------------------------------------------------------------------------ pure elemental function fd_pdf ( this , x ) result ( rst ) !! Computes the probability density function. !! !! The PDF for a F distribution is given as !!  f(x) = !! \\sqrt{ \\frac{ (d_1 x)&#94;{d_1} d_{2}&#94;{d_2} }{ (d_1 x + d_2)&#94;{d_1 + d_2} } } !! \\frac{1}{x \\beta \\left( \\frac{d_1}{2}, \\frac{d_2}{2} \\right) } . class ( f_distribution ), intent ( in ) :: this !! The f_distribution object. real ( real64 ), intent ( in ) :: x !! The value at which to evaluate the function. real ( real64 ) :: rst !! The value of the function. ! Process real ( real64 ) :: d1 , d2 d1 = this % d1 d2 = this % d2 rst = ( 1.0d0 / beta ( 0.5d0 * d1 , 0.5d0 * d2 )) * ( d1 / d2 ) ** ( 0.5d0 * d1 ) * & x ** ( 0.5d0 * d1 - 1.0d0 ) * ( 1.0d0 + d1 * x / d2 ) ** ( - 0.5d0 * ( d1 + d2 )) end function ! ------------------------------------------------------------------------------ pure elemental function fd_cdf ( this , x ) result ( rst ) !! Computes the cumulative distribution function. !! !! The CDF for a F distribution is given as !!  F(x) = I_{d_1 x/(d_1 x + d_2)} \\left( \\frac{d_1}{2}, !! \\frac{d_2}{2} \\right) . class ( f_distribution ), intent ( in ) :: this !! The f_distribution object. real ( real64 ), intent ( in ) :: x !! The value at which to evaluate the function. real ( real64 ) :: rst !! The value of the function. ! Process real ( real64 ) :: d1 , d2 d1 = this % d1 d2 = this % d2 rst = regularized_beta ( 0.5d0 * d1 , 0.5d0 * d2 , d1 * x / ( d1 * x + d2 )) end function ! ------------------------------------------------------------------------------ pure function fd_mean ( this ) result ( rst ) !! Computes the mean of the distribution. class ( f_distribution ), intent ( in ) :: this !! The f_distribution object. real ( real64 ) :: rst !! The mean. ! Process if ( this % d2 > 2.0d0 ) then rst = this % d2 / ( this % d2 - 2.0d0 ) else rst = ieee_value ( rst , IEEE_QUIET_NAN ) end if end function ! ------------------------------------------------------------------------------ pure function fd_median ( this ) result ( rst ) !! Computes the median of the distribution. class ( f_distribution ), intent ( in ) :: this !! The f_distribution object. real ( real64 ) :: rst !! The median. rst = ieee_value ( rst , IEEE_QUIET_NAN ) end function ! ------------------------------------------------------------------------------ pure function fd_mode ( this ) result ( rst ) !! Computes the mode of the distribution. class ( f_distribution ), intent ( in ) :: this !! The f_distribution object. real ( real64 ) :: rst !! The mode. ! Process if ( this % d1 > 2.0d0 ) then rst = (( this % d1 - 2.0d0 ) / this % d1 ) * ( this % d2 / ( this % d2 + 2.0d0 )) else rst = ieee_value ( rst , IEEE_QUIET_NAN ) end if end function ! ------------------------------------------------------------------------------ pure function fd_variance ( this ) result ( rst ) !! Computes the variance of the distribution. class ( f_distribution ), intent ( in ) :: this !! The f_distribution object. real ( real64 ) :: rst !! The variance. ! Process real ( real64 ) :: d1 , d2 d1 = this % d1 d2 = this % d2 if ( d2 > 4.0d0 ) then rst = ( 2.0d0 * d2 ** 2 * ( d1 + d2 - 2.0d0 )) / & ( d1 * ( d2 - 2.0d0 ) ** 2 * ( d2 - 4.0d0 )) else rst = ieee_value ( rst , IEEE_QUIET_NAN ) end if end function ! ****************************************************************************** ! CHI-SQUARED DISTRIBUTION ! ------------------------------------------------------------------------------ pure elemental function cs_pdf ( this , x ) result ( rst ) !! Computes the probability density function. !! !! The PDF for a Chi-squared distribution is given as !!  f(x) = \\frac{x&#94;{k/2 - 1} \\exp{-x / 2}} {2&#94;{k / 2} !! \\Gamma \\left( \\frac{k}{2} \\right)} . class ( chi_squared_distribution ), intent ( in ) :: this !! The chi_squared_distribution object. real ( real64 ), intent ( in ) :: x !! The value at which to evaluate the function. real ( real64 ) :: rst !! The value of the function. ! Local Variables real ( real64 ) :: arg ! Process arg = 0.5d0 * this % dof rst = 1.0d0 / ( 2.0d0 ** arg * gamma ( arg )) * x ** ( arg - 1.0d0 ) * exp ( - 0.5d0 * x ) end function ! ------------------------------------------------------------------------------ pure elemental function cs_cdf ( this , x ) result ( rst ) !! Computes the cumulative distribution function. !! !! The CDF for a Chi-squared distribution is given as !!  F(x) = \\frac{ \\gamma \\left( \\frac{k}{2}, \\frac{x}{2} \\right) } !! { \\Gamma \\left( \\frac{k}{2} \\right)} . class ( chi_squared_distribution ), intent ( in ) :: this !! The chi_squared_distribution object. real ( real64 ), intent ( in ) :: x !! The value at which to evaluate the function. real ( real64 ) :: rst !! The value of the function. ! Local Variables real ( real64 ) :: arg ! Process arg = 0.5d0 * this % dof rst = incomplete_gamma_lower ( arg , 0.5d0 * x ) / gamma ( arg ) end function ! ------------------------------------------------------------------------------ pure function cs_mean ( this ) result ( rst ) !! Computes the mean of the distribution. class ( chi_squared_distribution ), intent ( in ) :: this !! The chi_squared_distribution object. real ( real64 ) :: rst !! The mean. ! Process rst = real ( this % dof , real64 ) end function ! ------------------------------------------------------------------------------ pure function cs_median ( this ) result ( rst ) !! Computes the median of the distribution. class ( chi_squared_distribution ), intent ( in ) :: this !! The chi_squared_distribution object. real ( real64 ) :: rst !! The median. ! Process rst = this % dof * ( 1.0d0 - 2.0d0 / ( 9.0d0 * this % dof )) ** 3 end function ! ------------------------------------------------------------------------------ pure function cs_mode ( this ) result ( rst ) !! Computes the mode of the distribution. class ( chi_squared_distribution ), intent ( in ) :: this !! The chi_squared_distribution object. real ( real64 ) :: rst !! The mode. ! Process rst = max ( this % dof - 2.0d0 , 0.0d0 ) end function ! ------------------------------------------------------------------------------ pure function cs_variance ( this ) result ( rst ) !! Computes the variance of the distribution. class ( chi_squared_distribution ), intent ( in ) :: this !! The chi_squared_distribution object. real ( real64 ) :: rst !! The variance. ! Process rst = 2.0d0 * this % dof end function ! ****************************************************************************** ! BINOMIAL DISTRIBUTION ! ------------------------------------------------------------------------------ pure elemental function bd_pdf ( this , x ) result ( rst ) !! Computes the probability mass function. !! !! The PMF for a binomial distribution is given as !!  f(k,n,p) = \\frac{n!}{k! \\left( n - k! \\right)} p&#94;k !! \\left( 1 - p \\right)&#94;{n-k} . class ( binomial_distribution ), intent ( in ) :: this !! The binomial_distribution object. real ( real64 ), intent ( in ) :: x !! The value at which to evaluate the function.  This parameter !! is the number k successes in the n independent trials.  As !! such, this parameter must exist on the set [0, n]. real ( real64 ) :: rst !! The value of the function. ! Local Variables real ( real64 ) :: dn ! Process dn = real ( this % n , real64 ) rst = ( factorial ( dn ) / ( factorial ( x ) * factorial ( dn - x ))) * ( this % p ** x ) * ( 1.0d0 - this % p ) ** ( dn - x ) end function ! ------------------------------------------------------------------------------ pure elemental function bd_cdf ( this , x ) result ( rst ) !! Computes the cumulative distribution funtion. !! !! The CDF for a binomial distribution is given as !!  F(k,n,p) = I_{1-p} \\left( n - k, 1 + k \\right) , which is simply !! the regularized incomplete beta function. class ( binomial_distribution ), intent ( in ) :: this !! The binomial_distribution object. real ( real64 ), intent ( in ) :: x !! The value at which to evaluate the function.  This parameter !! is the number k successes in the n independent trials.  As !! such, this parameter must exist on the set [0, n]. real ( real64 ) :: rst !! The value of the function. ! Local Variables real ( real64 ) :: dn ! Process dn = real ( this % n , real64 ) rst = regularized_beta ( dn - x , x + 1.0d0 , 1.0d0 - this % p ) end function ! ------------------------------------------------------------------------------ pure function bd_mean ( this ) result ( rst ) !! Computes the mean of the distribution. class ( binomial_distribution ), intent ( in ) :: this !! The binomial_distribution object. real ( real64 ) :: rst !! The mean. rst = real ( this % n * this % p , real64 ) end function ! ------------------------------------------------------------------------------ pure function bd_median ( this ) result ( rst ) !! Computes the median of the distribution. class ( binomial_distribution ), intent ( in ) :: this !! The binomial_distribution object. real ( real64 ) :: rst !! The median. rst = real ( this % n * this % p , real64 ) end function ! ------------------------------------------------------------------------------ pure function bd_mode ( this ) result ( rst ) !! Computes the mode of the distribution. class ( binomial_distribution ), intent ( in ) :: this !! The binomial_distribution object. real ( real64 ) :: rst !! The mode. rst = ( this % n + 1.0d0 ) * this % p end function ! ------------------------------------------------------------------------------ pure function bd_variance ( this ) result ( rst ) !! Computes the variance of the distribution. class ( binomial_distribution ), intent ( in ) :: this !! The binomial_distribution object. real ( real64 ) :: rst !! The variance. rst = this % n * this % p * ( 1.0d0 - this % p ) end function ! ------------------------------------------------------------------------------ end module","tags":"","loc":"sourcefile\\fstats_distributions.f90.html"},{"title":"fstats_sampling.f90 – FSTATS","text":"Source Code module fstats_sampling use iso_fortran_env use linalg , only : sort use fstats_distributions implicit none private public :: box_muller_sample public :: rejection_sample real ( real64 ), parameter :: pi = 2.0d0 * acos ( 0.0d0 ) real ( real64 ), parameter :: twopi = 2.0d0 * pi real ( real64 ), parameter :: pi_f = 2.0 * acos ( 0.0 ) real ( real64 ), parameter :: twopi_f = 2.0 * pi_f interface box_muller_sample !! Generates random, normally distributed values via the Box-Muller !! transform. module procedure :: box_muller_sample_scalar module procedure :: box_muller_array end interface contains ! ------------------------------------------------------------------------------ function box_muller_sample_scalar ( mu , sigma ) result ( rst ) !! Generates a pair of independent, standard, normally distributed !! random values using the Box-Muller transform. real ( real64 ), intent ( in ) :: mu !! The mean of the distribution. real ( real64 ), intent ( in ) :: sigma !! The standard deviation of the distribution. real ( real64 ) :: rst ( 2 ) !! The pair of random values. ! Parameters complex ( real64 ), parameter :: j = ( 0.0d0 , 1.0d0 ) ! Local Variables real ( real64 ) :: u1 , u2 complex ( real64 ) :: z ! Process call random_number ( u1 ) call random_number ( u2 ) z = sqrt ( - log ( u1 )) * exp ( j * twopi * u2 ) rst = [ real ( z , real64 ), aimag ( z )] end function ! ------------------------------------------------------------------------------ function box_muller_array ( mu , sigma , n ) result ( rst ) !! Generates an array of normally distributed random values sampled !! by the Box-Muller transform. real ( real64 ), intent ( in ) :: mu !! The mean of the distribution. real ( real64 ), intent ( in ) :: sigma !! The standard deviation of the distribution. integer ( int32 ), intent ( in ) :: n !! The number of Box-Muller pairs to generate. real ( real64 ), allocatable , dimension (:) :: rst !! A 2N-element array containing the N Box-Muller pairs. ! Local Variables integer ( int32 ) :: i ! Process if ( n < 1 ) then allocate ( rst ( 0 )) return end if allocate ( rst ( 2 * n )) do i = 1 , n rst ( 2 * i - 1 : 2 * i ) = box_muller_sample ( mu , sigma ) end do end function ! ****************************************************************************** ! REJECTION SAMPLING ! ------------------------------------------------------------------------------ function rejection_sample ( tdist , n , xmin , xmax ) result ( rst ) !! Uses rejection sampling to randomly sample a target distribution. class ( distribution ), intent ( in ) :: tdist !! The distribution to sample integer ( int32 ), intent ( in ) :: n !! The number of samples to make. real ( real64 ), intent ( in ) :: xmin !! The minimum range to explore. real ( real64 ), intent ( in ) :: xmax !! The maximum range to explore. real ( real64 ), allocatable , dimension (:) :: rst !! An N-element array containing the N samples from the !! distribution. ! Parameters real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: c_start = 1.01d0 ! Local Variables integer ( int32 ) :: i , j , jmax real ( real64 ) :: u , c , g , f , rng ! Quick Return if ( n < 1 ) then allocate ( rst ( 0 ), source = zero ) end if ! Process i = 0 j = 0 jmax = min ( 1000 * n , huge ( j )) ! Guard against insanity rng = xmax - xmin c = c_start allocate ( rst ( n ), source = zero ) do while ( i <= n ) ! Update the acceptance threshold call random_number ( u ) ! Sample from the proposal distribution call random_number ( g ) g = g * rng + xmin ! Sample the target distribution f = tdist % pdf ( g ) ! Test if ( u <= f / ( c * g )) then i = i + 1 rst ( i ) = g end if ! Update C c = max ( c , f / g ) ! Update the infinite loop guard variable j = j + 1 if ( j == jmax ) exit end do end function ! ------------------------------------------------------------------------------ end module","tags":"","loc":"sourcefile\\fstats_sampling.f90.html"},{"title":"fstats_special_functions.f90 – FSTATS","text":"Source Code module fstats_special_functions use iso_fortran_env use ieee_arithmetic implicit none private public :: beta public :: regularized_beta public :: incomplete_beta public :: incomplete_gamma_lower public :: incomplete_gamma_upper public :: digamma contains ! ------------------------------------------------------------------------------ pure elemental function beta ( a , b ) result ( rst ) !! Computes the beta function. !! !! The beta function is related to the gamma function !! by the following relationship. !!  \\beta(a,b) = \\frac{\\Gamma(a) \\Gamma(b)}{\\Gamma(a + b)} . !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Beta_function) real ( real64 ), intent ( in ) :: a !! The first argument of the function. real ( real64 ), intent ( in ) :: b !! The second argument of the function. real ( real64 ) :: rst !! The value of the beta function at  a  and  b . ! Process ! REF: https://en.wikipedia.org/wiki/Beta_function rst = exp ( log_gamma ( a ) + log_gamma ( b ) - log_gamma ( a + b )) end function ! ------------------------------------------------------------------------------ ! source: https://people.math.sc.edu/Burkardt/f_src/special_functions/special_functions.f90 pure elemental function regularized_beta ( a , b , x ) result ( rst ) !! Computes the regularized beta function. !! !! The regularized beta function is defined as the ratio between !! the incomplete beta function and the beta function. !!  I_{x}(a,b) = \\frac{\\beta(x;a,b)}{\\beta(a,b)} . !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Beta_function) real ( real64 ), intent ( in ) :: a !! The first argument of the function. real ( real64 ), intent ( in ) :: b !! The second argument of the function. real ( real64 ), intent ( in ) :: x !! The upper limit of the integration. real ( real64 ) :: rst !! The value of the regularized beta function. ! Local Variables real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: one = 1.0d0 real ( real64 ), parameter :: two = 2.0d0 real ( real64 ) :: bt , dk ( 51 ), fk ( 51 ), s0 , t1 , t2 , ta , tb integer ( int32 ) :: k ! Process s0 = ( a + one ) / ( a + b + two ) bt = beta ( a , b ) if ( x <= s0 ) then do k = 1 , 20 dk ( 2 * k ) = k * ( b - k ) * x / ( a + two * k - one ) / ( a + two * k ) end do do k = 0 , 20 dk ( 2 * k + 1 ) = - ( a + k ) * ( a + b + k ) * x / ( a + two * k ) / & ( a + two * k + one ) end do t1 = zero do k = 20 , 1 , - 1 t1 = dk ( k ) / ( one + t1 ) end do ta = one / ( one + t1 ) rst = x ** a * ( one - x ) ** b / ( a * bt ) * ta else do k = 1 , 20 fk ( 2 * k ) = k * ( a - k ) * ( one - x ) / ( b + two * k - one ) / & ( b + two * k ) end do do k = 0 , 20 fk ( 2 * k + 1 ) = - ( b + k ) * ( a + b + k ) * ( one - x ) / ( b + two * k ) / & ( b + two * k + one ) end do t2 = zero do k = 20 , 1 , - 1 t2 = fk ( k ) / ( one + t2 ) end do tb = one / ( one + t2 ) rst = one - x ** a * ( one - x ) ** b / ( b * bt ) * tb end if end function ! ------------------------------------------------------------------------------ pure elemental function incomplete_beta ( a , b , x ) result ( rst ) !! Computes the incomplete beta function. !! !! The incomplete beta function is defind as: !!  \\beta(x;a,b) = \\int_{0}&#94;{x} t&#94;{a-1} (1 - t)&#94;{b-1} dt . !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Beta_function#Incomplete_beta_function) real ( real64 ), intent ( in ) :: a !! The first argument of the function. real ( real64 ), intent ( in ) :: b !! The second argument of the function. real ( real64 ), intent ( in ) :: x !! The upper limit of the integration. real ( real64 ) :: rst !! The value of the incomplete beta function. ! Process rst = beta ( a , b ) * regularized_beta ( a , b , x ) end function ! ------------------------------------------------------------------------------ ! REF: https://people.math.sc.edu/Burkardt/f_src/special_functions/special_functions.f90 pure elemental function incomplete_gamma_upper ( a , x ) result ( rst ) !! Computes the upper incomplete gamma function. !! !! The upper incomplete gamma function is defined as: !!  \\Gamma(a, x) = \\int_{x}&#94;{\\infty} t&#94;{a-1} e&#94;{-t} \\,dt  !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Incomplete_gamma_function) real ( real64 ), intent ( in ) :: a !! The coefficient value. real ( real64 ), intent ( in ) :: x !! The value at which to evaluate the function. real ( real64 ) :: rst !! The function value. ! Parameters real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: one = 1.0d0 real ( real64 ), parameter :: ten = 1.0d1 ! Local Variables real ( real64 ) :: ga , gin , gip , r , s , t0 , xam , small integer ( int32 ) :: k ! Process small = ten * epsilon ( small ) xam = - x + a * log ( x ) if ( xam > 7.0d2 . or . a > 1.7d2 ) then rst = ieee_value ( rst , IEEE_QUIET_NAN ) return end if if ( x == zero ) then rst = gamma ( a ) else if ( x <= one + a ) then s = one / a r = s do k = 1 , 60 r = r * x / ( a + k ) s = s + r if ( abs ( r / s ) < small ) then exit end if end do gin = exp ( xam ) * s ga = gamma ( a ) gip = gin / ga rst = ga - gin else if ( one + a < x ) then t0 = zero do k = 60 , 1 , - 1 t0 = ( k - a ) / ( one + k / ( x + t0 )) end do rst = exp ( xam ) / ( x + t0 ) end if end function ! ------------------------------------------------------------------------------ pure elemental function incomplete_gamma_lower ( a , x ) result ( rst ) !! Computes the lower incomplete gamma function. !! !! The lower incomplete gamma function is defined as: !!  \\gamma(a, x) = \\int_{0}&#94;{x} t&#94;{a-1} e&#94;{-t} \\,dt  !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Incomplete_gamma_function) real ( real64 ), intent ( in ) :: a !! The coefficient value. real ( real64 ), intent ( in ) :: x !! The value at which to evaluate the function. real ( real64 ) :: rst !! The function value. ! Parameters real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: one = 1.0d0 real ( real64 ), parameter :: ten = 1.0d1 ! Local Variables real ( real64 ) :: ga , gim , r , s , t0 , xam , small integer ( int32 ) :: k ! Process small = ten * epsilon ( small ) xam = - x + a * log ( x ) if ( xam > 7.0d2 . or . a > 1.7d2 ) then rst = ieee_value ( rst , IEEE_QUIET_NAN ) return end if if ( x == zero ) then rst = 0.0d0 else if ( x <= one + a ) then s = one / a r = s do k = 1 , 60 r = r * x / ( a + k ) s = s + r if ( abs ( r / s ) < small ) then exit end if end do rst = exp ( xam ) * s else if ( one + a < x ) then t0 = zero do k = 60 , 1 , - 1 t0 = ( k - a ) / ( one + k / ( x + t0 )) end do gim = exp ( xam ) / ( x + t0 ) ga = gamma ( a ) rst = ga - gim end if end function ! ------------------------------------------------------------------------------ pure elemental function digamma ( x ) result ( rst ) !! Computes the digamma function. !! !! The digamma function is defined as: !!  \\psi(x) = !! \\frac{d}{dx}\\left( \\ln \\left( \\Gamma \\left( x \\right) \\right) !! \\right)  !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Digamma_function) real ( real64 ), intent ( in ) :: x !! The value at which to evaluate the function. real ( real64 ) :: rst !! The function value. ! Parameters real ( real64 ), parameter :: c = 8.5d0 real ( real64 ), parameter :: euler_mascheroni = 0.57721566490153286060d0 ! Local Variables real ( real64 ) :: r , x2 , nan ! REF: ! - https://people.sc.fsu.edu/~jburkardt/f_src/asa103/asa103.f90 ! If x <= 0.0 if ( x <= 0.0 ) then nan = ieee_value ( nan , IEEE_QUIET_NAN ) rst = nan return end if ! Approximation for a small argument if ( x <= 1.0d-6 ) then rst = - euler_mascheroni - 1.0d0 / x + 1.6449340668482264365d0 * x return end if ! Process rst = 0.0d0 x2 = x do while ( x2 < c ) rst = rst - 1.0d0 / x2 x2 = x2 + 1.0d0 end do r = 1.0d0 / x2 rst = rst + log ( x2 ) - 0.5d0 * r r = r * r rst = rst & - r * ( 1.0d0 / 1 2.0d0 & - r * ( 1.0d0 / 12 0.0d0 & - r * ( 1.0d0 / 25 2.0d0 & - r * ( 1.0d0 / 24 0.0d0 & - r * ( 1.0d0 / 13 2.0d0 ) & )))) end function ! ------------------------------------------------------------------------------ end module","tags":"","loc":"sourcefile\\fstats_special_functions.f90.html"},{"title":"fstats_regression.f90 – FSTATS","text":"Source Code module fstats_regression use iso_fortran_env use linalg use fstats_errors use blas use ferror use fstats_descriptive_statistics use fstats_distributions use fstats_special_functions use fstats_hypothesis implicit none private public :: iteration_controls public :: convergence_info public :: lm_solver_options public :: regression_function public :: iteration_update public :: regression_statistics public :: r_squared public :: adjusted_r_squared public :: correlation public :: coefficient_matrix public :: covariance_matrix public :: linear_least_squares public :: calculate_regression_statistics public :: jacobian public :: nonlinear_least_squares public :: FS_LEVENBERG_MARQUARDT_UPDATE public :: FS_QUADRATIC_UPDATE public :: FS_NIELSEN_UPDATE ! ****************************************************************************** ! CONSTANTS ! ------------------------------------------------------------------------------ integer ( int32 ), parameter :: FS_LEVENBERG_MARQUARDT_UPDATE = 1 integer ( int32 ), parameter :: FS_QUADRATIC_UPDATE = 2 integer ( int32 ), parameter :: FS_NIELSEN_UPDATE = 3 ! ****************************************************************************** ! TYPES ! ------------------------------------------------------------------------------ type regression_statistics !! A container for regression-related statistical information. real ( real64 ) :: standard_error !! The standard error for the model coefficient. !! !!  E_{s}(\\beta_{i}) = \\sqrt{\\sigma&#94;{2} C_{ii}}  real ( real64 ) :: t_statistic !! The T-statistic for the model coefficient. !! !!  t_o = \\frac{ \\beta_{i} }{E_{s}(\\beta_{i})}  real ( real64 ) :: probability !! The probability that the coefficient is not statistically !! important.  A statistically important coefficient will have a !! low probability (p-value), typically 0.05 or lower; however, a !! p-value of up to ~0.2 may be acceptable dependent upon the !! problem.  Typically any p-value larger than ~0.2 indicates the !! parameter is not statistically important for the model. !! !!  p = t_{|t_o|, df_{residual}}  real ( real64 ) :: confidence_interval !! The confidence interval for the parameter at the level !! determined by the regression process. !! !!  c = t_{\\alpha, df} E_{s}(\\beta_{i})  end type type iteration_controls !! Provides a collection of iteration control parameters. integer ( int32 ) :: max_iteration_count !! Defines the maximum number of iterations allowed. integer ( int32 ) :: max_function_evaluations !! Defines the maximum number of function evaluations allowed. real ( real64 ) :: gradient_tolerance !! Defines a tolerance on the gradient of the fitted function. real ( real64 ) :: change_in_solution_tolerance !! Defines a tolerance on the change in parameter values. real ( real64 ) :: residual_tolerance !! Defines a tolerance on the metric associated with the residual !! error. real ( real64 ) :: iteration_improvement_tolerance !! Defines a tolerance to ensure adequate improvement on each !! iteration. integer ( int32 ) :: max_iteration_between_updates !! Defines how many iterations can pass before a re-evaluation of !! the Jacobian matrix is forced. contains procedure , public :: set_to_default => lm_set_default_tolerances end type type convergence_info !! Provides information regarding convergence status. logical :: converge_on_gradient !! True if convergence on the gradient was achieved; else, false. real ( real64 ) :: gradient_value !! The value of the gradient test parameter. logical :: converge_on_solution_change !! True if convergence on the change in solution was achieved; else, !! false. real ( real64 ) :: solution_change_value !! The value of the change in solution parameter. logical :: converge_on_residual_parameter !! True if convergence on the residual error parameter was achieved; !! else, false. real ( real64 ) :: residual_value !! The value of the residual error parameter. logical :: reach_iteration_limit !! True if the solution did not converge in the allowed number of !! iterations. integer ( int32 ) :: iteration_count !! The iteration count. logical :: reach_function_evaluation_limit !! True if the solution did not converge in the allowed number of !! function evaluations. integer ( int32 ) :: function_evaluation_count !! The function evaluation count. logical :: user_requested_stop !! True if the user requested the stop; else, false. end type type lm_solver_options !! Options to control the Levenberg-Marquardt solver. integer ( int32 ) :: method !! The solver method to utilize. !! - FS_LEVENBERG_MARQUARDT_UPDATE: !! - FS_QUADRATIC_UPDATE: !! - FS_NIELSEN_UDPATE: real ( real64 ) :: finite_difference_step_size !! The step size used for the finite difference calculations of the !! Jacobian matrix. real ( real64 ) :: damping_increase_factor !! The factor to use when increasing the damping parameter. real ( real64 ) :: damping_decrease_factor !! The factor to use when decreasing the damping parameter. contains procedure , public :: set_to_default => lm_set_default_settings end type interface subroutine regression_function ( xdata , params , resid , stop ) use iso_fortran_env , only : real64 real ( real64 ), intent ( in ), dimension (:) :: xdata , params real ( real64 ), intent ( out ), dimension (:) :: resid logical , intent ( out ) :: stop end subroutine subroutine iteration_update ( iter , funvals , resid , params , step ) use iso_fortran_env , only : int32 , real64 integer ( int32 ), intent ( in ) :: iter real ( real64 ), intent ( in ) :: funvals (:), resid (:), params (:), step (:) end subroutine end interface contains ! ------------------------------------------------------------------------------ function r_squared ( x , xm , err ) result ( rst ) !! Computes the R-squared value for a data set. !! !! The R-squared value is computed by determining the sum of the squares !! of the residuals: !!  SS_{res} = \\Sigma \\left( y_i - f_i \\right)&#94;2  !! The total sum of the squares: !!  SS_{tot} = \\Sigma \\left( y_i - \\bar{y} \\right)&#94;2 . !! The R-squared value is then: !!  R&#94;2 = 1 - \\frac{SS_{res}}{SS_{tot}} . !! !! See Also: !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Coefficient_of_determination) real ( real64 ), intent ( in ) :: x (:) !! An N-element array containing the dependent variables from !! the data set. real ( real64 ), intent ( in ) :: xm (:) !! An N-element array containing the corresponding modeled !! values. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings !! to the caller.  Possible warning and error codes are as !! follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_ARRAY_SIZE_ERROR: Occurs if x and xm are not the !!   same size. real ( real64 ) :: rst !! The result. ! Parameters real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: one = 1.0d0 ! Local Variables integer ( int32 ) :: i , n real ( real64 ) :: esum , vt class ( errors ), pointer :: errmgr type ( errors ), target :: deferr ! Initialization if ( present ( err )) then errmgr => err else errmgr => deferr end if ! Input Check n = size ( x ) if ( size ( xm ) /= n ) then call report_array_size_error ( errmgr , \"r_squared_real64\" , \"XM\" , n , & size ( xm )) return end if ! Process esum = zero do i = 1 , n esum = esum + ( x ( i ) - xm ( i )) ** 2 end do vt = variance ( x ) * ( n - one ) rst = one - esum / vt end function ! ------------------------------------------------------------------------------ function adjusted_r_squared ( p , x , xm , err ) result ( rst ) !! Computes the adjusted R-squared value for a data set. !! !! The adjusted R-squared provides a mechanism for tempering the effects !! of extra explanatory variables on the traditional R-squared !! calculation.  It is computed by noting the sample size  n  and !! the number of variables  p . !!  \\bar{R}&#94;2 = 1 - \\left( 1 - R&#94;2 \\right) \\frac{n - 1}{n - p} . !! !! See Also: !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Coefficient_of_determination#Adjusted_R2) integer ( int32 ), intent ( in ) :: p !! The number of variables. real ( real64 ), intent ( in ) :: x (:) !! An N-element array containing the dependent variables from !! the data set. real ( real64 ), intent ( in ) :: xm (:) !! An N-element array containing the corresponding modeled !! values. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings !! to the caller.  Possible warning and error codes are as !! follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_ARRAY_SIZE_ERROR: Occurs if x and xm are not the !!   same size. real ( real64 ) :: rst !! The result. ! Local Variables integer ( int32 ) :: n real ( real64 ) :: r2 class ( errors ), pointer :: errmgr type ( errors ), target :: deferr ! Parameters real ( real64 ), parameter :: one = 1.0d0 ! Initialization if ( present ( err )) then errmgr => err else errmgr => deferr end if n = size ( x ) ! Process r2 = r_squared ( x , xm , errmgr ) if ( errmgr % has_error_occurred ()) return rst = one - ( one - r2 ) * ( n - one ) / ( n - p - one ) end function ! ------------------------------------------------------------------------------ pure function correlation ( x , y ) result ( rst ) !! Computes the sample correlation coefficient (an estimate to the !! population Pearson correlation) as follows. !! !!  r_{xy} = \\frac{cov(x, y)}{s_{x} s_{y}} . !! !! Where,  s_{x}  &  s_{y}  are the sample standard deviations of !! x and y respectively. real ( real64 ), intent ( in ), dimension (:) :: x !! The first N-element data set. real ( real64 ), intent ( in ), dimension ( size ( x )) :: y !! The second N-element data set. real ( real64 ) :: rst !! The correlation coefficient. ! Process rst = covariance ( x , y ) / ( standard_deviation ( x ) * standard_deviation ( y )) end function ! ------------------------------------------------------------------------------ subroutine coefficient_matrix ( order , intercept , x , c , err ) !! Computes the coefficient matrix  X  to the linear !! least-squares regression problem of  X \\beta = y , where !!  X  is the coefficient matrix computed here,  \\beta  is !! the vector of coefficients to be determined, and  y  is the !! vector of measured dependent variables. !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Linear_regression) integer ( int32 ), intent ( in ) :: order !! The order of the equation to fit.  This value must be !! at least one (linear equation), but can be higher as desired. logical , intent ( in ) :: intercept !! Set to true if the intercept is being computed !! as part of the regression; else, false. real ( real64 ), intent ( in ) :: x (:) !! An N-element array containing the independent variable !! measurement points. real ( real64 ), intent ( out ) :: c (:,:) !! An N-by-K matrix where the results will be written.  K !! must equal order + 1 in the event intercept is true; !! however, if intercept is false, K must equal order. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings to the !! caller.  Possible warning and error codes are as follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_ARRAY_SIZE_ERROR: Occurs if c is not properly sized. !! - FS_INVALID_INPUT_ERROR: Occurs if order is less than 1. ! Parameters real ( real64 ), parameter :: one = 1.0d0 ! Local Variables integer ( int32 ) :: i , start , npts , ncols class ( errors ), pointer :: errmgr type ( errors ), target :: deferr ! Initialization if ( present ( err )) then errmgr => err else errmgr => deferr end if npts = size ( x ) ncols = order if ( intercept ) ncols = ncols + 1 ! Input Check if ( order < 1 ) then call errmgr % report_error ( \"coefficient_matrix\" , & \"The model order must be at least one.\" , FS_INVALID_INPUT_ERROR ) return end if if ( size ( c , 1 ) /= npts . or . size ( c , 2 ) /= ncols ) then call report_matrix_size_error ( errmgr , \"coefficient_matrix\" , & \"c\" , npts , ncols , size ( c , 1 ), size ( c , 2 )) return end if ! Process if ( intercept ) then c (:, 1 ) = one c (:, 2 ) = x start = 3 else c (:, 1 ) = x start = 2 end if if ( start >= ncols ) return do i = start , ncols c (:, i ) = c (:, i - 1 ) * x end do end subroutine ! ------------------------------------------------------------------------------ subroutine covariance_matrix ( x , c , err ) !! Computes the covariance matrix  C  where !!  C = \\left( X&#94;{T} X \\right)&#94;{-1}  and  X  is computed !! by coefficient_matrix. !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Covariance_matrix) !! - [Wikipedia - Regression](https://en.wikipedia.org/wiki/Linear_regression) real ( real64 ), intent ( in ) :: x (:,:) !! An M-by-N matrix containing the formatted independent data !!  matrix  X  as computed by coefficient_matrix. real ( real64 ), intent ( out ) :: c (:,:) !! The N-by-N covariance matrix. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings to the !! caller.  Possible warning and error codes are as follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_ARRAY_SIZE_ERROR: Occurs if any of the matrices are not !!      sized correctly. !! - FS_MEMORY_ERROR: Occurs if there is a memory allocation !!      error. ! Parameters real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: one = 1.0d0 ! Local Variables class ( errors ), pointer :: errmgr type ( errors ), target :: deferr integer ( int32 ) :: npts , ncoeffs , flag real ( real64 ), allocatable :: xtx (:,:) ! Initialization if ( present ( err )) then errmgr => err else errmgr => deferr end if npts = size ( x , 1 ) ncoeffs = size ( x , 2 ) ! Input Checking if ( size ( c , 1 ) /= ncoeffs . or . size ( c , 2 ) /= ncoeffs ) then call report_matrix_size_error ( errmgr , \"covariance_matrix\" , & \"c\" , ncoeffs , ncoeffs , size ( c , 1 ), size ( c , 2 )) return end if ! Local Memory Allocation allocate ( xtx ( ncoeffs , ncoeffs ), stat = flag ) if ( flag /= 0 ) then call report_memory_error ( errmgr , \"covariance_matrix\" , flag ) return end if ! Compute X**T * X call DGEMM ( \"T\" , \"N\" , ncoeffs , ncoeffs , npts , one , x , npts , x , npts , & zero , xtx , ncoeffs ) ! Compute the inverse of X**T * X to obtain the covariance matrix call mtx_pinverse ( xtx , c , err = errmgr ) if ( errmgr % has_error_occurred ()) return end subroutine ! ------------------------------------------------------------------------------ subroutine linear_least_squares ( order , intercept , x , y , coeffs , & ymod , resid , stats , alpha , err ) !! Computes a linear least-squares regression to fit a set of data. !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Linear_regression) !! - [SPC Excel Understanding Regression Statistics](https://www.spcforexcel.com/knowledge/root-cause-analysis/understanding-regression-statistics-part-1) integer ( int32 ), intent ( in ) :: order !! The order of the equation to fit.  This value must be at !! least one (linear equation), but can be higher as desired, !! as long as there is sufficient data. logical , intent ( in ) :: intercept !! Set to true if the intercept is being computed as part of !! the regression; else, false. real ( real64 ), intent ( in ) :: x (:) !! An N-element array containing the independent variable !! measurement points. real ( real64 ), intent ( in ) :: y (:) !! An N-element array containing the dependent variable !! measurement points. real ( real64 ), intent ( out ) :: coeffs (:) !! An ORDER+1 element array where the coefficients will be written. real ( real64 ), intent ( out ) :: ymod (:) !! An N-element array where the modeled data will be written. real ( real64 ), intent ( out ) :: resid (:) !! An N-element array where the residual error data will be !! written (modeled - actual). type ( regression_statistics ), intent ( out ), optional :: stats (:) !! An M-element array of regression_statistics items where !! M = ORDER + 1 when intercept is set to true; however, if !! intercept is set to false, M = ORDER. real ( real64 ), intent ( in ), optional :: alpha !! The significance level at which to evaluate the confidence !! intervals.  The default value is 0.05 such that a 95% !! confidence interval is calculated. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings to the !! caller.  Possible warning and error codes are as follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not !!      approriately sized. !! - FS_INVALID_INPUT_ERROR: Occurs if order is less than 1. !! - FS_MEMORY_ERROR: Occurs if there is a memory allocation !!      error. ! Parameters real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: half = 0.5d0 real ( real64 ), parameter :: one = 1.0d0 ! Local Variables integer ( int32 ) :: i , npts , ncols , ncoeffs , flag real ( real64 ) :: alph , var , df , ssr , talpha real ( real64 ), allocatable :: a (:,:), c (:,:), cxt (:,:) type ( t_distribution ) :: dist class ( errors ), pointer :: errmgr type ( errors ), target :: deferr ! Initialization if ( present ( err )) then errmgr => err else errmgr => deferr end if npts = size ( x ) ncoeffs = order + 1 ncols = order if ( intercept ) ncols = ncols + 1 alph = 0.05d0 if ( present ( alpha )) alph = alpha ! Input Check if ( order < 1 ) then call errmgr % report_error ( \"linear_least_squares\" , & \"The model order must be at least one.\" , FS_INVALID_INPUT_ERROR ) return end if if ( size ( y ) /= npts ) then call report_array_size_error ( errmgr , \"linear_least_squares\" , & \"y\" , npts , size ( y )) return end if if ( size ( coeffs ) /= ncoeffs ) then call report_array_size_error ( errmgr , \"linear_least_squares\" , & \"coeffs\" , ncoeffs , size ( coeffs )) return end if if ( size ( ymod ) /= npts ) then call report_array_size_error ( errmgr , \"linear_least_squares\" , & \"ymod\" , npts , size ( ymod )) return end if if ( size ( resid ) /= npts ) then call report_array_size_error ( errmgr , \"linear_least_squares\" , & \"resid\" , npts , size ( resid )) return end if if ( present ( stats )) then if ( size ( stats ) /= ncols ) then call report_array_size_error ( errmgr , & \"linear_least_squares\" , \"stats\" , ncols , size ( stats )) return end if end if ! Memory Allocation allocate ( a ( npts , ncols ), stat = flag ) if ( flag == 0 ) allocate ( c ( ncols , ncols ), stat = flag ) if ( flag == 0 ) allocate ( cxt ( ncols , npts ), stat = flag ) if ( flag /= 0 ) then call report_memory_error ( errmgr , \"linear_least_squares\" , flag ) return end if ! Compute the coefficient matrix call coefficient_matrix ( order , intercept , x , a , errmgr ) if ( errmgr % has_error_occurred ()) return ! Compute the covariance matrix call covariance_matrix ( a , c , errmgr ) if ( errmgr % has_error_occurred ()) return ! Compute the coefficients (NCOLS-by-1) call DGEMM ( \"N\" , \"T\" , ncols , npts , ncols , one , c , ncols , a , npts , zero , & cxt , ncols ) ! C * X**T i = 2 coeffs ( 1 ) = zero if ( intercept ) i = 1 call DGEMM ( \"N\" , \"N\" , ncols , 1 , npts , one , cxt , ncols , y , npts , zero , & coeffs ( i :), ncols ) ! (C * X**T) * Y ! Evaluate the model and compute the residuals call DGEMM ( \"N\" , \"N\" , npts , 1 , ncols , one , a , npts , coeffs ( i :), & ncols , zero , ymod , npts ) resid = ymod - y ! If the user doesn't want the statistics calculations we can stop now if (. not . present ( stats )) return ! Start the process of computing statistics stats = calculate_regression_statistics ( resid , coeffs ( i :), c , alph , & errmgr ) end subroutine ! ------------------------------------------------------------------------------ function calculate_regression_statistics ( resid , params , c , alpha , err ) & result ( rst ) !! Computes statistics for the quality of fit for a regression !! model. real ( real64 ), intent ( in ) :: resid (:) !! An M-element array containing the model residual errors. real ( real64 ), intent ( in ) :: params (:) !! An N-element array containing the model parameters. real ( real64 ), intent ( in ) :: c (:,:) !! The N-by-N covariance matrix. real ( real64 ), intent ( in ), optional :: alpha !! The significance level at which to evaluate the confidence !! intervals.  The default value is 0.05 such that a 95% !! confidence interval is calculated. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings to the !! caller.  Possible warning and error codes are as follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_ARRAY_SIZE_ERROR: Occurs if c is not sized correctly. !! - FS_INVALID_INPUT_ERROR: Occurs if order is less than 1. !! - FS_MEMORY_ERROR: Occurs if there is a memory allocation !!      error. type ( regression_statistics ), allocatable :: rst (:) !! A regression_statistics object containing the analysis results. ! Parameters real ( real64 ), parameter :: p05 = 0.05d0 real ( real64 ), parameter :: half = 0.5d0 real ( real64 ), parameter :: one = 1.0d0 ! Local Variables integer ( int32 ) :: i , m , n , dof , flag real ( real64 ) :: a , ssr , var , talpha type ( t_distribution ) :: dist class ( errors ), pointer :: errmgr type ( errors ), target :: deferr ! Initialization if ( present ( err )) then errmgr => err else errmgr => deferr end if ! Initialization m = size ( resid ) n = size ( params ) dof = m - n if ( present ( alpha )) then a = alpha else a = p05 end if allocate ( rst ( n ), stat = flag ) if ( flag /= 0 ) then end if ! Input Checking if ( size ( c , 1 ) /= n . or . size ( c , 2 ) /= n ) then end if ! Process ssr = norm2 ( resid ) ** 2 ! sum of the squares of the residual var = ssr / dof dist % dof = real ( dof , real64 ) talpha = confidence_interval ( dist , a , one , 1 ) do i = 1 , n rst ( i )% standard_error = sqrt ( var * c ( i , i )) rst ( i )% t_statistic = params ( i ) / rst ( i )% standard_error rst ( i )% probability = regularized_beta ( & half * dof , & half , & real ( dof , real64 ) / ( dof + ( rst ( i )% t_statistic ) ** 2 ) & ) rst ( i )% confidence_interval = talpha * rst ( i )% standard_error end do end function ! ------------------------------------------------------------------------------ subroutine jacobian ( fun , xdata , params , & jac , stop , f0 , f1 , step , err ) !! Computes the Jacobian matrix for a nonlinear regression problem. procedure ( regression_function ), intent ( in ), pointer :: fun !! A pointer to the regression_function to evaluate. real ( real64 ), intent ( in ) :: xdata (:) !! The M-element array containing x-coordinate data. real ( real64 ), intent ( in ) :: params (:) !! The N-element array containing the model parameters. real ( real64 ), intent ( out ) :: jac (:,:) !! The M-by-N matrix where the Jacobian will be written. logical , intent ( out ) :: stop !! A value that the user can set in fun forcing the !! evaluation process to stop prior to completion. real ( real64 ), intent ( in ), optional , target :: f0 (:) !! An optional M-element array containing the model values !!  using the current parameters as defined in m.  This input !! can be used to prevent the routine from performing a !! function evaluation at the model parameter state defined in !! params. real ( real64 ), intent ( out ), optional , target :: f1 (:) !! An optional M-element workspace array used for function !! evaluations. real ( real64 ), intent ( in ), optional :: step !! The differentiation step size.  The default is the square !! root of machine precision. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings to the !! caller.  Possible warning and error codes are as follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not !!      properly sized. !! - FS_MEMORY_ERROR: Occurs if there is a memory allocation !!      error. ! Local Variables real ( real64 ) :: h integer ( int32 ) :: m , n , flag , expected , actual real ( real64 ), pointer :: f1p (:), f0p (:) real ( real64 ), allocatable , target :: f1a (:), f0a (:), work (:) class ( errors ), pointer :: errmgr type ( errors ), target :: deferr ! Initialization if ( present ( err )) then errmgr => err else errmgr => deferr end if if ( present ( step )) then h = step else h = sqrt ( epsilon ( h )) end if m = size ( xdata ) n = size ( params ) ! Input Size Checking if ( size ( jac , 1 ) /= m . or . size ( jac , 2 ) /= n ) then call report_matrix_size_error ( errmgr , \"jacobian\" , & \"JAC\" , m , n , size ( jac , 1 ), size ( jac , 2 )) return end if if ( present ( f0 )) then ! Check Size if ( size ( f0 ) /= m ) then call report_array_size_error ( errmgr , \"jacobian\" , & \"F0\" , m , size ( f0 )) return end if f0p ( 1 : m ) => f0 else ! Allocate space, and fill the array with the current function ! results allocate ( f0a ( m ), stat = flag ) if ( flag /= 0 ) go to 20 f0p ( 1 : m ) => f0a call fun ( xdata , params , f0p , stop ) if ( stop ) return end if if ( present ( f1 )) then ! Check Size if ( size ( f1 ) /= m ) then call report_array_size_error ( errmgr , \"jacobian\" , & \"F1\" , m , size ( f1 )) return end if f1p ( 1 : m ) => f1 else ! Allocate space allocate ( f1a ( m ), stat = flag ) if ( flag /= 0 ) go to 20 f1p ( 1 : m ) => f1a end if ! Allocate a workspace array the same size as params allocate ( work ( n ), stat = flag ) if ( flag /= 0 ) go to 20 ! Compute the Jacobian call jacobian_finite_diff ( fun , xdata , params , f0p , jac , f1p , & stop , h , work ) ! End return ! Memroy Allocation Error Handling 20 continue call report_memory_error ( errmgr , \"jacobian\" , flag ) return end subroutine ! ------------------------------------------------------------------------------ subroutine nonlinear_least_squares ( fun , x , y , params , ymod , & resid , weights , maxp , minp , stats , alpha , controls , settings , info , & status , err ) !! Performs a nonlinear regression to fit a model using a version !! of the Levenberg-Marquardt algorithm. procedure ( regression_function ), intent ( in ), pointer :: fun !! A pointer to the regression_function to evaluate. real ( real64 ), intent ( in ) :: x (:) !! The M-element array containing independent data. real ( real64 ), intent ( in ) :: y (:) !! The M-element array containing dependent data. real ( real64 ), intent ( inout ) :: params (:) !! On input, the N-element array containing the initial estimate !! of the model parameters.  On output, the computed model !! parameters. real ( real64 ), intent ( out ) :: ymod (:) !! An M-element array where the modeled dependent data will !! be written. real ( real64 ), intent ( out ) :: resid (:) !! An M-element array where the model residuals will be !! written. real ( real64 ), intent ( in ), optional , target :: weights (:) !! An optional M-element array allowing the weighting of !! individual points. real ( real64 ), intent ( in ), optional , target :: maxp (:) !! An optional N-element array that can be used as upper limits !! on the parameter values.  If no upper limit is requested for !! a particular parameter, utilize a very large value.  The !! internal default is to utilize huge() as a value. real ( real64 ), intent ( in ), optional , target :: minp (:) !! An optional N-element array that can be used as lower limits !! on the parameter values.  If no lower limit is requested for !! a particalar parameter, utilize a very large magnitude, but !! negative, value.  The internal default is to utilize -huge() !! as a value. type ( regression_statistics ), intent ( out ), optional :: stats (:) !! An optional N-element array that, if supplied, will be used !! to return statistics about the fit for each parameter. real ( real64 ), intent ( in ), optional :: alpha !! The significance level at which to evaluate the confidence !! intervals.  The default value is 0.05 such that a 95% !! confidence interval is calculated. type ( iteration_controls ), intent ( in ), optional :: controls !! An optional input providing custom iteration controls. type ( lm_solver_options ), intent ( in ), optional :: settings !! An optional input providing custom settings for the solver. type ( convergence_info ), intent ( out ), optional , target :: info !! An optional output that can be used to gain information about !! the iterative solution and the nature of the convergence. procedure ( iteration_update ), intent ( in ), pointer , optional :: status !! An optional pointer to a routine that can be used to extract !! iteration information. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings to the !! caller.  Possible warning and error codes are as follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not !!      properly sized. !! - FS_MEMORY_ERROR: Occurs if there is a memory allocation !!      error. !! - FS_UNDERDEFINED_PROBLEM_ERROR: Occurs if the problem posed !!      is underdetetermined (M < N). !! - FS_TOLERANCE_TOO_SMALL_ERROR: Occurs if any supplied !!      tolerances are too small to be practical. !! - FS_TOO_FEW_ITERATION_ERROR: Occurs if too few iterations !!      are allowed. ! Parameters real ( real64 ), parameter :: too_small = 1.0d-14 integer ( int32 ), parameter :: min_iter_count = 2 integer ( int32 ), parameter :: min_fun_count = 10 integer ( int32 ), parameter :: min_update_count = 1 ! Local Variables logical :: stop integer ( int32 ) :: m , n , actual , expected , flag real ( real64 ), pointer :: w (:), pmax (:), pmin (:) real ( real64 ), allocatable , target :: defaultWeights (:), maxparam (:), & minparam (:), JtWJ (:,:) type ( iteration_controls ) :: tol type ( lm_solver_options ) :: opt type ( convergence_info ) :: cInfo class ( errors ), pointer :: errmgr type ( errors ), target :: deferr type ( convergence_info ), target :: defaultinfo type ( convergence_info ), pointer :: inf ! Initialization stop = . false . m = size ( x ) n = size ( params ) if ( present ( info )) then inf => info else inf => defaultinfo end if if ( present ( err )) then errmgr => err else errmgr => deferr end if if ( present ( controls )) then tol = controls else call tol % set_to_default () end if if ( present ( settings )) then opt = settings else call opt % set_to_default () end if ! Input Checking if ( size ( y ) /= m ) then call report_array_size_error ( errmgr , \"nonlinear_least_squares\" , & \"y\" , m , size ( y )) return end if if ( size ( ymod ) /= m ) then call report_array_size_error ( errmgr , \"nonlinear_least_squares\" , & \"ymod\" , m , size ( ymod )) return end if if ( size ( resid ) /= m ) then call report_array_size_error ( errmgr , \"nonlinear_least_squares\" , & \"resid\" , m , size ( resid )) return end if if ( m < n ) then call report_underdefined_error ( errmgr , & \"nonlinear_least_squares\" , n , m ) return end if ! Tolerance Checking if ( tol % gradient_tolerance < too_small ) then call errmgr % report_error ( \"nonlinear_least_squares\" , & \"The gradient tolerance was found to be too small.\" , & FS_TOLERANCE_TOO_SMALL_ERROR ) return end if if ( tol % change_in_solution_tolerance < too_small ) then call errmgr % report_error ( \"nonlinear_least_squares\" , & \"The change in solution tolerance was found to be too small.\" , & FS_TOLERANCE_TOO_SMALL_ERROR ) return end if if ( tol % residual_tolerance < too_small ) then call errmgr % report_error ( \"nonlinear_least_squares\" , & \"The residual error tolerance was found to be too small.\" , & FS_TOLERANCE_TOO_SMALL_ERROR ) return end if if ( tol % iteration_improvement_tolerance < too_small ) then call errmgr % report_error ( \"nonlinear_least_squares\" , & \"The iteration improvement tolerance was found to be too small.\" , & FS_TOLERANCE_TOO_SMALL_ERROR ) return end if ! Iteration Count Checking if ( tol % max_iteration_count < min_iter_count ) then call report_iteration_count_error ( errmgr , & \"nonlinear_least_squares\" , & \"Too few iterations were specified.\" , & min_iter_count ) return end if if ( tol % max_function_evaluations < min_fun_count ) then call report_iteration_count_error ( errmgr , & \"nonlinear_least_squares\" , & \"Too few function evaluations were specified.\" , & min_fun_count ) return end if if ( tol % max_iteration_between_updates < min_update_count ) then call report_iteration_count_error ( errmgr , & \"nonlinear_least_squares\" , & \"Too few iterations between updates were specified.\" , & min_update_count ) return end if ! Optional Array Arguments (weights, parameter limits, etc.) if ( present ( weights )) then if ( size ( weights ) < m ) then call report_array_size_error ( errmgr , & \"nonlinear_least_squares\" , \"weights\" , m , size ( weights )) return end if w ( 1 : m ) => weights ( 1 : m ) else allocate ( defaultWeights ( m ), source = 1.0d0 , stat = flag ) if ( flag /= 0 ) go to 50 w ( 1 : m ) => defaultWeights ( 1 : m ) end if if ( present ( maxp )) then if ( size ( maxp ) /= n ) then call report_array_size_error ( errmgr , & \"nonlinear_least_squares\" , \"maxp\" , n , size ( maxp )) return end if pmax ( 1 : n ) => maxp ( 1 : n ) else allocate ( maxparam ( n ), source = huge ( 1.0d0 ), stat = flag ) if ( flag /= 0 ) go to 50 pmax ( 1 : n ) => maxparam ( 1 : n ) end if if ( present ( minp )) then if ( size ( minp ) /= n ) then call report_array_size_error ( errmgr , & \"nonlinear_least_squares\" , \"minp\" , n , size ( minp )) return end if pmin ( 1 : n ) => minp ( 1 : n ) else allocate ( minparam ( n ), source = - huge ( 1.0d0 ), stat = flag ) if ( flag /= 0 ) go to 50 pmin ( 1 : n ) => minparam ( 1 : n ) end if ! Local Memory Allocations allocate ( JtWJ ( n , n ), stat = flag ) if ( flag /= 0 ) go to 50 ! Process call lm_solve ( fun , x , y , params , w , pmax , pmin , tol , opt , ymod , & resid , JtWJ , inf , stop , errmgr , status ) ! Statistical Parameters if ( present ( stats )) then if ( size ( stats ) /= n ) then call report_array_size_error ( errmgr , & \"nonlinear_least_squares\" , \"stats\" , n , size ( stats )) return end if ! Compute the covariance matrix call mtx_inverse ( JtWJ , err = errmgr ) if ( errmgr % has_error_occurred ()) return ! Compute the statistics stats = calculate_regression_statistics ( resid , params , JtWJ , & alpha , errmgr ) end if ! End return ! Memory Error Handler 50 continue call report_memory_error ( errmgr , \"nonlinear_least_squares\" , flag ) return end subroutine ! ****************************************************************************** ! SETTINGS DEFAULTS ! ------------------------------------------------------------------------------ ! Sets up default tolerances. subroutine lm_set_default_tolerances ( x ) ! Arguments class ( iteration_controls ), intent ( inout ) :: x ! Set defaults x % max_iteration_count = 500 x % max_function_evaluations = 5000 x % max_iteration_between_updates = 10 x % gradient_tolerance = 1.0d-8 x % residual_tolerance = 0.5d-2 x % change_in_solution_tolerance = 1.0d-6 x % iteration_improvement_tolerance = 1.0d-1 end subroutine ! ------------------------------------------------------------------------------ ! Sets up default solver settings. subroutine lm_set_default_settings ( x ) ! Arguments class ( lm_solver_options ), intent ( inout ) :: x ! Set defaults x % method = FS_LEVENBERG_MARQUARDT_UPDATE x % finite_difference_step_size = sqrt ( epsilon ( 1.0d0 )) x % damping_increase_factor = 1 1.0d0 x % damping_decrease_factor = 9.0d0 end subroutine ! ****************************************************************************** ! PRIVATE ROUTINES ! ------------------------------------------------------------------------------ ! Computes the Jacobian matrix via a forward difference. ! ! Inputs: ! - fun: The function to evaluate ! - xdata: The independent coordinate data to fit (M-by-1) ! - params: The model parameters (N-by-1) ! - f0: The current model estimate (M-by-1) ! - step: The differentiation step size ! ! Outputs: ! - jac: The Jacobian matrix (M-by-N) ! - f1: A workspace array for the model output (M-by-1) ! - stop: A flag allowing the user to terminate model execution ! - work: A workspace array for the model parameters (N-by-1) subroutine jacobian_finite_diff ( fun , xdata , params , f0 , jac , f1 , & stop , step , work ) ! Arguments procedure ( regression_function ), intent ( in ), pointer :: fun real ( real64 ), intent ( in ) :: xdata (:), params (:) real ( real64 ), intent ( in ) :: f0 (:) real ( real64 ), intent ( out ) :: jac (:,:) real ( real64 ), intent ( out ) :: f1 (:), work (:) logical , intent ( out ) :: stop real ( real64 ), intent ( in ) :: step ! Local Variables integer ( int32 ) :: i , n ! Initialization n = size ( params ) ! Cycle over each column of the Jacobian and calculate the derivative ! via a forward difference scheme ! ! J(i,j) = df(i) / dx(j) work = params do i = 1 , n work ( i ) = work ( i ) + step call fun ( xdata , work , f1 , stop ) if ( stop ) return jac (:, i ) = ( f1 - f0 ) / step work ( i ) = params ( i ) end do end subroutine ! ------------------------------------------------------------------------------ ! Computes a rank-1 update to the Jacobian matrix ! ! Inputs: ! - pOld: previous set of parameters (N-by-1) ! - yOld: model evaluation at previous set of parameters (M-by-1) ! - jac: current Jacobian estimate (M-by-N) ! - p: current set of parameters (N-by-1) ! - y: model evaluation at current set of parameters (M-by-1) ! ! Outputs: ! - jac: updated Jacobian matrix (M-by-N) (dy * dp**T + J) ! - dp: p - pOld (N-by-1) ! - dy: (y - yOld - J * dp) / (dp' * dp) (M-by-1) subroutine broyden_update ( pOld , yOld , jac , p , y , dp , dy ) ! Arguments real ( real64 ), intent ( in ) :: pOld (:), yOld (:), p (:), y (:) real ( real64 ), intent ( inout ) :: jac (:,:) real ( real64 ), intent ( out ) :: dp (:), dy (:) ! Local Variables real ( real64 ) :: h2 ! Process dp = p - pOld h2 = dot_product ( dp , dp ) dy = y - yOld - matmul ( jac , dp ) dy = dy / h2 call rank1_update ( 1.0d0 , dy , dp , jac ) end subroutine ! ------------------------------------------------------------------------------ ! Updates the Levenberg-Marquardt matrix by either computing a new Jacobian ! matrix or performing a rank-1 update to the existing Jacobian matrix. ! ! Inputs: ! - fun: The function to evaluate ! - xdata: The independent coordinate data to fit (M-by-1) ! - ydata: The dependent coordinate data to fit (M-by-1) ! - pOld: previous set of parameters (N-by-1) ! - yOld: model evaluation at previous set of parameters (M-by-1) ! - dX2: The previous change in the Chi-squared criteria ! - jac: current Jacobian estimate (M-by-N) ! - p: current set of parameters (N-by-1) ! - weights: A weighting vector (M-by-1) ! - neval: Current number of function evaluations ! - update: Set to true to force an update of the Jacobian; else, set to !       false to let the program choose based upon the change in the !       Chi-squared parameter. ! - step: The differentiation step size ! ! Outputs: ! - JtWJ: linearized Hessian matrix (inverse of the covariance matrix) (N-by-N) ! - JtWdy: linearized fitting vector (N-by-1) ! - X2: Updated Chi-squared criteria ! - yNew: model evaluated with parameters of p (M-by-1) ! - jac: updated Jacobian matrix (M-by-N) ! - neval: updated count of function evaluations ! - stop: A flag allowing the user to terminate model execution ! - work: A workspace array (N+M-by-1) ! - mwork: A workspace matrix (N-by-M) ! - update: Reset to false if a Jacobian evaluation was performed. subroutine lm_matrix ( fun , xdata , ydata , pOld , yOld , dX2 , jac , p , weights , & neval , update , step , JtWJ , JtWdy , X2 , yNew , stop , work , mwork ) ! Arguments procedure ( regression_function ), pointer :: fun real ( real64 ), intent ( in ) :: xdata (:), ydata (:), pOld (:), yOld (:), & p (:), weights (:) real ( real64 ), intent ( in ) :: dX2 , step real ( real64 ), intent ( inout ) :: jac (:,:) integer ( int32 ), intent ( inout ) :: neval logical , intent ( inout ) :: update real ( real64 ), intent ( out ) :: JtWJ (:,:), JtWdy (:) real ( real64 ), intent ( out ) :: X2 , mwork (:,:), yNew (:) logical , intent ( out ) :: stop real ( real64 ), intent ( out ), target :: work (:) ! Local Variables integer ( int32 ) :: m , n real ( real64 ), pointer :: w1 (:), w2 (:) ! Initialization m = size ( xdata ) n = size ( p ) w1 ( 1 : m ) => work ( 1 : m ) w2 ( 1 : n ) => work ( m + 1 : n + m ) ! Perform the next function evaluation call fun ( xdata , p , yNew , stop ) neval = neval + 1 if ( stop ) return ! Update or recompute the Jacobian matrix if ( dX2 > 0 . or . update ) then ! Recompute the Jacobian call jacobian_finite_diff ( fun , xdata , p , yNew , jac , w1 , & stop , step , w2 ) neval = neval + n if ( stop ) return update = . false . else ! Simply perform a rank-1 update to the Jacobian call broyden_update ( pOld , yOld , jac , p , yNew , w2 , w1 ) end if ! Update the Chi-squared estimate w1 = ydata - yNew X2 = dot_product ( w1 , w1 * weights ) ! Compute J**T * (W .* dY) w1 = w1 * weights call mtx_mult (. true ., 1.0d0 , jac , w1 , 0.0d0 , JtWdy ) ! Update the Hessian ! First: J**T * W = MWORK ! Second: (J**T * W) * J call diag_mtx_mult (. false ., . true ., 1.0d0 , weights , jac , 0.0d0 , mwork ) call mtx_mult (. false ., . false ., 1.0d0 , mwork , jac , 0.0d0 , JtWJ ) end subroutine ! ------------------------------------------------------------------------------ ! Performs a single iteration of the Levenberg-Marquardt algorithm. ! ! Inputs: ! - fun: The function to evaluate ! - xdata: The independent coordinate data to fit (M-by-1) ! - ydata: The dependent coordinate data to fit (M-by-1) ! - p: current set of parameters (N-by-1) ! - neval: current number of function evaluations ! - niter: current iteration number ! - update: set to 1 to use Marquardt's modification; else, ! - step: the differentiation step size ! - lambda: LM damping parameter ! - maxP: maximum limits on the parameters.  Use huge() or larger for no constraints (N-by-1) ! - minP: minimum limits on the parameters.  Use -huge() or smaller for no constraints (N-by-1) ! - weights: a weighting vector (M-by-1) ! - JtWJ: linearized Hessian matrix (inverse of the covariance matrix) (N-by-N) ! - JtWdy: linearized fitting vector (N-by-1) ! ! Outputs: ! - JtWJ: overwritten LU factorization of the original matrix (N-by-N) ! - h: The new estimate of the change in parameter (N-by-1) ! - pNew: The new parameter estimates (N-by-1) ! - deltaY: The new difference between data and model (M-by-1) ! - yNew: model evaluated with parameters of pNew (M-by-1) ! - neval: updated count of function evaluations ! - niter: updated current iteration number ! - X2: updated Chi-squared criteria ! - stop: A flag allowing the user to terminate model execution ! - iwork: A workspace array (N-by-1) ! - err: An error handling mechanism subroutine lm_iter ( fun , xdata , ydata , p , neval , niter , update , lambda , & maxP , minP , weights , JtWJ , JtWdy , h , pNew , deltaY , yNew , X2 , X2Old , & alpha , stop , iwork , err , status ) ! Arguments procedure ( regression_function ), pointer :: fun real ( real64 ), intent ( in ) :: xdata (:), ydata (:), p (:), maxP (:), & minP (:), weights (:), JtWdy (:) real ( real64 ), intent ( in ) :: lambda , X2Old integer ( int32 ), intent ( inout ) :: neval , niter integer ( int32 ), intent ( in ) :: update real ( real64 ), intent ( inout ) :: JtWJ (:,:) real ( real64 ), intent ( out ) :: h (:), pNew (:), deltaY (:), yNew (:) real ( real64 ), intent ( out ) :: X2 , alpha logical , intent ( out ) :: stop integer ( int32 ), intent ( out ) :: iwork (:) class ( errors ), intent ( inout ) :: err procedure ( iteration_update ), intent ( in ), pointer , optional :: status ! Local Variables integer ( int32 ) :: i , n real ( real64 ) :: dpJh ! Initialization n = size ( p ) ! Increment the iteration counter niter = niter + 1 ! Solve the linear system to determine the change in parameters ! A is N-by-N and is stored in JtWJ ! b is N-by-1 if ( update == FS_LEVENBERG_MARQUARDT_UPDATE ) then ! Compute: h = A \\ b ! A = J**T * W * J + lambda * diag(J**T * W * J) ! b = J**T * W * dy do i = 1 , n JtWJ ( i , i ) = JtWJ ( i , i ) * ( 1.0d0 + lambda ) h ( i ) = JtWdy ( i ) end do else ! Compute: h = A \\ b ! A = J**T * W * J + lambda * I ! b = J**T * W * dy do i = 1 , n JtWJ ( i , i ) = JtWJ ( i , i ) + lambda h ( i ) = JtWdy ( i ) end do end if call lu_factor ( JtWJ , iwork , err ) ! overwrites JtWJ with [L\\U] if ( err % has_error_occurred ()) return ! if JtWJ is singular call solve_lu ( JtWJ , iwork , h ) ! solution stored in h ! Compute the new attempted solution, and apply any constraints do i = 1 , n pNew ( i ) = min ( max ( minP ( i ), h ( i ) + p ( i )), maxP ( i )) end do ! Update the residual error call fun ( xdata , pNew , yNew , stop ) neval = neval + 1 deltaY = ydata - yNew if ( stop ) return ! Update the Chi-squared estimate X2 = dot_product ( deltaY , deltaY * weights ) ! Perform a quadratic line update in the H direction, if necessary if ( update == FS_QUADRATIC_UPDATE ) then dpJh = dot_product ( JtWdy , h ) alpha = abs ( dpJh / ( 0.5d0 * ( X2 - X2Old ) + 2.0d0 * dpJh )) h = alpha * h do i = 1 , n pNew ( i ) = min ( max ( minP ( i ), p ( i ) + h ( i )), maxP ( i )) end do call fun ( xdata , pNew , yNew , stop ) if ( stop ) return neval = neval + 1 deltaY = ydata - yNew X2 = dot_product ( deltaY , deltaY * weights ) end if ! Update the status of the iteration, if needed if ( present ( status )) then call status ( niter , yNew , deltaY , pNew , h ) end if end subroutine ! ------------------------------------------------------------------------------ ! A Levenberg-Marquardt solver. ! ! Inputs: ! - fun: The function to evaluate ! - xdata: The independent coordinate data to fit (M-by-1) ! - ydata: The dependent coordinate data to fit (M-by-1) ! - p: current set of parameters (N-by-1) ! - weights: a weighting vector (M-by-1) ! - maxP: maximum limits on the parameters.  Use huge() or larger for no constraints (N-by-1) ! - minP: minimum limits on the parameters.  Use -huge() or smaller for no constraints (N-by-1) ! - controls: an iteration_controls instance containing solution tolerances ! ! Outputs: ! - p: solution (N-by-1) ! - y: model results at p (M-by-1) ! - resid: residual (ydata - y) (M-by-1) ! - JtWJ: linearized Hessian matrix (inverse of the covariance matrix) (N-by-N) ! - opt: a convergence_info object containing information regarding !       convergence of the iteration ! - stop: A flag allowing the user to terminate model execution ! - err: An error handling object subroutine lm_solve ( fun , xdata , ydata , p , weights , maxP , minP , controls , & opt , y , resid , JtWJ , info , stop , err , status ) ! Arguments procedure ( regression_function ), intent ( in ), pointer :: fun real ( real64 ), intent ( in ) :: xdata (:), ydata (:), weights (:), maxP (:), & minP (:) real ( real64 ), intent ( inout ) :: p (:) class ( iteration_controls ), intent ( in ) :: controls class ( lm_solver_options ), intent ( in ) :: opt real ( real64 ), intent ( out ) :: y (:), resid (:), JtWJ (:,:) class ( convergence_info ), intent ( out ) :: info logical , intent ( out ) :: stop class ( errors ), intent ( inout ) :: err procedure ( iteration_update ), intent ( in ), pointer , optional :: status ! Local Variables logical :: update integer ( int32 ) :: i , m , n , dof , flag , neval , niter , nupdate real ( real64 ) :: dX2 , X2 , X2Old , X2Try , lambda , alpha , nu , step real ( real64 ), allocatable :: pOld (:), yOld (:), J (:,:), JtWdy (:), & work (:), mwork (:,:), pTry (:), yTemp (:), JtWJc (:,:), h (:) integer ( int32 ), allocatable :: iwork (:) character ( len = :), allocatable :: errmsg ! Initialization update = . true . m = size ( xdata ) n = size ( p ) dof = m - n niter = 0 step = opt % finite_difference_step_size stop = . false . info % user_requested_stop = . false . nupdate = 0 ! Local Memory Allocation allocate ( pOld ( n ), source = 0.0d0 , stat = flag ) if ( flag == 0 ) allocate ( yOld ( m ), source = 0.0d0 , stat = flag ) if ( flag == 0 ) allocate ( J ( m , n ), stat = flag ) if ( flag == 0 ) allocate ( JtWdy ( n ), stat = flag ) if ( flag == 0 ) allocate ( work ( m + n ), stat = flag ) if ( flag == 0 ) allocate ( mwork ( n , m ), stat = flag ) if ( flag == 0 ) allocate ( pTry ( n ), stat = flag ) if ( flag == 0 ) allocate ( h ( n ), stat = flag ) if ( flag == 0 ) allocate ( yTemp ( m ), stat = flag ) if ( flag == 0 ) allocate ( JtWJc ( n , n ), stat = flag ) if ( flag == 0 ) allocate ( iwork ( n ), stat = flag ) if ( flag /= 0 ) go to 10 ! Perform an initial function evaluation call fun ( xdata , p , y , stop ) neval = 1 ! Evaluate the problem matrices call lm_matrix ( fun , xdata , ydata , pOld , yOld , 1.0d0 , J , p , weights , & neval , update , step , JtWJ , JtWdy , X2 , y , stop , work , mwork ) if ( stop ) go to 5 X2Old = X2 JtWJc = JtWJ ! Determine an initial value for lambda if ( opt % method == FS_LEVENBERG_MARQUARDT_UPDATE ) then lambda = 1.0d-2 else call extract_diagonal ( JtWJ , work ( 1 : n )) lambda = 1.0d-2 * maxval ( work ( 1 : n )) nu = 2.0d0 end if ! Main Loop main : do while ( niter < controls % max_iteration_count ) ! Compute the linear solution at the current solution estimate and ! update the new parameter estimates call lm_iter ( fun , xdata , ydata , p , neval , niter , opt % method , & lambda , maxP , minP , weights , JtWJc , JtWdy , h , pTry , resid , & yTemp , X2Try , X2Old , alpha , stop , iwork , err , status ) if ( stop ) go to 5 if ( err % has_error_occurred ()) return ! Update the Chi-squared estimate, update the damping parameter ! lambda, and, if necessary, update the matrices call lm_update ( fun , xdata , ydata , pOld , p , pTry , yOld , y , h , dX2 , & X2Old , X2 , X2Try , lambda , alpha , nu , JtWdy , JtWJ , J , weights , & niter , neval , update , step , work , mwork , controls , opt , stop ) if ( stop ) go to 5 JtWJc = JtWJ ! Determine the matrix update scheme nupdate = nupdate + 1 if ( opt % method == FS_QUADRATIC_UPDATE ) then update = mod ( niter , 2 * n ) > 0 else if ( nupdate >= controls % max_iteration_between_updates ) then update = . true . nupdate = 0 end if ! Test for convergence if ( lm_check_convergence ( controls , dof , resid , niter , neval , & JtWdy , h , p , X2 , info )) & then exit main end if end do main ! End return ! User Requested End 5 continue info % user_requested_stop = . true . return ! Memory Error Handling 10 continue allocate ( character ( len = 512 ) :: errmsg ) write ( errmsg , 100 ) \"Memory allocation error code \" , flag , \".\" call err % report_error ( \"lm_solve\" , & trim ( errmsg ), FS_MEMORY_ERROR ) return ! Formatting 100 format ( A , I0 , A ) end subroutine ! ------------------------------------------------------------------------------ ! subroutine lm_update ( fun , xdata , ydata , pOld , p , pTry , yOld , y , h , dX2 , & X2old , X2 , X2try , lambda , alpha , nu , JtWdy , JtWJ , J , weights , niter , & neval , update , step , work , mwork , controls , opt , stop ) ! Arguments procedure ( regression_function ), intent ( in ), pointer :: fun real ( real64 ), intent ( in ) :: xdata (:), ydata (:), X2try , h (:), step , & pTry (:), weights (:), alpha real ( real64 ), intent ( inout ) :: pOld (:), p (:), yOld (:), y (:), lambda , & JtWdy (:), dX2 , X2 , X2old , JtWJ (:,:), J (:,:), nu real ( real64 ), intent ( out ) :: work (:), mwork (:,:) integer ( int32 ), intent ( in ) :: niter integer ( int32 ), intent ( inout ) :: neval logical , intent ( inout ) :: update class ( iteration_controls ), intent ( in ) :: controls class ( lm_solver_options ), intent ( in ) :: opt logical , intent ( out ) :: stop ! Local Variables integer ( int32 ) :: n real ( real64 ) :: rho ! Initialization n = size ( p ) ! Process if ( opt % method == FS_LEVENBERG_MARQUARDT_UPDATE ) then call extract_diagonal ( JtWJ , work ( 1 : n )) work ( 1 : n ) = lambda * work ( 1 : n ) * h + JtWdy else work ( 1 : n ) = lambda * h + JtWdy end if rho = ( X2 - X2try ) / abs ( dot_product ( h , work ( 1 : n ))) if ( rho > controls % iteration_improvement_tolerance ) then ! Things are getting better at an acceptable rate dX2 = X2 - X2old X2old = X2 pOld = p yOld = y p = pTry ! Recompute the matrices call lm_matrix ( fun , xdata , ydata , pOld , yOld , dX2 , J , p , weights , & neval , update , step , JtWJ , JtWdy , X2 , y , stop , work , mwork ) if ( stop ) return ! Decrease lambda select case ( opt % method ) case ( FS_LEVENBERG_MARQUARDT_UPDATE ) lambda = max ( lambda / opt % damping_decrease_factor , 1.0d-7 ) case ( FS_QUADRATIC_UPDATE ) lambda = max ( lambda / ( 1.0d0 + alpha ), 1.0d-7 ) case ( FS_NIELSEN_UPDATE ) lambda = lambda * max ( 1.0d0 / 3.0d0 , & 1.0d0 - ( 2.0d0 * rho - 1.0d0 ** 3 )) nu = 2.0d0 end select else ! The iteration is not improving in a satisfactory manner X2 = X2old if ( mod ( niter , 2 * n ) /= 0 ) then call lm_matrix ( fun , xdata , ydata , pOld , yOld , - 1.0d0 , J , p , & weights , neval , update , step , JtWJ , JtWdy , dX2 , y , stop , & work , mwork ) if ( stop ) return end if ! Increase lambda select case ( opt % method ) case ( FS_LEVENBERG_MARQUARDT_UPDATE ) lambda = min ( lambda * opt % damping_increase_factor , 1.0d7 ) case ( FS_QUADRATIC_UPDATE ) lambda = lambda + abs (( X2try - X2 ) / 2.0d0 / alpha ) case ( FS_NIELSEN_UPDATE ) lambda = lambda * nu nu = 2.0d0 * nu end select end if end subroutine ! ------------------------------------------------------------------------------ ! Checks the Levenberg-Marquardt solution against the convergence criteria. ! ! Inputs: ! - controls: the solution controls and convergence criteria ! - dof: the statistical degrees of freedom of the system (M - N) ! - resid: the residual error (M-by-1) ! - niter: the number of iterations ! - neval: the number of function evaluations ! - JtWdy: linearized fitting vector (N-by-1) ! - h: the change in parameter (solution) values (N-by-1) ! - p: the parameter (solution) values (N-by-1) ! - X2: the Chi-squared estimate ! ! Outputs: ! - info: The convergence information. ! - rst: True if convergence was achieved; else, false. function lm_check_convergence ( controls , dof , resid , niter , neval , & JtWdy , h , p , X2 , info ) result ( rst ) ! Arguments class ( iteration_controls ), intent ( in ) :: controls real ( real64 ), intent ( in ) :: resid (:), JtWdy (:), h (:), p (:), X2 integer ( int32 ), intent ( in ) :: dof , niter , neval class ( convergence_info ), intent ( out ) :: info logical :: rst ! Initialization rst = . false . ! Iteration Checks info % iteration_count = niter if ( niter >= controls % max_iteration_count ) then info % reach_iteration_limit = . true . rst = . true . else info % reach_iteration_limit = . false . end if info % function_evaluation_count = neval if ( neval >= controls % max_function_evaluations ) then info % reach_function_evaluation_limit = . true . rst = . true . else info % reach_function_evaluation_limit = . false . end if info % gradient_value = maxval ( abs ( JtWdy )) if ( info % gradient_value < controls % gradient_tolerance . and . niter > 2 ) & then info % converge_on_gradient = . true . rst = . true . else info % converge_on_gradient = . false . end if info % solution_change_value = maxval ( abs ( h ) / ( abs ( p ) + 1.0d-12 )) if ( info % solution_change_value < & controls % change_in_solution_tolerance . and . niter > 2 ) & then info % converge_on_solution_change = . true . rst = . true . else info % converge_on_solution_change = . false . end if info % residual_value = X2 / dof if ( info % residual_value < controls % residual_tolerance . and . niter > 2 ) & then info % converge_on_residual_parameter = . true . rst = . true . else info % converge_on_residual_parameter = . false . end if end function ! ------------------------------------------------------------------------------ end module","tags":"","loc":"sourcefile\\fstats_regression.f90.html"},{"title":"fstats_allan.f90 – FSTATS","text":"Source Code module fstats_allan use iso_fortran_env use fstats_errors implicit none private public :: allan_variance contains ! ------------------------------------------------------------------------------ ! REF: Yadav, Shrikanth & Shastri, Saurav & Chakravarthi, Ghanashyam & Kumar, ! Viraj & Rao, Divya & Agrawal, Vinod. (2018). A Fast, Parallel Algorithm for ! Fully Overlapped Allan Variance and Total Variance for Analysis and Modeling ! of Noise in Inertial Sensors. IEEE Sensors Letters. PP. 1-1. ! 10.1109/LSENS.2018.2829799. ! ! https://www.researchgate.net/publication/324738301_A_Fast_Parallel_Algorithm_for_Fully_Overlapped_Allan_Variance_and_Total_Variance_for_Analysis_and_Modeling_of_Noise_in_Inertial_Sensors ! https://github.com/shrikanth95/Fast-Parallel-Fully-Overlapped-Allan-Variance-and-Total-Variance/blob/master/fast_FOAV.m function allan_variance ( x , dt , err ) result ( rst ) !! Computes the Allan variance of a data set. !! !! Remarks !! !! This implementation computes the fully overlapped Allan variance !! using the method presented by Yadav et. al. !! !! Yadav, Shrikanth & Shastri, Saurav & Chakravarthi, Ghanashyam & Kumar, !! Viraj & Rao, Divya & Agrawal, Vinod. (2018). A Fast, Parallel Algorithm !! for Fully Overlapped Allan Variance and Total Variance for Analysis and !! Modeling of Noise in Inertial Sensors. IEEE Sensors Letters. PP. 1-1. !! 10.1109/LSENS.2018.2829799. real ( real64 ), intent ( in ), dimension (:) :: x !! The N-element data set to analyze. real ( real64 ), intent ( in ), optional :: dt !! An optional input specifying the time increment between !! samples in x.  If not specified, this value is set to 1. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings to the !! caller.  Possible warning and error codes are as follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_MEMORY_ERROR: Occurs if there is a memory allocation !!      error. real ( real64 ), allocatable , dimension (:,:) :: rst !! An M-by-2 array containing the results where M is N / 2 - 1 !! if N is even; else, M is (N - 1) / 2 - 1 if N is odd.  The !! first column contains the averaging times associated with !! the M results stored in the second column. ! Local Variables class ( errors ), pointer :: errmgr type ( errors ), target :: deferr integer ( int32 ) :: flag , j , m , n , limit , nr real ( real64 ), allocatable , dimension (:) :: tall1 , tall2 real ( real64 ) :: temp , deltaT ! Initialization if ( present ( err )) then errmgr => err else errmgr => deferr end if if ( present ( dt )) then deltaT = dt else deltaT = 1.0d0 end if ! Initialization n = size ( x ) limit = n nr = floor ( 0.5 * n ) - 1 allocate ( tall1 ( n - 1 ), source = x (: n - 1 ), stat = flag ) if ( flag == 0 ) allocate ( tall2 ( n - 1 ), source = x ( 2 : n )) if ( flag == 0 ) allocate ( rst ( nr , 2 ), source = 0.0d0 ) if ( flag /= 0 ) go to 10 ! Process do m = 1 , nr temp = 0.0d0 do j = 1 , limit - 1 temp = temp + ( tall2 ( j ) - tall1 ( j )) ** 2 tall1 ( j ) = tall1 ( j ) + x ( min ( n , m + j )) tall2 ( j ) = tall2 ( min ( n - 1 , j + 1 )) + x ( min ( n , 2 * m + j + 1 )) end do limit = limit - 2 rst ( m , 1 ) = dt * m rst ( m , 2 ) = temp / ( 2.0d0 * ( n - 2 * m + 1 ) * m ** 2 ) end do ! End return ! Memory Error Handling 10 continue call report_memory_error ( errmgr , \"allan_variance\" , flag ) return end function ! ------------------------------------------------------------------------------ end module","tags":"","loc":"sourcefile\\fstats_allan.f90.html"},{"title":"fstats_helper_routines.f90 – FSTATS","text":"Source Code module fstats_helper_routines use iso_fortran_env implicit none private public :: difference public :: factorial contains ! ------------------------------------------------------------------------------ pure function difference ( x ) result ( rst ) !! Computes the difference between elements in an array. real ( real64 ), intent ( in ), dimension (:) :: x !! The N-element array on which to operate. real ( real64 ), allocatable , dimension (:) :: rst !! The (N-1)-element array containing the differences between adjacent !! elements. ! Local Variables integer ( int32 ) :: i , n ! Process n = size ( x ) allocate ( rst ( n - 1 )) do i = 1 , n - 1 rst ( i ) = x ( i + 1 ) - x ( i ) end do end function ! ------------------------------------------------------------------------------ pure elemental function factorial ( x ) result ( rst ) !! Computes the factorial of X. real ( real64 ), intent ( in ) :: x !! The value whose factorial is to be computed. real ( real64 ) :: rst !! The result. rst = gamma ( x + 1.0d0 ) end function ! ------------------------------------------------------------------------------ end module","tags":"","loc":"sourcefile\\fstats_helper_routines.f90.html"},{"title":"fstats_hypothesis.f90 – FSTATS","text":"Source Code module fstats_hypothesis use iso_fortran_env use ieee_arithmetic use fstats_errors use fstats_special_functions use fstats_distributions use fstats_descriptive_statistics private public :: confidence_interval public :: t_test_equal_variance public :: t_test_unequal_variance public :: t_test_paired public :: f_test interface confidence_interval !! Computes the confidence interval for the specified distribution. !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Confidence_interval) module procedure :: confidence_interval_scalar module procedure :: confidence_interval_array end interface contains ! ------------------------------------------------------------------------------ pure function confidence_interval_scalar ( dist , alpha , s , n ) result ( rst ) !! Computes the confidence interval for the specified distribution. class ( distribution ), intent ( in ) :: dist !! The distribution object defining the probability distribution !! to establish the confidence level. real ( real64 ), intent ( in ) :: alpha !! The probability value of interest.  For instance, use a value of 0.05 !! for a confidence level of 95%. real ( real64 ), intent ( in ) :: s !! The sample standard deviation. integer ( int32 ), intent ( in ) :: n !! The number of samples in the data set. real ( real64 ) :: rst !! The result. ! Local Variables integer ( int32 ), parameter :: maxiter = 100 real ( real64 ), parameter :: tol = 1.0d-6 integer ( int32 ) :: i real ( real64 ) :: x , f , df , h , twoh , dy ! Process ! ! We use a simplified Newton's method to solve for the independent variable ! of the CDF function where it equals 1 - alpha / 2. h = 1.0d-6 twoh = 2.0d0 * h x = 1.0d0 - alpha / 2.0d0 rst = 0.5d0 do i = 1 , maxiter ! Compute the CDF and its derivative at y f = dist % cdf ( rst ) - x df = ( dist % cdf ( rst + h ) - dist % cdf ( rst - h )) / twoh dy = f / df rst = rst - dy if ( abs ( dy ) < tol ) exit end do ! Determine the actual interval rst = rst * s / sqrt ( real ( n , real64 )) end function ! ------------------------------------------------------------------------------ pure function confidence_interval_array ( dist , alpha , x ) result ( rst ) !! Computes the confidence interval for the specified distribution. class ( distribution ), intent ( in ) :: dist !! The distribution object defining the probability distribution !! to establish the confidence level. real ( real64 ), intent ( in ) :: alpha !! The probability value of interest.  For instance, use a value of 0.05 !! for a confidence level of 95%. real ( real64 ), intent ( in ) :: x (:) !! An N-element array containing the data to analyze. real ( real64 ) :: rst !! The result. ! Process rst = confidence_interval ( dist , alpha , standard_deviation ( x ), size ( x )) end function ! ------------------------------------------------------------------------------ subroutine t_test_equal_variance ( x1 , x2 , stat , p , dof ) !! Computes the 2-tailed Student's T-Test for two data sets of !! assumed equivalent variances. !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Student%27s_t-test) real ( real64 ), intent ( in ) :: x1 (:) !! An N-element array containing the first data set. real ( real64 ), intent ( in ) :: x2 (:) !! An M-element array containing the second data set. real ( real64 ), intent ( out ) :: stat !! The Student-'s T-Test statistic. real ( real64 ), intent ( out ) :: p !! The probability value that the two samples are likely to !! have come from two underlying populations that !! have the same mean. real ( real64 ), intent ( out ) :: dof !! The degrees of freedom. ! Parameters real ( real64 ), parameter :: half = 0.5d0 real ( real64 ), parameter :: one = 1.0d0 real ( real64 ), parameter :: two = 2.0d0 ! Local Variables real ( real64 ) :: v1 , v2 , m1 , m2 , sv , a , b , x integer ( int32 ) :: n1 , n2 ! Compute the T-statistic n1 = size ( x1 ) n2 = size ( x2 ) m1 = mean ( x1 ) m2 = mean ( x2 ) v1 = variance ( x1 ) v2 = variance ( x2 ) dof = n1 + n2 - two sv = (( n1 - one ) * v1 + ( n2 - one ) * v2 ) / dof stat = abs ( m1 - m2 ) / sqrt ( sv * ( one / real ( n1 ) + one / real ( n2 ))) ! Compute the probability a = half * dof b = half x = dof / ( dof + stat ** 2 ) p = regularized_beta ( a , b , x ) end subroutine ! ------------------------------------------------------------------------------ subroutine t_test_unequal_variance ( x1 , x2 , stat , p , dof ) !! Computes the 2-tailed Student's T-Test for two data sets of !! assumed non-equivalent variances. !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Student%27s_t-test) real ( real64 ), intent ( in ) :: x1 (:) !! An N-element array containing the first data set. real ( real64 ), intent ( in ) :: x2 (:) !! An M-element array containing the second data set. real ( real64 ), intent ( out ) :: stat !! The Student-'s T-Test statistic. real ( real64 ), intent ( out ) :: p !! The probability value that the two samples are likely to !! have come from two underlying populations that !! have the same mean. real ( real64 ), intent ( out ) :: dof !! The degrees of freedom. ! Parameters real ( real64 ), parameter :: half = 0.5d0 real ( real64 ), parameter :: one = 1.0d0 ! Local Variables real ( real64 ) :: v1 , v2 , m1 , m2 , sv , a , b , x integer ( int32 ) :: n1 , n2 ! Compute the T-statistic n1 = size ( x1 ) n2 = size ( x2 ) m1 = mean ( x1 ) m2 = mean ( x2 ) v1 = variance ( x1 ) v2 = variance ( x2 ) dof = ( v1 / real ( n1 ) + v2 / real ( n2 )) ** 2 / (( v1 / n1 ) ** 2 / ( n1 - one ) + & ( v2 / n2 ) ** 2 / ( n2 - one )) sv = sqrt ( v1 / n1 + v2 / n2 ) stat = ( m1 - m2 ) / sv ! Compute the probability a = half * dof b = half x = dof / ( dof + stat ** 2 ) p = regularized_beta ( a , b , x ) end subroutine ! ------------------------------------------------------------------------------ subroutine t_test_paired ( x1 , x2 , stat , p , dof , err ) !! Computes the 2-tailed Student's T-Test for two paired data sets. !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Student%27s_t-test) real ( real64 ), intent ( in ) :: x1 (:) !! An N-element array containing the first data set. real ( real64 ), intent ( in ) :: x2 (:) !! An N-element array containing the second data set. real ( real64 ), intent ( out ) :: stat !! The Student-'s T-Test statistic. real ( real64 ), intent ( out ) :: p !! The probability value that the two samples are likely to !! have come from  two underlying populations that !! have the same mean. real ( real64 ), intent ( out ) :: dof !! The degrees of freedom. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings to the !! caller.  Possible warning and error codes are as follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_ARRAY_SIZE_ERROR: Occurs if x1 and x2 are not the same !!   length. ! Parameters real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: half = 0.5d0 real ( real64 ), parameter :: one = 1.0d0 real ( real64 ), parameter :: two = 2.0d0 ! Local Variables class ( errors ), pointer :: errmgr type ( errors ), target :: deferr real ( real64 ) :: v1 , v2 , m1 , m2 , sd , cov , a , b , x integer ( int32 ) :: i , n1 , n2 , n ! Initialization if ( present ( err )) then errmgr => err else errmgr => deferr end if n1 = size ( x1 ) n2 = size ( x2 ) n = min ( n1 , n2 ) ! Input Checking if ( n1 /= n2 ) then call report_arrays_not_same_size_error ( errmgr , \"t_test_paired_real64\" , & \"X1\" , \"X2\" , n1 , n2 ) return end if ! Compute the T-statistic m1 = mean ( x1 ) m2 = mean ( x2 ) v1 = variance ( x1 ) v2 = variance ( x2 ) dof = real ( n1 ) - one cov = zero do i = 1 , n cov = cov + ( x1 ( i ) - m1 ) * ( x2 ( i ) - m2 ) end do cov = cov / dof sd = sqrt (( v1 + v2 - two * cov ) / n ) stat = ( m1 - m2 ) / sd ! Compute the probability a = half * dof b = half x = dof / ( dof + stat ** 2 ) p = regularized_beta ( a , b , x ) end subroutine ! ------------------------------------------------------------------------------ subroutine f_test ( x1 , x2 , stat , p , dof1 , dof2 ) !! Computes the F-test and returns the probability (two-tailed) that !! the variances of two data sets are not significantly different. !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/F-test) real ( real64 ), intent ( in ) :: x1 (:) !! An N-element array containing the first data set. real ( real64 ), intent ( in ) :: x2 (:) !! An M-element array containing the second data set. real ( real64 ), intent ( out ) :: stat !! The F-statistic. real ( real64 ), intent ( out ) :: p !! The probability value that the two samples are likely to !! have come from the two underlying populations that !! have the same variance. real ( real64 ), intent ( out ) :: dof1 !! A measure of the degrees of freedom. real ( real64 ), intent ( out ) :: dof2 !! A measure of the degrees of freedom. ! Parameters real ( real64 ), parameter :: half = 0.5d0 real ( real64 ), parameter :: one = 1.0d0 real ( real64 ), parameter :: two = 2.0d0 ! Local Variables integer ( int32 ) :: n1 , n2 real ( real64 ) :: v1 , v2 , m1 , m2 , a , b , x ! Compute the F-statistic n1 = size ( x1 ) n2 = size ( x2 ) m1 = mean ( x1 ) m2 = mean ( x2 ) v1 = variance ( x1 ) v2 = variance ( x2 ) if ( v1 > v2 ) then stat = v1 / v2 dof1 = n1 - one dof2 = n2 - one else stat = v2 / v1 dof1 = n2 - one dof2 = n1 - one end if ! Compute the probability a = half * dof2 b = half * dof1 x = dof2 / ( dof2 + dof1 * stat ) p = two * regularized_beta ( a , b , x ) if ( p > one ) p = two - p end subroutine ! ------------------------------------------------------------------------------ end module","tags":"","loc":"sourcefile\\fstats_hypothesis.f90.html"},{"title":"fstats_errors.f90 – FSTATS","text":"Source Code ! A module providing a set of routines to handle errors for the FSTATS library. module fstats_errors use ferror use iso_fortran_env , only : int32 implicit none ! ****************************************************************************** ! ERROR CODES ! ------------------------------------------------------------------------------ integer ( int32 ), parameter :: FS_NO_ERROR = 0 integer ( int32 ), parameter :: FS_ARRAY_SIZE_ERROR = 10000 integer ( int32 ), parameter :: FS_MATRIX_SIZE_ERROR = 10001 integer ( int32 ), parameter :: FS_INVALID_INPUT_ERROR = 10002 integer ( int32 ), parameter :: FS_MEMORY_ERROR = 10003 integer ( int32 ), parameter :: FS_UNDERDEFINED_PROBLEM_ERROR = 10004 integer ( int32 ), parameter :: FS_TOLERANCE_TOO_SMALL_ERROR = 10005 integer ( int32 ), parameter :: FS_TOO_FEW_ITERATION_ERROR = 10006 ! ------------------------------------------------------------------------------ integer ( int32 ), private , parameter :: MESSAGE_SIZE = 1024 contains ! ------------------------------------------------------------------------------ subroutine report_memory_error ( err , fname , code ) !! Reports a memory allocation related error. class ( errors ), intent ( inout ) :: err !! The error handling object. character ( len = * ), intent ( in ) :: fname !! The name of the routine in which the error occurred. integer ( int32 ), intent ( in ) :: code !! The error code returned by the allocation routine. ! Variables character ( len = MESSAGE_SIZE ) :: msg ! Process write ( msg , 100 ) & \"A memory allocation error occurred with code \" , code , \".\" call err % report_error ( fname , trim ( msg ), FS_MEMORY_ERROR ) ! Formatting 100 format ( A , I0 , A ) end subroutine ! ------------------------------------------------------------------------------ subroutine report_array_size_error ( err , fname , name , expect , actual ) !! Reports an array size error. class ( errors ), intent ( inout ) :: err !! The error handling object. character ( len = * ), intent ( in ) :: fname !! The name of the routine in which the error occurred. character ( len = * ), intent ( in ) :: name !! The name of the array. integer ( int32 ), intent ( in ) :: expect !! The expected size of the array. integer ( int32 ), intent ( in ) :: actual !! The actual size of the array. ! Variables character ( len = MESSAGE_SIZE ) :: msg ! Process write ( msg , 100 ) \"Expected array \" // name // \" to be of length \" , & expect , \", but found it to be of length \" , actual , \".\" call err % report_error ( fname , trim ( msg ), FS_ARRAY_SIZE_ERROR ) ! Formatting 100 format ( A , I0 , A , I0 , A ) end subroutine ! ------------------------------------------------------------------------------ subroutine report_matrix_size_error ( err , fname , name , expect_rows , & expect_cols , actual_rows , actual_cols ) !! Reports a matrix size error. class ( errors ), intent ( inout ) :: err !! The error handling object. character ( len = * ), intent ( in ) :: fname !! The name of the routine in which the error occurred. character ( len = * ), intent ( in ) :: name !! The name of the matrix. integer ( int32 ), intent ( in ) :: expect_rows !! The expected number of rows. integer ( int32 ), intent ( in ) :: expect_cols !! The expected number of columns. integer ( int32 ), intent ( in ) :: actual_rows !! The actual number of rows. integer ( int32 ), intent ( in ) :: actual_cols !! The actual number of columns. ! Variables character ( len = MESSAGE_SIZE ) :: msg ! Process write ( msg , 100 ) \"Expected matrix \" // name // \" to be of size (\" , & expect_rows , \", \" , expect_cols , \"), but found it to be of size (\" , & actual_rows , \", \" , actual_cols , \").\" call err % report_error ( fname , trim ( msg ), FS_MATRIX_SIZE_ERROR ) ! Formatting 100 format ( A , I0 , A , I0 , A , I0 , A , I0 , A ) end subroutine ! ------------------------------------------------------------------------------ subroutine report_arrays_not_same_size_error ( err , fname , name1 , name2 , & size1 , size2 ) !! Reports an error relating to two arrays not being the same size !! when they should be the same size. class ( errors ), intent ( inout ) :: err !! The error handling object. character ( len = * ), intent ( in ) :: fname !! The name of the routine in which the error occurred. character ( len = * ), intent ( in ) :: name1 !! The name of the first array. character ( len = * ), intent ( in ) :: name2 !! The name of the second array. integer ( int32 ), intent ( in ) :: size1 !! The size of the first array. integer ( int32 ), intent ( in ) :: size2 !! The size of the second array. ! Local Variables character ( len = MESSAGE_SIZE ) :: msg ! Process write ( msg , 100 ) \"Array \" // name1 // \" and array \" // name2 // & \"were expected to be the same size, but instead were found \" // & \"to be sized \" , size1 , \" and \" , size2 , \" respectively.\" call err % report_error ( fname , trim ( msg ), FS_ARRAY_SIZE_ERROR ) ! Formatting 100 format ( A , I0 , A , I0 , A ) end subroutine ! ------------------------------------------------------------------------------ subroutine report_underdefined_error ( err , fname , expect , actual ) !! Reports an underdefined problem error. class ( errors ), intent ( inout ) :: err !! The error handling object. character ( len = * ), intent ( in ) :: fname !! The name of the routine in which the error occurred. integer ( int32 ), intent ( in ) :: expect !! The expected minimum number of equations. integer ( int32 ), intent ( in ) :: actual !! The actual number of equations. ! Local Variables character ( len = MESSAGE_SIZE ) :: msg ! Process write ( msg , 100 ) \"The problem is underdefined.  The number of \" // & \"equations was found to be \" , actual , & \", but must be at least equal to the number of unknowns \" , & expect , \".\" call err % report_error ( fname , trim ( msg ), FS_UNDERDEFINED_PROBLEM_ERROR ) ! Formatting 100 format ( A , I0 , A , I0 , A ) end subroutine ! ------------------------------------------------------------------------------ subroutine report_iteration_count_error ( err , fname , msg , mincount ) !! Reports an iteration count error. class ( errors ), intent ( inout ) :: err !! The error handling object. character ( len = * ) :: fname !! The name of the routine in which the error occurred. character ( len = * ) :: msg !! The error message. integer ( int32 ), intent ( in ) :: mincount !! The minimum iteration count expected. ! Local Variables character ( len = MESSAGE_SIZE ) :: emsg ! Process write ( emsg , 100 ) msg // \"  A minimum of \" , mincount , \" is expected.\" call err % report_error ( fname , trim ( emsg ), FS_TOO_FEW_ITERATION_ERROR ) ! Formatting 100 format ( A , I0 , A ) end subroutine ! ------------------------------------------------------------------------------ end module","tags":"","loc":"sourcefile\\fstats_errors.f90.html"},{"title":"fstats_smoothing.f90 – FSTATS","text":"Source Code module fstats_smoothing use iso_fortran_env use ferror use fstats_errors use linalg , only : sort implicit none private public :: lowess contains ! ------------------------------------------------------------------------------ subroutine lowess ( x , y , ys , fsmooth , nstps , del , rweights , resid , err ) !! Computes the smoothing of a data set using a robust locally weighted !! scatterplot smoothing (LOWESS) algorithm.  Fitted values are computed at !! each of the supplied x values. !! !! Remarks !! !! The code is a reimplementation of the LOWESS library.  For a detailed !! understanding, see [this] !! (http://www.aliquote.org/cours/2012_biomed/biblio/Cleveland1979.pdf) !! paper by William Cleveland. real ( real64 ), intent ( in ), dimension (:) :: x !! An N-element array containing the independent variable data.  This !! array must be monotonically increasing. real ( real64 ), intent ( in ), dimension (:) :: y !! An N-element array containing the dependent variable data. real ( real64 ), intent ( out ), dimension (:) :: ys !! An N-element array where the smoothed results will be written. real ( real64 ), intent ( in ), optional :: fsmooth !! An optional input that specifies the amount of smoothing. !! Specifically, this value is the fraction of points used to compute !! each value.  As this value increases, the output becomes smoother. !! Choosing a value in the range of 0.2 to 0.8 typically results in a !! good fit.  The default value is 0.2. integer ( int32 ), intent ( in ), optional :: nstps !! An optional input that specifies the numb of iterations.  If set to !! zero, a non-robust fit is returned.  The default value is set to 2. real ( real64 ), intent ( in ), optional :: del !! real ( real64 ), intent ( out ), optional , dimension (:), target :: rweights !! An optional N-element array, that if supplied, will be used to !! return the weights given to each data point. real ( real64 ), intent ( out ), optional , dimension (:), target :: resid !! An optional N-element array, that if supplied, will be used to !! return the residual. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings to the !! caller.  Possible warning and error codes are as follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not !!      approriately sized. !! - FS_MEMORY_ERROR: Occurs if there is a memory allocation error. ! Parameters real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: p2 = 2.0d-1 real ( real64 ), parameter :: one = 1.0d0 real ( real64 ), parameter :: three = 3.0d0 real ( real64 ), parameter :: p001 = 1.0d-3 real ( real64 ), parameter :: p999 = 0.999d0 ! Local Variables logical :: ok integer ( int32 ) :: iter , i , j , nleft , nright , ns , last , m1 , m2 , n , nsteps , flag real ( real64 ) :: f , delta , d1 , d2 , denom , alpha , cut , eps , cmad , c1 , c9 , r real ( real64 ), allocatable , target , dimension (:) :: rwdef , rsdef real ( real64 ), pointer , dimension (:) :: rw , res class ( errors ), pointer :: errmgr type ( errors ), target :: deferr ! Initialization if ( present ( err )) then errmgr => err else errmgr => deferr end if n = size ( x ) if ( present ( fsmooth )) then f = fsmooth else f = p2 end if if ( present ( nstps )) then nsteps = nstps else nsteps = 2 end if if ( present ( del )) then delta = del else delta = 0.0d0 end if if ( present ( rweights )) then if ( size ( rweights ) /= n ) then call report_array_size_error ( errmgr , \"lowess\" , \"rweights\" , n , & size ( rweights )) return end if rw => rweights else allocate ( rwdef ( n ), stat = flag ) if ( flag /= 0 ) then call report_memory_error ( errmgr , \"lowess\" , flag ) return end if rw => rwdef end if if ( present ( resid )) then if ( size ( resid ) /= n ) then call report_array_size_error ( errmgr , \"lowess\" , \"resid\" , n , & size ( resid )) return end if res => resid else allocate ( rsdef ( n ), stat = flag ) if ( flag /= 0 ) then call report_memory_error ( errmgr , \"lowess\" , flag ) return end if res => rsdef end if ns = max ( min ( int ( f * real ( n ), int32 ), n ), 2 ) eps = epsilon ( eps ) ! Input Checking if ( size ( y ) /= n ) then call report_array_size_error ( errmgr , \"lowess\" , \"y\" , n , size ( y )) return end if if ( size ( ys ) /= n ) then call report_array_size_error ( errmgr , \"lowess\" , \"ys\" , n , size ( ys )) return end if ! Quick Return if ( n < 2 ) then ys = y return end if ! Process do iter = 1 , nsteps + 1 nleft = 1 nright = ns last = 0 i = 1 do do while ( nright < n ) d1 = x ( i ) - x ( nleft ) d2 = x ( nright + 1 ) - x ( i ) if ( d1 <= d2 ) exit nleft = nleft + 1 nright = nright + 1 end do call lowest ( x , y , x ( i ), ys ( i ), nleft , nright , res , iter > 1 , & rw , ok ) if (. not . ok ) ys ( i ) = y ( i ) if ( last < i - 1 ) then denom = x ( i ) - x ( last ) do j = last + 1 , i - 1 alpha = ( x ( j ) - x ( last )) / denom ys ( j ) = alpha * ys ( i ) + ( one - alpha ) * ys ( last ) end do end if last = i cut = x ( last ) + delta do i = last + 1 , n if ( x ( i ) > cut ) exit if ( abs ( x ( i ) - x ( last )) < eps ) then ys ( i ) = ys ( last ) last = i end if end do i = max ( last + 1 , i - 1 ) if ( last >= n ) exit end do res = y - ys if ( iter > nsteps ) exit rw = abs ( res ) call sort ( rw , . true .) m1 = 1 + n / 2 m2 = n - m1 + 1 cmad = three * ( rw ( m1 ) + rw ( m2 )) c9 = p999 * cmad c1 = p001 * cmad do i = 1 , n r = abs ( res ( i )) if ( r <= c1 ) then rw ( i ) = one else if ( r > c9 ) then rw ( i ) = zero else rw ( i ) = ( one - ( r / cmad ) ** 2 ) ** 2 end if end do end do end subroutine ! ****************************************************************************** ! PRIVATE ROUTINES ! ------------------------------------------------------------------------------ ! REF: ! - https://en.wikipedia.org/wiki/Local_regression ! - http://www.aliquote.org/cours/2012_biomed/biblio/Cleveland1979.pdf subroutine lowest ( x , y , xs , ys , nleft , nright , w , userw , rw , ok ) ! Arguments real ( real64 ), intent ( in ), dimension (:) :: x , y , rw ! N ELEMENT real ( real64 ), intent ( in ) :: xs real ( real64 ), intent ( out ) :: ys integer ( int32 ), intent ( in ) :: nleft , nright real ( real64 ), intent ( out ), dimension (:) :: w ! N ELEMENT logical , intent ( in ) :: userw logical , intent ( out ) :: ok ! Parameters real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: one = 1.0d0 real ( real64 ), parameter :: p001 = 1.0d-3 real ( real64 ), parameter :: p999 = 0.999d0 ! Local Variables integer ( int32 ) :: j , n , nrt real ( real64 ) :: range , h , h9 , h1 , a , b , c , r ! Initialization n = size ( x ) range = x ( n ) - x ( 1 ) h = max ( xs - x ( nleft ), x ( nright ) - xs ) h9 = p999 * h h1 = p001 * h a = zero ! Process do j = nleft , n w ( j ) = zero r = abs ( x ( j ) - xs ) if ( r <= h9 ) then if ( r > h1 ) then w ( j ) = ( one - ( r / h ) ** 3 ) ** 3 else w ( j ) = one end if if ( userw ) w ( j ) = rw ( j ) * w ( j ) a = a + w ( j ) else if ( x ( j ) > xs ) then exit end if end do nrt = j - 1 if ( a <= zero ) then ok = . false . else ok = . true . w ( nleft : nrt ) = w ( nleft : nrt ) / a if ( h > zero ) then a = zero do j = nleft , nrt a = a + w ( j ) * x ( j ) end do b = xs - a c = zero do j = nleft , nrt c = c + w ( j ) * ( x ( j ) - a ) ** 2 end do if ( sqrt ( c ) > p001 * range ) then b = b / c do j = nleft , nrt w ( j ) = w ( j ) * ( one + b * ( x ( j ) - a )) end do end if end if ys = zero do j = nleft , nrt ys = ys + w ( j ) * y ( j ) end do end if end subroutine ! ------------------------------------------------------------------------------ end module","tags":"","loc":"sourcefile\\fstats_smoothing.f90.html"},{"title":"fstats.f90 – FSTATS","text":"Source Code module fstats !! FSTATS is a modern Fortran statistical library containing routines for !! computing basic statistical properties, hypothesis testing, regression, !! special functions, and experimental design. use iso_fortran_env use fstats_special_functions use fstats_descriptive_statistics use fstats_hypothesis use fstats_distributions use fstats_anova use fstats_helper_routines use fstats_regression use fstats_experimental_design use fstats_allan use fstats_bootstrap use fstats_sampling use fstats_smoothing implicit none private public :: distribution public :: distribution_function public :: distribution_property public :: t_distribution public :: normal_distribution public :: f_distribution public :: chi_squared_distribution public :: binomial_distribution public :: mean public :: variance public :: standard_deviation public :: median public :: covariance public :: r_squared public :: adjusted_r_squared public :: correlation public :: quantile public :: t_test_equal_variance public :: t_test_unequal_variance public :: t_test_paired public :: f_test public :: anova public :: anova_factor public :: single_factor_anova_table public :: two_factor_anova_table public :: confidence_interval public :: beta public :: regularized_beta public :: incomplete_beta public :: digamma public :: incomplete_gamma_upper public :: incomplete_gamma_lower public :: coefficient_matrix public :: covariance_matrix public :: linear_least_squares public :: regression_statistics public :: get_full_factorial_matrix_size public :: full_factorial public :: iteration_controls public :: lm_solver_options public :: convergence_info public :: regression_function public :: iteration_update public :: jacobian public :: nonlinear_least_squares public :: allan_variance public :: trimmed_mean public :: difference public :: factorial public :: bootstrap_resampling_routine public :: bootstrap_statistic_routine public :: random_resample public :: scaled_random_resample public :: bootstrap_statistics public :: bootstrap public :: bootstrap_regression_statistics public :: bootstrap_linear_least_squares public :: bootstrap_nonlinear_least_squares public :: box_muller_sample public :: rejection_sample public :: lowess public :: FS_LEVENBERG_MARQUARDT_UPDATE public :: FS_QUADRATIC_UPDATE public :: FS_NIELSEN_UPDATE end module","tags":"","loc":"sourcefile\\fstats.f90.html"},{"title":"fstats_experimental_design.f90 – FSTATS","text":"Source Code module fstats_experimental_design use iso_fortran_env use fstats_errors implicit none private public :: get_full_factorial_matrix_size public :: full_factorial contains ! ------------------------------------------------------------------------------ subroutine get_full_factorial_matrix_size ( vars , m , n , err ) !! Computes the appropriate size for a full-factorial design table. integer ( int32 ), intent ( in ) :: vars (:) !! An M-element array containing the M factors to study.  Each !! of the M entries to the array is expected to contain the !! number of options for that particular factor to explore. !! This value must be greater than or equal to 1. integer ( int32 ), intent ( out ) :: m !! The number of rows for the table. integer ( int32 ), intent ( out ) :: n !! The number of columns for the table. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings to the !! caller.  Possible warning and error codes are as follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_INVALID_INPUT_ERROR: Occurs if any items in vars are !!      less than 1. ! Local Variables integer ( int32 ) :: i class ( errors ), pointer :: errmgr type ( errors ), target :: deferr character ( len = 256 ) :: errmsg ! Initialization if ( present ( err )) then errmgr => err else errmgr => deferr end if m = 0 n = 0 ! Ensure every value is greater than 1 do i = 1 , size ( vars ) if ( vars ( i ) < 1 ) then write ( errmsg , 100 ) \"A value less than 1 was found at index \" , & i , \" of the input array.  All values must be greater \" // & \"than or equal to 1.\" call errmgr % report_error ( \"get_full_factorial_matrix_size\" , & trim ( errmsg ), FS_INVALID_INPUT_ERROR ) return end if end do ! Process m = product ( vars ) n = size ( vars ) ! Formatting 100 format ( A , I0 , A ) end subroutine ! ------------------------------------------------------------------------------ subroutine full_factorial ( vars , tbl , err ) !! Computes a table with values scaled from 1 to N describing a !! full-factorial design. !! !! ```fortran !! program example !!     use iso_fortran_env !!     use fstats !!     implicit none !! !!     ! Local Variables !!     integer(int32) :: i, vars(3), tbl(24, 3) !! !!     ! Define the number of design points for each of the 3 factors to study !!     vars = [2, 4, 3] !! !!     ! Determine the design table !!     call full_factorial(vars, tbl) !! !!     ! Display the table !!     do i = 1, size(tbl, 1) !!         print *, tbl(i,:) !!     end do !! end program !! ``` !! The above program produces the following output. !! ```text !! 1           1           1 !! 1           1           2 !! 1           1           3 !! 1           2           1 !! 1           2           2 !! 1           2           3 !! 1           3           1 !! 1           3           2 !! 1           3           3 !! 1           4           1 !! 1           4           2 !! 1           4           3 !! 2           1           1 !! 2           1           2 !! 2           1           3 !! 2           2           1 !! 2           2           2 !! 2           2           3 !! 2           3           1 !! 2           3           2 !! 2           3           3 !! 2           4           1 !! 2           4           2 !! 2           4           3 !! ``` integer ( int32 ), intent ( in ) :: vars (:) !! An M-element array containing the M factors to study. !! Each of the M entries to the array is expected to contain !! the number of options for that particular factor to explore. !! This value must be greater than or equal to 1. integer ( int32 ), intent ( out ) :: tbl (:,:) !! A table where the design will be written.  Use !! get_full_factorial_matrix_size to determine the appropriate !! table size. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings to the !! caller.  Possible warning and error codes are as follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_INVALID_INPUT_ERROR: Occurs if any items in vars are !!      less than 1. !! - FS_ARRAY_SIZE_ERROR: Occurs if tbl is not properly sized. ! Local Variables integer ( int32 ) :: i , col , stride , last , val , m , n class ( errors ), pointer :: errmgr type ( errors ), target :: deferr ! Initialization if ( present ( err )) then errmgr => err else errmgr => deferr end if ! Verify the size of the input table call get_full_factorial_matrix_size ( vars , m , n , errmgr ) if ( errmgr % has_error_occurred ()) return if ( size ( tbl , 1 ) /= m . or . size ( tbl , 2 ) /= n ) then call report_matrix_size_error ( errmgr , \"full_factorial\" , & \"tbl\" , m , n , size ( tbl , 1 ), size ( tbl , 2 )) return end if ! Process do col = 1 , n stride = 1 if ( col /= n ) stride = product ( vars ( col + 1 : n )) val = 1 do i = 1 , m , stride last = i + stride - 1 tbl ( i : last , col ) = val val = val + 1 if ( val > vars ( col )) val = 1 end do end do end subroutine ! ------------------------------------------------------------------------------ end module","tags":"","loc":"sourcefile\\fstats_experimental_design.f90.html"},{"title":"fstats_anova.f90 – FSTATS","text":"Source Code module fstats_anova use iso_fortran_env use ieee_arithmetic use fstats_special_functions use fstats_descriptive_statistics use ferror use fstats_errors implicit none private public :: anova_factor public :: single_factor_anova_table public :: two_factor_anova_table public :: anova type anova_factor !! Defines an ANOVA factor result. real ( real64 ) :: dof !! The number of degrees of freedome. real ( real64 ) :: variance !! The estimate of variance. real ( real64 ) :: sum_of_squares !! The sum of the squares. real ( real64 ) :: f_statistic !! The F-statistic. real ( real64 ) :: probability !! The variance probability term. end type type single_factor_anova_table !! Defines a single-factor ANOVA results table. type ( anova_factor ) :: main_factor !! The main, or main factor, results. type ( anova_factor ) :: within_factor !! The within-treatement (error) results. real ( real64 ) :: total_dof !! The total number of degrees of freedom. real ( real64 ) :: total_sum_of_squares !! The total sum of squares. real ( real64 ) :: total_variance !! The total variance estimate. real ( real64 ) :: overall_mean !! The overall mean value. end type type two_factor_anova_table !! Defines a two-factor ANOVA results table. type ( anova_factor ) :: main_factor_1 !! The first main-factor results. type ( anova_factor ) :: main_factor_2 !! The second main-factor results. type ( anova_factor ) :: interaction !! The interaction effects. type ( anova_factor ) :: within_factor !! The within (error) factor results. real ( real64 ) :: total_dof !! The total number of degrees of freedom. real ( real64 ) :: total_sum_of_squares !! The total sum of squares. real ( real64 ) :: total_variance !! The total variance estimate. real ( real64 ) :: overall_mean !! The overall mean value. end type interface anova !! Performs an analysis of variance (ANOVA) on the supplied data !! set. !! !! The following example illustrates a single-factor ANOVA on a !! data set. !! ```fortran !! program example !!     use iso_fortran_env !!     use fstats !!     implicit none !! !!     ! Local Variables !!     character, parameter :: tab = achar(9) !!     real(real64) :: x(10, 2) !!     type(single_factor_anova_table) :: tbl !! !!     ! Define the data !!     x = reshape( & !!         [ & !!             3.086d3, 3.082d3, 3.069d3, 3.072d3, 3.045d3, 3.070d3, 3.079d3, & !!             3.050d3, 3.062d3, 3.062d3, 3.075d3, 3.061d3, 3.063d3, 3.038d3, & !!             3.070d3, 3.062d3, 3.070d3, 3.049d3, 3.042d3, 3.063d3 & !!         ], & !!         [10, 2] & !!     ) !! !!     ! Perform the ANOVA !!     tbl = anova(x) !! !!     ! Print out the table !!     print '(A)', \"Description\" // tab // \"DOF\" // tab // \"Sum of Sq.\" // & !!         tab // \"Variance\" // tab // \"F-Stat\" // tab // \"P-Value\" !!     print '(AF2.0AF5.1AF5.1AF5.3AF5.3)', \"Main Factor: \" // tab, & !!         tbl%main_factor%dof, tab, & !!         tbl%main_factor%sum_of_squares, tab // tab, & !!         tbl%main_factor%variance, tab // tab, & !!         tbl%main_factor%f_statistic, tab, & !!         tbl%main_factor%probability !! !!     print '(AF3.0AF6.1AF5.1)', \"Within: \" // tab, & !!         tbl%within_factor%dof, tab, & !!         tbl%within_factor%sum_of_squares, tab // tab, & !!         tbl%within_factor%variance !! !!     print '(AF3.0AF6.1AF5.1)', \"Total: \" // tab // tab, & !!         tbl%total_dof, tab, & !!         tbl%total_sum_of_squares, tab // tab, & !!         tbl%total_variance !! !!     print '(AF6.1)', \"Overall Mean: \", tbl%overall_mean !! end program !! ``` !! The above program produces the following output. !! ```text !! Description     DOF     Sum of Sq.      Variance        F-Stat  P-Value !! Main Factor:    1.      352.8           352.8           2.147   0.160 !! Within:         18.     2958.2          164.3 !! Total:          19.     3311.0          174.3 !! Overall Mean: 3063.5 !! ``` !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Analysis_of_variance) !! - [SPC Excel Single Factor ANOVA](https://www.spcforexcel.com/knowledge/root-cause-analysis/single-factor-anova) !! - [SPC Excel Gage R&R](https://www.spcforexcel.com/knowledge/measurement-systems-analysis/anova-gage-rr-part-1) !! - [SPC Excel Understanding Regression Statistics](https://www.spcforexcel.com/knowledge/root-cause-analysis/understanding-regression-statistics-part-1) !! - [NIST - Two Way ANOVA](https://www.itl.nist.gov/div898/handbook/prc/section4/prc427.htm) module procedure :: anova_1_factor module procedure :: anova_2_factor module procedure :: anova_model_fit end interface contains ! ------------------------------------------------------------------------------ ! REF: https://www.spcforexcel.com/knowledge/root-cause-analysis/single-factor-anova function anova_1_factor ( x ) result ( rst ) !! Performs an analysis of variance (ANOVA) on the supplied data set. real ( real64 ), intent ( in ) :: x (:,:) !! An M-by-N matrix containing the M replications of the N test !! points of interest. type ( single_factor_anova_table ) :: rst !! A single_factor_anova_table instance containing the ANOVA results. ! Parameters real ( real64 ), parameter :: zero = 0.0d0 ! Local Variables integer ( int32 ) :: j , a , n , nt real ( real64 ) :: sum_all , tssq , essq , bssq ! Initialization a = size ( x , 2 ) nt = size ( x , 1 ) n = nt * a rst % within_factor % f_statistic = ieee_value ( sum_all , IEEE_QUIET_NAN ) rst % within_factor % probability = ieee_value ( sum_all , IEEE_QUIET_NAN ) ! Determine the degrees of freedom rst % main_factor % dof = a - 1 rst % within_factor % dof = n - a rst % total_dof = n - 1 ! Quick Return if ( a == 1 . or . nt == 1 ) then rst % main_factor % sum_of_squares = zero rst % main_factor % variance = zero rst % main_factor % f_statistic = zero rst % main_factor % probability = zero rst % within_factor % sum_of_squares = zero rst % within_factor % variance = zero rst % total_variance = variance ( pack ( x , . true .)) rst % total_sum_of_squares = rst % total_variance * rst % total_dof rst % overall_mean = mean ( pack ( x , . true .)) return end if ! Compute the sum of squares for all factors sum_all = sum ( x ) tssq = sum ( x ** 2 ) - ( sum_all ** 2 / n ) bssq = zero do j = 1 , a bssq = bssq + sum ( x (:, j )) ** 2 end do bssq = ( bssq / nt ) - ( sum_all ** 2 / n ) essq = tssq - bssq rst % main_factor % sum_of_squares = bssq rst % within_factor % sum_of_squares = essq rst % total_sum_of_squares = tssq ! Compute the variance terms rst % main_factor % variance = bssq / rst % main_factor % dof rst % within_factor % variance = essq / rst % within_factor % dof rst % total_variance = tssq / rst % total_dof ! Compute the overall mean rst % overall_mean = mean ( pack ( x , . true .)) ! Compute the F-statistic and probability term call anova_probability ( & rst % main_factor % variance , & rst % within_factor % variance , & rst % main_factor % dof , & rst % within_factor % dof , & rst % main_factor % f_statistic , & rst % main_factor % probability & ) end function ! ------------------------------------------------------------------------------ ! REF: https://www.spcforexcel.com/knowledge/measurement-systems-analysis/anova-gage-rr-part-1 ! REF: https://www.itl.nist.gov/div898/handbook/prc/section4/prc427.htm ! Data set is expected as a 3D array with each of the K pages containing the R !   treatments of N tests such that the array size is N-by-R-by-K function anova_2_factor ( x ) result ( rst ) !! Performs an analysis of variance (ANOVA) on the supplied data set. real ( real64 ), intent ( in ) :: x (:,:,:) !! An M-by-N-by-K array containing the M replications of the !! N first factor results, and the K second factor results. type ( two_factor_anova_table ) :: rst !! A two_factor_anova_table instance containing the ANOVA results. ! Parameters real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: one = 1.0d0 ! Local Variables integer ( int32 ) :: i , j , jj , k , r , n real ( real64 ) :: factorMean , sum_all real ( real64 ), allocatable :: xpack (:) ! Initialization n = size ( x , 3 ) k = size ( x , 2 ) r = size ( x , 1 ) rst % within_factor % f_statistic = ieee_value ( sum_all , IEEE_QUIET_NAN ) rst % within_factor % probability = ieee_value ( sum_all , IEEE_QUIET_NAN ) ! Quick Return if ( k == 1 ) then ! This is a one-factor anova end if ! Determine the number of DOF rst % main_factor_1 % dof = k - one rst % main_factor_2 % dof = n - 1 rst % interaction % dof = ( k - 1 ) * ( n - 1 ) rst % within_factor % dof = n * k * ( r - 1 ) rst % total_dof = n * k * r - 1 ! Compute the overall mean, sum of squares, and variance xpack = pack ( x , . true .) rst % overall_mean = mean ( xpack ) rst % total_sum_of_squares = sum (( xpack - rst % overall_mean ) ** 2 ) rst % total_variance = rst % total_sum_of_squares / rst % total_dof ! Compute factor 1 results rst % main_factor_1 % sum_of_squares = zero do i = 1 , k factorMean = mean ( pack ( x (:, i ,:), . true .)) rst % main_factor_1 % sum_of_squares = rst % main_factor_1 % sum_of_squares + & ( factorMean - rst % overall_mean ) ** 2 end do rst % main_factor_1 % sum_of_squares = n * r * rst % main_factor_1 % sum_of_squares rst % main_factor_1 % variance = rst % main_factor_1 % sum_of_squares / & rst % main_factor_1 % dof ! Compute factor 2 results rst % main_factor_2 % sum_of_squares = zero do i = 1 , n factorMean = mean ( pack ( x (:,:, i ), . true .)) rst % main_factor_2 % sum_of_squares = rst % main_factor_2 % sum_of_squares + & ( factorMean - rst % overall_mean ) ** 2 end do rst % main_factor_2 % sum_of_squares = k * r * rst % main_factor_2 % sum_of_squares rst % main_factor_2 % variance = rst % main_factor_2 % sum_of_squares / & rst % main_factor_2 % dof ! Compute the within (error) term rst % within_factor % sum_of_squares = zero do j = 1 , k do i = 1 , n factorMean = mean ( x (:, j , i )) do jj = 1 , r rst % within_factor % sum_of_squares = & rst % within_factor % sum_of_squares + & ( x ( jj , j , i ) - factorMean ) ** 2 end do end do end do rst % within_factor % variance = rst % within_factor % sum_of_squares / & rst % within_factor % dof ! Compute the interaction term rst % interaction % sum_of_squares = rst % total_sum_of_squares - ( & rst % main_factor_1 % sum_of_squares + & rst % main_factor_2 % sum_of_squares + & rst % within_factor % sum_of_squares & ) rst % interaction % variance = rst % interaction % sum_of_squares / & rst % interaction % dof ! Compute the F-statistics call anova_probability ( & rst % main_factor_1 % variance , & rst % within_factor % variance , & rst % main_factor_1 % dof , & rst % within_factor % dof , & rst % main_factor_1 % f_statistic , & rst % main_factor_1 % probability & ) call anova_probability ( & rst % main_factor_2 % variance , & rst % within_factor % variance , & rst % main_factor_2 % dof , & rst % within_factor % dof , & rst % main_factor_2 % f_statistic , & rst % main_factor_2 % probability & ) call anova_probability ( & rst % interaction % variance , & rst % within_factor % variance , & rst % interaction % dof , & rst % within_factor % dof , & rst % interaction % f_statistic , & rst % interaction % probability & ) end function ! ------------------------------------------------------------------------------ ! REF: https://www.spcforexcel.com/knowledge/root-cause-analysis/understanding-regression-statistics-part-1 function anova_model_fit ( nmodelparams , ymeas , ymod , err ) result ( rst ) !! Performs an analysis of variance (ANOVA) on the supplied data set. integer ( int32 ), intent ( in ) :: nmodelparams !! The number of model parameters. real ( real64 ), intent ( in ) :: ymeas (:) !! An N-element array containing the measured dependent variable data. real ( real64 ), intent ( in ) :: ymod (:) !! An N-element array containing the modeled dependent variable data. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings to the !! caller.  Possible warning and error codes are as follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_ARRAY_SIZE_ERROR: Occurs if ymeas and ymod are not the !!   same length. !! - FS_MEMORY_ERROR: Occurs if a memory error is encountered. type ( single_factor_anova_table ) :: rst !! A single_factor_anova_table instance containing the ANOVA results. ! Local Variables integer ( int32 ) :: n , flag real ( real64 ), allocatable :: ypack (:) real ( real64 ) :: sum_all class ( errors ), pointer :: errmgr type ( errors ), target :: deferr ! Initialization n = size ( ymeas ) if ( present ( err )) then errmgr => err else errmgr => deferr end if rst % within_factor % f_statistic = ieee_value ( sum_all , IEEE_QUIET_NAN ) rst % within_factor % probability = ieee_value ( sum_all , IEEE_QUIET_NAN ) ! Input Checking if ( size ( ymod ) /= n ) then call report_arrays_not_same_size_error ( errmgr , \"anova_model_fit\" , & \"YMEAS\" , \"YMOD\" , n , size ( ymod )) return end if ! Memory Allocation allocate ( ypack ( 2 * n ), stat = flag ) if ( flag /= 0 ) then call report_memory_error ( errmgr , \"anova_model_fit\" , flag ) return end if ! Determine the number of DOF rst % main_factor % dof = nmodelparams - 1 rst % within_factor % dof = n - rst % main_factor % dof - 1 rst % total_dof = n - 1 ! Process ypack ( 1 : n ) = ymeas ypack ( n + 1 : 2 * n ) = ymod rst % overall_mean = mean ( ypack ) rst % total_sum_of_squares = sum (( ymeas - rst % overall_mean ) ** 2 ) rst % main_factor % sum_of_squares = sum (( ymod - rst % overall_mean ) ** 2 ) rst % within_factor % sum_of_squares = sum (( ymeas - ymod ) ** 2 ) rst % total_variance = rst % total_sum_of_squares / rst % total_dof rst % main_factor % variance = rst % main_factor % sum_of_squares / & rst % main_factor % dof rst % within_factor % variance = rst % within_factor % sum_of_squares / & rst % within_factor % dof ! Compute the F-statistic and probability term call anova_probability ( & rst % main_factor % variance , & rst % within_factor % variance , & rst % main_factor % dof , & rst % within_factor % dof , & rst % main_factor % f_statistic , & rst % main_factor % probability & ) ! Formatting 100 format ( A , I0 , A , I0 , A ) 101 format ( A , I0 , A ) end function ! ****************************************************************************** ! PRIVATE ROUTINES ! ------------------------------------------------------------------------------ subroutine anova_probability ( v1 , v2 , dof1 , dof2 , f , p ) ! Arguments real ( real64 ), intent ( in ) :: v1 , v2 , dof1 , dof2 real ( real64 ), intent ( out ) :: f , p ! Local Variables real ( real64 ) :: d1 , d2 , a , b , x ! Process f = v1 / v2 d1 = dof1 d2 = dof2 a = 0.5d0 * d2 b = 0.5d0 * d1 x = d2 / ( d2 + d1 * f ) p = regularized_beta ( a , b , x ) if ( p > 1.0d0 ) then p = 2.0d0 - p end if end subroutine ! ------------------------------------------------------------------------------ end module","tags":"","loc":"sourcefile\\fstats_anova.f90.html"}]}
\ No newline at end of file
+var tipuesearch = {"pages":[{"title":" FSTATS ","text":"FSTATS Developer Info Jason Christopherson","tags":"home","loc":"index.html"},{"title":"bootstrap_regression_statistics – FSTATS ","text":"type, public :: bootstrap_regression_statistics A container for regression-related statistical information as \ncomputed in a bootstrap, or equivalent, calculation. Components Type Visibility Attributes Name Initial real(kind=real64), public :: lower_confidence_interval The lower limit of the confidence interval for the parameter. real(kind=real64), public :: probability The probability that the coefficient is not statistically \nimportant.  A statistically important coefficient will have a \nlow probability (p-value), typically 0.05 or lower; however, a \np-value of up to ~0.2 may be acceptable dependent upon the \nproblem.  Typically any p-value larger than ~0.2 indicates the \nparameter is not statistically important for the model. real(kind=real64), public :: standard_error The standard error for the model coefficient. real(kind=real64), public :: t_statistic The T-statistic for the model coefficient. real(kind=real64), public :: upper_confidence_interval The upper limit of the confidence interval for the parameter.","tags":"","loc":"type\\bootstrap_regression_statistics.html"},{"title":"bootstrap_statistics – FSTATS ","text":"type, public :: bootstrap_statistics A collection of statistics resulting from the bootstrap process. Components Type Visibility Attributes Name Initial real(kind=real64), public :: bias The bias in the statistic. real(kind=real64), public :: lower_confidence_interval The lower confidence limit on the statistic. real(kind=real64), public, allocatable, dimension(:) :: population An array of the population values generated by the bootstrap\nprocess. real(kind=real64), public :: standard_error The standard error of the statistic. real(kind=real64), public :: statistic_value The value of the statistic of interest. real(kind=real64), public :: upper_confidence_interval The upper confidence limit on the statistic.","tags":"","loc":"type\\bootstrap_statistics.html"},{"title":"anova_factor – FSTATS ","text":"type, public :: anova_factor Defines an ANOVA factor result. Components Type Visibility Attributes Name Initial real(kind=real64), public :: dof The number of degrees of freedome. real(kind=real64), public :: f_statistic The F-statistic. real(kind=real64), public :: probability The variance probability term. real(kind=real64), public :: sum_of_squares The sum of the squares. real(kind=real64), public :: variance The estimate of variance.","tags":"","loc":"type\\anova_factor.html"},{"title":"single_factor_anova_table – FSTATS ","text":"type, public :: single_factor_anova_table Defines a single-factor ANOVA results table. Components Type Visibility Attributes Name Initial type( anova_factor ), public :: main_factor The main, or main factor, results. real(kind=real64), public :: overall_mean The overall mean value. real(kind=real64), public :: total_dof The total number of degrees of freedom. real(kind=real64), public :: total_sum_of_squares The total sum of squares. real(kind=real64), public :: total_variance The total variance estimate. type( anova_factor ), public :: within_factor The within-treatement (error) results.","tags":"","loc":"type\\single_factor_anova_table.html"},{"title":"two_factor_anova_table – FSTATS ","text":"type, public :: two_factor_anova_table Defines a two-factor ANOVA results table. Components Type Visibility Attributes Name Initial type( anova_factor ), public :: interaction The interaction effects. type( anova_factor ), public :: main_factor_1 The first main-factor results. type( anova_factor ), public :: main_factor_2 The second main-factor results. real(kind=real64), public :: overall_mean The overall mean value. real(kind=real64), public :: total_dof The total number of degrees of freedom. real(kind=real64), public :: total_sum_of_squares The total sum of squares. real(kind=real64), public :: total_variance The total variance estimate. type( anova_factor ), public :: within_factor The within (error) factor results.","tags":"","loc":"type\\two_factor_anova_table.html"},{"title":"convergence_info – FSTATS ","text":"type, public :: convergence_info Provides information regarding convergence status. Components Type Visibility Attributes Name Initial logical, public :: converge_on_gradient True if convergence on the gradient was achieved; else, false. logical, public :: converge_on_residual_parameter True if convergence on the residual error parameter was achieved; \nelse, false. logical, public :: converge_on_solution_change True if convergence on the change in solution was achieved; else,\nfalse. integer(kind=int32), public :: function_evaluation_count The function evaluation count. real(kind=real64), public :: gradient_value The value of the gradient test parameter. integer(kind=int32), public :: iteration_count The iteration count. logical, public :: reach_function_evaluation_limit True if the solution did not converge in the allowed number of\nfunction evaluations. logical, public :: reach_iteration_limit True if the solution did not converge in the allowed number of \niterations. real(kind=real64), public :: residual_value The value of the residual error parameter. real(kind=real64), public :: solution_change_value The value of the change in solution parameter. logical, public :: user_requested_stop True if the user requested the stop; else, false.","tags":"","loc":"type\\convergence_info.html"},{"title":"iteration_controls – FSTATS ","text":"type, public :: iteration_controls Provides a collection of iteration control parameters. Components Type Visibility Attributes Name Initial real(kind=real64), public :: change_in_solution_tolerance Defines a tolerance on the change in parameter values. real(kind=real64), public :: gradient_tolerance Defines a tolerance on the gradient of the fitted function. real(kind=real64), public :: iteration_improvement_tolerance Defines a tolerance to ensure adequate improvement on each \niteration. integer(kind=int32), public :: max_function_evaluations Defines the maximum number of function evaluations allowed. integer(kind=int32), public :: max_iteration_between_updates Defines how many iterations can pass before a re-evaluation of \nthe Jacobian matrix is forced. integer(kind=int32), public :: max_iteration_count Defines the maximum number of iterations allowed. real(kind=real64), public :: residual_tolerance Defines a tolerance on the metric associated with the residual \nerror. Type-Bound Procedures procedure, public :: set_to_default => lm_set_default_tolerances private  subroutine lm_set_default_tolerances(x) Arguments Type Intent Optional Attributes Name class( iteration_controls ), intent(inout) :: x","tags":"","loc":"type\\iteration_controls.html"},{"title":"lm_solver_options – FSTATS ","text":"type, public :: lm_solver_options Options to control the Levenberg-Marquardt solver. Components Type Visibility Attributes Name Initial real(kind=real64), public :: damping_decrease_factor The factor to use when decreasing the damping parameter. real(kind=real64), public :: damping_increase_factor The factor to use when increasing the damping parameter. real(kind=real64), public :: finite_difference_step_size The step size used for the finite difference calculations of the\nJacobian matrix. integer(kind=int32), public :: method The solver method to utilize.\n- FS_LEVENBERG_MARQUARDT_UPDATE:\n- FS_QUADRATIC_UPDATE:\n- FS_NIELSEN_UDPATE: Type-Bound Procedures procedure, public :: set_to_default => lm_set_default_settings private  subroutine lm_set_default_settings(x) Arguments Type Intent Optional Attributes Name class( lm_solver_options ), intent(inout) :: x","tags":"","loc":"type\\lm_solver_options.html"},{"title":"regression_statistics – FSTATS ","text":"type, public :: regression_statistics A container for regression-related statistical information. Components Type Visibility Attributes Name Initial real(kind=real64), public :: confidence_interval The confidence interval for the parameter at the level \ndetermined by the regression process. real(kind=real64), public :: probability The probability that the coefficient is not statistically \nimportant.  A statistically important coefficient will have a \nlow probability (p-value), typically 0.05 or lower; however, a \np-value of up to ~0.2 may be acceptable dependent upon the \nproblem.  Typically any p-value larger than ~0.2 indicates the \nparameter is not statistically important for the model. real(kind=real64), public :: standard_error The standard error for the model coefficient. real(kind=real64), public :: t_statistic The T-statistic for the model coefficient.","tags":"","loc":"type\\regression_statistics.html"},{"title":"array_container – FSTATS ","text":"type, public :: array_container Provides a container for a real-valued array.  A practical use of\nthis construct is in the construction of jagged arrays. Components Type Visibility Attributes Name Initial real(kind=real64), public, allocatable, dimension(:) :: x The array.","tags":"","loc":"type\\array_container.html"},{"title":"binomial_distribution – FSTATS ","text":"type, public, extends( distribution ) :: binomial_distribution Defines a binomial distribution.  The binomial distribution describes\nthe probability p of getting k successes in n independent trials. Components Type Visibility Attributes Name Initial integer(kind=int32), public :: n The number of independent trials. real(kind=real64), public :: p The success probability for each trial.  This parameter must\nexist on the set [0, 1]. Type-Bound Procedures procedure, public :: cdf => bd_cdf private pure elemental function bd_cdf(this, x) result(rst) Computes the cumulative distribution funtion. The CDF for a binomial distribution is given as , which is simply\nthe regularized incomplete beta function. Arguments Type Intent Optional Attributes Name class( binomial_distribution ), intent(in) :: this The binomial_distribution object. real(kind=real64), intent(in) :: x The value at which to evaluate the function.  This parameter\nis the number k successes in the n independent trials.  As\nsuch, this parameter must exist on the set [0, n]. Return Value real(kind=real64) The value of the function. procedure, public :: mean => bd_mean private pure function bd_mean(this) result(rst) Computes the mean of the distribution. Arguments Type Intent Optional Attributes Name class( binomial_distribution ), intent(in) :: this The binomial_distribution object. Return Value real(kind=real64) The mean. procedure, public :: median => bd_median private pure function bd_median(this) result(rst) Computes the median of the distribution. Arguments Type Intent Optional Attributes Name class( binomial_distribution ), intent(in) :: this The binomial_distribution object. Return Value real(kind=real64) The median. procedure, public :: mode => bd_mode private pure function bd_mode(this) result(rst) Computes the mode of the distribution. Arguments Type Intent Optional Attributes Name class( binomial_distribution ), intent(in) :: this The binomial_distribution object. Return Value real(kind=real64) The mode. procedure, public :: pdf => bd_pdf private pure elemental function bd_pdf(this, x) result(rst) Computes the probability mass function. The PMF for a binomial distribution is given as . Arguments Type Intent Optional Attributes Name class( binomial_distribution ), intent(in) :: this The binomial_distribution object. real(kind=real64), intent(in) :: x The value at which to evaluate the function.  This parameter\nis the number k successes in the n independent trials.  As\nsuch, this parameter must exist on the set [0, n]. Return Value real(kind=real64) The value of the function. procedure, public :: variance => bd_variance private pure function bd_variance(this) result(rst) Computes the variance of the distribution. Arguments Type Intent Optional Attributes Name class( binomial_distribution ), intent(in) :: this The binomial_distribution object. Return Value real(kind=real64) The variance.","tags":"","loc":"type\\binomial_distribution.html"},{"title":"chi_squared_distribution – FSTATS ","text":"type, public, extends( distribution ) :: chi_squared_distribution Defines a Chi-squared distribution. Components Type Visibility Attributes Name Initial integer(kind=int32), public :: dof The number of degrees of freedom. Type-Bound Procedures procedure, public :: cdf => cs_cdf private pure elemental function cs_cdf(this, x) result(rst) Computes the cumulative distribution function. The CDF for a Chi-squared distribution is given as . Arguments Type Intent Optional Attributes Name class( chi_squared_distribution ), intent(in) :: this The chi_squared_distribution object. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The value of the function. procedure, public :: mean => cs_mean private pure function cs_mean(this) result(rst) Computes the mean of the distribution. Arguments Type Intent Optional Attributes Name class( chi_squared_distribution ), intent(in) :: this The chi_squared_distribution object. Return Value real(kind=real64) The mean. procedure, public :: median => cs_median private pure function cs_median(this) result(rst) Computes the median of the distribution. Arguments Type Intent Optional Attributes Name class( chi_squared_distribution ), intent(in) :: this The chi_squared_distribution object. Return Value real(kind=real64) The median. procedure, public :: mode => cs_mode private pure function cs_mode(this) result(rst) Computes the mode of the distribution. Arguments Type Intent Optional Attributes Name class( chi_squared_distribution ), intent(in) :: this The chi_squared_distribution object. Return Value real(kind=real64) The mode. procedure, public :: pdf => cs_pdf private pure elemental function cs_pdf(this, x) result(rst) Computes the probability density function. The PDF for a Chi-squared distribution is given as . Arguments Type Intent Optional Attributes Name class( chi_squared_distribution ), intent(in) :: this The chi_squared_distribution object. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The value of the function. procedure, public :: variance => cs_variance private pure function cs_variance(this) result(rst) Computes the variance of the distribution. Arguments Type Intent Optional Attributes Name class( chi_squared_distribution ), intent(in) :: this The chi_squared_distribution object. Return Value real(kind=real64) The variance.","tags":"","loc":"type\\chi_squared_distribution.html"},{"title":"distribution – FSTATS ","text":"type, public :: distribution Defines a probability distribution. Type-Bound Procedures procedure( distribution_function ), public, deferred, pass :: cdf Computes the cumulative distribution function. pure elemental function distribution_function(this, x) result(rst) Prototype Defines the interface for a probability distribution function. Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: this The distribution object. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The value of the function. procedure( distribution_property ), public, deferred, pass :: mean Computes the mean of the distribution. pure function distribution_property(this) result(rst) Prototype Computes the value of a distribution property. Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: this The distribution object. Return Value real(kind=real64) The property value. procedure( distribution_property ), public, deferred, pass :: median Computes the median of the distribution. pure function distribution_property(this) result(rst) Prototype Computes the value of a distribution property. Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: this The distribution object. Return Value real(kind=real64) The property value. procedure( distribution_property ), public, deferred, pass :: mode Computes the mode of the distribution. pure function distribution_property(this) result(rst) Prototype Computes the value of a distribution property. Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: this The distribution object. Return Value real(kind=real64) The property value. procedure( distribution_function ), public, deferred, pass :: pdf Computes the probability density function. pure elemental function distribution_function(this, x) result(rst) Prototype Defines the interface for a probability distribution function. Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: this The distribution object. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The value of the function. procedure( distribution_property ), public, deferred, pass :: variance Computes the variance of the distribution. pure function distribution_property(this) result(rst) Prototype Computes the value of a distribution property. Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: this The distribution object. Return Value real(kind=real64) The property value.","tags":"","loc":"type\\distribution.html"},{"title":"f_distribution – FSTATS ","text":"type, public, extends( distribution ) :: f_distribution Defines an F-distribution. Components Type Visibility Attributes Name Initial real(kind=real64), public :: d1 The measure of degrees of freedom for the first data set. real(kind=real64), public :: d2 The measure of degrees of freedom for the second data set. Type-Bound Procedures procedure, public :: cdf => fd_cdf private pure elemental function fd_cdf(this, x) result(rst) Computes the cumulative distribution function. The CDF for a F distribution is given as . Arguments Type Intent Optional Attributes Name class( f_distribution ), intent(in) :: this The f_distribution object. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The value of the function. procedure, public :: mean => fd_mean private pure function fd_mean(this) result(rst) Computes the mean of the distribution. Arguments Type Intent Optional Attributes Name class( f_distribution ), intent(in) :: this The f_distribution object. Return Value real(kind=real64) The mean. procedure, public :: median => fd_median private pure function fd_median(this) result(rst) Computes the median of the distribution. Arguments Type Intent Optional Attributes Name class( f_distribution ), intent(in) :: this The f_distribution object. Return Value real(kind=real64) The median. procedure, public :: mode => fd_mode private pure function fd_mode(this) result(rst) Computes the mode of the distribution. Arguments Type Intent Optional Attributes Name class( f_distribution ), intent(in) :: this The f_distribution object. Return Value real(kind=real64) The mode. procedure, public :: pdf => fd_pdf private pure elemental function fd_pdf(this, x) result(rst) Computes the probability density function. The PDF for a F distribution is given as . Arguments Type Intent Optional Attributes Name class( f_distribution ), intent(in) :: this The f_distribution object. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The value of the function. procedure, public :: variance => fd_variance private pure function fd_variance(this) result(rst) Computes the variance of the distribution. Arguments Type Intent Optional Attributes Name class( f_distribution ), intent(in) :: this The f_distribution object. Return Value real(kind=real64) The variance.","tags":"","loc":"type\\f_distribution.html"},{"title":"normal_distribution – FSTATS ","text":"type, public, extends( distribution ) :: normal_distribution Defines a normal distribution. Components Type Visibility Attributes Name Initial real(kind=real64), public :: mean_value The mean value of the distribution. real(kind=real64), public :: standard_deviation The standard deviation of the distribution. Type-Bound Procedures procedure, public :: cdf => nd_cdf private pure elemental function nd_cdf(this, x) result(rst) Computes the cumulative distribution function. The CDF for a normal distribution is given as . Arguments Type Intent Optional Attributes Name class( normal_distribution ), intent(in) :: this The normal_distribution object. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The value of the function. procedure, public :: mean => nd_mean private pure function nd_mean(this) result(rst) Computes the mean of the distribution. Arguments Type Intent Optional Attributes Name class( normal_distribution ), intent(in) :: this The normal_distribution object. Return Value real(kind=real64) The mean procedure, public :: median => nd_median private pure function nd_median(this) result(rst) Computes the median of the distribution. Arguments Type Intent Optional Attributes Name class( normal_distribution ), intent(in) :: this The normal_distribution object. Return Value real(kind=real64) The median. procedure, public :: mode => nd_mode private pure function nd_mode(this) result(rst) Computes the mode of the distribution. Arguments Type Intent Optional Attributes Name class( normal_distribution ), intent(in) :: this The normal_distribution object. Return Value real(kind=real64) The mode. procedure, public :: pdf => nd_pdf private pure elemental function nd_pdf(this, x) result(rst) Computes the probability density function. The PDF for a normal distribution is given as . Arguments Type Intent Optional Attributes Name class( normal_distribution ), intent(in) :: this The normal_distribution object. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The value of the function. procedure, public :: standardize => nd_standardize private  subroutine nd_standardize(this) Standardizes the normal distribution to a mean of 0 and a \nstandard deviation of 1. Arguments Type Intent Optional Attributes Name class( normal_distribution ), intent(inout) :: this The normal_distribution object. procedure, public :: variance => nd_variance private pure function nd_variance(this) result(rst) Computes the variance of the distribution. Arguments Type Intent Optional Attributes Name class( normal_distribution ), intent(in) :: this The normal_distribution object. Return Value real(kind=real64) The variance.","tags":"","loc":"type\\normal_distribution.html"},{"title":"t_distribution – FSTATS ","text":"type, public, extends( distribution ) :: t_distribution Defines Student's T-Distribution. Components Type Visibility Attributes Name Initial real(kind=real64), public :: dof The number of degrees of freedom. Type-Bound Procedures procedure, public :: cdf => td_cdf private pure elemental function td_cdf(this, x) result(rst) Computes the cumulative distribution function. The CDF for Student's T-Distribution is given as where . Arguments Type Intent Optional Attributes Name class( t_distribution ), intent(in) :: this The t_distribution object. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The value of the function. procedure, public :: mean => td_mean private pure function td_mean(this) result(rst) Computes the mean of the distribution. Arguments Type Intent Optional Attributes Name class( t_distribution ), intent(in) :: this The t_distribution object. Return Value real(kind=real64) The mean. procedure, public :: median => td_median private pure function td_median(this) result(rst) Computes the median of the distribution. Arguments Type Intent Optional Attributes Name class( t_distribution ), intent(in) :: this The t_distribution object. Return Value real(kind=real64) procedure, public :: mode => td_mode private pure function td_mode(this) result(rst) Computes the mode of the distribution. Arguments Type Intent Optional Attributes Name class( t_distribution ), intent(in) :: this The t_distribution object. Return Value real(kind=real64) The mode. procedure, public :: pdf => td_pdf private pure elemental function td_pdf(this, x) result(rst) Computes the probability density function. The PDF for Student's T-Distribution is given as . Arguments Type Intent Optional Attributes Name class( t_distribution ), intent(in) :: this The t_distribution object. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The value of the function. procedure, public :: variance => td_variance private pure function td_variance(this) result(rst) Computes the variance of the distribution. Arguments Type Intent Optional Attributes Name class( t_distribution ), intent(in) :: this The t_distribution object. Return Value real(kind=real64) The variance.","tags":"","loc":"type\\t_distribution.html"},{"title":"beta – FSTATS","text":"public pure elemental function beta(a, b) result(rst) Computes the beta function. The beta function is related to the gamma function\nby the following relationship. . See Also Wikipedia Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: a The first argument of the function. real(kind=real64), intent(in) :: b The second argument of the function. Return Value real(kind=real64) The value of the beta function at and .","tags":"","loc":"proc\\beta.html"},{"title":"digamma – FSTATS","text":"public pure elemental function digamma(x) result(rst) Computes the digamma function. The digamma function is defined as: See Also Wikipedia Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The function value.","tags":"","loc":"proc\\digamma.html"},{"title":"incomplete_beta – FSTATS","text":"public pure elemental function incomplete_beta(a, b, x) result(rst) Computes the incomplete beta function. The incomplete beta function is defind as: . See Also Wikipedia Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: a The first argument of the function. real(kind=real64), intent(in) :: b The second argument of the function. real(kind=real64), intent(in) :: x The upper limit of the integration. Return Value real(kind=real64) The value of the incomplete beta function.","tags":"","loc":"proc\\incomplete_beta.html"},{"title":"incomplete_gamma_lower – FSTATS","text":"public pure elemental function incomplete_gamma_lower(a, x) result(rst) Computes the lower incomplete gamma function. The lower incomplete gamma function is defined as: See Also Wikipedia Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: a The coefficient value. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The function value.","tags":"","loc":"proc\\incomplete_gamma_lower.html"},{"title":"incomplete_gamma_upper – FSTATS","text":"public pure elemental function incomplete_gamma_upper(a, x) result(rst) Computes the upper incomplete gamma function. The upper incomplete gamma function is defined as: See Also Wikipedia Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: a The coefficient value. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The function value.","tags":"","loc":"proc\\incomplete_gamma_upper.html"},{"title":"regularized_beta – FSTATS","text":"public pure elemental function regularized_beta(a, b, x) result(rst) Computes the regularized beta function. The regularized beta function is defined as the ratio between\nthe incomplete beta function and the beta function. . See Also Wikipedia Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: a The first argument of the function. real(kind=real64), intent(in) :: b The second argument of the function. real(kind=real64), intent(in) :: x The upper limit of the integration. Return Value real(kind=real64) The value of the regularized beta function.","tags":"","loc":"proc\\regularized_beta.html"},{"title":"rejection_sample – FSTATS","text":"public  function rejection_sample(tdist, n, xmin, xmax) result(rst) Uses rejection sampling to randomly sample a target distribution. Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: tdist The distribution to sample integer(kind=int32), intent(in) :: n The number of samples to make. real(kind=real64), intent(in) :: xmin The minimum range to explore. real(kind=real64), intent(in) :: xmax The maximum range to explore. Return Value real(kind=real64), allocatable, dimension(:) An N-element array containing the N samples from the \ndistribution.","tags":"","loc":"proc\\rejection_sample.html"},{"title":"box_muller_sample – FSTATS","text":"public interface box_muller_sample Generates random, normally distributed values via the Box-Muller \ntransform. Module Procedures private  function box_muller_sample_scalar(mu, sigma) result(rst) Generates a pair of independent, standard, normally distributed\nrandom values using the Box-Muller transform. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: mu The mean of the distribution. real(kind=real64), intent(in) :: sigma The standard deviation of the distribution. Return Value real(kind=real64), (2) The pair of random values. private  function box_muller_array(mu, sigma, n) result(rst) Generates an array of normally distributed random values sampled\nby the Box-Muller transform. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: mu The mean of the distribution. real(kind=real64), intent(in) :: sigma The standard deviation of the distribution. integer(kind=int32), intent(in) :: n The number of Box-Muller pairs to generate. Return Value real(kind=real64), allocatable, dimension(:) A 2N-element array containing the N Box-Muller pairs.","tags":"","loc":"interface\\box_muller_sample.html"},{"title":"lowess – FSTATS","text":"public  subroutine lowess(x, y, ys, fsmooth, nstps, del, rweights, resid, err) Computes the smoothing of a data set using a robust locally weighted\nscatterplot smoothing (LOWESS) algorithm.  Fitted values are computed at\neach of the supplied x values. Remarks The code is a reimplementation of the LOWESS library.  For a detailed\nunderstanding, see [this]\n(http://www.aliquote.org/cours/2012_biomed/biblio/Cleveland1979.pdf) \npaper by William Cleveland. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x An N-element array containing the independent variable data.  This\narray must be monotonically increasing. real(kind=real64), intent(in), dimension(:) :: y An N-element array containing the dependent variable data. real(kind=real64), intent(out), dimension(:) :: ys An N-element array where the smoothed results will be written. real(kind=real64), intent(in), optional :: fsmooth An optional input that specifies the amount of smoothing. Specifically, this value is the fraction of points used to compute\neach value.  As this value increases, the output becomes smoother.\nChoosing a value in the range of 0.2 to 0.8 typically results in a\ngood fit.  The default value is 0.2. integer(kind=int32), intent(in), optional :: nstps An optional input that specifies the numb of iterations.  If set to\nzero, a non-robust fit is returned.  The default value is set to 2. real(kind=real64), intent(in), optional :: del real(kind=real64), intent(out), optional, dimension(:), target :: rweights An optional N-element array, that if supplied, will be used to\nreturn the weights given to each data point. real(kind=real64), intent(out), optional, dimension(:), target :: resid An optional N-element array, that if supplied, will be used to \nreturn the residual. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not \n     approriately sized.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation error.","tags":"","loc":"proc\\lowess.html"},{"title":"bootstrap – FSTATS","text":"public  function bootstrap(stat, x, method, nsamples, alpha) result(rst) Performs a bootstrap calculation on the supplied data set for the given\nstatistic.  The default implementation utlizes a random resampling with \nreplacement.  Other resampling methods may be defined by specifying an \nappropriate routine by means of the method input. Arguments Type Intent Optional Attributes Name procedure( bootstrap_statistic_routine ), intent(in), pointer :: stat The routine used to compute the desired statistic. real(kind=real64), intent(in), dimension(:) :: x The N-element data set. procedure( bootstrap_resampling_routine ), intent(in), optional, pointer :: method An optional pointer to the method to use for resampling of the data.\nIf no method is supplied, a random resampling is utilized. integer(kind=int32), intent(in), optional :: nsamples An optional input, that if supplied, specifies the number of \nresampling runs to perform.  The default is 10 000. real(kind=real64), intent(in), optional :: alpha An optional input, that if supplied, defines the significance level\nto use for the analysis.  The default is 0.05. Return Value type( bootstrap_statistics ) The resulting bootstrap_statistics type containing the confidence\nintervals, bias, standard error, etc. for the analyzed statistic.","tags":"","loc":"proc\\bootstrap.html"},{"title":"bootstrap_linear_least_squares – FSTATS","text":"public  subroutine bootstrap_linear_least_squares(order, intercept, x, y, coeffs, ymod, resid, nsamples, stats, bias, alpha, method, bscoeffs, err) Computes a linear least-squares regression to fit a set of data.\nBootstrapping is utilized to gain insight into the quality of \nthe fit.  Resampling for the bootstrap process is a random resampling \nwith replacement process with the range of values limited by the \nstandard deviation of the original data set. Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: order The order of the equation to fit.  This value must be at \nleast one (linear equation), but can be higher as desired, \nas long as there is sufficient data. logical, intent(in) :: intercept Set to true if the intercept is being computed as part of \nthe regression; else, false. real(kind=real64), intent(in), dimension(:) :: x An N-element array containing the independent variable\nmeasurement points. real(kind=real64), intent(in), dimension(:) :: y An N-element array containing the dependent variable\nmeasurement points. real(kind=real64), intent(out), dimension(:) :: coeffs An ORDER+1 element array where the coefficients will\nbe written. real(kind=real64), intent(out), dimension(:) :: ymod An N-element array where the modeled data will be written. real(kind=real64), intent(out), dimension(:) :: resid An N-element array where the residual error data will be \nwritten (modeled - actual). integer(kind=int32), intent(in), optional :: nsamples The number of bootstrapping samples to utilize. type( bootstrap_regression_statistics ), intent(out), optional, dimension(:) :: stats An M-element array of bootstrap_regression_statistics items \nwhere M = ORDER + 1 when intercept is set to true; however, \nif intercept is set to false, M = ORDER. real(kind=real64), intent(out), optional, dimension(:) :: bias An ORDER+1 element array where an estimate of the bias of\neach coefficient is returned based upon the results of the\nbootstrapping analysis.  The bias is computed as the difference \nbetween the mean of the boostrap population results for the given \nparameter and the original estimate of the given parameter. real(kind=real64), intent(in), optional :: alpha The significance level at which to evaluate the confidence \nintervals.  The default value is 0.05 such that a 95% \nconfidence interval is calculated. procedure( bootstrap_resampling_routine ), intent(in), optional, pointer :: method An optional pointer to the method to use for resampling of the data.\nIf no method is supplied, a random resampling is utilized. real(kind=real64), intent(out), optional, allocatable, target, dimension(:,:) :: bscoeffs An optional, allocatable matrix, containing the bootstrap \ndistributions for each parameter stored in each row of the matrix\nsuch that the resulting matrix is NCOEFFS -by- NSAMPLES. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not \n     approriately sized.\n- FS_INVALID_INPUT_ERROR: Occurs if order is less than 1.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error.","tags":"","loc":"proc\\bootstrap_linear_least_squares.html"},{"title":"bootstrap_nonlinear_least_squares – FSTATS","text":"public  subroutine bootstrap_nonlinear_least_squares(fun, x, y, params, ymod, resid, nsamples, weights, maxp, minp, stats, alpha, controls, settings, info, bias, method, bscoeffs, err) Performs a nonlinear regression to fit a model using a version\nof the Levenberg-Marquardt algorithm.  Bootstrapping is utilized to gain \ninsight into the quality of the fit.  Resampling for the bootstrap \nprocess is a random resampling with replacement process with the \nrange of values limited by the standard deviation of the original \ndata set. Arguments Type Intent Optional Attributes Name procedure( regression_function ), intent(in), pointer :: fun A pointer to the regression_function to evaluate. real(kind=real64), intent(in) :: x (:) The M-element array containing independent data. real(kind=real64), intent(in) :: y (:) The M-element array containing dependent data. real(kind=real64), intent(inout) :: params (:) On input, the N-element array containing the initial estimate\nof the model parameters.  On output, the computed model \nparameters. real(kind=real64), intent(out) :: ymod (:) An M-element array where the modeled dependent data will\nbe written. real(kind=real64), intent(out) :: resid (:) An M-element array where the model residuals will be\nwritten. integer(kind=int32), intent(in), optional :: nsamples The number of bootstrapping samples to utilize. real(kind=real64), intent(in), optional, target :: weights (:) An optional M-element array allowing the weighting of\nindividual points. real(kind=real64), intent(in), optional, target :: maxp (:) An optional N-element array that can be used as upper limits \non the parameter values.  If no upper limit is requested for\na particular parameter, utilize a very large value.  The \ninternal default is to utilize huge() as a value. real(kind=real64), intent(in), optional, target :: minp (:) An optional N-element array that can be used as lower limits \non the parameter values.  If no lower limit is requested for\na particalar parameter, utilize a very large magnitude, but \nnegative, value.  The internal default is to utilize -huge() \nas a value. type( bootstrap_regression_statistics ), intent(out), optional :: stats (:) An optional N-element array that, if supplied, will be used \nto return statistics about the fit for each parameter. real(kind=real64), intent(in), optional :: alpha The significance level at which to evaluate the confidence \nintervals.  The default value is 0.05 such that a 95% \nconfidence interval is calculated. type( iteration_controls ), intent(in), optional :: controls An optional input providing custom iteration controls. type( lm_solver_options ), intent(in), optional :: settings An optional input providing custom settings for the solver. type( convergence_info ), intent(out), optional, target :: info An optional output that can be used to gain information about\nthe iterative solution and the nature of the convergence. real(kind=real64), intent(out), optional, dimension(:) :: bias An optional N-element array that, if supplied, will be used to \nprovide an estimate of the bias of each model parameter based upon\nthe results of the bootstrapping analysis.  The bias is computed as \nthe difference between the mean of the boostrap population results \nfor the given parameter and the original estimate of the given \nparameter. procedure( bootstrap_resampling_routine ), intent(in), optional, pointer :: method An optional pointer to the method to use for resampling of the data.\nIf no method is supplied, a random resampling is utilized. real(kind=real64), intent(out), optional, allocatable, target, dimension(:,:) :: bscoeffs An optional, allocatable matrix, containing the bootstrap \ndistributions for each parameter stored in each row of the matrix\nsuch that the resulting matrix is NCOEFFS -by- NSAMPLES. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not \n     properly sized.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error.\n- FS_UNDERDEFINED_PROBLEM_ERROR: Occurs if the problem posed \n     is underdetetermined (M < N).\n- FS_TOLERANCE_TOO_SMALL_ERROR: Occurs if any supplied \n     tolerances are too small to be practical.\n- FS_TOO_FEW_ITERATION_ERROR: Occurs if too few iterations \n     are allowed.","tags":"","loc":"proc\\bootstrap_nonlinear_least_squares.html"},{"title":"random_resample – FSTATS","text":"public  subroutine random_resample(x, xn) Random resampling, with replacement, based upon a normal distribution. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The N-element array to resample. real(kind=real64), intent(out), dimension(size(x)) :: xn An N-element array where the resampled data set will be written.","tags":"","loc":"proc\\random_resample.html"},{"title":"scaled_random_resample – FSTATS","text":"public  subroutine scaled_random_resample(x, xn) A random resampling, scaled by the standard deviation of the original\ndata, but based upon a normal distribution. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The N-element array to resample. real(kind=real64), intent(out), dimension(size(x)) :: xn An N-element array where the resampled data set will be written.","tags":"","loc":"proc\\scaled_random_resample.html"},{"title":"bootstrap_resampling_routine – FSTATS","text":"interface public  subroutine bootstrap_resampling_routine(x, xn) Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The N-element array to resample. real(kind=real64), intent(out), dimension(size(x)) :: xn An N-element array where the resampled data set will be \nwritten. Description Defines the signature of a subroutine used to compute a \nresampling of data for bootstrapping purposes.","tags":"","loc":"interface\\bootstrap_resampling_routine.html"},{"title":"bootstrap_statistic_routine – FSTATS","text":"interface public  function bootstrap_statistic_routine(x) result(rst) Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The array of data to analyze. Return Value real(kind=real64) The resulting statistic. Description Defines the signature of a function for computing the desired\nbootstrap statistic.","tags":"","loc":"interface\\bootstrap_statistic_routine.html"},{"title":"allan_variance – FSTATS","text":"public  function allan_variance(x, dt, err) result(rst) Computes the Allan variance of a data set. Remarks This implementation computes the fully overlapped Allan variance \nusing the method presented by Yadav et. al. Yadav, Shrikanth & Shastri, Saurav & Chakravarthi, Ghanashyam & Kumar, \nViraj & Rao, Divya & Agrawal, Vinod. (2018). A Fast, Parallel Algorithm \nfor Fully Overlapped Allan Variance and Total Variance for Analysis and \nModeling of Noise in Inertial Sensors. IEEE Sensors Letters. PP. 1-1. \n10.1109/LSENS.2018.2829799. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The N-element data set to analyze. real(kind=real64), intent(in), optional :: dt An optional input specifying the time increment between \nsamples in x.  If not specified, this value is set to 1. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error. Return Value real(kind=real64), allocatable, dimension(:,:) An M-by-2 array containing the results where M is N / 2 - 1\nif N is even; else, M is (N - 1) / 2 - 1 if N is odd.  The \nfirst column contains the averaging times associated with \nthe M results stored in the second column.","tags":"","loc":"proc\\allan_variance.html"},{"title":"anova – FSTATS","text":"public interface anova Performs an analysis of variance (ANOVA) on the supplied data \nset. The following example illustrates a single-factor ANOVA on a \ndata set. program example use iso_fortran_env use fstats implicit none ! Local Variables character , parameter :: tab = achar ( 9 ) real ( real64 ) :: x ( 10 , 2 ) type ( single_factor_anova_table ) :: tbl ! Define the data x = reshape ( & [ & 3.086d3 , 3.082d3 , 3.069d3 , 3.072d3 , 3.045d3 , 3.070d3 , 3.079d3 , & 3.050d3 , 3.062d3 , 3.062d3 , 3.075d3 , 3.061d3 , 3.063d3 , 3.038d3 , & 3.070d3 , 3.062d3 , 3.070d3 , 3.049d3 , 3.042d3 , 3.063d3 & ], & [ 10 , 2 ] & ) ! Perform the ANOVA tbl = anova ( x ) ! Print out the table print '(A)' , \"Description\" // tab // \"DOF\" // tab // \"Sum of Sq.\" // & tab // \"Variance\" // tab // \"F-Stat\" // tab // \"P-Value\" print '(AF2.0AF5.1AF5.1AF5.3AF5.3)' , \"Main Factor: \" // tab , & tbl % main_factor % dof , tab , & tbl % main_factor % sum_of_squares , tab // tab , & tbl % main_factor % variance , tab // tab , & tbl % main_factor % f_statistic , tab , & tbl % main_factor % probability print '(AF3.0AF6.1AF5.1)' , \"Within: \" // tab , & tbl % within_factor % dof , tab , & tbl % within_factor % sum_of_squares , tab // tab , & tbl % within_factor % variance print '(AF3.0AF6.1AF5.1)' , \"Total: \" // tab // tab , & tbl % total_dof , tab , & tbl % total_sum_of_squares , tab // tab , & tbl % total_variance print '(AF6.1)' , \"Overall Mean: \" , tbl % overall_mean end program The above program produces the following output. Description     DOF     Sum of Sq.      Variance        F-Stat  P-Value\nMain Factor:    1.      352.8           352.8           2.147   0.160\nWithin:         18.     2958.2          164.3\nTotal:          19.     3311.0          174.3\nOverall Mean: 3063.5 See Also Wikipedia SPC Excel Single Factor ANOVA SPC Excel Gage R&R SPC Excel Understanding Regression Statistics NIST - Two Way ANOVA Module Procedures private  function anova_1_factor(x) result(rst) Performs an analysis of variance (ANOVA) on the supplied data set. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:,:) An M-by-N matrix containing the M replications of the N test \npoints of interest. Return Value type( single_factor_anova_table ) A single_factor_anova_table instance containing the ANOVA results. private  function anova_2_factor(x) result(rst) Performs an analysis of variance (ANOVA) on the supplied data set. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:,:,:) An M-by-N-by-K array containing the M replications of the\nN first factor results, and the K second factor results. Return Value type( two_factor_anova_table ) A two_factor_anova_table instance containing the ANOVA results. private  function anova_model_fit(nmodelparams, ymeas, ymod, err) result(rst) Performs an analysis of variance (ANOVA) on the supplied data set. Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: nmodelparams The number of model parameters. real(kind=real64), intent(in) :: ymeas (:) An N-element array containing the measured dependent variable data. real(kind=real64), intent(in) :: ymod (:) An N-element array containing the modeled dependent variable data. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if ymeas and ymod are not the \n  same length.\n- FS_MEMORY_ERROR: Occurs if a memory error is encountered. Return Value type( single_factor_anova_table ) A single_factor_anova_table instance containing the ANOVA results.","tags":"","loc":"interface\\anova.html"},{"title":"difference – FSTATS","text":"public pure function difference(x) result(rst) Computes the difference between elements in an array. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The N-element array on which to operate. Return Value real(kind=real64), allocatable, dimension(:) The (N-1)-element array containing the differences between adjacent\nelements.","tags":"","loc":"proc\\difference.html"},{"title":"factorial – FSTATS","text":"public pure elemental function factorial(x) result(rst) Computes the factorial of X. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x The value whose factorial is to be computed. Return Value real(kind=real64) The result.","tags":"","loc":"proc\\factorial.html"},{"title":"covariance – FSTATS","text":"public pure function covariance(x, y) result(rst) Computes the sample covariance of two data sets. The covariance computed is the sample covariance such that . Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The first N-element data set. real(kind=real64), intent(in), dimension(size(x)) :: y The second N-element data set. Return Value real(kind=real64) The covariance.","tags":"","loc":"proc\\covariance.html"},{"title":"mean – FSTATS","text":"public pure function mean(x) result(rst) Computes the mean of the values in an array. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:) The array of values to analyze. Return Value real(kind=real64) The result.","tags":"","loc":"proc\\mean.html"},{"title":"median – FSTATS","text":"public  function median(x) result(rst) Computes the median of the values in an array. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(inout) :: x (:) The array of values to analyze.  On output, this array is sorted into\nascending order. Return Value real(kind=real64) The result.","tags":"","loc":"proc\\median.html"},{"title":"quantile – FSTATS","text":"public pure function quantile(x, q) result(rst) Computes the specified quantile of a data set using the SAS \nMethod 4. See Also Wikipedia Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:) An N-element array containing the data. real(kind=real64), intent(in) :: q The quantile to compute (e.g. 0.25 computes the 25% quantile). Return Value real(kind=real64) The result.","tags":"","loc":"proc\\quantile.html"},{"title":"standard_deviation – FSTATS","text":"public pure function standard_deviation(x) result(rst) Computes the sample standard deviation of the values in an array. The value computed is the sample standard deviation. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:) The array of values to analyze. Return Value real(kind=real64) The result.","tags":"","loc":"proc\\standard_deviation.html"},{"title":"trimmed_mean – FSTATS","text":"public  function trimmed_mean(x, p) result(rst) Computes the trimmed mean of a data set. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(inout), dimension(:) :: x An N-element array containing the data.  On output, the\narray is sorted into ascending order. real(kind=real64), intent(in), optional :: p An optional parameter specifying the percentage of values\nfrom either end of the distribution to remove.  The default\nis 0.05 such that the bottom 5% and top 5% are removed. Return Value real(kind=real64) The trimmed mean.","tags":"","loc":"proc\\trimmed_mean.html"},{"title":"variance – FSTATS","text":"public pure function variance(x) result(rst) Computes the sample variance of the values in an array. The variance computed is the sample variance such that . Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:) The array of values to analyze. Return Value real(kind=real64)","tags":"","loc":"proc\\variance.html"},{"title":"pooled_variance – FSTATS","text":"public interface pooled_variance Computes the pooled estimate of variance. Module Procedures private pure function pooled_variance_1(si, ni) result(rst) Computes the pooled estimate of variance. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: si An N-element array containing the estimates for each of the N\nvariances. integer(kind=int32), intent(in), dimension(size(si)) :: ni An N-element array containing the number of data points in each\nof the data sets used to compute the variances in si. Return Value real(kind=real64) The pooled variance. private pure function pooled_variance_2(x) result(rst) Computes the pooled estimate of variance. Arguments Type Intent Optional Attributes Name type( array_container ), intent(in), dimension(:) :: x An array of arrays of data. Return Value real(kind=real64) The pooled variance.","tags":"","loc":"interface\\pooled_variance.html"},{"title":"full_factorial – FSTATS","text":"public  subroutine full_factorial(vars, tbl, err) Computes a table with values scaled from 1 to N describing a \nfull-factorial design. program example use iso_fortran_env use fstats implicit none ! Local Variables integer ( int32 ) :: i , vars ( 3 ), tbl ( 24 , 3 ) ! Define the number of design points for each of the 3 factors to study vars = [ 2 , 4 , 3 ] ! Determine the design table call full_factorial ( vars , tbl ) ! Display the table do i = 1 , size ( tbl , 1 ) print * , tbl ( i ,:) end do end program The above program produces the following output. 1           1           1\n1           1           2\n1           1           3\n1           2           1\n1           2           2\n1           2           3\n1           3           1\n1           3           2\n1           3           3\n1           4           1\n1           4           2\n1           4           3\n2           1           1\n2           1           2\n2           1           3\n2           2           1\n2           2           2\n2           2           3\n2           3           1\n2           3           2\n2           3           3\n2           4           1\n2           4           2\n2           4           3 Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: vars (:) An M-element array containing the M factors to study. Each of the M entries to the array is expected to contain \nthe number of options for that particular factor to explore. \nThis value must be greater than or equal to 1. integer(kind=int32), intent(out) :: tbl (:,:) A table where the design will be written.  Use \nget_full_factorial_matrix_size to determine the appropriate \ntable size. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_INVALID_INPUT_ERROR: Occurs if any items in vars are \n     less than 1.\n- FS_ARRAY_SIZE_ERROR: Occurs if tbl is not properly sized.","tags":"","loc":"proc\\full_factorial.html"},{"title":"get_full_factorial_matrix_size – FSTATS","text":"public  subroutine get_full_factorial_matrix_size(vars, m, n, err) Computes the appropriate size for a full-factorial design table. Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: vars (:) An M-element array containing the M factors to study.  Each \nof the M entries to the array is expected to contain the \nnumber of options for that particular factor to explore. This value must be greater than or equal to 1. integer(kind=int32), intent(out) :: m The number of rows for the table. integer(kind=int32), intent(out) :: n The number of columns for the table. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_INVALID_INPUT_ERROR: Occurs if any items in vars are \n     less than 1.","tags":"","loc":"proc\\get_full_factorial_matrix_size.html"},{"title":"adjusted_r_squared – FSTATS","text":"public  function adjusted_r_squared(p, x, xm, err) result(rst) Computes the adjusted R-squared value for a data set. The adjusted R-squared provides a mechanism for tempering the effects\nof extra explanatory variables on the traditional R-squared \ncalculation.  It is computed by noting the sample size and \nthe number of variables . . See Also: Wikipedia Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: p The number of variables. real(kind=real64), intent(in) :: x (:) An N-element array containing the dependent variables from \nthe data set. real(kind=real64), intent(in) :: xm (:) An N-element array containing the corresponding modeled \nvalues. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings\nto the caller.  Possible warning and error codes are as \nfollows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if x and xm are not the \n  same size. Return Value real(kind=real64) The result.","tags":"","loc":"proc\\adjusted_r_squared.html"},{"title":"calculate_regression_statistics – FSTATS","text":"public  function calculate_regression_statistics(resid, params, c, alpha, err) result(rst) Computes statistics for the quality of fit for a regression \nmodel. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: resid (:) An M-element array containing the model residual errors. real(kind=real64), intent(in) :: params (:) An N-element array containing the model parameters. real(kind=real64), intent(in) :: c (:,:) The N-by-N covariance matrix. real(kind=real64), intent(in), optional :: alpha The significance level at which to evaluate the confidence \nintervals.  The default value is 0.05 such that a 95% \nconfidence interval is calculated. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if c is not sized correctly.\n- FS_INVALID_INPUT_ERROR: Occurs if order is less than 1.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error. Return Value type( regression_statistics ), allocatable, (:) A regression_statistics object containing the analysis results.","tags":"","loc":"proc\\calculate_regression_statistics.html"},{"title":"correlation – FSTATS","text":"public pure function correlation(x, y) result(rst) Computes the sample correlation coefficient (an estimate to the \npopulation Pearson correlation) as follows. . Where, & are the sample standard deviations of\nx and y respectively. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The first N-element data set. real(kind=real64), intent(in), dimension(size(x)) :: y The second N-element data set. Return Value real(kind=real64) The correlation coefficient.","tags":"","loc":"proc\\correlation.html"},{"title":"r_squared – FSTATS","text":"public  function r_squared(x, xm, err) result(rst) Computes the R-squared value for a data set. The R-squared value is computed by determining the sum of the squares\nof the residuals: The total sum of the squares: . \nThe R-squared value is then: . See Also: Wikipedia Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:) An N-element array containing the dependent variables from \nthe data set. real(kind=real64), intent(in) :: xm (:) An N-element array containing the corresponding modeled \nvalues. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings\nto the caller.  Possible warning and error codes are as \nfollows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if x and xm are not the \n  same size. Return Value real(kind=real64) The result.","tags":"","loc":"proc\\r_squared.html"},{"title":"covariance_matrix – FSTATS","text":"public  subroutine covariance_matrix(x, c, err) Computes the covariance matrix where and is computed\nby design_matrix. See Also Wikipedia Wikipedia - Regression Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:,:) An M-by-N matrix containing the formatted independent data\n matrix as computed by design_matrix. real(kind=real64), intent(out) :: c (:,:) The N-by-N covariance matrix. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if any of the matrices are not \n     sized correctly.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error.","tags":"","loc":"proc\\covariance_matrix.html"},{"title":"design_matrix – FSTATS","text":"public  subroutine design_matrix(order, intercept, x, c, err) Computes the design matrix for the linear \nleast-squares regression problem of , where is the matrix computed here, is \nthe vector of coefficients to be determined, and is the \nvector of measured dependent variables. See Also Wikipedia Wikipedia Wikipedia Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: order The order of the equation to fit.  This value must be\nat least one (linear equation), but can be higher as desired. logical, intent(in) :: intercept Set to true if the intercept is being computed\nas part of the regression; else, false. real(kind=real64), intent(in) :: x (:) An N-element array containing the independent variable\nmeasurement points. real(kind=real64), intent(out) :: c (:,:) An N-by-K matrix where the results will be written.  K\nmust equal order + 1 in the event intercept is true; \nhowever, if intercept is false, K must equal order. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if c is not properly sized.\n- FS_INVALID_INPUT_ERROR: Occurs if order is less than 1.","tags":"","loc":"proc\\design_matrix.html"},{"title":"jacobian – FSTATS","text":"public  subroutine jacobian(fun, xdata, params, jac, stop, f0, f1, step, err) Computes the Jacobian matrix for a nonlinear regression problem. Arguments Type Intent Optional Attributes Name procedure( regression_function ), intent(in), pointer :: fun A pointer to the regression_function to evaluate. real(kind=real64), intent(in) :: xdata (:) The M-element array containing x-coordinate data. real(kind=real64), intent(in) :: params (:) The N-element array containing the model parameters. real(kind=real64), intent(out) :: jac (:,:) The M-by-N matrix where the Jacobian will be written. logical, intent(out) :: stop A value that the user can set in fun forcing the\nevaluation process to stop prior to completion. real(kind=real64), intent(in), optional, target :: f0 (:) An optional M-element array containing the model values\n using the current parameters as defined in m.  This input \ncan be used to prevent the routine from performing a \nfunction evaluation at the model parameter state defined in \nparams. real(kind=real64), intent(out), optional, target :: f1 (:) An optional M-element workspace array used for function\nevaluations. real(kind=real64), intent(in), optional :: step The differentiation step size.  The default is the square \nroot of machine precision. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not \n     properly sized.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error.","tags":"","loc":"proc\\jacobian.html"},{"title":"linear_least_squares – FSTATS","text":"public  subroutine linear_least_squares(order, intercept, x, y, coeffs, ymod, resid, stats, alpha, err) Computes a linear least-squares regression to fit a set of data. See Also Wikipedia SPC Excel Understanding Regression Statistics Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: order The order of the equation to fit.  This value must be at \nleast one (linear equation), but can be higher as desired, \nas long as there is sufficient data. logical, intent(in) :: intercept Set to true if the intercept is being computed as part of \nthe regression; else, false. real(kind=real64), intent(in) :: x (:) An N-element array containing the independent variable\nmeasurement points. real(kind=real64), intent(in) :: y (:) An N-element array containing the dependent variable\nmeasurement points. real(kind=real64), intent(out) :: coeffs (:) An ORDER+1 element array where the coefficients will be written. real(kind=real64), intent(out) :: ymod (:) An N-element array where the modeled data will be written. real(kind=real64), intent(out) :: resid (:) An N-element array where the residual error data will be \nwritten (modeled - actual). type( regression_statistics ), intent(out), optional :: stats (:) An M-element array of regression_statistics items where \nM = ORDER + 1 when intercept is set to true; however, if \nintercept is set to false, M = ORDER. real(kind=real64), intent(in), optional :: alpha The significance level at which to evaluate the confidence \nintervals.  The default value is 0.05 such that a 95% \nconfidence interval is calculated. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not \n     approriately sized.\n- FS_INVALID_INPUT_ERROR: Occurs if order is less than 1.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error.","tags":"","loc":"proc\\linear_least_squares.html"},{"title":"nonlinear_least_squares – FSTATS","text":"public  subroutine nonlinear_least_squares(fun, x, y, params, ymod, resid, weights, maxp, minp, stats, alpha, controls, settings, info, status, err) Performs a nonlinear regression to fit a model using a version\nof the Levenberg-Marquardt algorithm. Arguments Type Intent Optional Attributes Name procedure( regression_function ), intent(in), pointer :: fun A pointer to the regression_function to evaluate. real(kind=real64), intent(in) :: x (:) The M-element array containing independent data. real(kind=real64), intent(in) :: y (:) The M-element array containing dependent data. real(kind=real64), intent(inout) :: params (:) On input, the N-element array containing the initial estimate\nof the model parameters.  On output, the computed model \nparameters. real(kind=real64), intent(out) :: ymod (:) An M-element array where the modeled dependent data will\nbe written. real(kind=real64), intent(out) :: resid (:) An M-element array where the model residuals will be\nwritten. real(kind=real64), intent(in), optional, target :: weights (:) An optional M-element array allowing the weighting of\nindividual points. real(kind=real64), intent(in), optional, target :: maxp (:) An optional N-element array that can be used as upper limits \non the parameter values.  If no upper limit is requested for\na particular parameter, utilize a very large value.  The \ninternal default is to utilize huge() as a value. real(kind=real64), intent(in), optional, target :: minp (:) An optional N-element array that can be used as lower limits \non the parameter values.  If no lower limit is requested for\na particalar parameter, utilize a very large magnitude, but \nnegative, value.  The internal default is to utilize -huge() \nas a value. type( regression_statistics ), intent(out), optional :: stats (:) An optional N-element array that, if supplied, will be used \nto return statistics about the fit for each parameter. real(kind=real64), intent(in), optional :: alpha The significance level at which to evaluate the confidence \nintervals.  The default value is 0.05 such that a 95% \nconfidence interval is calculated. type( iteration_controls ), intent(in), optional :: controls An optional input providing custom iteration controls. type( lm_solver_options ), intent(in), optional :: settings An optional input providing custom settings for the solver. type( convergence_info ), intent(out), optional, target :: info An optional output that can be used to gain information about\nthe iterative solution and the nature of the convergence. procedure( iteration_update ), intent(in), optional, pointer :: status An optional pointer to a routine that can be used to extract\niteration information. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not \n     properly sized.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error.\n- FS_UNDERDEFINED_PROBLEM_ERROR: Occurs if the problem posed \n     is underdetetermined (M < N).\n- FS_TOLERANCE_TOO_SMALL_ERROR: Occurs if any supplied \n     tolerances are too small to be practical.\n- FS_TOO_FEW_ITERATION_ERROR: Occurs if too few iterations \n     are allowed.","tags":"","loc":"proc\\nonlinear_least_squares.html"},{"title":"iteration_update – FSTATS","text":"interface public  subroutine iteration_update(iter, funvals, resid, params, step) Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: iter real(kind=real64), intent(in) :: funvals (:) real(kind=real64), intent(in) :: resid (:) real(kind=real64), intent(in) :: params (:) real(kind=real64), intent(in) :: step (:)","tags":"","loc":"interface\\iteration_update.html"},{"title":"regression_function – FSTATS","text":"interface public  subroutine regression_function(xdata, params, resid, stop) Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: xdata real(kind=real64), intent(in), dimension(:) :: params real(kind=real64), intent(out), dimension(:) :: resid logical, intent(out) :: stop","tags":"","loc":"interface\\regression_function.html"},{"title":"distribution_function – FSTATS","text":"interface public pure elemental function distribution_function(this, x) result(rst) Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: this The distribution object. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The value of the function. Description Defines the interface for a probability distribution function.","tags":"","loc":"interface\\distribution_function.html"},{"title":"distribution_property – FSTATS","text":"interface public pure function distribution_property(this) result(rst) Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: this The distribution object. Return Value real(kind=real64) The property value. Description Computes the value of a distribution property.","tags":"","loc":"interface\\distribution_property.html"},{"title":"report_array_size_error – FSTATS","text":"public  subroutine report_array_size_error(err, fname, name, expect, actual) Reports an array size error. Arguments Type Intent Optional Attributes Name class(errors), intent(inout) :: err The error handling object. character(len=*), intent(in) :: fname The name of the routine in which the error occurred. character(len=*), intent(in) :: name The name of the array. integer(kind=int32), intent(in) :: expect The expected size of the array. integer(kind=int32), intent(in) :: actual The actual size of the array. Variables Type Visibility Attributes Name Initial character(len=MESSAGE_SIZE), public :: msg","tags":"","loc":"proc\\report_array_size_error.html"},{"title":"report_arrays_not_same_size_error – FSTATS","text":"public  subroutine report_arrays_not_same_size_error(err, fname, name1, name2, size1, size2) Reports an error relating to two arrays not being the same size\nwhen they should be the same size. Arguments Type Intent Optional Attributes Name class(errors), intent(inout) :: err The error handling object. character(len=*), intent(in) :: fname The name of the routine in which the error occurred. character(len=*), intent(in) :: name1 The name of the first array. character(len=*), intent(in) :: name2 The name of the second array. integer(kind=int32), intent(in) :: size1 The size of the first array. integer(kind=int32), intent(in) :: size2 The size of the second array. Variables Type Visibility Attributes Name Initial character(len=MESSAGE_SIZE), public :: msg","tags":"","loc":"proc\\report_arrays_not_same_size_error.html"},{"title":"report_iteration_count_error – FSTATS","text":"public  subroutine report_iteration_count_error(err, fname, msg, mincount) Reports an iteration count error. Arguments Type Intent Optional Attributes Name class(errors), intent(inout) :: err The error handling object. character(len=*) :: fname The name of the routine in which the error occurred. character(len=*) :: msg The error message. integer(kind=int32), intent(in) :: mincount The minimum iteration count expected. Variables Type Visibility Attributes Name Initial character(len=MESSAGE_SIZE), public :: emsg","tags":"","loc":"proc\\report_iteration_count_error.html"},{"title":"report_matrix_size_error – FSTATS","text":"public  subroutine report_matrix_size_error(err, fname, name, expect_rows, expect_cols, actual_rows, actual_cols) Reports a matrix size error. Arguments Type Intent Optional Attributes Name class(errors), intent(inout) :: err The error handling object. character(len=*), intent(in) :: fname The name of the routine in which the error occurred. character(len=*), intent(in) :: name The name of the matrix. integer(kind=int32), intent(in) :: expect_rows The expected number of rows. integer(kind=int32), intent(in) :: expect_cols The expected number of columns. integer(kind=int32), intent(in) :: actual_rows The actual number of rows. integer(kind=int32), intent(in) :: actual_cols The actual number of columns. Variables Type Visibility Attributes Name Initial character(len=MESSAGE_SIZE), public :: msg","tags":"","loc":"proc\\report_matrix_size_error.html"},{"title":"report_memory_error – FSTATS","text":"public  subroutine report_memory_error(err, fname, code) Reports a memory allocation related error. Arguments Type Intent Optional Attributes Name class(errors), intent(inout) :: err The error handling object. character(len=*), intent(in) :: fname The name of the routine in which the error occurred. integer(kind=int32), intent(in) :: code The error code returned by the allocation routine. Variables Type Visibility Attributes Name Initial character(len=MESSAGE_SIZE), public :: msg","tags":"","loc":"proc\\report_memory_error.html"},{"title":"report_underdefined_error – FSTATS","text":"public  subroutine report_underdefined_error(err, fname, expect, actual) Reports an underdefined problem error. Arguments Type Intent Optional Attributes Name class(errors), intent(inout) :: err The error handling object. character(len=*), intent(in) :: fname The name of the routine in which the error occurred. integer(kind=int32), intent(in) :: expect The expected minimum number of equations. integer(kind=int32), intent(in) :: actual The actual number of equations. Variables Type Visibility Attributes Name Initial character(len=MESSAGE_SIZE), public :: msg","tags":"","loc":"proc\\report_underdefined_error.html"},{"title":"bartletts_test – FSTATS","text":"public  subroutine bartletts_test(x, stat, p) Computes Bartlett's test statistic as follows. Where and is the pooled\nvariance. Arguments Type Intent Optional Attributes Name type( array_container ), intent(in), dimension(:) :: x The arrays of data to analyze. real(kind=real64), intent(out) :: stat The Bartlett's test statistic. real(kind=real64), intent(out) :: p The probability value that the variances of each data set are\nequivalent.  A low p-value, less than some significance level,\nindicates a non-equivalance of variances.","tags":"","loc":"proc\\bartletts_test.html"},{"title":"f_test – FSTATS","text":"public  subroutine f_test(x1, x2, stat, p, dof1, dof2) Computes the F-test and returns the probability (two-tailed) that\nthe variances of two data sets are not significantly different. See Also Wikipedia Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x1 (:) An N-element array containing the first data set. real(kind=real64), intent(in) :: x2 (:) An M-element array containing the second data set. real(kind=real64), intent(out) :: stat The F-statistic. real(kind=real64), intent(out) :: p The probability value that the two samples are likely to\nhave come from the two underlying populations that \nhave the same variance. real(kind=real64), intent(out) :: dof1 A measure of the degrees of freedom. real(kind=real64), intent(out) :: dof2 A measure of the degrees of freedom.","tags":"","loc":"proc\\f_test.html"},{"title":"t_test_equal_variance – FSTATS","text":"public  subroutine t_test_equal_variance(x1, x2, stat, p, dof) Computes the 2-tailed Student's T-Test for two data sets of \nassumed equivalent variances. See Also Wikipedia Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x1 (:) An N-element array containing the first data set. real(kind=real64), intent(in) :: x2 (:) An M-element array containing the second data set. real(kind=real64), intent(out) :: stat The Student-'s T-Test statistic. real(kind=real64), intent(out) :: p The probability value that the two samples are likely to\nhave come from two underlying populations that \nhave the same mean. real(kind=real64), intent(out) :: dof The degrees of freedom.","tags":"","loc":"proc\\t_test_equal_variance.html"},{"title":"t_test_paired – FSTATS","text":"public  subroutine t_test_paired(x1, x2, stat, p, dof, err) Computes the 2-tailed Student's T-Test for two paired data sets. See Also Wikipedia Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x1 (:) An N-element array containing the first data set. real(kind=real64), intent(in) :: x2 (:) An N-element array containing the second data set. real(kind=real64), intent(out) :: stat The Student-'s T-Test statistic. real(kind=real64), intent(out) :: p The probability value that the two samples are likely to\nhave come from  two underlying populations that \nhave the same mean. real(kind=real64), intent(out) :: dof The degrees of freedom. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if x1 and x2 are not the same \n  length.","tags":"","loc":"proc\\t_test_paired.html"},{"title":"t_test_unequal_variance – FSTATS","text":"public  subroutine t_test_unequal_variance(x1, x2, stat, p, dof) Computes the 2-tailed Student's T-Test for two data sets of \nassumed non-equivalent variances. See Also Wikipedia Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x1 (:) An N-element array containing the first data set. real(kind=real64), intent(in) :: x2 (:) An M-element array containing the second data set. real(kind=real64), intent(out) :: stat The Student-'s T-Test statistic. real(kind=real64), intent(out) :: p The probability value that the two samples are likely to\nhave come from two underlying populations that \nhave the same mean. real(kind=real64), intent(out) :: dof The degrees of freedom.","tags":"","loc":"proc\\t_test_unequal_variance.html"},{"title":"confidence_interval – FSTATS","text":"public interface confidence_interval Computes the confidence interval for the specified distribution. See Also Wikipedia Module Procedures private pure function confidence_interval_scalar(dist, alpha, s, n) result(rst) Computes the confidence interval for the specified distribution. Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: dist The distribution object defining the probability distribution\nto establish the confidence level. real(kind=real64), intent(in) :: alpha The probability value of interest.  For instance, use a value of 0.05\nfor a confidence level of 95%. real(kind=real64), intent(in) :: s The sample standard deviation. integer(kind=int32), intent(in) :: n The number of samples in the data set. Return Value real(kind=real64) The result. private pure function confidence_interval_array(dist, alpha, x) result(rst) Computes the confidence interval for the specified distribution. Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: dist The distribution object defining the probability distribution\nto establish the confidence level. real(kind=real64), intent(in) :: alpha The probability value of interest.  For instance, use a value of 0.05\nfor a confidence level of 95%. real(kind=real64), intent(in) :: x (:) An N-element array containing the data to analyze. Return Value real(kind=real64) The result.","tags":"","loc":"interface\\confidence_interval.html"},{"title":"fstats_special_functions – FSTATS","text":"Uses iso_fortran_env ieee_arithmetic Functions public pure elemental function beta (a, b) result(rst) Computes the beta function. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: a The first argument of the function. real(kind=real64), intent(in) :: b The second argument of the function. Return Value real(kind=real64) The value of the beta function at and . public pure elemental function digamma (x) result(rst) Computes the digamma function. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The function value. public pure elemental function incomplete_beta (a, b, x) result(rst) Computes the incomplete beta function. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: a The first argument of the function. real(kind=real64), intent(in) :: b The second argument of the function. real(kind=real64), intent(in) :: x The upper limit of the integration. Return Value real(kind=real64) The value of the incomplete beta function. public pure elemental function incomplete_gamma_lower (a, x) result(rst) Computes the lower incomplete gamma function. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: a The coefficient value. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The function value. public pure elemental function incomplete_gamma_upper (a, x) result(rst) Computes the upper incomplete gamma function. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: a The coefficient value. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The function value. public pure elemental function regularized_beta (a, b, x) result(rst) Computes the regularized beta function. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: a The first argument of the function. real(kind=real64), intent(in) :: b The second argument of the function. real(kind=real64), intent(in) :: x The upper limit of the integration. Return Value real(kind=real64) The value of the regularized beta function.","tags":"","loc":"module\\fstats_special_functions.html"},{"title":"fstats_sampling – FSTATS","text":"Uses iso_fortran_env linalg fstats_distributions Interfaces public        interface box_muller_sample Generates random, normally distributed values via the Box-Muller \ntransform. private  function box_muller_sample_scalar(mu, sigma) result(rst) Generates a pair of independent, standard, normally distributed\nrandom values using the Box-Muller transform. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: mu The mean of the distribution. real(kind=real64), intent(in) :: sigma The standard deviation of the distribution. Return Value real(kind=real64), (2) The pair of random values. private  function box_muller_array(mu, sigma, n) result(rst) Generates an array of normally distributed random values sampled\nby the Box-Muller transform. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: mu The mean of the distribution. real(kind=real64), intent(in) :: sigma The standard deviation of the distribution. integer(kind=int32), intent(in) :: n The number of Box-Muller pairs to generate. Return Value real(kind=real64), allocatable, dimension(:) A 2N-element array containing the N Box-Muller pairs. Functions public  function rejection_sample (tdist, n, xmin, xmax) result(rst) Uses rejection sampling to randomly sample a target distribution. Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: tdist The distribution to sample integer(kind=int32), intent(in) :: n The number of samples to make. real(kind=real64), intent(in) :: xmin The minimum range to explore. real(kind=real64), intent(in) :: xmax The maximum range to explore. Return Value real(kind=real64), allocatable, dimension(:) An N-element array containing the N samples from the \ndistribution.","tags":"","loc":"module\\fstats_sampling.html"},{"title":"fstats_smoothing – FSTATS","text":"Uses iso_fortran_env fstats_errors linalg ferror Subroutines public  subroutine lowess (x, y, ys, fsmooth, nstps, del, rweights, resid, err) Computes the smoothing of a data set using a robust locally weighted\nscatterplot smoothing (LOWESS) algorithm.  Fitted values are computed at\neach of the supplied x values. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x An N-element array containing the independent variable data.  This\narray must be monotonically increasing. real(kind=real64), intent(in), dimension(:) :: y An N-element array containing the dependent variable data. real(kind=real64), intent(out), dimension(:) :: ys An N-element array where the smoothed results will be written. real(kind=real64), intent(in), optional :: fsmooth An optional input that specifies the amount of smoothing. Specifically, this value is the fraction of points used to compute\neach value.  As this value increases, the output becomes smoother.\nChoosing a value in the range of 0.2 to 0.8 typically results in a\ngood fit.  The default value is 0.2. integer(kind=int32), intent(in), optional :: nstps An optional input that specifies the numb of iterations.  If set to\nzero, a non-robust fit is returned.  The default value is set to 2. real(kind=real64), intent(in), optional :: del real(kind=real64), intent(out), optional, dimension(:), target :: rweights An optional N-element array, that if supplied, will be used to\nreturn the weights given to each data point. real(kind=real64), intent(out), optional, dimension(:), target :: resid An optional N-element array, that if supplied, will be used to \nreturn the residual. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not \n     approriately sized.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation error.","tags":"","loc":"module\\fstats_smoothing.html"},{"title":"fstats_bootstrap – FSTATS","text":"Uses fstats_distributions omp_lib fstats_descriptive_statistics fstats_regression fstats_errors fstats_special_functions linalg iso_fortran_env Interfaces interface public  subroutine bootstrap_resampling_routine(x, xn) Defines the signature of a subroutine used to compute a \nresampling of data for bootstrapping purposes. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The N-element array to resample. real(kind=real64), intent(out), dimension(size(x)) :: xn An N-element array where the resampled data set will be \nwritten. interface public  function bootstrap_statistic_routine(x) result(rst) Defines the signature of a function for computing the desired\nbootstrap statistic. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The array of data to analyze. Return Value real(kind=real64) The resulting statistic. Derived Types type, public :: bootstrap_regression_statistics A container for regression-related statistical information as \ncomputed in a bootstrap, or equivalent, calculation. Components Type Visibility Attributes Name Initial real(kind=real64), public :: lower_confidence_interval The lower limit of the confidence interval for the parameter. real(kind=real64), public :: probability The probability that the coefficient is not statistically \nimportant.  A statistically important coefficient will have a \nlow probability (p-value), typically 0.05 or lower; however, a \np-value of up to ~0.2 may be acceptable dependent upon the \nproblem.  Typically any p-value larger than ~0.2 indicates the \nparameter is not statistically important for the model. Read more… real(kind=real64), public :: standard_error The standard error for the model coefficient. real(kind=real64), public :: t_statistic The T-statistic for the model coefficient. Read more… real(kind=real64), public :: upper_confidence_interval The upper limit of the confidence interval for the parameter. type, public :: bootstrap_statistics A collection of statistics resulting from the bootstrap process. Components Type Visibility Attributes Name Initial real(kind=real64), public :: bias The bias in the statistic. real(kind=real64), public :: lower_confidence_interval The lower confidence limit on the statistic. real(kind=real64), public, allocatable, dimension(:) :: population An array of the population values generated by the bootstrap\nprocess. real(kind=real64), public :: standard_error The standard error of the statistic. real(kind=real64), public :: statistic_value The value of the statistic of interest. real(kind=real64), public :: upper_confidence_interval The upper confidence limit on the statistic. Functions public  function bootstrap (stat, x, method, nsamples, alpha) result(rst) Performs a bootstrap calculation on the supplied data set for the given\nstatistic.  The default implementation utlizes a random resampling with \nreplacement.  Other resampling methods may be defined by specifying an \nappropriate routine by means of the method input. Arguments Type Intent Optional Attributes Name procedure( bootstrap_statistic_routine ), intent(in), pointer :: stat The routine used to compute the desired statistic. real(kind=real64), intent(in), dimension(:) :: x The N-element data set. procedure( bootstrap_resampling_routine ), intent(in), optional, pointer :: method An optional pointer to the method to use for resampling of the data.\nIf no method is supplied, a random resampling is utilized. integer(kind=int32), intent(in), optional :: nsamples An optional input, that if supplied, specifies the number of \nresampling runs to perform.  The default is 10 000. real(kind=real64), intent(in), optional :: alpha An optional input, that if supplied, defines the significance level\nto use for the analysis.  The default is 0.05. Return Value type( bootstrap_statistics ) The resulting bootstrap_statistics type containing the confidence\nintervals, bias, standard error, etc. for the analyzed statistic. Subroutines public  subroutine bootstrap_linear_least_squares (order, intercept, x, y, coeffs, ymod, resid, nsamples, stats, bias, alpha, method, bscoeffs, err) Computes a linear least-squares regression to fit a set of data.\nBootstrapping is utilized to gain insight into the quality of \nthe fit.  Resampling for the bootstrap process is a random resampling \nwith replacement process with the range of values limited by the \nstandard deviation of the original data set. Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: order The order of the equation to fit.  This value must be at \nleast one (linear equation), but can be higher as desired, \nas long as there is sufficient data. logical, intent(in) :: intercept Set to true if the intercept is being computed as part of \nthe regression; else, false. real(kind=real64), intent(in), dimension(:) :: x An N-element array containing the independent variable\nmeasurement points. real(kind=real64), intent(in), dimension(:) :: y An N-element array containing the dependent variable\nmeasurement points. real(kind=real64), intent(out), dimension(:) :: coeffs An ORDER+1 element array where the coefficients will\nbe written. real(kind=real64), intent(out), dimension(:) :: ymod An N-element array where the modeled data will be written. real(kind=real64), intent(out), dimension(:) :: resid An N-element array where the residual error data will be \nwritten (modeled - actual). integer(kind=int32), intent(in), optional :: nsamples The number of bootstrapping samples to utilize. type( bootstrap_regression_statistics ), intent(out), optional, dimension(:) :: stats An M-element array of bootstrap_regression_statistics items \nwhere M = ORDER + 1 when intercept is set to true; however, \nif intercept is set to false, M = ORDER. real(kind=real64), intent(out), optional, dimension(:) :: bias An ORDER+1 element array where an estimate of the bias of\neach coefficient is returned based upon the results of the\nbootstrapping analysis.  The bias is computed as the difference \nbetween the mean of the boostrap population results for the given \nparameter and the original estimate of the given parameter. real(kind=real64), intent(in), optional :: alpha The significance level at which to evaluate the confidence \nintervals.  The default value is 0.05 such that a 95% \nconfidence interval is calculated. procedure( bootstrap_resampling_routine ), intent(in), optional, pointer :: method An optional pointer to the method to use for resampling of the data.\nIf no method is supplied, a random resampling is utilized. real(kind=real64), intent(out), optional, allocatable, target, dimension(:,:) :: bscoeffs An optional, allocatable matrix, containing the bootstrap \ndistributions for each parameter stored in each row of the matrix\nsuch that the resulting matrix is NCOEFFS -by- NSAMPLES. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not \n     approriately sized.\n- FS_INVALID_INPUT_ERROR: Occurs if order is less than 1.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error. public  subroutine bootstrap_nonlinear_least_squares (fun, x, y, params, ymod, resid, nsamples, weights, maxp, minp, stats, alpha, controls, settings, info, bias, method, bscoeffs, err) Performs a nonlinear regression to fit a model using a version\nof the Levenberg-Marquardt algorithm.  Bootstrapping is utilized to gain \ninsight into the quality of the fit.  Resampling for the bootstrap \nprocess is a random resampling with replacement process with the \nrange of values limited by the standard deviation of the original \ndata set. Arguments Type Intent Optional Attributes Name procedure( regression_function ), intent(in), pointer :: fun A pointer to the regression_function to evaluate. real(kind=real64), intent(in) :: x (:) The M-element array containing independent data. real(kind=real64), intent(in) :: y (:) The M-element array containing dependent data. real(kind=real64), intent(inout) :: params (:) On input, the N-element array containing the initial estimate\nof the model parameters.  On output, the computed model \nparameters. real(kind=real64), intent(out) :: ymod (:) An M-element array where the modeled dependent data will\nbe written. real(kind=real64), intent(out) :: resid (:) An M-element array where the model residuals will be\nwritten. integer(kind=int32), intent(in), optional :: nsamples The number of bootstrapping samples to utilize. real(kind=real64), intent(in), optional, target :: weights (:) An optional M-element array allowing the weighting of\nindividual points. real(kind=real64), intent(in), optional, target :: maxp (:) An optional N-element array that can be used as upper limits \non the parameter values.  If no upper limit is requested for\na particular parameter, utilize a very large value.  The \ninternal default is to utilize huge() as a value. real(kind=real64), intent(in), optional, target :: minp (:) An optional N-element array that can be used as lower limits \non the parameter values.  If no lower limit is requested for\na particalar parameter, utilize a very large magnitude, but \nnegative, value.  The internal default is to utilize -huge() \nas a value. type( bootstrap_regression_statistics ), intent(out), optional :: stats (:) An optional N-element array that, if supplied, will be used \nto return statistics about the fit for each parameter. real(kind=real64), intent(in), optional :: alpha The significance level at which to evaluate the confidence \nintervals.  The default value is 0.05 such that a 95% \nconfidence interval is calculated. type( iteration_controls ), intent(in), optional :: controls An optional input providing custom iteration controls. type( lm_solver_options ), intent(in), optional :: settings An optional input providing custom settings for the solver. type( convergence_info ), intent(out), optional, target :: info An optional output that can be used to gain information about\nthe iterative solution and the nature of the convergence. real(kind=real64), intent(out), optional, dimension(:) :: bias An optional N-element array that, if supplied, will be used to \nprovide an estimate of the bias of each model parameter based upon\nthe results of the bootstrapping analysis.  The bias is computed as \nthe difference between the mean of the boostrap population results \nfor the given parameter and the original estimate of the given \nparameter. procedure( bootstrap_resampling_routine ), intent(in), optional, pointer :: method An optional pointer to the method to use for resampling of the data.\nIf no method is supplied, a random resampling is utilized. real(kind=real64), intent(out), optional, allocatable, target, dimension(:,:) :: bscoeffs An optional, allocatable matrix, containing the bootstrap \ndistributions for each parameter stored in each row of the matrix\nsuch that the resulting matrix is NCOEFFS -by- NSAMPLES. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not \n     properly sized.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error.\n- FS_UNDERDEFINED_PROBLEM_ERROR: Occurs if the problem posed \n     is underdetetermined (M < N).\n- FS_TOLERANCE_TOO_SMALL_ERROR: Occurs if any supplied \n     tolerances are too small to be practical.\n- FS_TOO_FEW_ITERATION_ERROR: Occurs if too few iterations \n     are allowed. public  subroutine random_resample (x, xn) Random resampling, with replacement, based upon a normal distribution. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The N-element array to resample. real(kind=real64), intent(out), dimension(size(x)) :: xn An N-element array where the resampled data set will be written. public  subroutine scaled_random_resample (x, xn) A random resampling, scaled by the standard deviation of the original\ndata, but based upon a normal distribution. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The N-element array to resample. real(kind=real64), intent(out), dimension(size(x)) :: xn An N-element array where the resampled data set will be written.","tags":"","loc":"module\\fstats_bootstrap.html"},{"title":"fstats_allan – FSTATS","text":"Uses iso_fortran_env fstats_errors Functions public  function allan_variance (x, dt, err) result(rst) Computes the Allan variance of a data set. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The N-element data set to analyze. real(kind=real64), intent(in), optional :: dt An optional input specifying the time increment between \nsamples in x.  If not specified, this value is set to 1. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error. Return Value real(kind=real64), allocatable, dimension(:,:) An M-by-2 array containing the results where M is N / 2 - 1\nif N is even; else, M is (N - 1) / 2 - 1 if N is odd.  The \nfirst column contains the averaging times associated with \nthe M results stored in the second column.","tags":"","loc":"module\\fstats_allan.html"},{"title":"fstats_anova – FSTATS","text":"Uses fstats_descriptive_statistics fstats_errors fstats_special_functions ieee_arithmetic ferror iso_fortran_env Interfaces public        interface anova Performs an analysis of variance (ANOVA) on the supplied data \nset. The following example illustrates a single-factor ANOVA on a \ndata set. program example use iso_fortran_env use fstats implicit none ! Local Variables character , parameter :: tab = achar ( 9 ) real ( real64 ) :: x ( 10 , 2 ) type ( single_factor_anova_table ) :: tbl ! Define the data x = reshape ( & [ & 3.086d3 , 3.082d3 , 3.069d3 , 3.072d3 , 3.045d3 , 3.070d3 , 3.079d3 , & 3.050d3 , 3.062d3 , 3.062d3 , 3.075d3 , 3.061d3 , 3.063d3 , 3.038d3 , & 3.070d3 , 3.062d3 , 3.070d3 , 3.049d3 , 3.042d3 , 3.063d3 & ], & [ 10 , 2 ] & ) ! Perform the ANOVA tbl = anova ( x ) ! Print out the table print '(A)' , \"Description\" // tab // \"DOF\" // tab // \"Sum of Sq.\" // & tab // \"Variance\" // tab // \"F-Stat\" // tab // \"P-Value\" print '(AF2.0AF5.1AF5.1AF5.3AF5.3)' , \"Main Factor: \" // tab , & tbl % main_factor % dof , tab , & tbl % main_factor % sum_of_squares , tab // tab , & tbl % main_factor % variance , tab // tab , & tbl % main_factor % f_statistic , tab , & tbl % main_factor % probability print '(AF3.0AF6.1AF5.1)' , \"Within: \" // tab , & tbl % within_factor % dof , tab , & tbl % within_factor % sum_of_squares , tab // tab , & tbl % within_factor % variance print '(AF3.0AF6.1AF5.1)' , \"Total: \" // tab // tab , & tbl % total_dof , tab , & tbl % total_sum_of_squares , tab // tab , & tbl % total_variance print '(AF6.1)' , \"Overall Mean: \" , tbl % overall_mean end program The above program produces the following output. Description     DOF     Sum of Sq.      Variance        F-Stat  P-Value\nMain Factor:    1.      352.8           352.8           2.147   0.160\nWithin:         18.     2958.2          164.3\nTotal:          19.     3311.0          174.3\nOverall Mean: 3063.5 See Also Wikipedia SPC Excel Single Factor ANOVA SPC Excel Gage R&R SPC Excel Understanding Regression Statistics NIST - Two Way ANOVA private  function anova_1_factor(x) result(rst) Performs an analysis of variance (ANOVA) on the supplied data set. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:,:) An M-by-N matrix containing the M replications of the N test \npoints of interest. Return Value type( single_factor_anova_table ) A single_factor_anova_table instance containing the ANOVA results. private  function anova_2_factor(x) result(rst) Performs an analysis of variance (ANOVA) on the supplied data set. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:,:,:) An M-by-N-by-K array containing the M replications of the\nN first factor results, and the K second factor results. Return Value type( two_factor_anova_table ) A two_factor_anova_table instance containing the ANOVA results. private  function anova_model_fit(nmodelparams, ymeas, ymod, err) result(rst) Performs an analysis of variance (ANOVA) on the supplied data set. Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: nmodelparams The number of model parameters. real(kind=real64), intent(in) :: ymeas (:) An N-element array containing the measured dependent variable data. real(kind=real64), intent(in) :: ymod (:) An N-element array containing the modeled dependent variable data. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if ymeas and ymod are not the \n  same length.\n- FS_MEMORY_ERROR: Occurs if a memory error is encountered. Return Value type( single_factor_anova_table ) A single_factor_anova_table instance containing the ANOVA results. Derived Types type, public :: anova_factor Defines an ANOVA factor result. Components Type Visibility Attributes Name Initial real(kind=real64), public :: dof The number of degrees of freedome. real(kind=real64), public :: f_statistic The F-statistic. real(kind=real64), public :: probability The variance probability term. real(kind=real64), public :: sum_of_squares The sum of the squares. real(kind=real64), public :: variance The estimate of variance. type, public :: single_factor_anova_table Defines a single-factor ANOVA results table. Components Type Visibility Attributes Name Initial type( anova_factor ), public :: main_factor The main, or main factor, results. real(kind=real64), public :: overall_mean The overall mean value. real(kind=real64), public :: total_dof The total number of degrees of freedom. real(kind=real64), public :: total_sum_of_squares The total sum of squares. real(kind=real64), public :: total_variance The total variance estimate. type( anova_factor ), public :: within_factor The within-treatement (error) results. type, public :: two_factor_anova_table Defines a two-factor ANOVA results table. Components Type Visibility Attributes Name Initial type( anova_factor ), public :: interaction The interaction effects. type( anova_factor ), public :: main_factor_1 The first main-factor results. type( anova_factor ), public :: main_factor_2 The second main-factor results. real(kind=real64), public :: overall_mean The overall mean value. real(kind=real64), public :: total_dof The total number of degrees of freedom. real(kind=real64), public :: total_sum_of_squares The total sum of squares. real(kind=real64), public :: total_variance The total variance estimate. type( anova_factor ), public :: within_factor The within (error) factor results.","tags":"","loc":"module\\fstats_anova.html"},{"title":"fstats_helper_routines – FSTATS","text":"Uses iso_fortran_env Functions public pure function difference (x) result(rst) Computes the difference between elements in an array. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The N-element array on which to operate. Return Value real(kind=real64), allocatable, dimension(:) The (N-1)-element array containing the differences between adjacent\nelements. public pure elemental function factorial (x) result(rst) Computes the factorial of X. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x The value whose factorial is to be computed. Return Value real(kind=real64) The result.","tags":"","loc":"module\\fstats_helper_routines.html"},{"title":"fstats_descriptive_statistics – FSTATS","text":"Uses fstats_errors linalg ferror iso_fortran_env fstats_types Interfaces public        interface pooled_variance Computes the pooled estimate of variance. private pure function pooled_variance_1(si, ni) result(rst) Computes the pooled estimate of variance. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: si An N-element array containing the estimates for each of the N\nvariances. integer(kind=int32), intent(in), dimension(size(si)) :: ni An N-element array containing the number of data points in each\nof the data sets used to compute the variances in si. Return Value real(kind=real64) The pooled variance. private pure function pooled_variance_2(x) result(rst) Computes the pooled estimate of variance. Arguments Type Intent Optional Attributes Name type( array_container ), intent(in), dimension(:) :: x An array of arrays of data. Return Value real(kind=real64) The pooled variance. Functions public pure function covariance (x, y) result(rst) Computes the sample covariance of two data sets. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The first N-element data set. real(kind=real64), intent(in), dimension(size(x)) :: y The second N-element data set. Return Value real(kind=real64) The covariance. public pure function mean (x) result(rst) Computes the mean of the values in an array. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:) The array of values to analyze. Return Value real(kind=real64) The result. public  function median (x) result(rst) Computes the median of the values in an array. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(inout) :: x (:) The array of values to analyze.  On output, this array is sorted into\nascending order. Return Value real(kind=real64) The result. public pure function quantile (x, q) result(rst) Computes the specified quantile of a data set using the SAS \nMethod 4. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:) An N-element array containing the data. real(kind=real64), intent(in) :: q The quantile to compute (e.g. 0.25 computes the 25% quantile). Return Value real(kind=real64) The result. public pure function standard_deviation (x) result(rst) Computes the sample standard deviation of the values in an array. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:) The array of values to analyze. Return Value real(kind=real64) The result. public  function trimmed_mean (x, p) result(rst) Computes the trimmed mean of a data set. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(inout), dimension(:) :: x An N-element array containing the data.  On output, the\narray is sorted into ascending order. real(kind=real64), intent(in), optional :: p An optional parameter specifying the percentage of values\nfrom either end of the distribution to remove.  The default\nis 0.05 such that the bottom 5% and top 5% are removed. Return Value real(kind=real64) The trimmed mean. public pure function variance (x) result(rst) Computes the sample variance of the values in an array. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:) The array of values to analyze. Return Value real(kind=real64)","tags":"","loc":"module\\fstats_descriptive_statistics.html"},{"title":"fstats – FSTATS","text":"FSTATS is a modern Fortran statistical library containing routines for \ncomputing basic statistical properties, hypothesis testing, regression, \nspecial functions, and experimental design. Uses fstats_distributions fstats_descriptive_statistics fstats_anova fstats_regression fstats_bootstrap fstats_experimental_design fstats_special_functions fstats_helper_routines fstats_smoothing fstats_sampling iso_fortran_env fstats_hypothesis fstats_allan","tags":"","loc":"module\\fstats.html"},{"title":"fstats_experimental_design – FSTATS","text":"Uses iso_fortran_env fstats_errors Subroutines public  subroutine full_factorial (vars, tbl, err) Computes a table with values scaled from 1 to N describing a \nfull-factorial design. Read more… Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: vars (:) An M-element array containing the M factors to study. Each of the M entries to the array is expected to contain \nthe number of options for that particular factor to explore. \nThis value must be greater than or equal to 1. integer(kind=int32), intent(out) :: tbl (:,:) A table where the design will be written.  Use \nget_full_factorial_matrix_size to determine the appropriate \ntable size. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_INVALID_INPUT_ERROR: Occurs if any items in vars are \n     less than 1.\n- FS_ARRAY_SIZE_ERROR: Occurs if tbl is not properly sized. public  subroutine get_full_factorial_matrix_size (vars, m, n, err) Computes the appropriate size for a full-factorial design table. Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: vars (:) An M-element array containing the M factors to study.  Each \nof the M entries to the array is expected to contain the \nnumber of options for that particular factor to explore. This value must be greater than or equal to 1. integer(kind=int32), intent(out) :: m The number of rows for the table. integer(kind=int32), intent(out) :: n The number of columns for the table. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_INVALID_INPUT_ERROR: Occurs if any items in vars are \n     less than 1.","tags":"","loc":"module\\fstats_experimental_design.html"},{"title":"fstats_regression – FSTATS","text":"Uses fstats_distributions fstats_descriptive_statistics blas fstats_errors fstats_special_functions linalg ferror iso_fortran_env fstats_hypothesis Variables Type Visibility Attributes Name Initial integer(kind=int32), public, parameter :: FS_LEVENBERG_MARQUARDT_UPDATE = 1 integer(kind=int32), public, parameter :: FS_NIELSEN_UPDATE = 3 integer(kind=int32), public, parameter :: FS_QUADRATIC_UPDATE = 2 Interfaces interface public  subroutine iteration_update(iter, funvals, resid, params, step) Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: iter real(kind=real64), intent(in) :: funvals (:) real(kind=real64), intent(in) :: resid (:) real(kind=real64), intent(in) :: params (:) real(kind=real64), intent(in) :: step (:) interface public  subroutine regression_function(xdata, params, resid, stop) Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: xdata real(kind=real64), intent(in), dimension(:) :: params real(kind=real64), intent(out), dimension(:) :: resid logical, intent(out) :: stop Derived Types type, public :: convergence_info Provides information regarding convergence status. Components Type Visibility Attributes Name Initial logical, public :: converge_on_gradient True if convergence on the gradient was achieved; else, false. logical, public :: converge_on_residual_parameter True if convergence on the residual error parameter was achieved; \nelse, false. logical, public :: converge_on_solution_change True if convergence on the change in solution was achieved; else,\nfalse. integer(kind=int32), public :: function_evaluation_count The function evaluation count. real(kind=real64), public :: gradient_value The value of the gradient test parameter. integer(kind=int32), public :: iteration_count The iteration count. logical, public :: reach_function_evaluation_limit True if the solution did not converge in the allowed number of\nfunction evaluations. logical, public :: reach_iteration_limit True if the solution did not converge in the allowed number of \niterations. real(kind=real64), public :: residual_value The value of the residual error parameter. real(kind=real64), public :: solution_change_value The value of the change in solution parameter. logical, public :: user_requested_stop True if the user requested the stop; else, false. type, public :: iteration_controls Provides a collection of iteration control parameters. Components Type Visibility Attributes Name Initial real(kind=real64), public :: change_in_solution_tolerance Defines a tolerance on the change in parameter values. real(kind=real64), public :: gradient_tolerance Defines a tolerance on the gradient of the fitted function. real(kind=real64), public :: iteration_improvement_tolerance Defines a tolerance to ensure adequate improvement on each \niteration. integer(kind=int32), public :: max_function_evaluations Defines the maximum number of function evaluations allowed. integer(kind=int32), public :: max_iteration_between_updates Defines how many iterations can pass before a re-evaluation of \nthe Jacobian matrix is forced. integer(kind=int32), public :: max_iteration_count Defines the maximum number of iterations allowed. real(kind=real64), public :: residual_tolerance Defines a tolerance on the metric associated with the residual \nerror. Type-Bound Procedures procedure, public :: set_to_default => lm_set_default_tolerances type, public :: lm_solver_options Options to control the Levenberg-Marquardt solver. Components Type Visibility Attributes Name Initial real(kind=real64), public :: damping_decrease_factor The factor to use when decreasing the damping parameter. real(kind=real64), public :: damping_increase_factor The factor to use when increasing the damping parameter. real(kind=real64), public :: finite_difference_step_size The step size used for the finite difference calculations of the\nJacobian matrix. integer(kind=int32), public :: method The solver method to utilize.\n- FS_LEVENBERG_MARQUARDT_UPDATE:\n- FS_QUADRATIC_UPDATE:\n- FS_NIELSEN_UDPATE: Type-Bound Procedures procedure, public :: set_to_default => lm_set_default_settings type, public :: regression_statistics A container for regression-related statistical information. Components Type Visibility Attributes Name Initial real(kind=real64), public :: confidence_interval The confidence interval for the parameter at the level \ndetermined by the regression process. Read more… real(kind=real64), public :: probability The probability that the coefficient is not statistically \nimportant.  A statistically important coefficient will have a \nlow probability (p-value), typically 0.05 or lower; however, a \np-value of up to ~0.2 may be acceptable dependent upon the \nproblem.  Typically any p-value larger than ~0.2 indicates the \nparameter is not statistically important for the model. Read more… real(kind=real64), public :: standard_error The standard error for the model coefficient. Read more… real(kind=real64), public :: t_statistic The T-statistic for the model coefficient. Read more… Functions public  function adjusted_r_squared (p, x, xm, err) result(rst) Computes the adjusted R-squared value for a data set. Read more… Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: p The number of variables. real(kind=real64), intent(in) :: x (:) An N-element array containing the dependent variables from \nthe data set. real(kind=real64), intent(in) :: xm (:) An N-element array containing the corresponding modeled \nvalues. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings\nto the caller.  Possible warning and error codes are as \nfollows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if x and xm are not the \n  same size. Return Value real(kind=real64) The result. public  function calculate_regression_statistics (resid, params, c, alpha, err) result(rst) Computes statistics for the quality of fit for a regression \nmodel. Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: resid (:) An M-element array containing the model residual errors. real(kind=real64), intent(in) :: params (:) An N-element array containing the model parameters. real(kind=real64), intent(in) :: c (:,:) The N-by-N covariance matrix. real(kind=real64), intent(in), optional :: alpha The significance level at which to evaluate the confidence \nintervals.  The default value is 0.05 such that a 95% \nconfidence interval is calculated. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if c is not sized correctly.\n- FS_INVALID_INPUT_ERROR: Occurs if order is less than 1.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error. Return Value type( regression_statistics ), allocatable, (:) A regression_statistics object containing the analysis results. public pure function correlation (x, y) result(rst) Computes the sample correlation coefficient (an estimate to the \npopulation Pearson correlation) as follows. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in), dimension(:) :: x The first N-element data set. real(kind=real64), intent(in), dimension(size(x)) :: y The second N-element data set. Return Value real(kind=real64) The correlation coefficient. public  function r_squared (x, xm, err) result(rst) Computes the R-squared value for a data set. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:) An N-element array containing the dependent variables from \nthe data set. real(kind=real64), intent(in) :: xm (:) An N-element array containing the corresponding modeled \nvalues. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings\nto the caller.  Possible warning and error codes are as \nfollows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if x and xm are not the \n  same size. Return Value real(kind=real64) The result. Subroutines public  subroutine covariance_matrix (x, c, err) Computes the covariance matrix where and is computed\nby design_matrix. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x (:,:) An M-by-N matrix containing the formatted independent data\n matrix as computed by design_matrix. real(kind=real64), intent(out) :: c (:,:) The N-by-N covariance matrix. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if any of the matrices are not \n     sized correctly.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error. public  subroutine design_matrix (order, intercept, x, c, err) Computes the design matrix for the linear \nleast-squares regression problem of , where is the matrix computed here, is \nthe vector of coefficients to be determined, and is the \nvector of measured dependent variables. Read more… Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: order The order of the equation to fit.  This value must be\nat least one (linear equation), but can be higher as desired. logical, intent(in) :: intercept Set to true if the intercept is being computed\nas part of the regression; else, false. real(kind=real64), intent(in) :: x (:) An N-element array containing the independent variable\nmeasurement points. real(kind=real64), intent(out) :: c (:,:) An N-by-K matrix where the results will be written.  K\nmust equal order + 1 in the event intercept is true; \nhowever, if intercept is false, K must equal order. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if c is not properly sized.\n- FS_INVALID_INPUT_ERROR: Occurs if order is less than 1. public  subroutine jacobian (fun, xdata, params, jac, stop, f0, f1, step, err) Computes the Jacobian matrix for a nonlinear regression problem. Arguments Type Intent Optional Attributes Name procedure( regression_function ), intent(in), pointer :: fun A pointer to the regression_function to evaluate. real(kind=real64), intent(in) :: xdata (:) The M-element array containing x-coordinate data. real(kind=real64), intent(in) :: params (:) The N-element array containing the model parameters. real(kind=real64), intent(out) :: jac (:,:) The M-by-N matrix where the Jacobian will be written. logical, intent(out) :: stop A value that the user can set in fun forcing the\nevaluation process to stop prior to completion. real(kind=real64), intent(in), optional, target :: f0 (:) An optional M-element array containing the model values\n using the current parameters as defined in m.  This input \ncan be used to prevent the routine from performing a \nfunction evaluation at the model parameter state defined in \nparams. real(kind=real64), intent(out), optional, target :: f1 (:) An optional M-element workspace array used for function\nevaluations. real(kind=real64), intent(in), optional :: step The differentiation step size.  The default is the square \nroot of machine precision. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not \n     properly sized.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error. public  subroutine linear_least_squares (order, intercept, x, y, coeffs, ymod, resid, stats, alpha, err) Computes a linear least-squares regression to fit a set of data. Read more… Arguments Type Intent Optional Attributes Name integer(kind=int32), intent(in) :: order The order of the equation to fit.  This value must be at \nleast one (linear equation), but can be higher as desired, \nas long as there is sufficient data. logical, intent(in) :: intercept Set to true if the intercept is being computed as part of \nthe regression; else, false. real(kind=real64), intent(in) :: x (:) An N-element array containing the independent variable\nmeasurement points. real(kind=real64), intent(in) :: y (:) An N-element array containing the dependent variable\nmeasurement points. real(kind=real64), intent(out) :: coeffs (:) An ORDER+1 element array where the coefficients will be written. real(kind=real64), intent(out) :: ymod (:) An N-element array where the modeled data will be written. real(kind=real64), intent(out) :: resid (:) An N-element array where the residual error data will be \nwritten (modeled - actual). type( regression_statistics ), intent(out), optional :: stats (:) An M-element array of regression_statistics items where \nM = ORDER + 1 when intercept is set to true; however, if \nintercept is set to false, M = ORDER. real(kind=real64), intent(in), optional :: alpha The significance level at which to evaluate the confidence \nintervals.  The default value is 0.05 such that a 95% \nconfidence interval is calculated. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not \n     approriately sized.\n- FS_INVALID_INPUT_ERROR: Occurs if order is less than 1.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error. public  subroutine nonlinear_least_squares (fun, x, y, params, ymod, resid, weights, maxp, minp, stats, alpha, controls, settings, info, status, err) Performs a nonlinear regression to fit a model using a version\nof the Levenberg-Marquardt algorithm. Arguments Type Intent Optional Attributes Name procedure( regression_function ), intent(in), pointer :: fun A pointer to the regression_function to evaluate. real(kind=real64), intent(in) :: x (:) The M-element array containing independent data. real(kind=real64), intent(in) :: y (:) The M-element array containing dependent data. real(kind=real64), intent(inout) :: params (:) On input, the N-element array containing the initial estimate\nof the model parameters.  On output, the computed model \nparameters. real(kind=real64), intent(out) :: ymod (:) An M-element array where the modeled dependent data will\nbe written. real(kind=real64), intent(out) :: resid (:) An M-element array where the model residuals will be\nwritten. real(kind=real64), intent(in), optional, target :: weights (:) An optional M-element array allowing the weighting of\nindividual points. real(kind=real64), intent(in), optional, target :: maxp (:) An optional N-element array that can be used as upper limits \non the parameter values.  If no upper limit is requested for\na particular parameter, utilize a very large value.  The \ninternal default is to utilize huge() as a value. real(kind=real64), intent(in), optional, target :: minp (:) An optional N-element array that can be used as lower limits \non the parameter values.  If no lower limit is requested for\na particalar parameter, utilize a very large magnitude, but \nnegative, value.  The internal default is to utilize -huge() \nas a value. type( regression_statistics ), intent(out), optional :: stats (:) An optional N-element array that, if supplied, will be used \nto return statistics about the fit for each parameter. real(kind=real64), intent(in), optional :: alpha The significance level at which to evaluate the confidence \nintervals.  The default value is 0.05 such that a 95% \nconfidence interval is calculated. type( iteration_controls ), intent(in), optional :: controls An optional input providing custom iteration controls. type( lm_solver_options ), intent(in), optional :: settings An optional input providing custom settings for the solver. type( convergence_info ), intent(out), optional, target :: info An optional output that can be used to gain information about\nthe iterative solution and the nature of the convergence. procedure( iteration_update ), intent(in), optional, pointer :: status An optional pointer to a routine that can be used to extract\niteration information. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not \n     properly sized.\n- FS_MEMORY_ERROR: Occurs if there is a memory allocation \n     error.\n- FS_UNDERDEFINED_PROBLEM_ERROR: Occurs if the problem posed \n     is underdetetermined (M < N).\n- FS_TOLERANCE_TOO_SMALL_ERROR: Occurs if any supplied \n     tolerances are too small to be practical.\n- FS_TOO_FEW_ITERATION_ERROR: Occurs if too few iterations \n     are allowed.","tags":"","loc":"module\\fstats_regression.html"},{"title":"fstats_types – FSTATS","text":"Uses iso_fortran_env Derived Types type, public :: array_container Provides a container for a real-valued array.  A practical use of\nthis construct is in the construction of jagged arrays. Components Type Visibility Attributes Name Initial real(kind=real64), public, allocatable, dimension(:) :: x The array.","tags":"","loc":"module\\fstats_types.html"},{"title":"fstats_distributions – FSTATS","text":"Uses iso_fortran_env fstats_helper_routines ieee_arithmetic fstats_special_functions Interfaces interface public pure elemental function distribution_function(this, x) result(rst) Defines the interface for a probability distribution function. Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: this The distribution object. real(kind=real64), intent(in) :: x The value at which to evaluate the function. Return Value real(kind=real64) The value of the function. interface public pure function distribution_property(this) result(rst) Computes the value of a distribution property. Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: this The distribution object. Return Value real(kind=real64) The property value. Derived Types type, public, extends( distribution ) :: binomial_distribution Defines a binomial distribution.  The binomial distribution describes\nthe probability p of getting k successes in n independent trials. Components Type Visibility Attributes Name Initial integer(kind=int32), public :: n The number of independent trials. real(kind=real64), public :: p The success probability for each trial.  This parameter must\nexist on the set [0, 1]. Type-Bound Procedures procedure, public :: cdf => bd_cdf procedure, public :: mean => bd_mean procedure, public :: median => bd_median procedure, public :: mode => bd_mode procedure, public :: pdf => bd_pdf procedure, public :: variance => bd_variance type, public, extends( distribution ) :: chi_squared_distribution Defines a Chi-squared distribution. Components Type Visibility Attributes Name Initial integer(kind=int32), public :: dof The number of degrees of freedom. Type-Bound Procedures procedure, public :: cdf => cs_cdf procedure, public :: mean => cs_mean procedure, public :: median => cs_median procedure, public :: mode => cs_mode procedure, public :: pdf => cs_pdf procedure, public :: variance => cs_variance type, public :: distribution Defines a probability distribution. Type-Bound Procedures procedure( distribution_function ), public, deferred, pass :: cdf ..\\..\\ Computes the cumulative distribution function.<\\p> procedure( distribution_property ), public, deferred, pass :: mean ..\\..\\ Computes the mean of the distribution.<\\p> procedure( distribution_property ), public, deferred, pass :: median ..\\..\\ Computes the median of the distribution.<\\p> procedure( distribution_property ), public, deferred, pass :: mode ..\\..\\ Computes the mode of the distribution.<\\p> procedure( distribution_function ), public, deferred, pass :: pdf ..\\..\\ Computes the probability density function.<\\p> procedure( distribution_property ), public, deferred, pass :: variance ..\\..\\ Computes the variance of the distribution.<\\p> type, public, extends( distribution ) :: f_distribution Defines an F-distribution. Components Type Visibility Attributes Name Initial real(kind=real64), public :: d1 The measure of degrees of freedom for the first data set. real(kind=real64), public :: d2 The measure of degrees of freedom for the second data set. Type-Bound Procedures procedure, public :: cdf => fd_cdf procedure, public :: mean => fd_mean procedure, public :: median => fd_median procedure, public :: mode => fd_mode procedure, public :: pdf => fd_pdf procedure, public :: variance => fd_variance type, public, extends( distribution ) :: normal_distribution Defines a normal distribution. Components Type Visibility Attributes Name Initial real(kind=real64), public :: mean_value The mean value of the distribution. real(kind=real64), public :: standard_deviation The standard deviation of the distribution. Type-Bound Procedures procedure, public :: cdf => nd_cdf procedure, public :: mean => nd_mean procedure, public :: median => nd_median procedure, public :: mode => nd_mode procedure, public :: pdf => nd_pdf procedure, public :: standardize => nd_standardize procedure, public :: variance => nd_variance type, public, extends( distribution ) :: t_distribution Defines Student's T-Distribution. Components Type Visibility Attributes Name Initial real(kind=real64), public :: dof The number of degrees of freedom. Type-Bound Procedures procedure, public :: cdf => td_cdf procedure, public :: mean => td_mean procedure, public :: median => td_median procedure, public :: mode => td_mode procedure, public :: pdf => td_pdf procedure, public :: variance => td_variance","tags":"","loc":"module\\fstats_distributions.html"},{"title":"fstats_errors – FSTATS","text":"Uses iso_fortran_env ferror Variables Type Visibility Attributes Name Initial integer(kind=int32), public, parameter :: FS_ARRAY_SIZE_ERROR = 10000 integer(kind=int32), public, parameter :: FS_INVALID_INPUT_ERROR = 10002 integer(kind=int32), public, parameter :: FS_MATRIX_SIZE_ERROR = 10001 integer(kind=int32), public, parameter :: FS_MEMORY_ERROR = 10003 integer(kind=int32), public, parameter :: FS_NO_ERROR = 0 integer(kind=int32), public, parameter :: FS_TOLERANCE_TOO_SMALL_ERROR = 10005 integer(kind=int32), public, parameter :: FS_TOO_FEW_ITERATION_ERROR = 10006 integer(kind=int32), public, parameter :: FS_UNDERDEFINED_PROBLEM_ERROR = 10004 Subroutines public  subroutine report_array_size_error (err, fname, name, expect, actual) Reports an array size error. Arguments Type Intent Optional Attributes Name class(errors), intent(inout) :: err The error handling object. character(len=*), intent(in) :: fname The name of the routine in which the error occurred. character(len=*), intent(in) :: name The name of the array. integer(kind=int32), intent(in) :: expect The expected size of the array. integer(kind=int32), intent(in) :: actual The actual size of the array. public  subroutine report_arrays_not_same_size_error (err, fname, name1, name2, size1, size2) Reports an error relating to two arrays not being the same size\nwhen they should be the same size. Arguments Type Intent Optional Attributes Name class(errors), intent(inout) :: err The error handling object. character(len=*), intent(in) :: fname The name of the routine in which the error occurred. character(len=*), intent(in) :: name1 The name of the first array. character(len=*), intent(in) :: name2 The name of the second array. integer(kind=int32), intent(in) :: size1 The size of the first array. integer(kind=int32), intent(in) :: size2 The size of the second array. public  subroutine report_iteration_count_error (err, fname, msg, mincount) Reports an iteration count error. Arguments Type Intent Optional Attributes Name class(errors), intent(inout) :: err The error handling object. character(len=*) :: fname The name of the routine in which the error occurred. character(len=*) :: msg The error message. integer(kind=int32), intent(in) :: mincount The minimum iteration count expected. public  subroutine report_matrix_size_error (err, fname, name, expect_rows, expect_cols, actual_rows, actual_cols) Reports a matrix size error. Arguments Type Intent Optional Attributes Name class(errors), intent(inout) :: err The error handling object. character(len=*), intent(in) :: fname The name of the routine in which the error occurred. character(len=*), intent(in) :: name The name of the matrix. integer(kind=int32), intent(in) :: expect_rows The expected number of rows. integer(kind=int32), intent(in) :: expect_cols The expected number of columns. integer(kind=int32), intent(in) :: actual_rows The actual number of rows. integer(kind=int32), intent(in) :: actual_cols The actual number of columns. public  subroutine report_memory_error (err, fname, code) Reports a memory allocation related error. Arguments Type Intent Optional Attributes Name class(errors), intent(inout) :: err The error handling object. character(len=*), intent(in) :: fname The name of the routine in which the error occurred. integer(kind=int32), intent(in) :: code The error code returned by the allocation routine. public  subroutine report_underdefined_error (err, fname, expect, actual) Reports an underdefined problem error. Arguments Type Intent Optional Attributes Name class(errors), intent(inout) :: err The error handling object. character(len=*), intent(in) :: fname The name of the routine in which the error occurred. integer(kind=int32), intent(in) :: expect The expected minimum number of equations. integer(kind=int32), intent(in) :: actual The actual number of equations.","tags":"","loc":"module\\fstats_errors.html"},{"title":"fstats_hypothesis – FSTATS","text":"Uses fstats_distributions fstats_descriptive_statistics fstats_errors fstats_special_functions ieee_arithmetic iso_fortran_env fstats_types Interfaces public        interface confidence_interval Computes the confidence interval for the specified distribution. See Also Wikipedia private pure function confidence_interval_scalar(dist, alpha, s, n) result(rst) Computes the confidence interval for the specified distribution. Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: dist The distribution object defining the probability distribution\nto establish the confidence level. real(kind=real64), intent(in) :: alpha The probability value of interest.  For instance, use a value of 0.05\nfor a confidence level of 95%. real(kind=real64), intent(in) :: s The sample standard deviation. integer(kind=int32), intent(in) :: n The number of samples in the data set. Return Value real(kind=real64) The result. private pure function confidence_interval_array(dist, alpha, x) result(rst) Computes the confidence interval for the specified distribution. Arguments Type Intent Optional Attributes Name class( distribution ), intent(in) :: dist The distribution object defining the probability distribution\nto establish the confidence level. real(kind=real64), intent(in) :: alpha The probability value of interest.  For instance, use a value of 0.05\nfor a confidence level of 95%. real(kind=real64), intent(in) :: x (:) An N-element array containing the data to analyze. Return Value real(kind=real64) The result. Subroutines public  subroutine bartletts_test (x, stat, p) Computes Bartlett's test statistic as follows. Read more… Arguments Type Intent Optional Attributes Name type( array_container ), intent(in), dimension(:) :: x The arrays of data to analyze. real(kind=real64), intent(out) :: stat The Bartlett's test statistic. real(kind=real64), intent(out) :: p The probability value that the variances of each data set are\nequivalent.  A low p-value, less than some significance level,\nindicates a non-equivalance of variances. public  subroutine f_test (x1, x2, stat, p, dof1, dof2) Computes the F-test and returns the probability (two-tailed) that\nthe variances of two data sets are not significantly different. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x1 (:) An N-element array containing the first data set. real(kind=real64), intent(in) :: x2 (:) An M-element array containing the second data set. real(kind=real64), intent(out) :: stat The F-statistic. real(kind=real64), intent(out) :: p The probability value that the two samples are likely to\nhave come from the two underlying populations that \nhave the same variance. real(kind=real64), intent(out) :: dof1 A measure of the degrees of freedom. real(kind=real64), intent(out) :: dof2 A measure of the degrees of freedom. public  subroutine t_test_equal_variance (x1, x2, stat, p, dof) Computes the 2-tailed Student's T-Test for two data sets of \nassumed equivalent variances. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x1 (:) An N-element array containing the first data set. real(kind=real64), intent(in) :: x2 (:) An M-element array containing the second data set. real(kind=real64), intent(out) :: stat The Student-'s T-Test statistic. real(kind=real64), intent(out) :: p The probability value that the two samples are likely to\nhave come from two underlying populations that \nhave the same mean. real(kind=real64), intent(out) :: dof The degrees of freedom. public  subroutine t_test_paired (x1, x2, stat, p, dof, err) Computes the 2-tailed Student's T-Test for two paired data sets. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x1 (:) An N-element array containing the first data set. real(kind=real64), intent(in) :: x2 (:) An N-element array containing the second data set. real(kind=real64), intent(out) :: stat The Student-'s T-Test statistic. real(kind=real64), intent(out) :: p The probability value that the two samples are likely to\nhave come from  two underlying populations that \nhave the same mean. real(kind=real64), intent(out) :: dof The degrees of freedom. class(errors), intent(inout), optional, target :: err A mechanism for communicating errors and warnings to the \ncaller.  Possible warning and error codes are as follows.\n- FS_NO_ERROR: No errors encountered.\n- FS_ARRAY_SIZE_ERROR: Occurs if x1 and x2 are not the same \n  length. public  subroutine t_test_unequal_variance (x1, x2, stat, p, dof) Computes the 2-tailed Student's T-Test for two data sets of \nassumed non-equivalent variances. Read more… Arguments Type Intent Optional Attributes Name real(kind=real64), intent(in) :: x1 (:) An N-element array containing the first data set. real(kind=real64), intent(in) :: x2 (:) An M-element array containing the second data set. real(kind=real64), intent(out) :: stat The Student-'s T-Test statistic. real(kind=real64), intent(out) :: p The probability value that the two samples are likely to\nhave come from two underlying populations that \nhave the same mean. real(kind=real64), intent(out) :: dof The degrees of freedom.","tags":"","loc":"module\\fstats_hypothesis.html"},{"title":"fstats_special_functions.f90 – FSTATS","text":"Source Code module fstats_special_functions use iso_fortran_env use ieee_arithmetic implicit none private public :: beta public :: regularized_beta public :: incomplete_beta public :: incomplete_gamma_lower public :: incomplete_gamma_upper public :: digamma contains ! ------------------------------------------------------------------------------ pure elemental function beta ( a , b ) result ( rst ) !! Computes the beta function. !! !! The beta function is related to the gamma function !! by the following relationship. !!  \\beta(a,b) = \\frac{\\Gamma(a) \\Gamma(b)}{\\Gamma(a + b)} . !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Beta_function) real ( real64 ), intent ( in ) :: a !! The first argument of the function. real ( real64 ), intent ( in ) :: b !! The second argument of the function. real ( real64 ) :: rst !! The value of the beta function at  a  and  b . ! Process ! REF: https://en.wikipedia.org/wiki/Beta_function rst = exp ( log_gamma ( a ) + log_gamma ( b ) - log_gamma ( a + b )) end function ! ------------------------------------------------------------------------------ ! source: https://people.math.sc.edu/Burkardt/f_src/special_functions/special_functions.f90 pure elemental function regularized_beta ( a , b , x ) result ( rst ) !! Computes the regularized beta function. !! !! The regularized beta function is defined as the ratio between !! the incomplete beta function and the beta function. !!  I_{x}(a,b) = \\frac{\\beta(x;a,b)}{\\beta(a,b)} . !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Beta_function) real ( real64 ), intent ( in ) :: a !! The first argument of the function. real ( real64 ), intent ( in ) :: b !! The second argument of the function. real ( real64 ), intent ( in ) :: x !! The upper limit of the integration. real ( real64 ) :: rst !! The value of the regularized beta function. ! Local Variables real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: one = 1.0d0 real ( real64 ), parameter :: two = 2.0d0 real ( real64 ) :: bt , dk ( 51 ), fk ( 51 ), s0 , t1 , t2 , ta , tb integer ( int32 ) :: k ! Process s0 = ( a + one ) / ( a + b + two ) bt = beta ( a , b ) if ( x <= s0 ) then do k = 1 , 20 dk ( 2 * k ) = k * ( b - k ) * x / ( a + two * k - one ) / ( a + two * k ) end do do k = 0 , 20 dk ( 2 * k + 1 ) = - ( a + k ) * ( a + b + k ) * x / ( a + two * k ) / & ( a + two * k + one ) end do t1 = zero do k = 20 , 1 , - 1 t1 = dk ( k ) / ( one + t1 ) end do ta = one / ( one + t1 ) rst = x ** a * ( one - x ) ** b / ( a * bt ) * ta else do k = 1 , 20 fk ( 2 * k ) = k * ( a - k ) * ( one - x ) / ( b + two * k - one ) / & ( b + two * k ) end do do k = 0 , 20 fk ( 2 * k + 1 ) = - ( b + k ) * ( a + b + k ) * ( one - x ) / ( b + two * k ) / & ( b + two * k + one ) end do t2 = zero do k = 20 , 1 , - 1 t2 = fk ( k ) / ( one + t2 ) end do tb = one / ( one + t2 ) rst = one - x ** a * ( one - x ) ** b / ( b * bt ) * tb end if end function ! ------------------------------------------------------------------------------ pure elemental function incomplete_beta ( a , b , x ) result ( rst ) !! Computes the incomplete beta function. !! !! The incomplete beta function is defind as: !!  \\beta(x;a,b) = \\int_{0}&#94;{x} t&#94;{a-1} (1 - t)&#94;{b-1} dt . !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Beta_function#Incomplete_beta_function) real ( real64 ), intent ( in ) :: a !! The first argument of the function. real ( real64 ), intent ( in ) :: b !! The second argument of the function. real ( real64 ), intent ( in ) :: x !! The upper limit of the integration. real ( real64 ) :: rst !! The value of the incomplete beta function. ! Process rst = beta ( a , b ) * regularized_beta ( a , b , x ) end function ! ------------------------------------------------------------------------------ ! REF: https://people.math.sc.edu/Burkardt/f_src/special_functions/special_functions.f90 pure elemental function incomplete_gamma_upper ( a , x ) result ( rst ) !! Computes the upper incomplete gamma function. !! !! The upper incomplete gamma function is defined as: !!  \\Gamma(a, x) = \\int_{x}&#94;{\\infty} t&#94;{a-1} e&#94;{-t} \\,dt  !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Incomplete_gamma_function) real ( real64 ), intent ( in ) :: a !! The coefficient value. real ( real64 ), intent ( in ) :: x !! The value at which to evaluate the function. real ( real64 ) :: rst !! The function value. ! Parameters real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: one = 1.0d0 real ( real64 ), parameter :: ten = 1.0d1 ! Local Variables real ( real64 ) :: ga , gin , gip , r , s , t0 , xam , small integer ( int32 ) :: k ! Process small = ten * epsilon ( small ) xam = - x + a * log ( x ) if ( xam > 7.0d2 . or . a > 1.7d2 ) then rst = ieee_value ( rst , IEEE_QUIET_NAN ) return end if if ( x == zero ) then rst = gamma ( a ) else if ( x <= one + a ) then s = one / a r = s do k = 1 , 60 r = r * x / ( a + k ) s = s + r if ( abs ( r / s ) < small ) then exit end if end do gin = exp ( xam ) * s ga = gamma ( a ) gip = gin / ga rst = ga - gin else if ( one + a < x ) then t0 = zero do k = 60 , 1 , - 1 t0 = ( k - a ) / ( one + k / ( x + t0 )) end do rst = exp ( xam ) / ( x + t0 ) end if end function ! ------------------------------------------------------------------------------ pure elemental function incomplete_gamma_lower ( a , x ) result ( rst ) !! Computes the lower incomplete gamma function. !! !! The lower incomplete gamma function is defined as: !!  \\gamma(a, x) = \\int_{0}&#94;{x} t&#94;{a-1} e&#94;{-t} \\,dt  !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Incomplete_gamma_function) real ( real64 ), intent ( in ) :: a !! The coefficient value. real ( real64 ), intent ( in ) :: x !! The value at which to evaluate the function. real ( real64 ) :: rst !! The function value. ! Parameters real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: one = 1.0d0 real ( real64 ), parameter :: ten = 1.0d1 ! Local Variables real ( real64 ) :: ga , gim , r , s , t0 , xam , small integer ( int32 ) :: k ! Process small = ten * epsilon ( small ) xam = - x + a * log ( x ) if ( xam > 7.0d2 . or . a > 1.7d2 ) then rst = ieee_value ( rst , IEEE_QUIET_NAN ) return end if if ( x == zero ) then rst = 0.0d0 else if ( x <= one + a ) then s = one / a r = s do k = 1 , 60 r = r * x / ( a + k ) s = s + r if ( abs ( r / s ) < small ) then exit end if end do rst = exp ( xam ) * s else if ( one + a < x ) then t0 = zero do k = 60 , 1 , - 1 t0 = ( k - a ) / ( one + k / ( x + t0 )) end do gim = exp ( xam ) / ( x + t0 ) ga = gamma ( a ) rst = ga - gim end if end function ! ------------------------------------------------------------------------------ pure elemental function digamma ( x ) result ( rst ) !! Computes the digamma function. !! !! The digamma function is defined as: !!  \\psi(x) = !! \\frac{d}{dx}\\left( \\ln \\left( \\Gamma \\left( x \\right) \\right) !! \\right)  !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Digamma_function) real ( real64 ), intent ( in ) :: x !! The value at which to evaluate the function. real ( real64 ) :: rst !! The function value. ! Parameters real ( real64 ), parameter :: c = 8.5d0 real ( real64 ), parameter :: euler_mascheroni = 0.57721566490153286060d0 ! Local Variables real ( real64 ) :: r , x2 , nan ! REF: ! - https://people.sc.fsu.edu/~jburkardt/f_src/asa103/asa103.f90 ! If x <= 0.0 if ( x <= 0.0 ) then nan = ieee_value ( nan , IEEE_QUIET_NAN ) rst = nan return end if ! Approximation for a small argument if ( x <= 1.0d-6 ) then rst = - euler_mascheroni - 1.0d0 / x + 1.6449340668482264365d0 * x return end if ! Process rst = 0.0d0 x2 = x do while ( x2 < c ) rst = rst - 1.0d0 / x2 x2 = x2 + 1.0d0 end do r = 1.0d0 / x2 rst = rst + log ( x2 ) - 0.5d0 * r r = r * r rst = rst & - r * ( 1.0d0 / 1 2.0d0 & - r * ( 1.0d0 / 12 0.0d0 & - r * ( 1.0d0 / 25 2.0d0 & - r * ( 1.0d0 / 24 0.0d0 & - r * ( 1.0d0 / 13 2.0d0 ) & )))) end function ! ------------------------------------------------------------------------------ end module","tags":"","loc":"sourcefile\\fstats_special_functions.f90.html"},{"title":"fstats_sampling.f90 – FSTATS","text":"Source Code module fstats_sampling use iso_fortran_env use linalg , only : sort use fstats_distributions implicit none private public :: box_muller_sample public :: rejection_sample real ( real64 ), parameter :: pi = 2.0d0 * acos ( 0.0d0 ) real ( real64 ), parameter :: twopi = 2.0d0 * pi real ( real64 ), parameter :: pi_f = 2.0 * acos ( 0.0 ) real ( real64 ), parameter :: twopi_f = 2.0 * pi_f interface box_muller_sample !! Generates random, normally distributed values via the Box-Muller !! transform. module procedure :: box_muller_sample_scalar module procedure :: box_muller_array end interface contains ! ------------------------------------------------------------------------------ function box_muller_sample_scalar ( mu , sigma ) result ( rst ) !! Generates a pair of independent, standard, normally distributed !! random values using the Box-Muller transform. real ( real64 ), intent ( in ) :: mu !! The mean of the distribution. real ( real64 ), intent ( in ) :: sigma !! The standard deviation of the distribution. real ( real64 ) :: rst ( 2 ) !! The pair of random values. ! Parameters complex ( real64 ), parameter :: j = ( 0.0d0 , 1.0d0 ) ! Local Variables real ( real64 ) :: u1 , u2 complex ( real64 ) :: z ! Process call random_number ( u1 ) call random_number ( u2 ) z = sqrt ( - log ( u1 )) * exp ( j * twopi * u2 ) rst = [ real ( z , real64 ), aimag ( z )] end function ! ------------------------------------------------------------------------------ function box_muller_array ( mu , sigma , n ) result ( rst ) !! Generates an array of normally distributed random values sampled !! by the Box-Muller transform. real ( real64 ), intent ( in ) :: mu !! The mean of the distribution. real ( real64 ), intent ( in ) :: sigma !! The standard deviation of the distribution. integer ( int32 ), intent ( in ) :: n !! The number of Box-Muller pairs to generate. real ( real64 ), allocatable , dimension (:) :: rst !! A 2N-element array containing the N Box-Muller pairs. ! Local Variables integer ( int32 ) :: i ! Process if ( n < 1 ) then allocate ( rst ( 0 )) return end if allocate ( rst ( 2 * n )) do i = 1 , n rst ( 2 * i - 1 : 2 * i ) = box_muller_sample ( mu , sigma ) end do end function ! ****************************************************************************** ! REJECTION SAMPLING ! ------------------------------------------------------------------------------ function rejection_sample ( tdist , n , xmin , xmax ) result ( rst ) !! Uses rejection sampling to randomly sample a target distribution. class ( distribution ), intent ( in ) :: tdist !! The distribution to sample integer ( int32 ), intent ( in ) :: n !! The number of samples to make. real ( real64 ), intent ( in ) :: xmin !! The minimum range to explore. real ( real64 ), intent ( in ) :: xmax !! The maximum range to explore. real ( real64 ), allocatable , dimension (:) :: rst !! An N-element array containing the N samples from the !! distribution. ! Parameters real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: c_start = 1.01d0 ! Local Variables integer ( int32 ) :: i , j , jmax real ( real64 ) :: u , c , g , f , rng ! Quick Return if ( n < 1 ) then allocate ( rst ( 0 ), source = zero ) end if ! Process i = 0 j = 0 jmax = min ( 1000 * n , huge ( j )) ! Guard against insanity rng = xmax - xmin c = c_start allocate ( rst ( n ), source = zero ) do while ( i <= n ) ! Update the acceptance threshold call random_number ( u ) ! Sample from the proposal distribution call random_number ( g ) g = g * rng + xmin ! Sample the target distribution f = tdist % pdf ( g ) ! Test if ( u <= f / ( c * g )) then i = i + 1 rst ( i ) = g end if ! Update C c = max ( c , f / g ) ! Update the infinite loop guard variable j = j + 1 if ( j == jmax ) exit end do end function ! ------------------------------------------------------------------------------ end module","tags":"","loc":"sourcefile\\fstats_sampling.f90.html"},{"title":"fstats_smoothing.f90 – FSTATS","text":"Source Code module fstats_smoothing use iso_fortran_env use ferror use fstats_errors use linalg , only : sort implicit none private public :: lowess contains ! ------------------------------------------------------------------------------ subroutine lowess ( x , y , ys , fsmooth , nstps , del , rweights , resid , err ) !! Computes the smoothing of a data set using a robust locally weighted !! scatterplot smoothing (LOWESS) algorithm.  Fitted values are computed at !! each of the supplied x values. !! !! Remarks !! !! The code is a reimplementation of the LOWESS library.  For a detailed !! understanding, see [this] !! (http://www.aliquote.org/cours/2012_biomed/biblio/Cleveland1979.pdf) !! paper by William Cleveland. real ( real64 ), intent ( in ), dimension (:) :: x !! An N-element array containing the independent variable data.  This !! array must be monotonically increasing. real ( real64 ), intent ( in ), dimension (:) :: y !! An N-element array containing the dependent variable data. real ( real64 ), intent ( out ), dimension (:) :: ys !! An N-element array where the smoothed results will be written. real ( real64 ), intent ( in ), optional :: fsmooth !! An optional input that specifies the amount of smoothing. !! Specifically, this value is the fraction of points used to compute !! each value.  As this value increases, the output becomes smoother. !! Choosing a value in the range of 0.2 to 0.8 typically results in a !! good fit.  The default value is 0.2. integer ( int32 ), intent ( in ), optional :: nstps !! An optional input that specifies the numb of iterations.  If set to !! zero, a non-robust fit is returned.  The default value is set to 2. real ( real64 ), intent ( in ), optional :: del !! real ( real64 ), intent ( out ), optional , dimension (:), target :: rweights !! An optional N-element array, that if supplied, will be used to !! return the weights given to each data point. real ( real64 ), intent ( out ), optional , dimension (:), target :: resid !! An optional N-element array, that if supplied, will be used to !! return the residual. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings to the !! caller.  Possible warning and error codes are as follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not !!      approriately sized. !! - FS_MEMORY_ERROR: Occurs if there is a memory allocation error. ! Parameters real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: p2 = 2.0d-1 real ( real64 ), parameter :: one = 1.0d0 real ( real64 ), parameter :: three = 3.0d0 real ( real64 ), parameter :: p001 = 1.0d-3 real ( real64 ), parameter :: p999 = 0.999d0 ! Local Variables logical :: ok integer ( int32 ) :: iter , i , j , nleft , nright , ns , last , m1 , m2 , n , nsteps , flag real ( real64 ) :: f , delta , d1 , d2 , denom , alpha , cut , eps , cmad , c1 , c9 , r real ( real64 ), allocatable , target , dimension (:) :: rwdef , rsdef real ( real64 ), pointer , dimension (:) :: rw , res class ( errors ), pointer :: errmgr type ( errors ), target :: deferr ! Initialization if ( present ( err )) then errmgr => err else errmgr => deferr end if n = size ( x ) if ( present ( fsmooth )) then f = fsmooth else f = p2 end if if ( present ( nstps )) then nsteps = nstps else nsteps = 2 end if if ( present ( del )) then delta = del else delta = 0.0d0 end if if ( present ( rweights )) then if ( size ( rweights ) /= n ) then call report_array_size_error ( errmgr , \"lowess\" , \"rweights\" , n , & size ( rweights )) return end if rw => rweights else allocate ( rwdef ( n ), stat = flag ) if ( flag /= 0 ) then call report_memory_error ( errmgr , \"lowess\" , flag ) return end if rw => rwdef end if if ( present ( resid )) then if ( size ( resid ) /= n ) then call report_array_size_error ( errmgr , \"lowess\" , \"resid\" , n , & size ( resid )) return end if res => resid else allocate ( rsdef ( n ), stat = flag ) if ( flag /= 0 ) then call report_memory_error ( errmgr , \"lowess\" , flag ) return end if res => rsdef end if ns = max ( min ( int ( f * real ( n ), int32 ), n ), 2 ) eps = epsilon ( eps ) ! Input Checking if ( size ( y ) /= n ) then call report_array_size_error ( errmgr , \"lowess\" , \"y\" , n , size ( y )) return end if if ( size ( ys ) /= n ) then call report_array_size_error ( errmgr , \"lowess\" , \"ys\" , n , size ( ys )) return end if ! Quick Return if ( n < 2 ) then ys = y return end if ! Process do iter = 1 , nsteps + 1 nleft = 1 nright = ns last = 0 i = 1 do do while ( nright < n ) d1 = x ( i ) - x ( nleft ) d2 = x ( nright + 1 ) - x ( i ) if ( d1 <= d2 ) exit nleft = nleft + 1 nright = nright + 1 end do call lowest ( x , y , x ( i ), ys ( i ), nleft , nright , res , iter > 1 , & rw , ok ) if (. not . ok ) ys ( i ) = y ( i ) if ( last < i - 1 ) then denom = x ( i ) - x ( last ) do j = last + 1 , i - 1 alpha = ( x ( j ) - x ( last )) / denom ys ( j ) = alpha * ys ( i ) + ( one - alpha ) * ys ( last ) end do end if last = i cut = x ( last ) + delta do i = last + 1 , n if ( x ( i ) > cut ) exit if ( abs ( x ( i ) - x ( last )) < eps ) then ys ( i ) = ys ( last ) last = i end if end do i = max ( last + 1 , i - 1 ) if ( last >= n ) exit end do res = y - ys if ( iter > nsteps ) exit rw = abs ( res ) call sort ( rw , . true .) m1 = 1 + n / 2 m2 = n - m1 + 1 cmad = three * ( rw ( m1 ) + rw ( m2 )) c9 = p999 * cmad c1 = p001 * cmad do i = 1 , n r = abs ( res ( i )) if ( r <= c1 ) then rw ( i ) = one else if ( r > c9 ) then rw ( i ) = zero else rw ( i ) = ( one - ( r / cmad ) ** 2 ) ** 2 end if end do end do end subroutine ! ****************************************************************************** ! PRIVATE ROUTINES ! ------------------------------------------------------------------------------ ! REF: ! - https://en.wikipedia.org/wiki/Local_regression ! - http://www.aliquote.org/cours/2012_biomed/biblio/Cleveland1979.pdf subroutine lowest ( x , y , xs , ys , nleft , nright , w , userw , rw , ok ) ! Arguments real ( real64 ), intent ( in ), dimension (:) :: x , y , rw ! N ELEMENT real ( real64 ), intent ( in ) :: xs real ( real64 ), intent ( out ) :: ys integer ( int32 ), intent ( in ) :: nleft , nright real ( real64 ), intent ( out ), dimension (:) :: w ! N ELEMENT logical , intent ( in ) :: userw logical , intent ( out ) :: ok ! Parameters real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: one = 1.0d0 real ( real64 ), parameter :: p001 = 1.0d-3 real ( real64 ), parameter :: p999 = 0.999d0 ! Local Variables integer ( int32 ) :: j , n , nrt real ( real64 ) :: range , h , h9 , h1 , a , b , c , r ! Initialization n = size ( x ) range = x ( n ) - x ( 1 ) h = max ( xs - x ( nleft ), x ( nright ) - xs ) h9 = p999 * h h1 = p001 * h a = zero ! Process do j = nleft , n w ( j ) = zero r = abs ( x ( j ) - xs ) if ( r <= h9 ) then if ( r > h1 ) then w ( j ) = ( one - ( r / h ) ** 3 ) ** 3 else w ( j ) = one end if if ( userw ) w ( j ) = rw ( j ) * w ( j ) a = a + w ( j ) else if ( x ( j ) > xs ) then exit end if end do nrt = j - 1 if ( a <= zero ) then ok = . false . else ok = . true . w ( nleft : nrt ) = w ( nleft : nrt ) / a if ( h > zero ) then a = zero do j = nleft , nrt a = a + w ( j ) * x ( j ) end do b = xs - a c = zero do j = nleft , nrt c = c + w ( j ) * ( x ( j ) - a ) ** 2 end do if ( sqrt ( c ) > p001 * range ) then b = b / c do j = nleft , nrt w ( j ) = w ( j ) * ( one + b * ( x ( j ) - a )) end do end if end if ys = zero do j = nleft , nrt ys = ys + w ( j ) * y ( j ) end do end if end subroutine ! ------------------------------------------------------------------------------ end module","tags":"","loc":"sourcefile\\fstats_smoothing.f90.html"},{"title":"fstats_bootstrap.f90 – FSTATS","text":"Source Code module fstats_bootstrap use iso_fortran_env use fstats_errors use omp_lib use fstats_distributions use fstats_descriptive_statistics use fstats_special_functions use fstats_regression use linalg , only : sort implicit none private public :: bootstrap_resampling_routine public :: bootstrap_statistic_routine public :: random_resample public :: scaled_random_resample public :: bootstrap_statistics public :: bootstrap public :: bootstrap_regression_statistics public :: bootstrap_linear_least_squares public :: bootstrap_nonlinear_least_squares ! REFERENCES: ! - https://medium.com/@m21413108/bootstrapping-maximum-entropy-non-parametric-boot-python-3b1e23ea589d ! - https://cran.r-project.org/web/packages/meboot/vignettes/meboot.pdf ! - https://gist.github.com/christianjauregui/314456688a3c2fead43a48be3a47dad6 type bootstrap_regression_statistics !! A container for regression-related statistical information as !! computed in a bootstrap, or equivalent, calculation. real ( real64 ) :: standard_error !! The standard error for the model coefficient. real ( real64 ) :: t_statistic !! The T-statistic for the model coefficient. !! !!  t_o = \\frac{ \\beta_{i} }{E_{s}(\\beta_{i})}  real ( real64 ) :: probability !! The probability that the coefficient is not statistically !! important.  A statistically important coefficient will have a !! low probability (p-value), typically 0.05 or lower; however, a !! p-value of up to ~0.2 may be acceptable dependent upon the !! problem.  Typically any p-value larger than ~0.2 indicates the !! parameter is not statistically important for the model. !! !!  p = t_{|t_o|, df_{residual}}  real ( real64 ) :: upper_confidence_interval !! The upper limit of the confidence interval for the parameter. real ( real64 ) :: lower_confidence_interval !! The lower limit of the confidence interval for the parameter. end type type bootstrap_statistics !! A collection of statistics resulting from the bootstrap process. real ( real64 ) :: statistic_value !! The value of the statistic of interest. real ( real64 ) :: upper_confidence_interval !! The upper confidence limit on the statistic. real ( real64 ) :: lower_confidence_interval !! The lower confidence limit on the statistic. real ( real64 ) :: bias !! The bias in the statistic. real ( real64 ) :: standard_error !! The standard error of the statistic. real ( real64 ), allocatable , dimension (:) :: population !! An array of the population values generated by the bootstrap !! process. end type interface subroutine bootstrap_resampling_routine ( x , xn ) !! Defines the signature of a subroutine used to compute a !! resampling of data for bootstrapping purposes. use iso_fortran_env , only : real64 real ( real64 ), intent ( in ), dimension (:) :: x !! The N-element array to resample. real ( real64 ), intent ( out ), dimension ( size ( x )) :: xn !! An N-element array where the resampled data set will be !! written. end subroutine function bootstrap_statistic_routine ( x ) result ( rst ) !! Defines the signature of a function for computing the desired !! bootstrap statistic. use iso_fortran_env , only : real64 real ( real64 ), intent ( in ), dimension (:) :: x !! The array of data to analyze. real ( real64 ) :: rst !! The resulting statistic. end function end interface contains ! ****************************************************************************** ! RESAMPLING ! ------------------------------------------------------------------------------ subroutine random_resample ( x , xn ) !! Random resampling, with replacement, based upon a normal distribution. real ( real64 ), intent ( in ), dimension (:) :: x !! The N-element array to resample. real ( real64 ), intent ( out ), dimension ( size ( x )) :: xn !! An N-element array where the resampled data set will be written. ! Parameters real ( real64 ), parameter :: scale = 1.25d0 ! Local Variables integer ( int32 ) :: i , n real ( real64 ) :: xmin , xmax , rng ! Process n = size ( x ) xmin = x ( 1 ) xmax = x ( 1 ) do i = 2 , n xmin = min ( xmin , x ( i )) xmax = max ( xmax , x ( i )) end do rng = ( xmax - xmin ) call random_number ( xn ) xn = xn * rng + xmin end subroutine ! ------------------------------------------------------------------------------ subroutine scaled_random_resample ( x , xn ) !! A random resampling, scaled by the standard deviation of the original !! data, but based upon a normal distribution. real ( real64 ), intent ( in ), dimension (:) :: x !! The N-element array to resample. real ( real64 ), intent ( out ), dimension ( size ( x )) :: xn !! An N-element array where the resampled data set will be written. ! Parameters real ( real64 ), parameter :: half = 0.5d0 ! Local Variables integer ( int32 ) :: n real ( real64 ) :: eps ! Process n = size ( x ) eps = standard_deviation ( x ) / sqrt ( real ( n , real64 )) call random_number ( xn ) xn = eps * ( xn - half ) + x end subroutine ! ****************************************************************************** ! BOOTSTRAPPING ! ------------------------------------------------------------------------------ function bootstrap ( stat , x , method , nsamples , alpha ) result ( rst ) !! Performs a bootstrap calculation on the supplied data set for the given !! statistic.  The default implementation utlizes a random resampling with !! replacement.  Other resampling methods may be defined by specifying an !! appropriate routine by means of the method input. procedure ( bootstrap_statistic_routine ), pointer , intent ( in ) :: stat !! The routine used to compute the desired statistic. real ( real64 ), intent ( in ), dimension (:) :: x !! The N-element data set. procedure ( bootstrap_resampling_routine ), pointer , intent ( in ), optional :: method !! An optional pointer to the method to use for resampling of the data. !! If no method is supplied, a random resampling is utilized. integer ( int32 ), intent ( in ), optional :: nsamples !! An optional input, that if supplied, specifies the number of !! resampling runs to perform.  The default is 10 000. real ( real64 ), intent ( in ), optional :: alpha !! An optional input, that if supplied, defines the significance level !! to use for the analysis.  The default is 0.05. type ( bootstrap_statistics ) :: rst !! The resulting bootstrap_statistics type containing the confidence !! intervals, bias, standard error, etc. for the analyzed statistic. ! Parameters real ( real64 ), parameter :: half = 0.5d0 real ( real64 ), parameter :: p05 = 5.0d-2 ! Local Variables integer ( int32 ) :: i , i1 , i2 , n , ns real ( real64 ) :: a real ( real64 ), allocatable , dimension (:) :: xn procedure ( bootstrap_resampling_routine ), pointer :: resample ! Initialization n = size ( x ) if ( present ( method )) then resample => method else resample => random_resample end if if ( present ( nsamples )) then ns = nsamples else ns = 10000 end if if ( present ( alpha )) then a = alpha else a = p05 end if allocate ( rst % population ( ns )) i1 = floor ( half * a * ns , int32 ) i2 = ns - i1 + 1 ! Analyze the basic data set rst % statistic_value = stat ( x ) rst % population ( 1 ) = rst % statistic_value ! Resampling Process #ifdef USEOPENMP ! Use OpenMP to run operations in parallel !$OMP PARALLEL DO PRIVATE(xn) SHARED(rst) do i = 2 , ns ! Per-thread memory allocation if (. not . allocated ( xn )) allocate ( xn ( n )) ! Resample the data call resample ( x , xn ) ! Compute the statistic rst % population ( i ) = stat ( xn ) end do !$OMP END PARALLEL DO #else ! OpenMP is not available - run in a serial manner allocate ( xn ( n )) do i = 2 , ns ! Resample the data call resample ( x , xn ) ! Compute the statistic for the resampled data rst % population ( i ) = stat ( xn ) end do #endif ! Compute the relevant quantities on the resampled statistic call sort ( rst % population , . true .) rst % upper_confidence_interval = rst % population ( i2 ) rst % lower_confidence_interval = rst % population ( i1 ) rst % bias = mean ( rst % population ) - rst % statistic_value rst % standard_error = standard_deviation ( rst % population ) end function ! ****************************************************************************** ! LINEAR REGRESSION ! ------------------------------------------------------------------------------ subroutine bootstrap_linear_least_squares ( order , intercept , x , y , & coeffs , ymod , resid , nsamples , stats , bias , alpha , method , bscoeffs , err ) !! Computes a linear least-squares regression to fit a set of data. !! Bootstrapping is utilized to gain insight into the quality of !! the fit.  Resampling for the bootstrap process is a random resampling !! with replacement process with the range of values limited by the !! standard deviation of the original data set. integer ( int32 ), intent ( in ) :: order !! The order of the equation to fit.  This value must be at !! least one (linear equation), but can be higher as desired, !! as long as there is sufficient data. logical , intent ( in ) :: intercept !! Set to true if the intercept is being computed as part of !! the regression; else, false. real ( real64 ), intent ( in ), dimension (:) :: x !! An N-element array containing the independent variable !! measurement points. real ( real64 ), intent ( in ), dimension (:) :: y !! An N-element array containing the dependent variable !! measurement points. real ( real64 ), intent ( out ), dimension (:) :: coeffs !! An ORDER+1 element array where the coefficients will !! be written. real ( real64 ), intent ( out ), dimension (:) :: ymod !! An N-element array where the modeled data will be written. real ( real64 ), intent ( out ), dimension (:) :: resid !! An N-element array where the residual error data will be !! written (modeled - actual). integer ( int32 ), intent ( in ), optional :: nsamples !! The number of bootstrapping samples to utilize. type ( bootstrap_regression_statistics ), intent ( out ), optional , & dimension (:) :: stats !! An M-element array of bootstrap_regression_statistics items !! where M = ORDER + 1 when intercept is set to true; however, !! if intercept is set to false, M = ORDER. real ( real64 ), intent ( out ), optional , dimension (:) :: bias !! An ORDER+1 element array where an estimate of the bias of !! each coefficient is returned based upon the results of the !! bootstrapping analysis.  The bias is computed as the difference !! between the mean of the boostrap population results for the given !! parameter and the original estimate of the given parameter. real ( real64 ), intent ( in ), optional :: alpha !! The significance level at which to evaluate the confidence !! intervals.  The default value is 0.05 such that a 95% !! confidence interval is calculated. procedure ( bootstrap_resampling_routine ), pointer , intent ( in ), optional :: method !! An optional pointer to the method to use for resampling of the data. !! If no method is supplied, a random resampling is utilized. real ( real64 ), intent ( out ), optional , allocatable , target , dimension (:,:) :: bscoeffs !! An optional, allocatable matrix, containing the bootstrap !! distributions for each parameter stored in each row of the matrix !! such that the resulting matrix is NCOEFFS -by- NSAMPLES. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings to the !! caller.  Possible warning and error codes are as follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not !!      approriately sized. !! - FS_INVALID_INPUT_ERROR: Occurs if order is less than 1. !! - FS_MEMORY_ERROR: Occurs if there is a memory allocation !!      error. ! Parameters real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: p05 = 5.0d-2 ! Local Variables integer ( int32 ) :: i , j , n , ns , nc , ncoeffs , flag , nthreads , thread real ( real64 ) :: alph real ( real64 ), allocatable , dimension (:) :: fLocal , yLocal , rLocal real ( real64 ), allocatable , target , dimension (:,:) :: coeffstorage real ( real64 ), pointer , dimension (:,:) :: allcoeffs class ( errors ), pointer :: errmgr type ( errors ), target :: deferr procedure ( bootstrap_resampling_routine ), pointer :: resample ! Initialization if ( present ( err )) then errmgr => err else errmgr => deferr end if if ( present ( nsamples )) then ns = nsamples else ns = 1000 end if if ( present ( alpha )) then alph = alpha else alph = p05 end if if ( present ( method )) then resample => method else resample => scaled_random_resample end if n = size ( x ) ncoeffs = order + 1 nc = order if ( intercept ) nc = nc + 1 nthreads = omp_get_num_threads () ! Compute the fit call linear_least_squares ( order , intercept , x , y , coeffs , & ymod , resid , alpha = alph , err = errmgr ) if ( errmgr % has_error_occurred ()) return ! Memory Allocations if ( present ( bscoeffs )) then allocate ( bscoeffs ( ncoeffs , ns ), source = zero , stat = flag ) if ( flag /= 0 ) then call report_memory_error ( errmgr , \"bootstrap_linear_least_squares\" , & flag ) return end if allcoeffs => bscoeffs else allocate ( coeffstorage ( ncoeffs , ns ), source = zero , stat = flag ) if ( flag /= 0 ) then call report_memory_error ( errmgr , \"bootstrap_linear_least_squares\" , & flag ) return end if allcoeffs => coeffstorage end if allcoeffs (:, 1 ) = coeffs ! Cycle over each data set and perform the fit #ifdef USEOPENMP !$OMP PARALLEL DO PRIVATE(fLocal, yLocal, rLocal) SHARED(allcoeffs) do i = 2 , ns ! Get the current thread number ! The +1 is because OpenMP is zero-based for thread numbering thread = omp_get_thread_num () + 1 ! Allocate local arrays on a per-thread basis if (. not . allocated ( fLocal )) allocate ( fLocal ( n )) if (. not . allocated ( yLocal )) allocate ( yLocal ( n )) if (. not . allocated ( rLocal )) allocate ( rLocal ( n )) ! Compute a random data set call resample ( y , yLocal ) ! Compute the fit of the perturbed data set call linear_least_squares ( order , intercept , x , yLocal , & allcoeffs (:, i ), fLocal , rLocal , alpha = alph ) end do !$OMP END PARALLEL DO #else ! OpenMP is not available - run in a serial manner allocate ( fLocal ( n ), yLocal ( n ), rLocal ( n )) do i = 2 , ns ! Compute a random data set call resample ( y , yLocal ) ! Compute the fit of the perturbed data set call linear_least_squares ( order , intercept , x , yLocal , & allcoeffs (:, i ), fLocal , rLocal , alpha = alph ) end do #endif ! Perform statistics calculations, if needed if ( present ( stats )) then call compute_stats ( coeffs , allcoeffs , alph , intercept , stats ) end if ! Compute the bias for each parameter, if needed if ( present ( bias )) then ! Verify the size of the array if ( size ( bias ) /= ncoeffs ) then call report_array_size_error ( errmgr , & \"bootstrap_linear_least_squares\" , \"bias\" , ncoeffs , size ( bias )) return end if ! Perform the calculations do i = 1 , ncoeffs bias ( i ) = mean ( allcoeffs ( i ,:)) - coeffs ( i ) end do end if end subroutine ! ****************************************************************************** ! NONLINEAR REGRESSION ! ------------------------------------------------------------------------------ subroutine bootstrap_nonlinear_least_squares ( fun , x , y , params , ymod , resid , & nsamples , weights , maxp , minp , stats , alpha , controls , settings , info , & bias , method , bscoeffs , err ) !! Performs a nonlinear regression to fit a model using a version !! of the Levenberg-Marquardt algorithm.  Bootstrapping is utilized to gain !! insight into the quality of the fit.  Resampling for the bootstrap !! process is a random resampling with replacement process with the !! range of values limited by the standard deviation of the original !! data set. procedure ( regression_function ), intent ( in ), pointer :: fun !! A pointer to the regression_function to evaluate. real ( real64 ), intent ( in ) :: x (:) !! The M-element array containing independent data. real ( real64 ), intent ( in ) :: y (:) !! The M-element array containing dependent data. real ( real64 ), intent ( inout ) :: params (:) !! On input, the N-element array containing the initial estimate !! of the model parameters.  On output, the computed model !! parameters. real ( real64 ), intent ( out ) :: ymod (:) !! An M-element array where the modeled dependent data will !! be written. real ( real64 ), intent ( out ) :: resid (:) !! An M-element array where the model residuals will be !! written. integer ( int32 ), intent ( in ), optional :: nsamples !! The number of bootstrapping samples to utilize. real ( real64 ), intent ( in ), optional , target :: weights (:) !! An optional M-element array allowing the weighting of !! individual points. real ( real64 ), intent ( in ), optional , target :: maxp (:) !! An optional N-element array that can be used as upper limits !! on the parameter values.  If no upper limit is requested for !! a particular parameter, utilize a very large value.  The !! internal default is to utilize huge() as a value. real ( real64 ), intent ( in ), optional , target :: minp (:) !! An optional N-element array that can be used as lower limits !! on the parameter values.  If no lower limit is requested for !! a particalar parameter, utilize a very large magnitude, but !! negative, value.  The internal default is to utilize -huge() !! as a value. type ( bootstrap_regression_statistics ), intent ( out ), optional :: stats (:) !! An optional N-element array that, if supplied, will be used !! to return statistics about the fit for each parameter. real ( real64 ), intent ( in ), optional :: alpha !! The significance level at which to evaluate the confidence !! intervals.  The default value is 0.05 such that a 95% !! confidence interval is calculated. type ( iteration_controls ), intent ( in ), optional :: controls !! An optional input providing custom iteration controls. type ( lm_solver_options ), intent ( in ), optional :: settings !! An optional input providing custom settings for the solver. type ( convergence_info ), intent ( out ), optional , target :: info !! An optional output that can be used to gain information about !! the iterative solution and the nature of the convergence. real ( real64 ), intent ( out ), optional , dimension (:) :: bias !! An optional N-element array that, if supplied, will be used to !! provide an estimate of the bias of each model parameter based upon !! the results of the bootstrapping analysis.  The bias is computed as !! the difference between the mean of the boostrap population results !! for the given parameter and the original estimate of the given !! parameter. procedure ( bootstrap_resampling_routine ), pointer , intent ( in ), optional :: method !! An optional pointer to the method to use for resampling of the data. !! If no method is supplied, a random resampling is utilized. real ( real64 ), intent ( out ), optional , allocatable , target , dimension (:,:) :: bscoeffs !! An optional, allocatable matrix, containing the bootstrap !! distributions for each parameter stored in each row of the matrix !! such that the resulting matrix is NCOEFFS -by- NSAMPLES. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings to the !! caller.  Possible warning and error codes are as follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not !!      properly sized. !! - FS_MEMORY_ERROR: Occurs if there is a memory allocation !!      error. !! - FS_UNDERDEFINED_PROBLEM_ERROR: Occurs if the problem posed !!      is underdetetermined (M < N). !! - FS_TOLERANCE_TOO_SMALL_ERROR: Occurs if any supplied !!      tolerances are too small to be practical. !! - FS_TOO_FEW_ITERATION_ERROR: Occurs if too few iterations !!      are allowed. ! Parameters real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: p05 = 5.0d-2 ! Local Variables integer ( int32 ) :: i , n , ns , nparams , flag real ( real64 ) :: alph real ( real64 ), allocatable , dimension (:) :: fLocal , yLocal , rLocal real ( real64 ), allocatable , target , dimension (:,:) :: coeffstorage real ( real64 ), pointer , dimension (:,:) :: allcoeffs procedure ( bootstrap_resampling_routine ), pointer :: resample class ( errors ), pointer :: errmgr type ( errors ), target :: deferr ! Initialization if ( present ( err )) then errmgr => err else errmgr => deferr end if if ( present ( nsamples )) then ns = nsamples else ns = 1000 end if if ( present ( alpha )) then alph = alpha else alph = p05 end if if ( present ( method )) then resample => method else resample => scaled_random_resample end if n = size ( x ) nparams = size ( params ) ! Compute the fit call nonlinear_least_squares ( fun , x , y , params , ymod , resid , & weights = weights , maxp = maxp , minp = minp , alpha = alph , & controls = controls , settings = settings , info = info , err = err ) ! Memory Allocations if ( present ( bscoeffs )) then allocate ( bscoeffs ( nparams , ns ), source = zero , stat = flag ) if ( flag /= 0 ) then call report_memory_error ( errmgr , & \"bootstrap_nonlinear_least_squares\" , flag ) return end if allcoeffs => bscoeffs else allocate ( coeffstorage ( nparams , ns ), source = zero , stat = flag ) if ( flag /= 0 ) then call report_memory_error ( errmgr , & \"bootstrap_nonlinear_least_squares\" , flag ) return end if allcoeffs => coeffstorage end if allcoeffs (:, 1 ) = params ! Define initial guesses for each step.  Base upon the results of the ! initial analysis as this should provide a strong starting point for ! subsequent analysis do i = 1 , nparams allcoeffs ( i ,:) = params ( i ) end do ! Cycle over each data set and perform the fit #ifdef USEOPENMP !$OMP PARALLEL DO PRIVATE(fLocal, yLocal, rLocal) do i = 2 , ns ! Allocate local arrays on a per-thread basis if (. not . allocated ( fLocal )) allocate ( fLocal ( n )) if (. not . allocated ( yLocal )) allocate ( yLocal ( n )) if (. not . allocated ( rLocal )) allocate ( rLocal ( n )) ! Compute a random data set call resample ( y , yLocal ) ! Compute the fit of the perturbed data set call nonlinear_least_squares ( fun , x , yLocal , allcoeffs (:, i ), fLocal , & rLocal , weights = weights , maxp = maxp , minp = minp , alpha = alph , & controls = controls , settings = settings , info = info ) end do !$OMP END PARALLEL DO #else ! OpenMP is not available - run in a serial manner allocate ( fLocal ( n ), yLocal ( n ), rLocal ( n )) do i = 2 , ns ! Compute a random data set call resample ( y , yLocal ) ! Compute the fit of the perturbed data set call nonlinear_least_squares ( fun , x , yLocal , allcoeffs (:, i ), fLocal , & rLocal , weights = weights , maxp = maxp , minp = minp , alpha = alph , & controls = controls , settings = settings , info = info ) end do #endif ! Perform the statistics calculations, if needed if ( present ( stats )) then ! Verify the size of stats if ( size ( stats ) /= nparams ) then call report_array_size_error ( errmgr , & \"bootstrap_nonlinear_least_squares\" , \"stats\" , & nparams , size ( stats )) return end if ! Perform the calculations call compute_stats ( params , allcoeffs , alph , . true ., stats ) end if ! Compute the bias for each parameter, if needed if ( present ( bias )) then ! Verify the size of the array if ( size ( bias ) /= nparams ) then call report_array_size_error ( errmgr , & \"bootstrap_nonlinear_least_squares\" , \"bias\" , & nparams , size ( bias )) return end if ! Perform the calculations do i = 1 , nparams bias ( i ) = mean ( allcoeffs ( i ,:)) - params ( i ) end do end if end subroutine ! ****************************************************************************** ! PRIVATE HELPER ROUTINES ! ------------------------------------------------------------------------------ subroutine compute_stats ( mdl , coeffs , alpha , intercept , stats ) ! Arguments real ( real64 ), intent ( in ), dimension (:) :: mdl real ( real64 ), intent ( inout ), dimension (:,:) :: coeffs real ( real64 ), intent ( in ) :: alpha logical , intent ( in ) :: intercept type ( bootstrap_regression_statistics ), intent ( out ), dimension (:) :: stats ! Parameters real ( real64 ), parameter :: half = 0.5d0 ! Local Variables integer ( int32 ) :: i , j , i1 , i2 , ncoeffs , nc , nsamples real ( real64 ) :: ms type ( t_distribution ) :: dist ! Initialization ncoeffs = size ( coeffs , 1 ) nsamples = size ( coeffs , 2 ) nc = ncoeffs if (. not . intercept ) nc = ncoeffs - 1 i1 = floor ( half * alpha * nsamples , int32 ) i2 = nsamples - i1 + 1 dist % dof = real ( nsamples - nc ) ! Process j = 1 if ( intercept ) j = 0 do i = 1 , nc j = j + 1 ms = trimmed_mean ( coeffs ( j ,:), p = half * alpha ) ! As we have a distribution of mean values, the standard deviation ! of this population yields the standard error estimate for the ! overall problem stats ( i )% standard_error = standard_deviation ( coeffs ( j ,:)) ! As before, this is a distribution of mean values.  The CI can ! be directly estimated by considering the values of the bottom ! alpha/2 and top alpha/2 terms. stats ( i )% upper_confidence_interval = coeffs ( j , i2 ) stats ( i )% lower_confidence_interval = coeffs ( j , i1 ) ! Compute the remaining parameters stats ( i )% t_statistic = mdl ( j ) / stats ( i )% standard_error stats ( i )% probability = regularized_beta ( half * dist % dof , half , & dist % dof / ( dist % dof + ( stats ( i )% t_statistic ) ** 2 )) end do end subroutine ! ------------------------------------------------------------------------------ end module","tags":"","loc":"sourcefile\\fstats_bootstrap.f90.html"},{"title":"fstats_allan.f90 – FSTATS","text":"Source Code module fstats_allan use iso_fortran_env use fstats_errors implicit none private public :: allan_variance contains ! ------------------------------------------------------------------------------ ! REF: Yadav, Shrikanth & Shastri, Saurav & Chakravarthi, Ghanashyam & Kumar, ! Viraj & Rao, Divya & Agrawal, Vinod. (2018). A Fast, Parallel Algorithm for ! Fully Overlapped Allan Variance and Total Variance for Analysis and Modeling ! of Noise in Inertial Sensors. IEEE Sensors Letters. PP. 1-1. ! 10.1109/LSENS.2018.2829799. ! ! https://www.researchgate.net/publication/324738301_A_Fast_Parallel_Algorithm_for_Fully_Overlapped_Allan_Variance_and_Total_Variance_for_Analysis_and_Modeling_of_Noise_in_Inertial_Sensors ! https://github.com/shrikanth95/Fast-Parallel-Fully-Overlapped-Allan-Variance-and-Total-Variance/blob/master/fast_FOAV.m function allan_variance ( x , dt , err ) result ( rst ) !! Computes the Allan variance of a data set. !! !! Remarks !! !! This implementation computes the fully overlapped Allan variance !! using the method presented by Yadav et. al. !! !! Yadav, Shrikanth & Shastri, Saurav & Chakravarthi, Ghanashyam & Kumar, !! Viraj & Rao, Divya & Agrawal, Vinod. (2018). A Fast, Parallel Algorithm !! for Fully Overlapped Allan Variance and Total Variance for Analysis and !! Modeling of Noise in Inertial Sensors. IEEE Sensors Letters. PP. 1-1. !! 10.1109/LSENS.2018.2829799. real ( real64 ), intent ( in ), dimension (:) :: x !! The N-element data set to analyze. real ( real64 ), intent ( in ), optional :: dt !! An optional input specifying the time increment between !! samples in x.  If not specified, this value is set to 1. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings to the !! caller.  Possible warning and error codes are as follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_MEMORY_ERROR: Occurs if there is a memory allocation !!      error. real ( real64 ), allocatable , dimension (:,:) :: rst !! An M-by-2 array containing the results where M is N / 2 - 1 !! if N is even; else, M is (N - 1) / 2 - 1 if N is odd.  The !! first column contains the averaging times associated with !! the M results stored in the second column. ! Local Variables class ( errors ), pointer :: errmgr type ( errors ), target :: deferr integer ( int32 ) :: flag , j , m , n , limit , nr real ( real64 ), allocatable , dimension (:) :: tall1 , tall2 real ( real64 ) :: temp , deltaT ! Initialization if ( present ( err )) then errmgr => err else errmgr => deferr end if if ( present ( dt )) then deltaT = dt else deltaT = 1.0d0 end if ! Initialization n = size ( x ) limit = n nr = floor ( 0.5 * n ) - 1 allocate ( tall1 ( n - 1 ), source = x (: n - 1 ), stat = flag ) if ( flag == 0 ) allocate ( tall2 ( n - 1 ), source = x ( 2 : n )) if ( flag == 0 ) allocate ( rst ( nr , 2 ), source = 0.0d0 ) if ( flag /= 0 ) go to 10 ! Process do m = 1 , nr temp = 0.0d0 do j = 1 , limit - 1 temp = temp + ( tall2 ( j ) - tall1 ( j )) ** 2 tall1 ( j ) = tall1 ( j ) + x ( min ( n , m + j )) tall2 ( j ) = tall2 ( min ( n - 1 , j + 1 )) + x ( min ( n , 2 * m + j + 1 )) end do limit = limit - 2 rst ( m , 1 ) = dt * m rst ( m , 2 ) = temp / ( 2.0d0 * ( n - 2 * m + 1 ) * m ** 2 ) end do ! End return ! Memory Error Handling 10 continue call report_memory_error ( errmgr , \"allan_variance\" , flag ) return end function ! ------------------------------------------------------------------------------ end module","tags":"","loc":"sourcefile\\fstats_allan.f90.html"},{"title":"fstats_anova.f90 – FSTATS","text":"Source Code module fstats_anova use iso_fortran_env use ieee_arithmetic use fstats_special_functions use fstats_descriptive_statistics use ferror use fstats_errors implicit none private public :: anova_factor public :: single_factor_anova_table public :: two_factor_anova_table public :: anova type anova_factor !! Defines an ANOVA factor result. real ( real64 ) :: dof !! The number of degrees of freedome. real ( real64 ) :: variance !! The estimate of variance. real ( real64 ) :: sum_of_squares !! The sum of the squares. real ( real64 ) :: f_statistic !! The F-statistic. real ( real64 ) :: probability !! The variance probability term. end type type single_factor_anova_table !! Defines a single-factor ANOVA results table. type ( anova_factor ) :: main_factor !! The main, or main factor, results. type ( anova_factor ) :: within_factor !! The within-treatement (error) results. real ( real64 ) :: total_dof !! The total number of degrees of freedom. real ( real64 ) :: total_sum_of_squares !! The total sum of squares. real ( real64 ) :: total_variance !! The total variance estimate. real ( real64 ) :: overall_mean !! The overall mean value. end type type two_factor_anova_table !! Defines a two-factor ANOVA results table. type ( anova_factor ) :: main_factor_1 !! The first main-factor results. type ( anova_factor ) :: main_factor_2 !! The second main-factor results. type ( anova_factor ) :: interaction !! The interaction effects. type ( anova_factor ) :: within_factor !! The within (error) factor results. real ( real64 ) :: total_dof !! The total number of degrees of freedom. real ( real64 ) :: total_sum_of_squares !! The total sum of squares. real ( real64 ) :: total_variance !! The total variance estimate. real ( real64 ) :: overall_mean !! The overall mean value. end type interface anova !! Performs an analysis of variance (ANOVA) on the supplied data !! set. !! !! The following example illustrates a single-factor ANOVA on a !! data set. !! ```fortran !! program example !!     use iso_fortran_env !!     use fstats !!     implicit none !! !!     ! Local Variables !!     character, parameter :: tab = achar(9) !!     real(real64) :: x(10, 2) !!     type(single_factor_anova_table) :: tbl !! !!     ! Define the data !!     x = reshape( & !!         [ & !!             3.086d3, 3.082d3, 3.069d3, 3.072d3, 3.045d3, 3.070d3, 3.079d3, & !!             3.050d3, 3.062d3, 3.062d3, 3.075d3, 3.061d3, 3.063d3, 3.038d3, & !!             3.070d3, 3.062d3, 3.070d3, 3.049d3, 3.042d3, 3.063d3 & !!         ], & !!         [10, 2] & !!     ) !! !!     ! Perform the ANOVA !!     tbl = anova(x) !! !!     ! Print out the table !!     print '(A)', \"Description\" // tab // \"DOF\" // tab // \"Sum of Sq.\" // & !!         tab // \"Variance\" // tab // \"F-Stat\" // tab // \"P-Value\" !!     print '(AF2.0AF5.1AF5.1AF5.3AF5.3)', \"Main Factor: \" // tab, & !!         tbl%main_factor%dof, tab, & !!         tbl%main_factor%sum_of_squares, tab // tab, & !!         tbl%main_factor%variance, tab // tab, & !!         tbl%main_factor%f_statistic, tab, & !!         tbl%main_factor%probability !! !!     print '(AF3.0AF6.1AF5.1)', \"Within: \" // tab, & !!         tbl%within_factor%dof, tab, & !!         tbl%within_factor%sum_of_squares, tab // tab, & !!         tbl%within_factor%variance !! !!     print '(AF3.0AF6.1AF5.1)', \"Total: \" // tab // tab, & !!         tbl%total_dof, tab, & !!         tbl%total_sum_of_squares, tab // tab, & !!         tbl%total_variance !! !!     print '(AF6.1)', \"Overall Mean: \", tbl%overall_mean !! end program !! ``` !! The above program produces the following output. !! ```text !! Description     DOF     Sum of Sq.      Variance        F-Stat  P-Value !! Main Factor:    1.      352.8           352.8           2.147   0.160 !! Within:         18.     2958.2          164.3 !! Total:          19.     3311.0          174.3 !! Overall Mean: 3063.5 !! ``` !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Analysis_of_variance) !! - [SPC Excel Single Factor ANOVA](https://www.spcforexcel.com/knowledge/root-cause-analysis/single-factor-anova) !! - [SPC Excel Gage R&R](https://www.spcforexcel.com/knowledge/measurement-systems-analysis/anova-gage-rr-part-1) !! - [SPC Excel Understanding Regression Statistics](https://www.spcforexcel.com/knowledge/root-cause-analysis/understanding-regression-statistics-part-1) !! - [NIST - Two Way ANOVA](https://www.itl.nist.gov/div898/handbook/prc/section4/prc427.htm) module procedure :: anova_1_factor module procedure :: anova_2_factor module procedure :: anova_model_fit end interface contains ! ------------------------------------------------------------------------------ ! REF: https://www.spcforexcel.com/knowledge/root-cause-analysis/single-factor-anova function anova_1_factor ( x ) result ( rst ) !! Performs an analysis of variance (ANOVA) on the supplied data set. real ( real64 ), intent ( in ) :: x (:,:) !! An M-by-N matrix containing the M replications of the N test !! points of interest. type ( single_factor_anova_table ) :: rst !! A single_factor_anova_table instance containing the ANOVA results. ! Parameters real ( real64 ), parameter :: zero = 0.0d0 ! Local Variables integer ( int32 ) :: j , a , n , nt real ( real64 ) :: sum_all , tssq , essq , bssq ! Initialization a = size ( x , 2 ) nt = size ( x , 1 ) n = nt * a rst % within_factor % f_statistic = ieee_value ( sum_all , IEEE_QUIET_NAN ) rst % within_factor % probability = ieee_value ( sum_all , IEEE_QUIET_NAN ) ! Determine the degrees of freedom rst % main_factor % dof = a - 1 rst % within_factor % dof = n - a rst % total_dof = n - 1 ! Quick Return if ( a == 1 . or . nt == 1 ) then rst % main_factor % sum_of_squares = zero rst % main_factor % variance = zero rst % main_factor % f_statistic = zero rst % main_factor % probability = zero rst % within_factor % sum_of_squares = zero rst % within_factor % variance = zero rst % total_variance = variance ( pack ( x , . true .)) rst % total_sum_of_squares = rst % total_variance * rst % total_dof rst % overall_mean = mean ( pack ( x , . true .)) return end if ! Compute the sum of squares for all factors sum_all = sum ( x ) tssq = sum ( x ** 2 ) - ( sum_all ** 2 / n ) bssq = zero do j = 1 , a bssq = bssq + sum ( x (:, j )) ** 2 end do bssq = ( bssq / nt ) - ( sum_all ** 2 / n ) essq = tssq - bssq rst % main_factor % sum_of_squares = bssq rst % within_factor % sum_of_squares = essq rst % total_sum_of_squares = tssq ! Compute the variance terms rst % main_factor % variance = bssq / rst % main_factor % dof rst % within_factor % variance = essq / rst % within_factor % dof rst % total_variance = tssq / rst % total_dof ! Compute the overall mean rst % overall_mean = mean ( pack ( x , . true .)) ! Compute the F-statistic and probability term call anova_probability ( & rst % main_factor % variance , & rst % within_factor % variance , & rst % main_factor % dof , & rst % within_factor % dof , & rst % main_factor % f_statistic , & rst % main_factor % probability & ) end function ! ------------------------------------------------------------------------------ ! REF: https://www.spcforexcel.com/knowledge/measurement-systems-analysis/anova-gage-rr-part-1 ! REF: https://www.itl.nist.gov/div898/handbook/prc/section4/prc427.htm ! Data set is expected as a 3D array with each of the K pages containing the R !   treatments of N tests such that the array size is N-by-R-by-K function anova_2_factor ( x ) result ( rst ) !! Performs an analysis of variance (ANOVA) on the supplied data set. real ( real64 ), intent ( in ) :: x (:,:,:) !! An M-by-N-by-K array containing the M replications of the !! N first factor results, and the K second factor results. type ( two_factor_anova_table ) :: rst !! A two_factor_anova_table instance containing the ANOVA results. ! Parameters real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: one = 1.0d0 ! Local Variables integer ( int32 ) :: i , j , jj , k , r , n real ( real64 ) :: factorMean , sum_all real ( real64 ), allocatable :: xpack (:) ! Initialization n = size ( x , 3 ) k = size ( x , 2 ) r = size ( x , 1 ) rst % within_factor % f_statistic = ieee_value ( sum_all , IEEE_QUIET_NAN ) rst % within_factor % probability = ieee_value ( sum_all , IEEE_QUIET_NAN ) ! Quick Return if ( k == 1 ) then ! This is a one-factor anova end if ! Determine the number of DOF rst % main_factor_1 % dof = k - one rst % main_factor_2 % dof = n - 1 rst % interaction % dof = ( k - 1 ) * ( n - 1 ) rst % within_factor % dof = n * k * ( r - 1 ) rst % total_dof = n * k * r - 1 ! Compute the overall mean, sum of squares, and variance xpack = pack ( x , . true .) rst % overall_mean = mean ( xpack ) rst % total_sum_of_squares = sum (( xpack - rst % overall_mean ) ** 2 ) rst % total_variance = rst % total_sum_of_squares / rst % total_dof ! Compute factor 1 results rst % main_factor_1 % sum_of_squares = zero do i = 1 , k factorMean = mean ( pack ( x (:, i ,:), . true .)) rst % main_factor_1 % sum_of_squares = rst % main_factor_1 % sum_of_squares + & ( factorMean - rst % overall_mean ) ** 2 end do rst % main_factor_1 % sum_of_squares = n * r * rst % main_factor_1 % sum_of_squares rst % main_factor_1 % variance = rst % main_factor_1 % sum_of_squares / & rst % main_factor_1 % dof ! Compute factor 2 results rst % main_factor_2 % sum_of_squares = zero do i = 1 , n factorMean = mean ( pack ( x (:,:, i ), . true .)) rst % main_factor_2 % sum_of_squares = rst % main_factor_2 % sum_of_squares + & ( factorMean - rst % overall_mean ) ** 2 end do rst % main_factor_2 % sum_of_squares = k * r * rst % main_factor_2 % sum_of_squares rst % main_factor_2 % variance = rst % main_factor_2 % sum_of_squares / & rst % main_factor_2 % dof ! Compute the within (error) term rst % within_factor % sum_of_squares = zero do j = 1 , k do i = 1 , n factorMean = mean ( x (:, j , i )) do jj = 1 , r rst % within_factor % sum_of_squares = & rst % within_factor % sum_of_squares + & ( x ( jj , j , i ) - factorMean ) ** 2 end do end do end do rst % within_factor % variance = rst % within_factor % sum_of_squares / & rst % within_factor % dof ! Compute the interaction term rst % interaction % sum_of_squares = rst % total_sum_of_squares - ( & rst % main_factor_1 % sum_of_squares + & rst % main_factor_2 % sum_of_squares + & rst % within_factor % sum_of_squares & ) rst % interaction % variance = rst % interaction % sum_of_squares / & rst % interaction % dof ! Compute the F-statistics call anova_probability ( & rst % main_factor_1 % variance , & rst % within_factor % variance , & rst % main_factor_1 % dof , & rst % within_factor % dof , & rst % main_factor_1 % f_statistic , & rst % main_factor_1 % probability & ) call anova_probability ( & rst % main_factor_2 % variance , & rst % within_factor % variance , & rst % main_factor_2 % dof , & rst % within_factor % dof , & rst % main_factor_2 % f_statistic , & rst % main_factor_2 % probability & ) call anova_probability ( & rst % interaction % variance , & rst % within_factor % variance , & rst % interaction % dof , & rst % within_factor % dof , & rst % interaction % f_statistic , & rst % interaction % probability & ) end function ! ------------------------------------------------------------------------------ ! REF: https://www.spcforexcel.com/knowledge/root-cause-analysis/understanding-regression-statistics-part-1 function anova_model_fit ( nmodelparams , ymeas , ymod , err ) result ( rst ) !! Performs an analysis of variance (ANOVA) on the supplied data set. integer ( int32 ), intent ( in ) :: nmodelparams !! The number of model parameters. real ( real64 ), intent ( in ) :: ymeas (:) !! An N-element array containing the measured dependent variable data. real ( real64 ), intent ( in ) :: ymod (:) !! An N-element array containing the modeled dependent variable data. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings to the !! caller.  Possible warning and error codes are as follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_ARRAY_SIZE_ERROR: Occurs if ymeas and ymod are not the !!   same length. !! - FS_MEMORY_ERROR: Occurs if a memory error is encountered. type ( single_factor_anova_table ) :: rst !! A single_factor_anova_table instance containing the ANOVA results. ! Local Variables integer ( int32 ) :: n , flag real ( real64 ), allocatable :: ypack (:) real ( real64 ) :: sum_all class ( errors ), pointer :: errmgr type ( errors ), target :: deferr ! Initialization n = size ( ymeas ) if ( present ( err )) then errmgr => err else errmgr => deferr end if rst % within_factor % f_statistic = ieee_value ( sum_all , IEEE_QUIET_NAN ) rst % within_factor % probability = ieee_value ( sum_all , IEEE_QUIET_NAN ) ! Input Checking if ( size ( ymod ) /= n ) then call report_arrays_not_same_size_error ( errmgr , \"anova_model_fit\" , & \"YMEAS\" , \"YMOD\" , n , size ( ymod )) return end if ! Memory Allocation allocate ( ypack ( 2 * n ), stat = flag ) if ( flag /= 0 ) then call report_memory_error ( errmgr , \"anova_model_fit\" , flag ) return end if ! Determine the number of DOF rst % main_factor % dof = nmodelparams - 1 rst % within_factor % dof = n - rst % main_factor % dof - 1 rst % total_dof = n - 1 ! Process ypack ( 1 : n ) = ymeas ypack ( n + 1 : 2 * n ) = ymod rst % overall_mean = mean ( ypack ) rst % total_sum_of_squares = sum (( ymeas - rst % overall_mean ) ** 2 ) rst % main_factor % sum_of_squares = sum (( ymod - rst % overall_mean ) ** 2 ) rst % within_factor % sum_of_squares = sum (( ymeas - ymod ) ** 2 ) rst % total_variance = rst % total_sum_of_squares / rst % total_dof rst % main_factor % variance = rst % main_factor % sum_of_squares / & rst % main_factor % dof rst % within_factor % variance = rst % within_factor % sum_of_squares / & rst % within_factor % dof ! Compute the F-statistic and probability term call anova_probability ( & rst % main_factor % variance , & rst % within_factor % variance , & rst % main_factor % dof , & rst % within_factor % dof , & rst % main_factor % f_statistic , & rst % main_factor % probability & ) ! Formatting 100 format ( A , I0 , A , I0 , A ) 101 format ( A , I0 , A ) end function ! ****************************************************************************** ! PRIVATE ROUTINES ! ------------------------------------------------------------------------------ subroutine anova_probability ( v1 , v2 , dof1 , dof2 , f , p ) ! Arguments real ( real64 ), intent ( in ) :: v1 , v2 , dof1 , dof2 real ( real64 ), intent ( out ) :: f , p ! Local Variables real ( real64 ) :: d1 , d2 , a , b , x ! Process f = v1 / v2 d1 = dof1 d2 = dof2 a = 0.5d0 * d2 b = 0.5d0 * d1 x = d2 / ( d2 + d1 * f ) p = regularized_beta ( a , b , x ) if ( p > 1.0d0 ) then p = 2.0d0 - p end if end subroutine ! ------------------------------------------------------------------------------ end module","tags":"","loc":"sourcefile\\fstats_anova.f90.html"},{"title":"fstats_helper_routines.f90 – FSTATS","text":"Source Code module fstats_helper_routines use iso_fortran_env implicit none private public :: difference public :: factorial contains ! ------------------------------------------------------------------------------ pure function difference ( x ) result ( rst ) !! Computes the difference between elements in an array. real ( real64 ), intent ( in ), dimension (:) :: x !! The N-element array on which to operate. real ( real64 ), allocatable , dimension (:) :: rst !! The (N-1)-element array containing the differences between adjacent !! elements. ! Local Variables integer ( int32 ) :: i , n ! Process n = size ( x ) allocate ( rst ( n - 1 )) do i = 1 , n - 1 rst ( i ) = x ( i + 1 ) - x ( i ) end do end function ! ------------------------------------------------------------------------------ pure elemental function factorial ( x ) result ( rst ) !! Computes the factorial of X. real ( real64 ), intent ( in ) :: x !! The value whose factorial is to be computed. real ( real64 ) :: rst !! The result. rst = gamma ( x + 1.0d0 ) end function ! ------------------------------------------------------------------------------ end module","tags":"","loc":"sourcefile\\fstats_helper_routines.f90.html"},{"title":"fstats_descriptive_statistics.f90 – FSTATS","text":"Source Code module fstats_descriptive_statistics use iso_fortran_env use linalg , only : sort use ferror use fstats_errors use fstats_types implicit none private public :: mean public :: variance public :: standard_deviation public :: median public :: quantile public :: trimmed_mean public :: covariance public :: pooled_variance interface pooled_variance !! Computes the pooled estimate of variance. module procedure :: pooled_variance_1 module procedure :: pooled_variance_2 end interface contains ! ------------------------------------------------------------------------------ pure function mean ( x ) result ( rst ) !! Computes the mean of the values in an array. real ( real64 ), intent ( in ) :: x (:) !! The array of values to analyze. real ( real64 ) :: rst !! The result. ! Parameters real ( real64 ), parameter :: zero = 0.0d0 ! Local Variables integer ( int32 ) :: i , n ! Process n = size ( x ) if ( n == 0 ) then rst = zero else rst = x ( 1 ) do i = 2 , n rst = rst + ( x ( i ) - rst ) / i end do end if end function ! ------------------------------------------------------------------------------ pure function variance ( x ) result ( rst ) !! Computes the sample variance of the values in an array. !! !! The variance computed is the sample variance such that !!  s&#94;2 = \\frac{\\Sigma \\left( x_{i} - \\bar{x} \\right)&#94;2}{n - 1} . real ( real64 ), intent ( in ) :: x (:) !! The array of values to analyze. real ( real64 ) :: rst ! Parameters real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: one = 1.0d0 ! Local Variables integer ( int32 ) :: i , n real ( real64 ) :: oldMean , newMean ! Process n = size ( x ) if ( n <= 1 ) then rst = zero else oldMean = x ( 1 ) rst = zero do i = 2 , n newMean = oldMean + ( x ( i ) - oldMean ) / i rst = rst + ( x ( i ) - oldMean ) * ( x ( i ) - newMean ) oldMean = newMean end do rst = rst / ( n - one ) end if end function ! ------------------------------------------------------------------------------ pure function standard_deviation ( x ) result ( rst ) !! Computes the sample standard deviation of the values in an array. !! !! The value computed is the sample standard deviation. !!  s = \\sqrt{ \\frac{\\Sigma \\left( x_{i} - \\bar{x} \\right)&#94;2}{n - 1} }  real ( real64 ), intent ( in ) :: x (:) !! The array of values to analyze. real ( real64 ) :: rst !! The result. ! Process rst = sqrt ( variance ( x )) end function ! ------------------------------------------------------------------------------ function median ( x ) result ( rst ) !! Computes the median of the values in an array. real ( real64 ), intent ( inout ) :: x (:) !! The array of values to analyze.  On output, this array is sorted into !! ascending order. real ( real64 ) :: rst !! The result. ! Parameters real ( real64 ), parameter :: half = 0.5d0 ! Local Variables integer ( int32 ) :: n , nmid , nmidp1 , flag , iflag ! Initialization n = size ( x ) nmid = n / 2 nmidp1 = nmid + 1 iflag = n - 2 * nmid ! Sort the array in ascending order call sort ( x , . true .) ! Find the median if ( iflag == 0 ) then rst = half * ( x ( nmid ) + x ( nmidp1 )) else rst = x ( nmidp1 ) end if end function ! ------------------------------------------------------------------------------ ! REF: https://fortranwiki.org/fortran/show/Quartiles ! ! This is the method used by Minitab pure function quantile ( x , q ) result ( rst ) !! Computes the specified quantile of a data set using the SAS !! Method 4. !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Quantile) real ( real64 ), intent ( in ) :: x (:) !! An N-element array containing the data. real ( real64 ), intent ( in ) :: q !! The quantile to compute (e.g. 0.25 computes the 25% quantile). real ( real64 ) :: rst !! The result. ! Parameters real ( real64 ), parameter :: one = 1.0d0 ! Local Variables real ( real64 ) :: a , b , c , tol integer ( int32 ) :: n , ib ! Initialization tol = sqrt ( epsilon ( tol )) n = size ( x ) ! Process a = ( n + one ) * q b = mod ( a , one ) c = a - b ib = int ( c , int32 ) if (( ib + 1 ) > n ) then rst = ( one - b ) * x ( ib ) + b * x ( n ) else rst = ( one - b ) * x ( ib ) + b * x ( ib + 1 ) end if end function ! ------------------------------------------------------------------------------ function trimmed_mean ( x , p ) result ( rst ) !! Computes the trimmed mean of a data set. real ( real64 ), intent ( inout ), dimension (:) :: x !! An N-element array containing the data.  On output, the !! array is sorted into ascending order. real ( real64 ), intent ( in ), optional :: p !! An optional parameter specifying the percentage of values !! from either end of the distribution to remove.  The default !! is 0.05 such that the bottom 5% and top 5% are removed. real ( real64 ) :: rst !! The trimmed mean. ! Local Variables integer ( int32 ) :: i1 , i2 , n real ( real64 ) :: pv ! Initialization if ( present ( p )) then pv = abs ( p ) else pv = 0.05d0 end if ! Sort the array into ascending order call sort ( x , . true .) ! Find the limiting indices n = size ( x ) i1 = max ( floor ( n * pv , int32 ), 1 ) i2 = min ( n , n - i1 + 1 ) rst = mean ( x ( i1 : i2 )) end function ! ------------------------------------------------------------------------------ pure function covariance ( x , y ) result ( rst ) !! Computes the sample covariance of two data sets. !! !! The covariance computed is the sample covariance such that !!  q_{jk} = \\frac{\\Sigma \\left( x_{i} - \\bar{x} \\right) !! \\left( y_{i} - \\bar{y} \\right)}{n - 1} . real ( real64 ), intent ( in ), dimension (:) :: x !! The first N-element data set. real ( real64 ), intent ( in ), dimension ( size ( x )) :: y !! The second N-element data set. real ( real64 ) :: rst !! The covariance. ! Parameters real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: one = 1.0d0 ! Local Variables integer ( int32 ) :: i , n real ( real64 ) :: meanX , meanY ! Process n = size ( x ) if ( n <= 1 ) then rst = zero else ! Compute the means meanX = x ( 1 ) meanY = y ( 1 ) do i = 2 , n meanX = meanX + ( x ( i ) - meanX ) / i meanY = meanY + ( y ( i ) - meanY ) / i end do ! Compute the covariance rst = sum (( x - meanX ) * ( y - meanY )) / ( n - one ) end if end function ! ------------------------------------------------------------------------------ pure function pooled_variance_1 ( si , ni ) result ( rst ) !! Computes the pooled estimate of variance. real ( real64 ), intent ( in ), dimension (:) :: si !! An N-element array containing the estimates for each of the N !! variances. integer ( int32 ), intent ( in ), dimension ( size ( si )) :: ni !! An N-element array containing the number of data points in each !! of the data sets used to compute the variances in si. real ( real64 ) :: rst !! The pooled variance. ! Local Variables integer ( int32 ) :: i , k , n ! Process k = size ( si ) rst = 0.0d0 n = 0 do i = 1 , k n = n + ni ( i ) rst = rst + ( ni ( i ) - 1.0d0 ) * si ( i ) end do rst = rst / real ( n - k , real64 ) end function pure function pooled_variance_2 ( x ) result ( rst ) !! Computes the pooled estimate of variance. type ( array_container ), intent ( in ), dimension (:) :: x !! An array of arrays of data. real ( real64 ) :: rst !! The pooled variance. ! Local Variables integer ( int32 ) :: i , k , n , ni ! Process k = size ( x ) n = 0 rst = 0.0d0 do i = 1 , k ni = size ( x ( i )% x ) n = n + ni rst = rst + variance ( x ( i )% x ) * ( ni - 1.0 ) end do rst = rst / real ( n - k , real64 ) end function ! ------------------------------------------------------------------------------ end module","tags":"","loc":"sourcefile\\fstats_descriptive_statistics.f90.html"},{"title":"fstats.f90 – FSTATS","text":"Source Code module fstats !! FSTATS is a modern Fortran statistical library containing routines for !! computing basic statistical properties, hypothesis testing, regression, !! special functions, and experimental design. use iso_fortran_env use fstats_special_functions use fstats_descriptive_statistics use fstats_hypothesis use fstats_distributions use fstats_anova use fstats_helper_routines use fstats_regression use fstats_experimental_design use fstats_allan use fstats_bootstrap use fstats_sampling use fstats_smoothing implicit none private public :: distribution public :: distribution_function public :: distribution_property public :: t_distribution public :: normal_distribution public :: f_distribution public :: chi_squared_distribution public :: binomial_distribution public :: mean public :: variance public :: standard_deviation public :: median public :: covariance public :: r_squared public :: adjusted_r_squared public :: correlation public :: quantile public :: t_test_equal_variance public :: t_test_unequal_variance public :: t_test_paired public :: f_test public :: anova public :: anova_factor public :: single_factor_anova_table public :: two_factor_anova_table public :: confidence_interval public :: beta public :: regularized_beta public :: incomplete_beta public :: digamma public :: incomplete_gamma_upper public :: incomplete_gamma_lower public :: design_matrix public :: covariance_matrix public :: linear_least_squares public :: regression_statistics public :: get_full_factorial_matrix_size public :: full_factorial public :: iteration_controls public :: lm_solver_options public :: convergence_info public :: regression_function public :: iteration_update public :: jacobian public :: nonlinear_least_squares public :: allan_variance public :: trimmed_mean public :: difference public :: factorial public :: bootstrap_resampling_routine public :: bootstrap_statistic_routine public :: random_resample public :: scaled_random_resample public :: bootstrap_statistics public :: bootstrap public :: bootstrap_regression_statistics public :: bootstrap_linear_least_squares public :: bootstrap_nonlinear_least_squares public :: box_muller_sample public :: rejection_sample public :: lowess public :: pooled_variance public :: bartletts_test public :: FS_LEVENBERG_MARQUARDT_UPDATE public :: FS_QUADRATIC_UPDATE public :: FS_NIELSEN_UPDATE end module","tags":"","loc":"sourcefile\\fstats.f90.html"},{"title":"fstats_experimental_design.f90 – FSTATS","text":"Source Code module fstats_experimental_design use iso_fortran_env use fstats_errors implicit none private public :: get_full_factorial_matrix_size public :: full_factorial contains ! ------------------------------------------------------------------------------ subroutine get_full_factorial_matrix_size ( vars , m , n , err ) !! Computes the appropriate size for a full-factorial design table. integer ( int32 ), intent ( in ) :: vars (:) !! An M-element array containing the M factors to study.  Each !! of the M entries to the array is expected to contain the !! number of options for that particular factor to explore. !! This value must be greater than or equal to 1. integer ( int32 ), intent ( out ) :: m !! The number of rows for the table. integer ( int32 ), intent ( out ) :: n !! The number of columns for the table. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings to the !! caller.  Possible warning and error codes are as follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_INVALID_INPUT_ERROR: Occurs if any items in vars are !!      less than 1. ! Local Variables integer ( int32 ) :: i class ( errors ), pointer :: errmgr type ( errors ), target :: deferr character ( len = 256 ) :: errmsg ! Initialization if ( present ( err )) then errmgr => err else errmgr => deferr end if m = 0 n = 0 ! Ensure every value is greater than 1 do i = 1 , size ( vars ) if ( vars ( i ) < 1 ) then write ( errmsg , 100 ) \"A value less than 1 was found at index \" , & i , \" of the input array.  All values must be greater \" // & \"than or equal to 1.\" call errmgr % report_error ( \"get_full_factorial_matrix_size\" , & trim ( errmsg ), FS_INVALID_INPUT_ERROR ) return end if end do ! Process m = product ( vars ) n = size ( vars ) ! Formatting 100 format ( A , I0 , A ) end subroutine ! ------------------------------------------------------------------------------ subroutine full_factorial ( vars , tbl , err ) !! Computes a table with values scaled from 1 to N describing a !! full-factorial design. !! !! ```fortran !! program example !!     use iso_fortran_env !!     use fstats !!     implicit none !! !!     ! Local Variables !!     integer(int32) :: i, vars(3), tbl(24, 3) !! !!     ! Define the number of design points for each of the 3 factors to study !!     vars = [2, 4, 3] !! !!     ! Determine the design table !!     call full_factorial(vars, tbl) !! !!     ! Display the table !!     do i = 1, size(tbl, 1) !!         print *, tbl(i,:) !!     end do !! end program !! ``` !! The above program produces the following output. !! ```text !! 1           1           1 !! 1           1           2 !! 1           1           3 !! 1           2           1 !! 1           2           2 !! 1           2           3 !! 1           3           1 !! 1           3           2 !! 1           3           3 !! 1           4           1 !! 1           4           2 !! 1           4           3 !! 2           1           1 !! 2           1           2 !! 2           1           3 !! 2           2           1 !! 2           2           2 !! 2           2           3 !! 2           3           1 !! 2           3           2 !! 2           3           3 !! 2           4           1 !! 2           4           2 !! 2           4           3 !! ``` integer ( int32 ), intent ( in ) :: vars (:) !! An M-element array containing the M factors to study. !! Each of the M entries to the array is expected to contain !! the number of options for that particular factor to explore. !! This value must be greater than or equal to 1. integer ( int32 ), intent ( out ) :: tbl (:,:) !! A table where the design will be written.  Use !! get_full_factorial_matrix_size to determine the appropriate !! table size. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings to the !! caller.  Possible warning and error codes are as follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_INVALID_INPUT_ERROR: Occurs if any items in vars are !!      less than 1. !! - FS_ARRAY_SIZE_ERROR: Occurs if tbl is not properly sized. ! Local Variables integer ( int32 ) :: i , col , stride , last , val , m , n class ( errors ), pointer :: errmgr type ( errors ), target :: deferr ! Initialization if ( present ( err )) then errmgr => err else errmgr => deferr end if ! Verify the size of the input table call get_full_factorial_matrix_size ( vars , m , n , errmgr ) if ( errmgr % has_error_occurred ()) return if ( size ( tbl , 1 ) /= m . or . size ( tbl , 2 ) /= n ) then call report_matrix_size_error ( errmgr , \"full_factorial\" , & \"tbl\" , m , n , size ( tbl , 1 ), size ( tbl , 2 )) return end if ! Process do col = 1 , n stride = 1 if ( col /= n ) stride = product ( vars ( col + 1 : n )) val = 1 do i = 1 , m , stride last = i + stride - 1 tbl ( i : last , col ) = val val = val + 1 if ( val > vars ( col )) val = 1 end do end do end subroutine ! ------------------------------------------------------------------------------ end module","tags":"","loc":"sourcefile\\fstats_experimental_design.f90.html"},{"title":"fstats_regression.f90 – FSTATS","text":"Source Code module fstats_regression use iso_fortran_env use linalg use fstats_errors use blas use ferror use fstats_descriptive_statistics use fstats_distributions use fstats_special_functions use fstats_hypothesis implicit none private public :: iteration_controls public :: convergence_info public :: lm_solver_options public :: regression_function public :: iteration_update public :: regression_statistics public :: r_squared public :: adjusted_r_squared public :: correlation public :: design_matrix public :: covariance_matrix public :: linear_least_squares public :: calculate_regression_statistics public :: jacobian public :: nonlinear_least_squares public :: FS_LEVENBERG_MARQUARDT_UPDATE public :: FS_QUADRATIC_UPDATE public :: FS_NIELSEN_UPDATE ! ****************************************************************************** ! CONSTANTS ! ------------------------------------------------------------------------------ integer ( int32 ), parameter :: FS_LEVENBERG_MARQUARDT_UPDATE = 1 integer ( int32 ), parameter :: FS_QUADRATIC_UPDATE = 2 integer ( int32 ), parameter :: FS_NIELSEN_UPDATE = 3 ! ****************************************************************************** ! TYPES ! ------------------------------------------------------------------------------ type regression_statistics !! A container for regression-related statistical information. real ( real64 ) :: standard_error !! The standard error for the model coefficient. !! !!  E_{s}(\\beta_{i}) = \\sqrt{\\sigma&#94;{2} C_{ii}}  real ( real64 ) :: t_statistic !! The T-statistic for the model coefficient. !! !!  t_o = \\frac{ \\beta_{i} }{E_{s}(\\beta_{i})}  real ( real64 ) :: probability !! The probability that the coefficient is not statistically !! important.  A statistically important coefficient will have a !! low probability (p-value), typically 0.05 or lower; however, a !! p-value of up to ~0.2 may be acceptable dependent upon the !! problem.  Typically any p-value larger than ~0.2 indicates the !! parameter is not statistically important for the model. !! !!  p = t_{|t_o|, df_{residual}}  real ( real64 ) :: confidence_interval !! The confidence interval for the parameter at the level !! determined by the regression process. !! !!  c = t_{\\alpha, df} E_{s}(\\beta_{i})  end type type iteration_controls !! Provides a collection of iteration control parameters. integer ( int32 ) :: max_iteration_count !! Defines the maximum number of iterations allowed. integer ( int32 ) :: max_function_evaluations !! Defines the maximum number of function evaluations allowed. real ( real64 ) :: gradient_tolerance !! Defines a tolerance on the gradient of the fitted function. real ( real64 ) :: change_in_solution_tolerance !! Defines a tolerance on the change in parameter values. real ( real64 ) :: residual_tolerance !! Defines a tolerance on the metric associated with the residual !! error. real ( real64 ) :: iteration_improvement_tolerance !! Defines a tolerance to ensure adequate improvement on each !! iteration. integer ( int32 ) :: max_iteration_between_updates !! Defines how many iterations can pass before a re-evaluation of !! the Jacobian matrix is forced. contains procedure , public :: set_to_default => lm_set_default_tolerances end type type convergence_info !! Provides information regarding convergence status. logical :: converge_on_gradient !! True if convergence on the gradient was achieved; else, false. real ( real64 ) :: gradient_value !! The value of the gradient test parameter. logical :: converge_on_solution_change !! True if convergence on the change in solution was achieved; else, !! false. real ( real64 ) :: solution_change_value !! The value of the change in solution parameter. logical :: converge_on_residual_parameter !! True if convergence on the residual error parameter was achieved; !! else, false. real ( real64 ) :: residual_value !! The value of the residual error parameter. logical :: reach_iteration_limit !! True if the solution did not converge in the allowed number of !! iterations. integer ( int32 ) :: iteration_count !! The iteration count. logical :: reach_function_evaluation_limit !! True if the solution did not converge in the allowed number of !! function evaluations. integer ( int32 ) :: function_evaluation_count !! The function evaluation count. logical :: user_requested_stop !! True if the user requested the stop; else, false. end type type lm_solver_options !! Options to control the Levenberg-Marquardt solver. integer ( int32 ) :: method !! The solver method to utilize. !! - FS_LEVENBERG_MARQUARDT_UPDATE: !! - FS_QUADRATIC_UPDATE: !! - FS_NIELSEN_UDPATE: real ( real64 ) :: finite_difference_step_size !! The step size used for the finite difference calculations of the !! Jacobian matrix. real ( real64 ) :: damping_increase_factor !! The factor to use when increasing the damping parameter. real ( real64 ) :: damping_decrease_factor !! The factor to use when decreasing the damping parameter. contains procedure , public :: set_to_default => lm_set_default_settings end type interface subroutine regression_function ( xdata , params , resid , stop ) use iso_fortran_env , only : real64 real ( real64 ), intent ( in ), dimension (:) :: xdata , params real ( real64 ), intent ( out ), dimension (:) :: resid logical , intent ( out ) :: stop end subroutine subroutine iteration_update ( iter , funvals , resid , params , step ) use iso_fortran_env , only : int32 , real64 integer ( int32 ), intent ( in ) :: iter real ( real64 ), intent ( in ) :: funvals (:), resid (:), params (:), step (:) end subroutine end interface contains ! ------------------------------------------------------------------------------ function r_squared ( x , xm , err ) result ( rst ) !! Computes the R-squared value for a data set. !! !! The R-squared value is computed by determining the sum of the squares !! of the residuals: !!  SS_{res} = \\Sigma \\left( y_i - f_i \\right)&#94;2  !! The total sum of the squares: !!  SS_{tot} = \\Sigma \\left( y_i - \\bar{y} \\right)&#94;2 . !! The R-squared value is then: !!  R&#94;2 = 1 - \\frac{SS_{res}}{SS_{tot}} . !! !! See Also: !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Coefficient_of_determination) real ( real64 ), intent ( in ) :: x (:) !! An N-element array containing the dependent variables from !! the data set. real ( real64 ), intent ( in ) :: xm (:) !! An N-element array containing the corresponding modeled !! values. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings !! to the caller.  Possible warning and error codes are as !! follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_ARRAY_SIZE_ERROR: Occurs if x and xm are not the !!   same size. real ( real64 ) :: rst !! The result. ! Parameters real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: one = 1.0d0 ! Local Variables integer ( int32 ) :: i , n real ( real64 ) :: esum , vt class ( errors ), pointer :: errmgr type ( errors ), target :: deferr ! Initialization if ( present ( err )) then errmgr => err else errmgr => deferr end if ! Input Check n = size ( x ) if ( size ( xm ) /= n ) then call report_array_size_error ( errmgr , \"r_squared_real64\" , \"XM\" , n , & size ( xm )) return end if ! Process esum = zero do i = 1 , n esum = esum + ( x ( i ) - xm ( i )) ** 2 end do vt = variance ( x ) * ( n - one ) rst = one - esum / vt end function ! ------------------------------------------------------------------------------ function adjusted_r_squared ( p , x , xm , err ) result ( rst ) !! Computes the adjusted R-squared value for a data set. !! !! The adjusted R-squared provides a mechanism for tempering the effects !! of extra explanatory variables on the traditional R-squared !! calculation.  It is computed by noting the sample size  n  and !! the number of variables  p . !!  \\bar{R}&#94;2 = 1 - \\left( 1 - R&#94;2 \\right) \\frac{n - 1}{n - p} . !! !! See Also: !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Coefficient_of_determination#Adjusted_R2) integer ( int32 ), intent ( in ) :: p !! The number of variables. real ( real64 ), intent ( in ) :: x (:) !! An N-element array containing the dependent variables from !! the data set. real ( real64 ), intent ( in ) :: xm (:) !! An N-element array containing the corresponding modeled !! values. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings !! to the caller.  Possible warning and error codes are as !! follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_ARRAY_SIZE_ERROR: Occurs if x and xm are not the !!   same size. real ( real64 ) :: rst !! The result. ! Local Variables integer ( int32 ) :: n real ( real64 ) :: r2 class ( errors ), pointer :: errmgr type ( errors ), target :: deferr ! Parameters real ( real64 ), parameter :: one = 1.0d0 ! Initialization if ( present ( err )) then errmgr => err else errmgr => deferr end if n = size ( x ) ! Process r2 = r_squared ( x , xm , errmgr ) if ( errmgr % has_error_occurred ()) return rst = one - ( one - r2 ) * ( n - one ) / ( n - p - one ) end function ! ------------------------------------------------------------------------------ pure function correlation ( x , y ) result ( rst ) !! Computes the sample correlation coefficient (an estimate to the !! population Pearson correlation) as follows. !! !!  r_{xy} = \\frac{cov(x, y)}{s_{x} s_{y}} . !! !! Where,  s_{x}  &  s_{y}  are the sample standard deviations of !! x and y respectively. real ( real64 ), intent ( in ), dimension (:) :: x !! The first N-element data set. real ( real64 ), intent ( in ), dimension ( size ( x )) :: y !! The second N-element data set. real ( real64 ) :: rst !! The correlation coefficient. ! Process rst = covariance ( x , y ) / ( standard_deviation ( x ) * standard_deviation ( y )) end function ! ------------------------------------------------------------------------------ subroutine design_matrix ( order , intercept , x , c , err ) !! Computes the design matrix  X  for the linear !! least-squares regression problem of  X \\beta = y , where !!  X  is the matrix computed here,  \\beta  is !! the vector of coefficients to be determined, and  y  is the !! vector of measured dependent variables. !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Linear_regression) !! - [Wikipedia](https://en.wikipedia.org/wiki/Vandermonde_matrix) !! - [Wikipedia](https://en.wikipedia.org/wiki/Design_matrix) integer ( int32 ), intent ( in ) :: order !! The order of the equation to fit.  This value must be !! at least one (linear equation), but can be higher as desired. logical , intent ( in ) :: intercept !! Set to true if the intercept is being computed !! as part of the regression; else, false. real ( real64 ), intent ( in ) :: x (:) !! An N-element array containing the independent variable !! measurement points. real ( real64 ), intent ( out ) :: c (:,:) !! An N-by-K matrix where the results will be written.  K !! must equal order + 1 in the event intercept is true; !! however, if intercept is false, K must equal order. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings to the !! caller.  Possible warning and error codes are as follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_ARRAY_SIZE_ERROR: Occurs if c is not properly sized. !! - FS_INVALID_INPUT_ERROR: Occurs if order is less than 1. ! Parameters real ( real64 ), parameter :: one = 1.0d0 ! Local Variables integer ( int32 ) :: i , start , npts , ncols class ( errors ), pointer :: errmgr type ( errors ), target :: deferr ! Initialization if ( present ( err )) then errmgr => err else errmgr => deferr end if npts = size ( x ) ncols = order if ( intercept ) ncols = ncols + 1 ! Input Check if ( order < 1 ) then call errmgr % report_error ( \"design_matrix\" , & \"The model order must be at least one.\" , FS_INVALID_INPUT_ERROR ) return end if if ( size ( c , 1 ) /= npts . or . size ( c , 2 ) /= ncols ) then call report_matrix_size_error ( errmgr , \"design_matrix\" , & \"c\" , npts , ncols , size ( c , 1 ), size ( c , 2 )) return end if ! Process if ( intercept ) then c (:, 1 ) = one c (:, 2 ) = x start = 3 else c (:, 1 ) = x start = 2 end if if ( start >= ncols ) return do i = start , ncols c (:, i ) = c (:, i - 1 ) * x end do end subroutine ! ------------------------------------------------------------------------------ subroutine covariance_matrix ( x , c , err ) !! Computes the covariance matrix  C  where !!  C = \\left( X&#94;{T} X \\right)&#94;{-1}  and  X  is computed !! by design_matrix. !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Covariance_matrix) !! - [Wikipedia - Regression](https://en.wikipedia.org/wiki/Linear_regression) real ( real64 ), intent ( in ) :: x (:,:) !! An M-by-N matrix containing the formatted independent data !!  matrix  X  as computed by design_matrix. real ( real64 ), intent ( out ) :: c (:,:) !! The N-by-N covariance matrix. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings to the !! caller.  Possible warning and error codes are as follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_ARRAY_SIZE_ERROR: Occurs if any of the matrices are not !!      sized correctly. !! - FS_MEMORY_ERROR: Occurs if there is a memory allocation !!      error. ! Parameters real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: one = 1.0d0 ! Local Variables class ( errors ), pointer :: errmgr type ( errors ), target :: deferr integer ( int32 ) :: npts , ncoeffs , flag real ( real64 ), allocatable :: xtx (:,:) ! Initialization if ( present ( err )) then errmgr => err else errmgr => deferr end if npts = size ( x , 1 ) ncoeffs = size ( x , 2 ) ! Input Checking if ( size ( c , 1 ) /= ncoeffs . or . size ( c , 2 ) /= ncoeffs ) then call report_matrix_size_error ( errmgr , \"covariance_matrix\" , & \"c\" , ncoeffs , ncoeffs , size ( c , 1 ), size ( c , 2 )) return end if ! Local Memory Allocation allocate ( xtx ( ncoeffs , ncoeffs ), stat = flag ) if ( flag /= 0 ) then call report_memory_error ( errmgr , \"covariance_matrix\" , flag ) return end if ! Compute X**T * X call DGEMM ( \"T\" , \"N\" , ncoeffs , ncoeffs , npts , one , x , npts , x , npts , & zero , xtx , ncoeffs ) ! Compute the inverse of X**T * X to obtain the covariance matrix call mtx_pinverse ( xtx , c , err = errmgr ) if ( errmgr % has_error_occurred ()) return end subroutine ! ------------------------------------------------------------------------------ subroutine linear_least_squares ( order , intercept , x , y , coeffs , & ymod , resid , stats , alpha , err ) !! Computes a linear least-squares regression to fit a set of data. !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Linear_regression) !! - [SPC Excel Understanding Regression Statistics](https://www.spcforexcel.com/knowledge/root-cause-analysis/understanding-regression-statistics-part-1) integer ( int32 ), intent ( in ) :: order !! The order of the equation to fit.  This value must be at !! least one (linear equation), but can be higher as desired, !! as long as there is sufficient data. logical , intent ( in ) :: intercept !! Set to true if the intercept is being computed as part of !! the regression; else, false. real ( real64 ), intent ( in ) :: x (:) !! An N-element array containing the independent variable !! measurement points. real ( real64 ), intent ( in ) :: y (:) !! An N-element array containing the dependent variable !! measurement points. real ( real64 ), intent ( out ) :: coeffs (:) !! An ORDER+1 element array where the coefficients will be written. real ( real64 ), intent ( out ) :: ymod (:) !! An N-element array where the modeled data will be written. real ( real64 ), intent ( out ) :: resid (:) !! An N-element array where the residual error data will be !! written (modeled - actual). type ( regression_statistics ), intent ( out ), optional :: stats (:) !! An M-element array of regression_statistics items where !! M = ORDER + 1 when intercept is set to true; however, if !! intercept is set to false, M = ORDER. real ( real64 ), intent ( in ), optional :: alpha !! The significance level at which to evaluate the confidence !! intervals.  The default value is 0.05 such that a 95% !! confidence interval is calculated. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings to the !! caller.  Possible warning and error codes are as follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not !!      approriately sized. !! - FS_INVALID_INPUT_ERROR: Occurs if order is less than 1. !! - FS_MEMORY_ERROR: Occurs if there is a memory allocation !!      error. ! Parameters real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: half = 0.5d0 real ( real64 ), parameter :: one = 1.0d0 ! Local Variables integer ( int32 ) :: i , npts , ncols , ncoeffs , flag real ( real64 ) :: alph , var , df , ssr , talpha real ( real64 ), allocatable :: a (:,:), c (:,:), cxt (:,:) type ( t_distribution ) :: dist class ( errors ), pointer :: errmgr type ( errors ), target :: deferr ! Initialization if ( present ( err )) then errmgr => err else errmgr => deferr end if npts = size ( x ) ncoeffs = order + 1 ncols = order if ( intercept ) ncols = ncols + 1 alph = 0.05d0 if ( present ( alpha )) alph = alpha ! Input Check if ( order < 1 ) then call errmgr % report_error ( \"linear_least_squares\" , & \"The model order must be at least one.\" , FS_INVALID_INPUT_ERROR ) return end if if ( size ( y ) /= npts ) then call report_array_size_error ( errmgr , \"linear_least_squares\" , & \"y\" , npts , size ( y )) return end if if ( size ( coeffs ) /= ncoeffs ) then call report_array_size_error ( errmgr , \"linear_least_squares\" , & \"coeffs\" , ncoeffs , size ( coeffs )) return end if if ( size ( ymod ) /= npts ) then call report_array_size_error ( errmgr , \"linear_least_squares\" , & \"ymod\" , npts , size ( ymod )) return end if if ( size ( resid ) /= npts ) then call report_array_size_error ( errmgr , \"linear_least_squares\" , & \"resid\" , npts , size ( resid )) return end if if ( present ( stats )) then if ( size ( stats ) /= ncols ) then call report_array_size_error ( errmgr , & \"linear_least_squares\" , \"stats\" , ncols , size ( stats )) return end if end if ! Memory Allocation allocate ( a ( npts , ncols ), stat = flag ) if ( flag == 0 ) allocate ( c ( ncols , ncols ), stat = flag ) if ( flag == 0 ) allocate ( cxt ( ncols , npts ), stat = flag ) if ( flag /= 0 ) then call report_memory_error ( errmgr , \"linear_least_squares\" , flag ) return end if ! Compute the coefficient matrix call design_matrix ( order , intercept , x , a , errmgr ) if ( errmgr % has_error_occurred ()) return ! Compute the covariance matrix call covariance_matrix ( a , c , errmgr ) if ( errmgr % has_error_occurred ()) return ! Compute the coefficients (NCOLS-by-1) call DGEMM ( \"N\" , \"T\" , ncols , npts , ncols , one , c , ncols , a , npts , zero , & cxt , ncols ) ! C * X**T i = 2 coeffs ( 1 ) = zero if ( intercept ) i = 1 call DGEMM ( \"N\" , \"N\" , ncols , 1 , npts , one , cxt , ncols , y , npts , zero , & coeffs ( i :), ncols ) ! (C * X**T) * Y ! Evaluate the model and compute the residuals call DGEMM ( \"N\" , \"N\" , npts , 1 , ncols , one , a , npts , coeffs ( i :), & ncols , zero , ymod , npts ) resid = ymod - y ! If the user doesn't want the statistics calculations we can stop now if (. not . present ( stats )) return ! Start the process of computing statistics stats = calculate_regression_statistics ( resid , coeffs ( i :), c , alph , & errmgr ) end subroutine ! ------------------------------------------------------------------------------ function calculate_regression_statistics ( resid , params , c , alpha , err ) & result ( rst ) !! Computes statistics for the quality of fit for a regression !! model. real ( real64 ), intent ( in ) :: resid (:) !! An M-element array containing the model residual errors. real ( real64 ), intent ( in ) :: params (:) !! An N-element array containing the model parameters. real ( real64 ), intent ( in ) :: c (:,:) !! The N-by-N covariance matrix. real ( real64 ), intent ( in ), optional :: alpha !! The significance level at which to evaluate the confidence !! intervals.  The default value is 0.05 such that a 95% !! confidence interval is calculated. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings to the !! caller.  Possible warning and error codes are as follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_ARRAY_SIZE_ERROR: Occurs if c is not sized correctly. !! - FS_INVALID_INPUT_ERROR: Occurs if order is less than 1. !! - FS_MEMORY_ERROR: Occurs if there is a memory allocation !!      error. type ( regression_statistics ), allocatable :: rst (:) !! A regression_statistics object containing the analysis results. ! Parameters real ( real64 ), parameter :: p05 = 0.05d0 real ( real64 ), parameter :: half = 0.5d0 real ( real64 ), parameter :: one = 1.0d0 ! Local Variables integer ( int32 ) :: i , m , n , dof , flag real ( real64 ) :: a , ssr , var , talpha type ( t_distribution ) :: dist class ( errors ), pointer :: errmgr type ( errors ), target :: deferr ! Initialization if ( present ( err )) then errmgr => err else errmgr => deferr end if ! Initialization m = size ( resid ) n = size ( params ) dof = m - n if ( present ( alpha )) then a = alpha else a = p05 end if allocate ( rst ( n ), stat = flag ) if ( flag /= 0 ) then end if ! Input Checking if ( size ( c , 1 ) /= n . or . size ( c , 2 ) /= n ) then end if ! Process ssr = norm2 ( resid ) ** 2 ! sum of the squares of the residual var = ssr / dof dist % dof = real ( dof , real64 ) talpha = confidence_interval ( dist , a , one , 1 ) do i = 1 , n rst ( i )% standard_error = sqrt ( var * c ( i , i )) rst ( i )% t_statistic = params ( i ) / rst ( i )% standard_error rst ( i )% probability = regularized_beta ( & half * dof , & half , & real ( dof , real64 ) / ( dof + ( rst ( i )% t_statistic ) ** 2 ) & ) rst ( i )% confidence_interval = talpha * rst ( i )% standard_error end do end function ! ------------------------------------------------------------------------------ subroutine jacobian ( fun , xdata , params , & jac , stop , f0 , f1 , step , err ) !! Computes the Jacobian matrix for a nonlinear regression problem. procedure ( regression_function ), intent ( in ), pointer :: fun !! A pointer to the regression_function to evaluate. real ( real64 ), intent ( in ) :: xdata (:) !! The M-element array containing x-coordinate data. real ( real64 ), intent ( in ) :: params (:) !! The N-element array containing the model parameters. real ( real64 ), intent ( out ) :: jac (:,:) !! The M-by-N matrix where the Jacobian will be written. logical , intent ( out ) :: stop !! A value that the user can set in fun forcing the !! evaluation process to stop prior to completion. real ( real64 ), intent ( in ), optional , target :: f0 (:) !! An optional M-element array containing the model values !!  using the current parameters as defined in m.  This input !! can be used to prevent the routine from performing a !! function evaluation at the model parameter state defined in !! params. real ( real64 ), intent ( out ), optional , target :: f1 (:) !! An optional M-element workspace array used for function !! evaluations. real ( real64 ), intent ( in ), optional :: step !! The differentiation step size.  The default is the square !! root of machine precision. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings to the !! caller.  Possible warning and error codes are as follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not !!      properly sized. !! - FS_MEMORY_ERROR: Occurs if there is a memory allocation !!      error. ! Local Variables real ( real64 ) :: h integer ( int32 ) :: m , n , flag , expected , actual real ( real64 ), pointer :: f1p (:), f0p (:) real ( real64 ), allocatable , target :: f1a (:), f0a (:), work (:) class ( errors ), pointer :: errmgr type ( errors ), target :: deferr ! Initialization if ( present ( err )) then errmgr => err else errmgr => deferr end if if ( present ( step )) then h = step else h = sqrt ( epsilon ( h )) end if m = size ( xdata ) n = size ( params ) ! Input Size Checking if ( size ( jac , 1 ) /= m . or . size ( jac , 2 ) /= n ) then call report_matrix_size_error ( errmgr , \"jacobian\" , & \"JAC\" , m , n , size ( jac , 1 ), size ( jac , 2 )) return end if if ( present ( f0 )) then ! Check Size if ( size ( f0 ) /= m ) then call report_array_size_error ( errmgr , \"jacobian\" , & \"F0\" , m , size ( f0 )) return end if f0p ( 1 : m ) => f0 else ! Allocate space, and fill the array with the current function ! results allocate ( f0a ( m ), stat = flag ) if ( flag /= 0 ) go to 20 f0p ( 1 : m ) => f0a call fun ( xdata , params , f0p , stop ) if ( stop ) return end if if ( present ( f1 )) then ! Check Size if ( size ( f1 ) /= m ) then call report_array_size_error ( errmgr , \"jacobian\" , & \"F1\" , m , size ( f1 )) return end if f1p ( 1 : m ) => f1 else ! Allocate space allocate ( f1a ( m ), stat = flag ) if ( flag /= 0 ) go to 20 f1p ( 1 : m ) => f1a end if ! Allocate a workspace array the same size as params allocate ( work ( n ), stat = flag ) if ( flag /= 0 ) go to 20 ! Compute the Jacobian call jacobian_finite_diff ( fun , xdata , params , f0p , jac , f1p , & stop , h , work ) ! End return ! Memroy Allocation Error Handling 20 continue call report_memory_error ( errmgr , \"jacobian\" , flag ) return end subroutine ! ------------------------------------------------------------------------------ subroutine nonlinear_least_squares ( fun , x , y , params , ymod , & resid , weights , maxp , minp , stats , alpha , controls , settings , info , & status , err ) !! Performs a nonlinear regression to fit a model using a version !! of the Levenberg-Marquardt algorithm. procedure ( regression_function ), intent ( in ), pointer :: fun !! A pointer to the regression_function to evaluate. real ( real64 ), intent ( in ) :: x (:) !! The M-element array containing independent data. real ( real64 ), intent ( in ) :: y (:) !! The M-element array containing dependent data. real ( real64 ), intent ( inout ) :: params (:) !! On input, the N-element array containing the initial estimate !! of the model parameters.  On output, the computed model !! parameters. real ( real64 ), intent ( out ) :: ymod (:) !! An M-element array where the modeled dependent data will !! be written. real ( real64 ), intent ( out ) :: resid (:) !! An M-element array where the model residuals will be !! written. real ( real64 ), intent ( in ), optional , target :: weights (:) !! An optional M-element array allowing the weighting of !! individual points. real ( real64 ), intent ( in ), optional , target :: maxp (:) !! An optional N-element array that can be used as upper limits !! on the parameter values.  If no upper limit is requested for !! a particular parameter, utilize a very large value.  The !! internal default is to utilize huge() as a value. real ( real64 ), intent ( in ), optional , target :: minp (:) !! An optional N-element array that can be used as lower limits !! on the parameter values.  If no lower limit is requested for !! a particalar parameter, utilize a very large magnitude, but !! negative, value.  The internal default is to utilize -huge() !! as a value. type ( regression_statistics ), intent ( out ), optional :: stats (:) !! An optional N-element array that, if supplied, will be used !! to return statistics about the fit for each parameter. real ( real64 ), intent ( in ), optional :: alpha !! The significance level at which to evaluate the confidence !! intervals.  The default value is 0.05 such that a 95% !! confidence interval is calculated. type ( iteration_controls ), intent ( in ), optional :: controls !! An optional input providing custom iteration controls. type ( lm_solver_options ), intent ( in ), optional :: settings !! An optional input providing custom settings for the solver. type ( convergence_info ), intent ( out ), optional , target :: info !! An optional output that can be used to gain information about !! the iterative solution and the nature of the convergence. procedure ( iteration_update ), intent ( in ), pointer , optional :: status !! An optional pointer to a routine that can be used to extract !! iteration information. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings to the !! caller.  Possible warning and error codes are as follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_ARRAY_SIZE_ERROR: Occurs if any of the arrays are not !!      properly sized. !! - FS_MEMORY_ERROR: Occurs if there is a memory allocation !!      error. !! - FS_UNDERDEFINED_PROBLEM_ERROR: Occurs if the problem posed !!      is underdetetermined (M < N). !! - FS_TOLERANCE_TOO_SMALL_ERROR: Occurs if any supplied !!      tolerances are too small to be practical. !! - FS_TOO_FEW_ITERATION_ERROR: Occurs if too few iterations !!      are allowed. ! Parameters real ( real64 ), parameter :: too_small = 1.0d-14 integer ( int32 ), parameter :: min_iter_count = 2 integer ( int32 ), parameter :: min_fun_count = 10 integer ( int32 ), parameter :: min_update_count = 1 ! Local Variables logical :: stop integer ( int32 ) :: m , n , actual , expected , flag real ( real64 ), pointer :: w (:), pmax (:), pmin (:) real ( real64 ), allocatable , target :: defaultWeights (:), maxparam (:), & minparam (:), JtWJ (:,:) type ( iteration_controls ) :: tol type ( lm_solver_options ) :: opt type ( convergence_info ) :: cInfo class ( errors ), pointer :: errmgr type ( errors ), target :: deferr type ( convergence_info ), target :: defaultinfo type ( convergence_info ), pointer :: inf ! Initialization stop = . false . m = size ( x ) n = size ( params ) if ( present ( info )) then inf => info else inf => defaultinfo end if if ( present ( err )) then errmgr => err else errmgr => deferr end if if ( present ( controls )) then tol = controls else call tol % set_to_default () end if if ( present ( settings )) then opt = settings else call opt % set_to_default () end if ! Input Checking if ( size ( y ) /= m ) then call report_array_size_error ( errmgr , \"nonlinear_least_squares\" , & \"y\" , m , size ( y )) return end if if ( size ( ymod ) /= m ) then call report_array_size_error ( errmgr , \"nonlinear_least_squares\" , & \"ymod\" , m , size ( ymod )) return end if if ( size ( resid ) /= m ) then call report_array_size_error ( errmgr , \"nonlinear_least_squares\" , & \"resid\" , m , size ( resid )) return end if if ( m < n ) then call report_underdefined_error ( errmgr , & \"nonlinear_least_squares\" , n , m ) return end if ! Tolerance Checking if ( tol % gradient_tolerance < too_small ) then call errmgr % report_error ( \"nonlinear_least_squares\" , & \"The gradient tolerance was found to be too small.\" , & FS_TOLERANCE_TOO_SMALL_ERROR ) return end if if ( tol % change_in_solution_tolerance < too_small ) then call errmgr % report_error ( \"nonlinear_least_squares\" , & \"The change in solution tolerance was found to be too small.\" , & FS_TOLERANCE_TOO_SMALL_ERROR ) return end if if ( tol % residual_tolerance < too_small ) then call errmgr % report_error ( \"nonlinear_least_squares\" , & \"The residual error tolerance was found to be too small.\" , & FS_TOLERANCE_TOO_SMALL_ERROR ) return end if if ( tol % iteration_improvement_tolerance < too_small ) then call errmgr % report_error ( \"nonlinear_least_squares\" , & \"The iteration improvement tolerance was found to be too small.\" , & FS_TOLERANCE_TOO_SMALL_ERROR ) return end if ! Iteration Count Checking if ( tol % max_iteration_count < min_iter_count ) then call report_iteration_count_error ( errmgr , & \"nonlinear_least_squares\" , & \"Too few iterations were specified.\" , & min_iter_count ) return end if if ( tol % max_function_evaluations < min_fun_count ) then call report_iteration_count_error ( errmgr , & \"nonlinear_least_squares\" , & \"Too few function evaluations were specified.\" , & min_fun_count ) return end if if ( tol % max_iteration_between_updates < min_update_count ) then call report_iteration_count_error ( errmgr , & \"nonlinear_least_squares\" , & \"Too few iterations between updates were specified.\" , & min_update_count ) return end if ! Optional Array Arguments (weights, parameter limits, etc.) if ( present ( weights )) then if ( size ( weights ) < m ) then call report_array_size_error ( errmgr , & \"nonlinear_least_squares\" , \"weights\" , m , size ( weights )) return end if w ( 1 : m ) => weights ( 1 : m ) else allocate ( defaultWeights ( m ), source = 1.0d0 , stat = flag ) if ( flag /= 0 ) go to 50 w ( 1 : m ) => defaultWeights ( 1 : m ) end if if ( present ( maxp )) then if ( size ( maxp ) /= n ) then call report_array_size_error ( errmgr , & \"nonlinear_least_squares\" , \"maxp\" , n , size ( maxp )) return end if pmax ( 1 : n ) => maxp ( 1 : n ) else allocate ( maxparam ( n ), source = huge ( 1.0d0 ), stat = flag ) if ( flag /= 0 ) go to 50 pmax ( 1 : n ) => maxparam ( 1 : n ) end if if ( present ( minp )) then if ( size ( minp ) /= n ) then call report_array_size_error ( errmgr , & \"nonlinear_least_squares\" , \"minp\" , n , size ( minp )) return end if pmin ( 1 : n ) => minp ( 1 : n ) else allocate ( minparam ( n ), source = - huge ( 1.0d0 ), stat = flag ) if ( flag /= 0 ) go to 50 pmin ( 1 : n ) => minparam ( 1 : n ) end if ! Local Memory Allocations allocate ( JtWJ ( n , n ), stat = flag ) if ( flag /= 0 ) go to 50 ! Process call lm_solve ( fun , x , y , params , w , pmax , pmin , tol , opt , ymod , & resid , JtWJ , inf , stop , errmgr , status ) ! Statistical Parameters if ( present ( stats )) then if ( size ( stats ) /= n ) then call report_array_size_error ( errmgr , & \"nonlinear_least_squares\" , \"stats\" , n , size ( stats )) return end if ! Compute the covariance matrix call mtx_inverse ( JtWJ , err = errmgr ) if ( errmgr % has_error_occurred ()) return ! Compute the statistics stats = calculate_regression_statistics ( resid , params , JtWJ , & alpha , errmgr ) end if ! End return ! Memory Error Handler 50 continue call report_memory_error ( errmgr , \"nonlinear_least_squares\" , flag ) return end subroutine ! ****************************************************************************** ! SETTINGS DEFAULTS ! ------------------------------------------------------------------------------ ! Sets up default tolerances. subroutine lm_set_default_tolerances ( x ) ! Arguments class ( iteration_controls ), intent ( inout ) :: x ! Set defaults x % max_iteration_count = 500 x % max_function_evaluations = 5000 x % max_iteration_between_updates = 10 x % gradient_tolerance = 1.0d-8 x % residual_tolerance = 0.5d-2 x % change_in_solution_tolerance = 1.0d-6 x % iteration_improvement_tolerance = 1.0d-1 end subroutine ! ------------------------------------------------------------------------------ ! Sets up default solver settings. subroutine lm_set_default_settings ( x ) ! Arguments class ( lm_solver_options ), intent ( inout ) :: x ! Set defaults x % method = FS_LEVENBERG_MARQUARDT_UPDATE x % finite_difference_step_size = sqrt ( epsilon ( 1.0d0 )) x % damping_increase_factor = 1 1.0d0 x % damping_decrease_factor = 9.0d0 end subroutine ! ****************************************************************************** ! PRIVATE ROUTINES ! ------------------------------------------------------------------------------ ! Computes the Jacobian matrix via a forward difference. ! ! Inputs: ! - fun: The function to evaluate ! - xdata: The independent coordinate data to fit (M-by-1) ! - params: The model parameters (N-by-1) ! - f0: The current model estimate (M-by-1) ! - step: The differentiation step size ! ! Outputs: ! - jac: The Jacobian matrix (M-by-N) ! - f1: A workspace array for the model output (M-by-1) ! - stop: A flag allowing the user to terminate model execution ! - work: A workspace array for the model parameters (N-by-1) subroutine jacobian_finite_diff ( fun , xdata , params , f0 , jac , f1 , & stop , step , work ) ! Arguments procedure ( regression_function ), intent ( in ), pointer :: fun real ( real64 ), intent ( in ) :: xdata (:), params (:) real ( real64 ), intent ( in ) :: f0 (:) real ( real64 ), intent ( out ) :: jac (:,:) real ( real64 ), intent ( out ) :: f1 (:), work (:) logical , intent ( out ) :: stop real ( real64 ), intent ( in ) :: step ! Local Variables integer ( int32 ) :: i , n ! Initialization n = size ( params ) ! Cycle over each column of the Jacobian and calculate the derivative ! via a forward difference scheme ! ! J(i,j) = df(i) / dx(j) work = params do i = 1 , n work ( i ) = work ( i ) + step call fun ( xdata , work , f1 , stop ) if ( stop ) return jac (:, i ) = ( f1 - f0 ) / step work ( i ) = params ( i ) end do end subroutine ! ------------------------------------------------------------------------------ ! Computes a rank-1 update to the Jacobian matrix ! ! Inputs: ! - pOld: previous set of parameters (N-by-1) ! - yOld: model evaluation at previous set of parameters (M-by-1) ! - jac: current Jacobian estimate (M-by-N) ! - p: current set of parameters (N-by-1) ! - y: model evaluation at current set of parameters (M-by-1) ! ! Outputs: ! - jac: updated Jacobian matrix (M-by-N) (dy * dp**T + J) ! - dp: p - pOld (N-by-1) ! - dy: (y - yOld - J * dp) / (dp' * dp) (M-by-1) subroutine broyden_update ( pOld , yOld , jac , p , y , dp , dy ) ! Arguments real ( real64 ), intent ( in ) :: pOld (:), yOld (:), p (:), y (:) real ( real64 ), intent ( inout ) :: jac (:,:) real ( real64 ), intent ( out ) :: dp (:), dy (:) ! Local Variables real ( real64 ) :: h2 ! Process dp = p - pOld h2 = dot_product ( dp , dp ) dy = y - yOld - matmul ( jac , dp ) dy = dy / h2 call rank1_update ( 1.0d0 , dy , dp , jac ) end subroutine ! ------------------------------------------------------------------------------ ! Updates the Levenberg-Marquardt matrix by either computing a new Jacobian ! matrix or performing a rank-1 update to the existing Jacobian matrix. ! ! Inputs: ! - fun: The function to evaluate ! - xdata: The independent coordinate data to fit (M-by-1) ! - ydata: The dependent coordinate data to fit (M-by-1) ! - pOld: previous set of parameters (N-by-1) ! - yOld: model evaluation at previous set of parameters (M-by-1) ! - dX2: The previous change in the Chi-squared criteria ! - jac: current Jacobian estimate (M-by-N) ! - p: current set of parameters (N-by-1) ! - weights: A weighting vector (M-by-1) ! - neval: Current number of function evaluations ! - update: Set to true to force an update of the Jacobian; else, set to !       false to let the program choose based upon the change in the !       Chi-squared parameter. ! - step: The differentiation step size ! ! Outputs: ! - JtWJ: linearized Hessian matrix (inverse of the covariance matrix) (N-by-N) ! - JtWdy: linearized fitting vector (N-by-1) ! - X2: Updated Chi-squared criteria ! - yNew: model evaluated with parameters of p (M-by-1) ! - jac: updated Jacobian matrix (M-by-N) ! - neval: updated count of function evaluations ! - stop: A flag allowing the user to terminate model execution ! - work: A workspace array (N+M-by-1) ! - mwork: A workspace matrix (N-by-M) ! - update: Reset to false if a Jacobian evaluation was performed. subroutine lm_matrix ( fun , xdata , ydata , pOld , yOld , dX2 , jac , p , weights , & neval , update , step , JtWJ , JtWdy , X2 , yNew , stop , work , mwork ) ! Arguments procedure ( regression_function ), pointer :: fun real ( real64 ), intent ( in ) :: xdata (:), ydata (:), pOld (:), yOld (:), & p (:), weights (:) real ( real64 ), intent ( in ) :: dX2 , step real ( real64 ), intent ( inout ) :: jac (:,:) integer ( int32 ), intent ( inout ) :: neval logical , intent ( inout ) :: update real ( real64 ), intent ( out ) :: JtWJ (:,:), JtWdy (:) real ( real64 ), intent ( out ) :: X2 , mwork (:,:), yNew (:) logical , intent ( out ) :: stop real ( real64 ), intent ( out ), target :: work (:) ! Local Variables integer ( int32 ) :: m , n real ( real64 ), pointer :: w1 (:), w2 (:) ! Initialization m = size ( xdata ) n = size ( p ) w1 ( 1 : m ) => work ( 1 : m ) w2 ( 1 : n ) => work ( m + 1 : n + m ) ! Perform the next function evaluation call fun ( xdata , p , yNew , stop ) neval = neval + 1 if ( stop ) return ! Update or recompute the Jacobian matrix if ( dX2 > 0 . or . update ) then ! Recompute the Jacobian call jacobian_finite_diff ( fun , xdata , p , yNew , jac , w1 , & stop , step , w2 ) neval = neval + n if ( stop ) return update = . false . else ! Simply perform a rank-1 update to the Jacobian call broyden_update ( pOld , yOld , jac , p , yNew , w2 , w1 ) end if ! Update the Chi-squared estimate w1 = ydata - yNew X2 = dot_product ( w1 , w1 * weights ) ! Compute J**T * (W .* dY) w1 = w1 * weights call mtx_mult (. true ., 1.0d0 , jac , w1 , 0.0d0 , JtWdy ) ! Update the Hessian ! First: J**T * W = MWORK ! Second: (J**T * W) * J call diag_mtx_mult (. false ., . true ., 1.0d0 , weights , jac , 0.0d0 , mwork ) call mtx_mult (. false ., . false ., 1.0d0 , mwork , jac , 0.0d0 , JtWJ ) end subroutine ! ------------------------------------------------------------------------------ ! Performs a single iteration of the Levenberg-Marquardt algorithm. ! ! Inputs: ! - fun: The function to evaluate ! - xdata: The independent coordinate data to fit (M-by-1) ! - ydata: The dependent coordinate data to fit (M-by-1) ! - p: current set of parameters (N-by-1) ! - neval: current number of function evaluations ! - niter: current iteration number ! - update: set to 1 to use Marquardt's modification; else, ! - step: the differentiation step size ! - lambda: LM damping parameter ! - maxP: maximum limits on the parameters.  Use huge() or larger for no constraints (N-by-1) ! - minP: minimum limits on the parameters.  Use -huge() or smaller for no constraints (N-by-1) ! - weights: a weighting vector (M-by-1) ! - JtWJ: linearized Hessian matrix (inverse of the covariance matrix) (N-by-N) ! - JtWdy: linearized fitting vector (N-by-1) ! ! Outputs: ! - JtWJ: overwritten LU factorization of the original matrix (N-by-N) ! - h: The new estimate of the change in parameter (N-by-1) ! - pNew: The new parameter estimates (N-by-1) ! - deltaY: The new difference between data and model (M-by-1) ! - yNew: model evaluated with parameters of pNew (M-by-1) ! - neval: updated count of function evaluations ! - niter: updated current iteration number ! - X2: updated Chi-squared criteria ! - stop: A flag allowing the user to terminate model execution ! - iwork: A workspace array (N-by-1) ! - err: An error handling mechanism subroutine lm_iter ( fun , xdata , ydata , p , neval , niter , update , lambda , & maxP , minP , weights , JtWJ , JtWdy , h , pNew , deltaY , yNew , X2 , X2Old , & alpha , stop , iwork , err , status ) ! Arguments procedure ( regression_function ), pointer :: fun real ( real64 ), intent ( in ) :: xdata (:), ydata (:), p (:), maxP (:), & minP (:), weights (:), JtWdy (:) real ( real64 ), intent ( in ) :: lambda , X2Old integer ( int32 ), intent ( inout ) :: neval , niter integer ( int32 ), intent ( in ) :: update real ( real64 ), intent ( inout ) :: JtWJ (:,:) real ( real64 ), intent ( out ) :: h (:), pNew (:), deltaY (:), yNew (:) real ( real64 ), intent ( out ) :: X2 , alpha logical , intent ( out ) :: stop integer ( int32 ), intent ( out ) :: iwork (:) class ( errors ), intent ( inout ) :: err procedure ( iteration_update ), intent ( in ), pointer , optional :: status ! Local Variables integer ( int32 ) :: i , n real ( real64 ) :: dpJh ! Initialization n = size ( p ) ! Increment the iteration counter niter = niter + 1 ! Solve the linear system to determine the change in parameters ! A is N-by-N and is stored in JtWJ ! b is N-by-1 if ( update == FS_LEVENBERG_MARQUARDT_UPDATE ) then ! Compute: h = A \\ b ! A = J**T * W * J + lambda * diag(J**T * W * J) ! b = J**T * W * dy do i = 1 , n JtWJ ( i , i ) = JtWJ ( i , i ) * ( 1.0d0 + lambda ) h ( i ) = JtWdy ( i ) end do else ! Compute: h = A \\ b ! A = J**T * W * J + lambda * I ! b = J**T * W * dy do i = 1 , n JtWJ ( i , i ) = JtWJ ( i , i ) + lambda h ( i ) = JtWdy ( i ) end do end if call lu_factor ( JtWJ , iwork , err ) ! overwrites JtWJ with [L\\U] if ( err % has_error_occurred ()) return ! if JtWJ is singular call solve_lu ( JtWJ , iwork , h ) ! solution stored in h ! Compute the new attempted solution, and apply any constraints do i = 1 , n pNew ( i ) = min ( max ( minP ( i ), h ( i ) + p ( i )), maxP ( i )) end do ! Update the residual error call fun ( xdata , pNew , yNew , stop ) neval = neval + 1 deltaY = ydata - yNew if ( stop ) return ! Update the Chi-squared estimate X2 = dot_product ( deltaY , deltaY * weights ) ! Perform a quadratic line update in the H direction, if necessary if ( update == FS_QUADRATIC_UPDATE ) then dpJh = dot_product ( JtWdy , h ) alpha = abs ( dpJh / ( 0.5d0 * ( X2 - X2Old ) + 2.0d0 * dpJh )) h = alpha * h do i = 1 , n pNew ( i ) = min ( max ( minP ( i ), p ( i ) + h ( i )), maxP ( i )) end do call fun ( xdata , pNew , yNew , stop ) if ( stop ) return neval = neval + 1 deltaY = ydata - yNew X2 = dot_product ( deltaY , deltaY * weights ) end if ! Update the status of the iteration, if needed if ( present ( status )) then call status ( niter , yNew , deltaY , pNew , h ) end if end subroutine ! ------------------------------------------------------------------------------ ! A Levenberg-Marquardt solver. ! ! Inputs: ! - fun: The function to evaluate ! - xdata: The independent coordinate data to fit (M-by-1) ! - ydata: The dependent coordinate data to fit (M-by-1) ! - p: current set of parameters (N-by-1) ! - weights: a weighting vector (M-by-1) ! - maxP: maximum limits on the parameters.  Use huge() or larger for no constraints (N-by-1) ! - minP: minimum limits on the parameters.  Use -huge() or smaller for no constraints (N-by-1) ! - controls: an iteration_controls instance containing solution tolerances ! ! Outputs: ! - p: solution (N-by-1) ! - y: model results at p (M-by-1) ! - resid: residual (ydata - y) (M-by-1) ! - JtWJ: linearized Hessian matrix (inverse of the covariance matrix) (N-by-N) ! - opt: a convergence_info object containing information regarding !       convergence of the iteration ! - stop: A flag allowing the user to terminate model execution ! - err: An error handling object subroutine lm_solve ( fun , xdata , ydata , p , weights , maxP , minP , controls , & opt , y , resid , JtWJ , info , stop , err , status ) ! Arguments procedure ( regression_function ), intent ( in ), pointer :: fun real ( real64 ), intent ( in ) :: xdata (:), ydata (:), weights (:), maxP (:), & minP (:) real ( real64 ), intent ( inout ) :: p (:) class ( iteration_controls ), intent ( in ) :: controls class ( lm_solver_options ), intent ( in ) :: opt real ( real64 ), intent ( out ) :: y (:), resid (:), JtWJ (:,:) class ( convergence_info ), intent ( out ) :: info logical , intent ( out ) :: stop class ( errors ), intent ( inout ) :: err procedure ( iteration_update ), intent ( in ), pointer , optional :: status ! Local Variables logical :: update integer ( int32 ) :: i , m , n , dof , flag , neval , niter , nupdate real ( real64 ) :: dX2 , X2 , X2Old , X2Try , lambda , alpha , nu , step real ( real64 ), allocatable :: pOld (:), yOld (:), J (:,:), JtWdy (:), & work (:), mwork (:,:), pTry (:), yTemp (:), JtWJc (:,:), h (:) integer ( int32 ), allocatable :: iwork (:) character ( len = :), allocatable :: errmsg ! Initialization update = . true . m = size ( xdata ) n = size ( p ) dof = m - n niter = 0 step = opt % finite_difference_step_size stop = . false . info % user_requested_stop = . false . nupdate = 0 ! Local Memory Allocation allocate ( pOld ( n ), source = 0.0d0 , stat = flag ) if ( flag == 0 ) allocate ( yOld ( m ), source = 0.0d0 , stat = flag ) if ( flag == 0 ) allocate ( J ( m , n ), stat = flag ) if ( flag == 0 ) allocate ( JtWdy ( n ), stat = flag ) if ( flag == 0 ) allocate ( work ( m + n ), stat = flag ) if ( flag == 0 ) allocate ( mwork ( n , m ), stat = flag ) if ( flag == 0 ) allocate ( pTry ( n ), stat = flag ) if ( flag == 0 ) allocate ( h ( n ), stat = flag ) if ( flag == 0 ) allocate ( yTemp ( m ), stat = flag ) if ( flag == 0 ) allocate ( JtWJc ( n , n ), stat = flag ) if ( flag == 0 ) allocate ( iwork ( n ), stat = flag ) if ( flag /= 0 ) go to 10 ! Perform an initial function evaluation call fun ( xdata , p , y , stop ) neval = 1 ! Evaluate the problem matrices call lm_matrix ( fun , xdata , ydata , pOld , yOld , 1.0d0 , J , p , weights , & neval , update , step , JtWJ , JtWdy , X2 , y , stop , work , mwork ) if ( stop ) go to 5 X2Old = X2 JtWJc = JtWJ ! Determine an initial value for lambda if ( opt % method == FS_LEVENBERG_MARQUARDT_UPDATE ) then lambda = 1.0d-2 else call extract_diagonal ( JtWJ , work ( 1 : n )) lambda = 1.0d-2 * maxval ( work ( 1 : n )) nu = 2.0d0 end if ! Main Loop main : do while ( niter < controls % max_iteration_count ) ! Compute the linear solution at the current solution estimate and ! update the new parameter estimates call lm_iter ( fun , xdata , ydata , p , neval , niter , opt % method , & lambda , maxP , minP , weights , JtWJc , JtWdy , h , pTry , resid , & yTemp , X2Try , X2Old , alpha , stop , iwork , err , status ) if ( stop ) go to 5 if ( err % has_error_occurred ()) return ! Update the Chi-squared estimate, update the damping parameter ! lambda, and, if necessary, update the matrices call lm_update ( fun , xdata , ydata , pOld , p , pTry , yOld , y , h , dX2 , & X2Old , X2 , X2Try , lambda , alpha , nu , JtWdy , JtWJ , J , weights , & niter , neval , update , step , work , mwork , controls , opt , stop ) if ( stop ) go to 5 JtWJc = JtWJ ! Determine the matrix update scheme nupdate = nupdate + 1 if ( opt % method == FS_QUADRATIC_UPDATE ) then update = mod ( niter , 2 * n ) > 0 else if ( nupdate >= controls % max_iteration_between_updates ) then update = . true . nupdate = 0 end if ! Test for convergence if ( lm_check_convergence ( controls , dof , resid , niter , neval , & JtWdy , h , p , X2 , info )) & then exit main end if end do main ! End return ! User Requested End 5 continue info % user_requested_stop = . true . return ! Memory Error Handling 10 continue allocate ( character ( len = 512 ) :: errmsg ) write ( errmsg , 100 ) \"Memory allocation error code \" , flag , \".\" call err % report_error ( \"lm_solve\" , & trim ( errmsg ), FS_MEMORY_ERROR ) return ! Formatting 100 format ( A , I0 , A ) end subroutine ! ------------------------------------------------------------------------------ ! subroutine lm_update ( fun , xdata , ydata , pOld , p , pTry , yOld , y , h , dX2 , & X2old , X2 , X2try , lambda , alpha , nu , JtWdy , JtWJ , J , weights , niter , & neval , update , step , work , mwork , controls , opt , stop ) ! Arguments procedure ( regression_function ), intent ( in ), pointer :: fun real ( real64 ), intent ( in ) :: xdata (:), ydata (:), X2try , h (:), step , & pTry (:), weights (:), alpha real ( real64 ), intent ( inout ) :: pOld (:), p (:), yOld (:), y (:), lambda , & JtWdy (:), dX2 , X2 , X2old , JtWJ (:,:), J (:,:), nu real ( real64 ), intent ( out ) :: work (:), mwork (:,:) integer ( int32 ), intent ( in ) :: niter integer ( int32 ), intent ( inout ) :: neval logical , intent ( inout ) :: update class ( iteration_controls ), intent ( in ) :: controls class ( lm_solver_options ), intent ( in ) :: opt logical , intent ( out ) :: stop ! Local Variables integer ( int32 ) :: n real ( real64 ) :: rho ! Initialization n = size ( p ) ! Process if ( opt % method == FS_LEVENBERG_MARQUARDT_UPDATE ) then call extract_diagonal ( JtWJ , work ( 1 : n )) work ( 1 : n ) = lambda * work ( 1 : n ) * h + JtWdy else work ( 1 : n ) = lambda * h + JtWdy end if rho = ( X2 - X2try ) / abs ( dot_product ( h , work ( 1 : n ))) if ( rho > controls % iteration_improvement_tolerance ) then ! Things are getting better at an acceptable rate dX2 = X2 - X2old X2old = X2 pOld = p yOld = y p = pTry ! Recompute the matrices call lm_matrix ( fun , xdata , ydata , pOld , yOld , dX2 , J , p , weights , & neval , update , step , JtWJ , JtWdy , X2 , y , stop , work , mwork ) if ( stop ) return ! Decrease lambda select case ( opt % method ) case ( FS_LEVENBERG_MARQUARDT_UPDATE ) lambda = max ( lambda / opt % damping_decrease_factor , 1.0d-7 ) case ( FS_QUADRATIC_UPDATE ) lambda = max ( lambda / ( 1.0d0 + alpha ), 1.0d-7 ) case ( FS_NIELSEN_UPDATE ) lambda = lambda * max ( 1.0d0 / 3.0d0 , & 1.0d0 - ( 2.0d0 * rho - 1.0d0 ** 3 )) nu = 2.0d0 end select else ! The iteration is not improving in a satisfactory manner X2 = X2old if ( mod ( niter , 2 * n ) /= 0 ) then call lm_matrix ( fun , xdata , ydata , pOld , yOld , - 1.0d0 , J , p , & weights , neval , update , step , JtWJ , JtWdy , dX2 , y , stop , & work , mwork ) if ( stop ) return end if ! Increase lambda select case ( opt % method ) case ( FS_LEVENBERG_MARQUARDT_UPDATE ) lambda = min ( lambda * opt % damping_increase_factor , 1.0d7 ) case ( FS_QUADRATIC_UPDATE ) lambda = lambda + abs (( X2try - X2 ) / 2.0d0 / alpha ) case ( FS_NIELSEN_UPDATE ) lambda = lambda * nu nu = 2.0d0 * nu end select end if end subroutine ! ------------------------------------------------------------------------------ ! Checks the Levenberg-Marquardt solution against the convergence criteria. ! ! Inputs: ! - controls: the solution controls and convergence criteria ! - dof: the statistical degrees of freedom of the system (M - N) ! - resid: the residual error (M-by-1) ! - niter: the number of iterations ! - neval: the number of function evaluations ! - JtWdy: linearized fitting vector (N-by-1) ! - h: the change in parameter (solution) values (N-by-1) ! - p: the parameter (solution) values (N-by-1) ! - X2: the Chi-squared estimate ! ! Outputs: ! - info: The convergence information. ! - rst: True if convergence was achieved; else, false. function lm_check_convergence ( controls , dof , resid , niter , neval , & JtWdy , h , p , X2 , info ) result ( rst ) ! Arguments class ( iteration_controls ), intent ( in ) :: controls real ( real64 ), intent ( in ) :: resid (:), JtWdy (:), h (:), p (:), X2 integer ( int32 ), intent ( in ) :: dof , niter , neval class ( convergence_info ), intent ( out ) :: info logical :: rst ! Initialization rst = . false . ! Iteration Checks info % iteration_count = niter if ( niter >= controls % max_iteration_count ) then info % reach_iteration_limit = . true . rst = . true . else info % reach_iteration_limit = . false . end if info % function_evaluation_count = neval if ( neval >= controls % max_function_evaluations ) then info % reach_function_evaluation_limit = . true . rst = . true . else info % reach_function_evaluation_limit = . false . end if info % gradient_value = maxval ( abs ( JtWdy )) if ( info % gradient_value < controls % gradient_tolerance . and . niter > 2 ) & then info % converge_on_gradient = . true . rst = . true . else info % converge_on_gradient = . false . end if info % solution_change_value = maxval ( abs ( h ) / ( abs ( p ) + 1.0d-12 )) if ( info % solution_change_value < & controls % change_in_solution_tolerance . and . niter > 2 ) & then info % converge_on_solution_change = . true . rst = . true . else info % converge_on_solution_change = . false . end if info % residual_value = X2 / dof if ( info % residual_value < controls % residual_tolerance . and . niter > 2 ) & then info % converge_on_residual_parameter = . true . rst = . true . else info % converge_on_residual_parameter = . false . end if end function ! ------------------------------------------------------------------------------ end module","tags":"","loc":"sourcefile\\fstats_regression.f90.html"},{"title":"fstats_types.f90 – FSTATS","text":"Source Code module fstats_types use iso_fortran_env implicit none type array_container !! Provides a container for a real-valued array.  A practical use of !! this construct is in the construction of jagged arrays. real ( real64 ), allocatable , dimension (:) :: x !! The array. end type end module","tags":"","loc":"sourcefile\\fstats_types.f90.html"},{"title":"fstats_distributions.f90 – FSTATS","text":"Source Code module fstats_distributions use iso_fortran_env use ieee_arithmetic use fstats_special_functions use fstats_helper_routines implicit none private public :: distribution public :: distribution_function public :: distribution_property public :: t_distribution public :: normal_distribution public :: f_distribution public :: chi_squared_distribution public :: binomial_distribution real ( real64 ), parameter :: pi = 2.0d0 * acos ( 0.0d0 ) type , abstract :: distribution !! Defines a probability distribution. contains procedure ( distribution_function ), deferred , pass :: pdf !! Computes the probability density function. procedure ( distribution_function ), deferred , pass :: cdf !! Computes the cumulative distribution function. procedure ( distribution_property ), deferred , pass :: mean !! Computes the mean of the distribution. procedure ( distribution_property ), deferred , pass :: median !! Computes the median of the distribution. procedure ( distribution_property ), deferred , pass :: mode !! Computes the mode of the distribution. procedure ( distribution_property ), deferred , pass :: variance !! Computes the variance of the distribution. end type interface pure elemental function distribution_function ( this , x ) result ( rst ) !! Defines the interface for a probability distribution function. use iso_fortran_env , only : real64 import distribution class ( distribution ), intent ( in ) :: this !! The distribution object. real ( real64 ), intent ( in ) :: x !! The value at which to evaluate the function. real ( real64 ) :: rst !! The value of the function. end function pure function distribution_property ( this ) result ( rst ) !! Computes the value of a distribution property. use iso_fortran_env , only : real64 import distribution class ( distribution ), intent ( in ) :: this !! The distribution object. real ( real64 ) :: rst !! The property value. end function end interface ! ------------------------------------------------------------------------------ type , extends ( distribution ) :: t_distribution !! Defines Student's T-Distribution. real ( real64 ) :: dof !! The number of degrees of freedom. contains procedure , public :: pdf => td_pdf procedure , public :: cdf => td_cdf procedure , public :: mean => td_mean procedure , public :: median => td_median procedure , public :: mode => td_mode procedure , public :: variance => td_variance end type ! ------------------------------------------------------------------------------ type , extends ( distribution ) :: normal_distribution !! Defines a normal distribution. real ( real64 ) :: standard_deviation !! The standard deviation of the distribution. real ( real64 ) :: mean_value !! The mean value of the distribution. contains procedure , public :: pdf => nd_pdf procedure , public :: cdf => nd_cdf procedure , public :: mean => nd_mean procedure , public :: median => nd_median procedure , public :: mode => nd_mode procedure , public :: variance => nd_variance procedure , public :: standardize => nd_standardize end type ! ------------------------------------------------------------------------------ type , extends ( distribution ) :: f_distribution !! Defines an F-distribution. real ( real64 ) :: d1 !! The measure of degrees of freedom for the first data set. real ( real64 ) :: d2 !! The measure of degrees of freedom for the second data set. contains procedure , public :: pdf => fd_pdf procedure , public :: cdf => fd_cdf procedure , public :: mean => fd_mean procedure , public :: median => fd_median procedure , public :: mode => fd_mode procedure , public :: variance => fd_variance end type ! ------------------------------------------------------------------------------ type , extends ( distribution ) :: chi_squared_distribution !! Defines a Chi-squared distribution. integer ( int32 ) :: dof !! The number of degrees of freedom. contains procedure , public :: pdf => cs_pdf procedure , public :: cdf => cs_cdf procedure , public :: mean => cs_mean procedure , public :: median => cs_median procedure , public :: mode => cs_mode procedure , public :: variance => cs_variance end type ! ------------------------------------------------------------------------------ type , extends ( distribution ) :: binomial_distribution !! Defines a binomial distribution.  The binomial distribution describes !! the probability p of getting k successes in n independent trials. integer ( int32 ) :: n !! The number of independent trials. real ( real64 ) :: p !! The success probability for each trial.  This parameter must !! exist on the set [0, 1]. contains procedure , public :: pdf => bd_pdf procedure , public :: cdf => bd_cdf procedure , public :: mean => bd_mean procedure , public :: median => bd_median procedure , public :: mode => bd_mode procedure , public :: variance => bd_variance end type ! ------------------------------------------------------------------------------ contains ! ****************************************************************************** ! STUDENT'S T-DISTRIBUTION ! ------------------------------------------------------------------------------ ! REF: https://en.wikipedia.org/wiki/Student%27s_t-distribution pure elemental function td_pdf ( this , x ) result ( rst ) !! Computes the probability density function. !! !! The PDF for Student's T-Distribution is given as !!  f(t) = \\frac{ \\Gamma \\left( \\frac{\\nu + 1}{2} \\right) } !! { \\sqrt{\\nu \\pi} \\Gamma \\left( \\frac{\\nu}{2} \\right) } !! \\left( 1 + \\frac{t&#94;2}{\\nu} \\right)&#94;{-(\\nu + 1) / 2} . class ( t_distribution ), intent ( in ) :: this !! The t_distribution object. real ( real64 ), intent ( in ) :: x !! The value at which to evaluate the function. real ( real64 ) :: rst !! The value of the function. ! Process rst = gamma (( this % dof + 1.0d0 ) / 2.0d0 ) / & ( sqrt ( this % dof * pi ) * gamma ( this % dof / 2.0d0 )) * & ( 1.0d0 + x ** 2 / this % dof ) ** ( - 0.5d0 * ( 1.0d0 + this % dof )) end function ! ------------------------------------------------------------------------------ pure elemental function td_cdf ( this , x ) result ( rst ) !! Computes the cumulative distribution function. !! !! The CDF for Student's T-Distribution is given as !!  F(t) = \\int_{-\\infty}&#94;{t} f(u) \\,du = 1 - \\frac{1}{2} I_{x(t)} !! \\left( \\frac{\\nu}{2}, \\frac{1}{2} \\right)  !! where  x(t) = \\frac{\\nu}{\\nu + t&#94;2} . class ( t_distribution ), intent ( in ) :: this !! The t_distribution object. real ( real64 ), intent ( in ) :: x !! The value at which to evaluate the function. real ( real64 ) :: rst !! The value of the function. ! Process real ( real64 ) :: t t = this % dof / ( this % dof + x ** 2 ) rst = 1.0d0 - 0.5d0 * regularized_beta ( 0.5d0 * this % dof , 0.5d0 , t ) if ( x < 0 ) rst = 1.0d0 - rst end function ! ------------------------------------------------------------------------------ pure function td_mean ( this ) result ( rst ) !! Computes the mean of the distribution. class ( t_distribution ), intent ( in ) :: this !! The t_distribution object. real ( real64 ) :: rst !! The mean. ! Process if ( this % dof < 1.0d0 ) then rst = ieee_value ( rst , IEEE_QUIET_NAN ) else rst = 0.0d0 end if end function ! ------------------------------------------------------------------------------ pure function td_median ( this ) result ( rst ) !! Computes the median of the distribution. class ( t_distribution ), intent ( in ) :: this !! The t_distribution object. real ( real64 ) :: rst ! Process rst = 0.0d0 end function ! ------------------------------------------------------------------------------ pure function td_mode ( this ) result ( rst ) !! Computes the mode of the distribution. class ( t_distribution ), intent ( in ) :: this !! The t_distribution object. real ( real64 ) :: rst !! The mode. ! Process rst = 0.0d0 end function ! ------------------------------------------------------------------------------ pure function td_variance ( this ) result ( rst ) !! Computes the variance of the distribution. class ( t_distribution ), intent ( in ) :: this !! The t_distribution object. real ( real64 ) :: rst !! The variance. ! Process if ( this % dof <= 1.0d0 ) then rst = ieee_value ( rst , IEEE_QUIET_NAN ) else if ( this % dof > 1.0d0 . and . this % dof <= 2.0d0 ) then rst = ieee_value ( rst , IEEE_POSITIVE_INF ) else rst = this % dof / ( this % dof - 2.0d0 ) end if end function ! ****************************************************************************** ! NORMAL DISTRIBUTION ! ------------------------------------------------------------------------------ pure elemental function nd_pdf ( this , x ) result ( rst ) !! Computes the probability density function. !! !! The PDF for a normal distribution is given as !!  f(x) = \\frac{1}{\\sigma \\sqrt{2 \\pi}} \\exp \\left(-\\frac{1}{2} !! \\left( \\frac{x - \\mu}{\\sigma} \\right)&#94;2 \\right) . class ( normal_distribution ), intent ( in ) :: this !! The normal_distribution object. real ( real64 ), intent ( in ) :: x !! The value at which to evaluate the function. real ( real64 ) :: rst !! The value of the function. rst = exp ( - 0.5d0 * (( x - this % mean_value ) / this % standard_deviation ) ** 2 ) / & ( this % standard_deviation * sqrt ( 2.0d0 * pi )) end function ! ------------------------------------------------------------------------------ pure elemental function nd_cdf ( this , x ) result ( rst ) !! Computes the cumulative distribution function. !! !! The CDF for a normal distribution is given as !!  F(x) = \\frac{1}{2} \\left( 1 + erf \\left( \\frac{x - \\mu} !! {\\sigma \\sqrt{2}} \\right) \\right) . class ( normal_distribution ), intent ( in ) :: this !! The normal_distribution object. real ( real64 ), intent ( in ) :: x !! The value at which to evaluate the function. real ( real64 ) :: rst !! The value of the function. rst = 0.5d0 * ( 1.0d0 + erf (( x - this % mean_value ) / & ( this % standard_deviation * sqrt ( 2.0d0 )))) end function ! ------------------------------------------------------------------------------ pure function nd_mean ( this ) result ( rst ) !! Computes the mean of the distribution. class ( normal_distribution ), intent ( in ) :: this !! The normal_distribution object. real ( real64 ) :: rst !! The mean rst = this % mean_value end function ! ------------------------------------------------------------------------------ pure function nd_median ( this ) result ( rst ) !! Computes the median of the distribution. class ( normal_distribution ), intent ( in ) :: this !! The normal_distribution object. real ( real64 ) :: rst !! The median. rst = this % mean_value end function ! ------------------------------------------------------------------------------ pure function nd_mode ( this ) result ( rst ) !! Computes the mode of the distribution. class ( normal_distribution ), intent ( in ) :: this !! The normal_distribution object. real ( real64 ) :: rst !! The mode. rst = this % mean_value end function ! ------------------------------------------------------------------------------ pure function nd_variance ( this ) result ( rst ) !! Computes the variance of the distribution. class ( normal_distribution ), intent ( in ) :: this !! The normal_distribution object. real ( real64 ) :: rst !! The variance. rst = this % standard_deviation ** 2 end function ! ------------------------------------------------------------------------------ subroutine nd_standardize ( this ) !! Standardizes the normal distribution to a mean of 0 and a !! standard deviation of 1. class ( normal_distribution ), intent ( inout ) :: this !! The normal_distribution object. this % mean_value = 0.0d0 this % standard_deviation = 1.0d0 end subroutine ! ****************************************************************************** ! F DISTRIBUTION ! ------------------------------------------------------------------------------ pure elemental function fd_pdf ( this , x ) result ( rst ) !! Computes the probability density function. !! !! The PDF for a F distribution is given as !!  f(x) = !! \\sqrt{ \\frac{ (d_1 x)&#94;{d_1} d_{2}&#94;{d_2} }{ (d_1 x + d_2)&#94;{d_1 + d_2} } } !! \\frac{1}{x \\beta \\left( \\frac{d_1}{2}, \\frac{d_2}{2} \\right) } . class ( f_distribution ), intent ( in ) :: this !! The f_distribution object. real ( real64 ), intent ( in ) :: x !! The value at which to evaluate the function. real ( real64 ) :: rst !! The value of the function. ! Process real ( real64 ) :: d1 , d2 d1 = this % d1 d2 = this % d2 rst = ( 1.0d0 / beta ( 0.5d0 * d1 , 0.5d0 * d2 )) * ( d1 / d2 ) ** ( 0.5d0 * d1 ) * & x ** ( 0.5d0 * d1 - 1.0d0 ) * ( 1.0d0 + d1 * x / d2 ) ** ( - 0.5d0 * ( d1 + d2 )) end function ! ------------------------------------------------------------------------------ pure elemental function fd_cdf ( this , x ) result ( rst ) !! Computes the cumulative distribution function. !! !! The CDF for a F distribution is given as !!  F(x) = I_{d_1 x/(d_1 x + d_2)} \\left( \\frac{d_1}{2}, !! \\frac{d_2}{2} \\right) . class ( f_distribution ), intent ( in ) :: this !! The f_distribution object. real ( real64 ), intent ( in ) :: x !! The value at which to evaluate the function. real ( real64 ) :: rst !! The value of the function. ! Process real ( real64 ) :: d1 , d2 d1 = this % d1 d2 = this % d2 rst = regularized_beta ( 0.5d0 * d1 , 0.5d0 * d2 , d1 * x / ( d1 * x + d2 )) end function ! ------------------------------------------------------------------------------ pure function fd_mean ( this ) result ( rst ) !! Computes the mean of the distribution. class ( f_distribution ), intent ( in ) :: this !! The f_distribution object. real ( real64 ) :: rst !! The mean. ! Process if ( this % d2 > 2.0d0 ) then rst = this % d2 / ( this % d2 - 2.0d0 ) else rst = ieee_value ( rst , IEEE_QUIET_NAN ) end if end function ! ------------------------------------------------------------------------------ pure function fd_median ( this ) result ( rst ) !! Computes the median of the distribution. class ( f_distribution ), intent ( in ) :: this !! The f_distribution object. real ( real64 ) :: rst !! The median. rst = ieee_value ( rst , IEEE_QUIET_NAN ) end function ! ------------------------------------------------------------------------------ pure function fd_mode ( this ) result ( rst ) !! Computes the mode of the distribution. class ( f_distribution ), intent ( in ) :: this !! The f_distribution object. real ( real64 ) :: rst !! The mode. ! Process if ( this % d1 > 2.0d0 ) then rst = (( this % d1 - 2.0d0 ) / this % d1 ) * ( this % d2 / ( this % d2 + 2.0d0 )) else rst = ieee_value ( rst , IEEE_QUIET_NAN ) end if end function ! ------------------------------------------------------------------------------ pure function fd_variance ( this ) result ( rst ) !! Computes the variance of the distribution. class ( f_distribution ), intent ( in ) :: this !! The f_distribution object. real ( real64 ) :: rst !! The variance. ! Process real ( real64 ) :: d1 , d2 d1 = this % d1 d2 = this % d2 if ( d2 > 4.0d0 ) then rst = ( 2.0d0 * d2 ** 2 * ( d1 + d2 - 2.0d0 )) / & ( d1 * ( d2 - 2.0d0 ) ** 2 * ( d2 - 4.0d0 )) else rst = ieee_value ( rst , IEEE_QUIET_NAN ) end if end function ! ****************************************************************************** ! CHI-SQUARED DISTRIBUTION ! ------------------------------------------------------------------------------ pure elemental function cs_pdf ( this , x ) result ( rst ) !! Computes the probability density function. !! !! The PDF for a Chi-squared distribution is given as !!  f(x) = \\frac{x&#94;{k/2 - 1} \\exp{-x / 2}} {2&#94;{k / 2} !! \\Gamma \\left( \\frac{k}{2} \\right)} . class ( chi_squared_distribution ), intent ( in ) :: this !! The chi_squared_distribution object. real ( real64 ), intent ( in ) :: x !! The value at which to evaluate the function. real ( real64 ) :: rst !! The value of the function. ! Local Variables real ( real64 ) :: arg ! Process arg = 0.5d0 * this % dof rst = 1.0d0 / ( 2.0d0 ** arg * gamma ( arg )) * x ** ( arg - 1.0d0 ) * exp ( - 0.5d0 * x ) end function ! ------------------------------------------------------------------------------ pure elemental function cs_cdf ( this , x ) result ( rst ) !! Computes the cumulative distribution function. !! !! The CDF for a Chi-squared distribution is given as !!  F(x) = \\frac{ \\gamma \\left( \\frac{k}{2}, \\frac{x}{2} \\right) } !! { \\Gamma \\left( \\frac{k}{2} \\right)} . class ( chi_squared_distribution ), intent ( in ) :: this !! The chi_squared_distribution object. real ( real64 ), intent ( in ) :: x !! The value at which to evaluate the function. real ( real64 ) :: rst !! The value of the function. ! Local Variables real ( real64 ) :: arg ! Process arg = 0.5d0 * this % dof rst = incomplete_gamma_lower ( arg , 0.5d0 * x ) / gamma ( arg ) end function ! ------------------------------------------------------------------------------ pure function cs_mean ( this ) result ( rst ) !! Computes the mean of the distribution. class ( chi_squared_distribution ), intent ( in ) :: this !! The chi_squared_distribution object. real ( real64 ) :: rst !! The mean. ! Process rst = real ( this % dof , real64 ) end function ! ------------------------------------------------------------------------------ pure function cs_median ( this ) result ( rst ) !! Computes the median of the distribution. class ( chi_squared_distribution ), intent ( in ) :: this !! The chi_squared_distribution object. real ( real64 ) :: rst !! The median. ! Process rst = this % dof * ( 1.0d0 - 2.0d0 / ( 9.0d0 * this % dof )) ** 3 end function ! ------------------------------------------------------------------------------ pure function cs_mode ( this ) result ( rst ) !! Computes the mode of the distribution. class ( chi_squared_distribution ), intent ( in ) :: this !! The chi_squared_distribution object. real ( real64 ) :: rst !! The mode. ! Process rst = max ( this % dof - 2.0d0 , 0.0d0 ) end function ! ------------------------------------------------------------------------------ pure function cs_variance ( this ) result ( rst ) !! Computes the variance of the distribution. class ( chi_squared_distribution ), intent ( in ) :: this !! The chi_squared_distribution object. real ( real64 ) :: rst !! The variance. ! Process rst = 2.0d0 * this % dof end function ! ****************************************************************************** ! BINOMIAL DISTRIBUTION ! ------------------------------------------------------------------------------ pure elemental function bd_pdf ( this , x ) result ( rst ) !! Computes the probability mass function. !! !! The PMF for a binomial distribution is given as !!  f(k,n,p) = \\frac{n!}{k! \\left( n - k! \\right)} p&#94;k !! \\left( 1 - p \\right)&#94;{n-k} . class ( binomial_distribution ), intent ( in ) :: this !! The binomial_distribution object. real ( real64 ), intent ( in ) :: x !! The value at which to evaluate the function.  This parameter !! is the number k successes in the n independent trials.  As !! such, this parameter must exist on the set [0, n]. real ( real64 ) :: rst !! The value of the function. ! Local Variables real ( real64 ) :: dn ! Process dn = real ( this % n , real64 ) rst = ( factorial ( dn ) / ( factorial ( x ) * factorial ( dn - x ))) * ( this % p ** x ) * ( 1.0d0 - this % p ) ** ( dn - x ) end function ! ------------------------------------------------------------------------------ pure elemental function bd_cdf ( this , x ) result ( rst ) !! Computes the cumulative distribution funtion. !! !! The CDF for a binomial distribution is given as !!  F(k,n,p) = I_{1-p} \\left( n - k, 1 + k \\right) , which is simply !! the regularized incomplete beta function. class ( binomial_distribution ), intent ( in ) :: this !! The binomial_distribution object. real ( real64 ), intent ( in ) :: x !! The value at which to evaluate the function.  This parameter !! is the number k successes in the n independent trials.  As !! such, this parameter must exist on the set [0, n]. real ( real64 ) :: rst !! The value of the function. ! Local Variables real ( real64 ) :: dn ! Process dn = real ( this % n , real64 ) rst = regularized_beta ( dn - x , x + 1.0d0 , 1.0d0 - this % p ) end function ! ------------------------------------------------------------------------------ pure function bd_mean ( this ) result ( rst ) !! Computes the mean of the distribution. class ( binomial_distribution ), intent ( in ) :: this !! The binomial_distribution object. real ( real64 ) :: rst !! The mean. rst = real ( this % n * this % p , real64 ) end function ! ------------------------------------------------------------------------------ pure function bd_median ( this ) result ( rst ) !! Computes the median of the distribution. class ( binomial_distribution ), intent ( in ) :: this !! The binomial_distribution object. real ( real64 ) :: rst !! The median. rst = real ( this % n * this % p , real64 ) end function ! ------------------------------------------------------------------------------ pure function bd_mode ( this ) result ( rst ) !! Computes the mode of the distribution. class ( binomial_distribution ), intent ( in ) :: this !! The binomial_distribution object. real ( real64 ) :: rst !! The mode. rst = ( this % n + 1.0d0 ) * this % p end function ! ------------------------------------------------------------------------------ pure function bd_variance ( this ) result ( rst ) !! Computes the variance of the distribution. class ( binomial_distribution ), intent ( in ) :: this !! The binomial_distribution object. real ( real64 ) :: rst !! The variance. rst = this % n * this % p * ( 1.0d0 - this % p ) end function ! ------------------------------------------------------------------------------ end module","tags":"","loc":"sourcefile\\fstats_distributions.f90.html"},{"title":"fstats_errors.f90 – FSTATS","text":"Source Code ! A module providing a set of routines to handle errors for the FSTATS library. module fstats_errors use ferror use iso_fortran_env , only : int32 implicit none ! ****************************************************************************** ! ERROR CODES ! ------------------------------------------------------------------------------ integer ( int32 ), parameter :: FS_NO_ERROR = 0 integer ( int32 ), parameter :: FS_ARRAY_SIZE_ERROR = 10000 integer ( int32 ), parameter :: FS_MATRIX_SIZE_ERROR = 10001 integer ( int32 ), parameter :: FS_INVALID_INPUT_ERROR = 10002 integer ( int32 ), parameter :: FS_MEMORY_ERROR = 10003 integer ( int32 ), parameter :: FS_UNDERDEFINED_PROBLEM_ERROR = 10004 integer ( int32 ), parameter :: FS_TOLERANCE_TOO_SMALL_ERROR = 10005 integer ( int32 ), parameter :: FS_TOO_FEW_ITERATION_ERROR = 10006 ! ------------------------------------------------------------------------------ integer ( int32 ), private , parameter :: MESSAGE_SIZE = 1024 contains ! ------------------------------------------------------------------------------ subroutine report_memory_error ( err , fname , code ) !! Reports a memory allocation related error. class ( errors ), intent ( inout ) :: err !! The error handling object. character ( len = * ), intent ( in ) :: fname !! The name of the routine in which the error occurred. integer ( int32 ), intent ( in ) :: code !! The error code returned by the allocation routine. ! Variables character ( len = MESSAGE_SIZE ) :: msg ! Process write ( msg , 100 ) & \"A memory allocation error occurred with code \" , code , \".\" call err % report_error ( fname , trim ( msg ), FS_MEMORY_ERROR ) ! Formatting 100 format ( A , I0 , A ) end subroutine ! ------------------------------------------------------------------------------ subroutine report_array_size_error ( err , fname , name , expect , actual ) !! Reports an array size error. class ( errors ), intent ( inout ) :: err !! The error handling object. character ( len = * ), intent ( in ) :: fname !! The name of the routine in which the error occurred. character ( len = * ), intent ( in ) :: name !! The name of the array. integer ( int32 ), intent ( in ) :: expect !! The expected size of the array. integer ( int32 ), intent ( in ) :: actual !! The actual size of the array. ! Variables character ( len = MESSAGE_SIZE ) :: msg ! Process write ( msg , 100 ) \"Expected array \" // name // \" to be of length \" , & expect , \", but found it to be of length \" , actual , \".\" call err % report_error ( fname , trim ( msg ), FS_ARRAY_SIZE_ERROR ) ! Formatting 100 format ( A , I0 , A , I0 , A ) end subroutine ! ------------------------------------------------------------------------------ subroutine report_matrix_size_error ( err , fname , name , expect_rows , & expect_cols , actual_rows , actual_cols ) !! Reports a matrix size error. class ( errors ), intent ( inout ) :: err !! The error handling object. character ( len = * ), intent ( in ) :: fname !! The name of the routine in which the error occurred. character ( len = * ), intent ( in ) :: name !! The name of the matrix. integer ( int32 ), intent ( in ) :: expect_rows !! The expected number of rows. integer ( int32 ), intent ( in ) :: expect_cols !! The expected number of columns. integer ( int32 ), intent ( in ) :: actual_rows !! The actual number of rows. integer ( int32 ), intent ( in ) :: actual_cols !! The actual number of columns. ! Variables character ( len = MESSAGE_SIZE ) :: msg ! Process write ( msg , 100 ) \"Expected matrix \" // name // \" to be of size (\" , & expect_rows , \", \" , expect_cols , \"), but found it to be of size (\" , & actual_rows , \", \" , actual_cols , \").\" call err % report_error ( fname , trim ( msg ), FS_MATRIX_SIZE_ERROR ) ! Formatting 100 format ( A , I0 , A , I0 , A , I0 , A , I0 , A ) end subroutine ! ------------------------------------------------------------------------------ subroutine report_arrays_not_same_size_error ( err , fname , name1 , name2 , & size1 , size2 ) !! Reports an error relating to two arrays not being the same size !! when they should be the same size. class ( errors ), intent ( inout ) :: err !! The error handling object. character ( len = * ), intent ( in ) :: fname !! The name of the routine in which the error occurred. character ( len = * ), intent ( in ) :: name1 !! The name of the first array. character ( len = * ), intent ( in ) :: name2 !! The name of the second array. integer ( int32 ), intent ( in ) :: size1 !! The size of the first array. integer ( int32 ), intent ( in ) :: size2 !! The size of the second array. ! Local Variables character ( len = MESSAGE_SIZE ) :: msg ! Process write ( msg , 100 ) \"Array \" // name1 // \" and array \" // name2 // & \"were expected to be the same size, but instead were found \" // & \"to be sized \" , size1 , \" and \" , size2 , \" respectively.\" call err % report_error ( fname , trim ( msg ), FS_ARRAY_SIZE_ERROR ) ! Formatting 100 format ( A , I0 , A , I0 , A ) end subroutine ! ------------------------------------------------------------------------------ subroutine report_underdefined_error ( err , fname , expect , actual ) !! Reports an underdefined problem error. class ( errors ), intent ( inout ) :: err !! The error handling object. character ( len = * ), intent ( in ) :: fname !! The name of the routine in which the error occurred. integer ( int32 ), intent ( in ) :: expect !! The expected minimum number of equations. integer ( int32 ), intent ( in ) :: actual !! The actual number of equations. ! Local Variables character ( len = MESSAGE_SIZE ) :: msg ! Process write ( msg , 100 ) \"The problem is underdefined.  The number of \" // & \"equations was found to be \" , actual , & \", but must be at least equal to the number of unknowns \" , & expect , \".\" call err % report_error ( fname , trim ( msg ), FS_UNDERDEFINED_PROBLEM_ERROR ) ! Formatting 100 format ( A , I0 , A , I0 , A ) end subroutine ! ------------------------------------------------------------------------------ subroutine report_iteration_count_error ( err , fname , msg , mincount ) !! Reports an iteration count error. class ( errors ), intent ( inout ) :: err !! The error handling object. character ( len = * ) :: fname !! The name of the routine in which the error occurred. character ( len = * ) :: msg !! The error message. integer ( int32 ), intent ( in ) :: mincount !! The minimum iteration count expected. ! Local Variables character ( len = MESSAGE_SIZE ) :: emsg ! Process write ( emsg , 100 ) msg // \"  A minimum of \" , mincount , \" is expected.\" call err % report_error ( fname , trim ( emsg ), FS_TOO_FEW_ITERATION_ERROR ) ! Formatting 100 format ( A , I0 , A ) end subroutine ! ------------------------------------------------------------------------------ end module","tags":"","loc":"sourcefile\\fstats_errors.f90.html"},{"title":"fstats_hypothesis.f90 – FSTATS","text":"Source Code module fstats_hypothesis use iso_fortran_env use ieee_arithmetic use fstats_errors use fstats_special_functions use fstats_distributions use fstats_descriptive_statistics use fstats_types private public :: confidence_interval public :: t_test_equal_variance public :: t_test_unequal_variance public :: t_test_paired public :: f_test public :: bartletts_test interface confidence_interval !! Computes the confidence interval for the specified distribution. !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Confidence_interval) module procedure :: confidence_interval_scalar module procedure :: confidence_interval_array end interface contains ! ------------------------------------------------------------------------------ pure function confidence_interval_scalar ( dist , alpha , s , n ) result ( rst ) !! Computes the confidence interval for the specified distribution. class ( distribution ), intent ( in ) :: dist !! The distribution object defining the probability distribution !! to establish the confidence level. real ( real64 ), intent ( in ) :: alpha !! The probability value of interest.  For instance, use a value of 0.05 !! for a confidence level of 95%. real ( real64 ), intent ( in ) :: s !! The sample standard deviation. integer ( int32 ), intent ( in ) :: n !! The number of samples in the data set. real ( real64 ) :: rst !! The result. ! Local Variables integer ( int32 ), parameter :: maxiter = 100 real ( real64 ), parameter :: tol = 1.0d-6 integer ( int32 ) :: i real ( real64 ) :: x , f , df , h , twoh , dy ! Process ! ! We use a simplified Newton's method to solve for the independent variable ! of the CDF function where it equals 1 - alpha / 2. h = 1.0d-6 twoh = 2.0d0 * h x = 1.0d0 - alpha / 2.0d0 rst = 0.5d0 do i = 1 , maxiter ! Compute the CDF and its derivative at y f = dist % cdf ( rst ) - x df = ( dist % cdf ( rst + h ) - dist % cdf ( rst - h )) / twoh dy = f / df rst = rst - dy if ( abs ( dy ) < tol ) exit end do ! Determine the actual interval rst = rst * s / sqrt ( real ( n , real64 )) end function ! ------------------------------------------------------------------------------ pure function confidence_interval_array ( dist , alpha , x ) result ( rst ) !! Computes the confidence interval for the specified distribution. class ( distribution ), intent ( in ) :: dist !! The distribution object defining the probability distribution !! to establish the confidence level. real ( real64 ), intent ( in ) :: alpha !! The probability value of interest.  For instance, use a value of 0.05 !! for a confidence level of 95%. real ( real64 ), intent ( in ) :: x (:) !! An N-element array containing the data to analyze. real ( real64 ) :: rst !! The result. ! Process rst = confidence_interval ( dist , alpha , standard_deviation ( x ), size ( x )) end function ! ------------------------------------------------------------------------------ subroutine t_test_equal_variance ( x1 , x2 , stat , p , dof ) !! Computes the 2-tailed Student's T-Test for two data sets of !! assumed equivalent variances. !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Student%27s_t-test) real ( real64 ), intent ( in ) :: x1 (:) !! An N-element array containing the first data set. real ( real64 ), intent ( in ) :: x2 (:) !! An M-element array containing the second data set. real ( real64 ), intent ( out ) :: stat !! The Student-'s T-Test statistic. real ( real64 ), intent ( out ) :: p !! The probability value that the two samples are likely to !! have come from two underlying populations that !! have the same mean. real ( real64 ), intent ( out ) :: dof !! The degrees of freedom. ! Parameters real ( real64 ), parameter :: half = 0.5d0 real ( real64 ), parameter :: one = 1.0d0 real ( real64 ), parameter :: two = 2.0d0 ! Local Variables real ( real64 ) :: v1 , v2 , m1 , m2 , sv , a , b , x integer ( int32 ) :: n1 , n2 ! Compute the T-statistic n1 = size ( x1 ) n2 = size ( x2 ) m1 = mean ( x1 ) m2 = mean ( x2 ) v1 = variance ( x1 ) v2 = variance ( x2 ) dof = n1 + n2 - two sv = (( n1 - one ) * v1 + ( n2 - one ) * v2 ) / dof stat = abs ( m1 - m2 ) / sqrt ( sv * ( one / real ( n1 ) + one / real ( n2 ))) ! Compute the probability a = half * dof b = half x = dof / ( dof + stat ** 2 ) p = regularized_beta ( a , b , x ) end subroutine ! ------------------------------------------------------------------------------ subroutine t_test_unequal_variance ( x1 , x2 , stat , p , dof ) !! Computes the 2-tailed Student's T-Test for two data sets of !! assumed non-equivalent variances. !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Student%27s_t-test) real ( real64 ), intent ( in ) :: x1 (:) !! An N-element array containing the first data set. real ( real64 ), intent ( in ) :: x2 (:) !! An M-element array containing the second data set. real ( real64 ), intent ( out ) :: stat !! The Student-'s T-Test statistic. real ( real64 ), intent ( out ) :: p !! The probability value that the two samples are likely to !! have come from two underlying populations that !! have the same mean. real ( real64 ), intent ( out ) :: dof !! The degrees of freedom. ! Parameters real ( real64 ), parameter :: half = 0.5d0 real ( real64 ), parameter :: one = 1.0d0 ! Local Variables real ( real64 ) :: v1 , v2 , m1 , m2 , sv , a , b , x integer ( int32 ) :: n1 , n2 ! Compute the T-statistic n1 = size ( x1 ) n2 = size ( x2 ) m1 = mean ( x1 ) m2 = mean ( x2 ) v1 = variance ( x1 ) v2 = variance ( x2 ) dof = ( v1 / real ( n1 ) + v2 / real ( n2 )) ** 2 / (( v1 / n1 ) ** 2 / ( n1 - one ) + & ( v2 / n2 ) ** 2 / ( n2 - one )) sv = sqrt ( v1 / n1 + v2 / n2 ) stat = ( m1 - m2 ) / sv ! Compute the probability a = half * dof b = half x = dof / ( dof + stat ** 2 ) p = regularized_beta ( a , b , x ) end subroutine ! ------------------------------------------------------------------------------ subroutine t_test_paired ( x1 , x2 , stat , p , dof , err ) !! Computes the 2-tailed Student's T-Test for two paired data sets. !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/Student%27s_t-test) real ( real64 ), intent ( in ) :: x1 (:) !! An N-element array containing the first data set. real ( real64 ), intent ( in ) :: x2 (:) !! An N-element array containing the second data set. real ( real64 ), intent ( out ) :: stat !! The Student-'s T-Test statistic. real ( real64 ), intent ( out ) :: p !! The probability value that the two samples are likely to !! have come from  two underlying populations that !! have the same mean. real ( real64 ), intent ( out ) :: dof !! The degrees of freedom. class ( errors ), intent ( inout ), optional , target :: err !! A mechanism for communicating errors and warnings to the !! caller.  Possible warning and error codes are as follows. !! - FS_NO_ERROR: No errors encountered. !! - FS_ARRAY_SIZE_ERROR: Occurs if x1 and x2 are not the same !!   length. ! Parameters real ( real64 ), parameter :: zero = 0.0d0 real ( real64 ), parameter :: half = 0.5d0 real ( real64 ), parameter :: one = 1.0d0 real ( real64 ), parameter :: two = 2.0d0 ! Local Variables class ( errors ), pointer :: errmgr type ( errors ), target :: deferr real ( real64 ) :: v1 , v2 , m1 , m2 , sd , cov , a , b , x integer ( int32 ) :: i , n1 , n2 , n ! Initialization if ( present ( err )) then errmgr => err else errmgr => deferr end if n1 = size ( x1 ) n2 = size ( x2 ) n = min ( n1 , n2 ) ! Input Checking if ( n1 /= n2 ) then call report_arrays_not_same_size_error ( errmgr , \"t_test_paired_real64\" , & \"X1\" , \"X2\" , n1 , n2 ) return end if ! Compute the T-statistic m1 = mean ( x1 ) m2 = mean ( x2 ) v1 = variance ( x1 ) v2 = variance ( x2 ) dof = real ( n1 ) - one cov = zero do i = 1 , n cov = cov + ( x1 ( i ) - m1 ) * ( x2 ( i ) - m2 ) end do cov = cov / dof sd = sqrt (( v1 + v2 - two * cov ) / n ) stat = ( m1 - m2 ) / sd ! Compute the probability a = half * dof b = half x = dof / ( dof + stat ** 2 ) p = regularized_beta ( a , b , x ) end subroutine ! ------------------------------------------------------------------------------ subroutine f_test ( x1 , x2 , stat , p , dof1 , dof2 ) !! Computes the F-test and returns the probability (two-tailed) that !! the variances of two data sets are not significantly different. !! !! See Also !! !! - [Wikipedia](https://en.wikipedia.org/wiki/F-test) real ( real64 ), intent ( in ) :: x1 (:) !! An N-element array containing the first data set. real ( real64 ), intent ( in ) :: x2 (:) !! An M-element array containing the second data set. real ( real64 ), intent ( out ) :: stat !! The F-statistic. real ( real64 ), intent ( out ) :: p !! The probability value that the two samples are likely to !! have come from the two underlying populations that !! have the same variance. real ( real64 ), intent ( out ) :: dof1 !! A measure of the degrees of freedom. real ( real64 ), intent ( out ) :: dof2 !! A measure of the degrees of freedom. ! Parameters real ( real64 ), parameter :: one = 1.0d0 real ( real64 ), parameter :: two = 2.0d0 ! Local Variables integer ( int32 ) :: n1 , n2 real ( real64 ) :: v1 , v2 , m1 , m2 type ( f_distribution ) :: dist ! Compute the F-statistic n1 = size ( x1 ) n2 = size ( x2 ) m1 = mean ( x1 ) m2 = mean ( x2 ) v1 = variance ( x1 ) v2 = variance ( x2 ) if ( v1 > v2 ) then stat = v1 / v2 dof1 = n1 - one dof2 = n2 - one else stat = v2 / v1 dof1 = n2 - one dof2 = n1 - one end if dist % d1 = dof1 dist % d2 = dof2 p = two * ( one - dist % cdf ( stat )) end subroutine ! ------------------------------------------------------------------------------ subroutine bartletts_test ( x , stat , p ) !! Computes Bartlett's test statistic as follows. !! !!  \\chi&#94;{2} = \\frac{(N - k) \\ln(S_{p}&#94;{2}) \\sum_{i = 1}&#94;{k} !! \\left(n_{i} - 1 \\right) \\ln(S_{i}&#94;{2})}{1 + !! \\frac{1}{3 \\left( k - 1 \\right)} \\left( \\sum_{i = 1}&#94;{k} !! \\left( \\frac{1}{n_{i} - 1} \\right) - \\frac{1}{N - k} \\right)}  !! !! Where  N = \\sum_{i = 1}&#94;{k} n_{i}  and  S_{p}&#94;{2}  is the pooled !! variance. type ( array_container ), intent ( in ), dimension (:) :: x !! The arrays of data to analyze. real ( real64 ), intent ( out ) :: stat !! The Bartlett's test statistic. real ( real64 ), intent ( out ) :: p !! The probability value that the variances of each data set are !! equivalent.  A low p-value, less than some significance level, !! indicates a non-equivalance of variances. ! Local Variables integer ( int32 ) :: i , n , k , ni real ( real64 ) :: si , sp , numer , denom type ( chi_squared_distribution ) :: dist ! Initialization k = size ( x ) n = 0 do i = 1 , k n = n + size ( x ( i )% x ) end do ! Compute the statistic n = 0 sp = 0.0d0 numer = 0.0d0 denom = 0.0d0 do i = 1 , k ni = size ( x ( i )% x ) n = n + ni si = variance ( x ( i )% x ) sp = sp + ( ni - 1.0d0 ) * si numer = numer + ( ni - 1.0d0 ) * log ( variance ( x ( i )% x )) denom = denom + 1.0d0 / ( ni - 1.0d0 ) end do sp = sp / real ( n - k , real64 ) stat = (( n - k ) * log ( sp ) - numer ) / & ( 1.0d0 + ( 1.0d0 / ( 3.0d0 * k - 3.0d0 )) * & ( denom - 1.0d0 / real ( n - k , real64 ))) ! Compute the p-value dist % dof = k - 1 p = 1.0d0 - dist % cdf ( stat ) end subroutine ! ------------------------------------------------------------------------------ end module","tags":"","loc":"sourcefile\\fstats_hypothesis.f90.html"}]}
\ No newline at end of file
diff --git a/doc/type/anova_factor.html b/doc/type/anova_factor.html
index 57efa3f..bfef220 100644
--- a/doc/type/anova_factor.html
+++ b/doc/type/anova_factor.html
@@ -74,7 +74,7 @@ <h1>anova_factor
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title="<p> 5.0% of total for derived types.</p>Including implementation: 7 statements,  1.9% of total for derived types.">7 statements</a>
+                 title="<p> 4.9% of total for derived types.</p>Including implementation: 7 statements,  1.9% of total for derived types.">7 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -114,11 +114,11 @@ <h4 class="card-header bg-primary text-white">Variables</h4>
       </a>
       <div id="vars-0" class="collapse">
         <div class="list-group list-group-flush">
-            <a class="list-group-item" href="../type/anova_factor.html#variable-dof~9">dof</a>
+            <a class="list-group-item" href="../type/anova_factor.html#variable-dof">dof</a>
             <a class="list-group-item" href="../type/anova_factor.html#variable-f_statistic">f_statistic</a>
-            <a class="list-group-item" href="../type/anova_factor.html#variable-probability~3">probability</a>
+            <a class="list-group-item" href="../type/anova_factor.html#variable-probability~2">probability</a>
             <a class="list-group-item" href="../type/anova_factor.html#variable-sum_of_squares">sum_of_squares</a>
-            <a class="list-group-item" href="../type/anova_factor.html#variable-variance~7">variance</a>
+            <a class="list-group-item" href="../type/anova_factor.html#variable-variance">variance</a>
         </div>
       </div>
     </div>
@@ -167,7 +167,7 @@ <h2>Components</h2>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-dof~9"></span>
+              <span class="anchor" id="variable-dof"></span>
               real(kind=real64),
             </td>
               <td>public</td>
@@ -201,7 +201,7 @@ <h2>Components</h2>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-probability~3"></span>
+              <span class="anchor" id="variable-probability~2"></span>
               real(kind=real64),
             </td>
               <td>public</td>
@@ -235,7 +235,7 @@ <h2>Components</h2>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-variance~7"></span>
+              <span class="anchor" id="variable-variance"></span>
               real(kind=real64),
             </td>
               <td>public</td>
@@ -275,7 +275,7 @@ <h2>Components</h2>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/type/array_container.html b/doc/type/array_container.html
new file mode 100644
index 0000000..69c10a8
--- /dev/null
+++ b/doc/type/array_container.html
@@ -0,0 +1,236 @@
+<!-- -*- mode: jinja2 -*- -->
+
+<!DOCTYPE html>
+<html lang="en">
+  <head>
+    <meta charset="utf-8">
+    <meta http-equiv="X-UA-Compatible" content="IE=edge">
+    <meta name="viewport" content="width=device-width, initial-scale=1">
+      <meta name="description" content="FSTATS is a modern Fortran statistical library containing routines for computing basic statistical properties, hypothesis testing, regression, special functions, and experimental design.">
+    <meta name="author" content="Jason Christopherson" >
+    <link rel="icon" href="../favicon.png">
+
+    <title>array_container &ndash; FSTATS </title>
+
+    <link href="https://cdn.jsdelivr.net/npm/bootstrap@5.1.3/dist/css/bootstrap.min.css" rel="stylesheet"
+          integrity="sha384-1BmE4kWBq78iYhFldvKuhfTAU6auU8tT94WrHftjDbrCEXSU1oBoqyl2QvZ6jIW3" crossorigin="anonymous">
+    <link href="../css/pygments.css" rel="stylesheet">
+    <link href="../css/font-awesome.min.css" rel="stylesheet">
+    <link href="../css/local.css" rel="stylesheet">
+      <link  href="../tipuesearch/tipuesearch.css" rel="stylesheet">
+
+    <script src="https://code.jquery.com/jquery-3.7.1.min.js" integrity="sha256-/JqT3SQfawRcv/BIHPThkBvs0OEvtFFmqPF/lYI/Cxo=" crossorigin="anonymous"></script>
+    <script src="../js/svg-pan-zoom.min.js"></script>
+  </head>
+
+  <body>
+
+    <!-- Fixed navbar -->
+    <div class="container-fluid mb-sm-4 mb-xl-2">
+      <nav class="navbar navbar-expand-lg navbar-dark bg-dark fixed-top">
+        <div class="container">
+          <a class="navbar-brand" href="../index.html">FSTATS </a>
+          <button type="button" class="navbar-toggler" data-bs-toggle="collapse" data-bs-target="#navbar"
+                  aria-expanded="false" aria-controls="navbar" aria-label="Toggle navigation">
+                  <span class="navbar-toggler-icon">
+          </button>
+
+          <div id="navbar" class="navbar-collapse collapse">
+            <ul class="navbar-nav">
+                  <li class="nav-item">
+                    <a class="nav-link" href="../lists/files.html">Source Files</a>
+                  </li>
+                <li class="nav-item">
+                  <a class="nav-link" href="../lists/modules.html">Modules</a>
+                </li>
+                <li class="nav-item">
+                  <a class="nav-link" href="../lists/procedures.html">Procedures</a>
+                </li>
+                <li class="nav-item">
+                  <a class="nav-link" href="../lists/types.html">Derived Types</a>
+                </li>
+            </ul>
+              <div class="d-flex align-items-end flex-grow-1">
+                <form action="../search.html" role="search" class="ms-auto">
+                  <input type="text" class="form-control" aria-label="Search" placeholder="Search" name="q" id="tipue_search_input" autocomplete="off" required>
+                </form>
+              </div>
+          </div><!--/.nav-collapse -->
+        </div>
+      </nav>
+    </div>
+
+    <div class="container">
+  <div class="row">
+    <h1>array_container
+      <small>Derived Type</small>
+      
+    </h1>
+      <div class="container p-2 mb-4 bg-light border rounded-3">
+    <div class="row align-items-center justify-content-between" id="info-bar">
+      <div class="col">
+        <ul class="list-inline" style="margin-bottom:0px;display:inline">
+
+            <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
+              <a data-bs-toggle="tooltip"
+                 data-bs-placement="bottom" data-html="true"
+                 title="<p> 2.1% of total for derived types.</p>Including implementation: 3 statements,  0.8% of total for derived types.">3 statements</a>
+            </li>
+
+            <li class="list-inline-item" id="source-file">
+              <i class="fa fa-code"></i>
+              <a href="../src/fstats_types.f90"> Source File</a>
+            </li>
+        </ul>
+      </div>
+      <div class="col">
+        <nav aria-label="breadcrumb">
+          <ol class="breadcrumb justify-content-end mb-0">
+                <li class="breadcrumb-item"><a href='..\sourcefile\fstats_types.f90.html'>fstats_types.f90</a></li>
+                <li class="breadcrumb-item"><a href='..\module\fstats_types.html'>fstats_types</a></li>
+            <li class="breadcrumb-item active" aria-current="page">array_container</li>
+          </ol>
+        </nav>
+      </div>
+    </div>
+  </div>
+  <script>
+    $(function () {
+    $('[data-bs-toggle="tooltip"]').tooltip()
+    })
+  </script>
+
+  </div>
+  
+  <div class="row">
+    <div class="col-md-3 hidden-xs hidden-sm visible-md visible-lg">
+      <div id="sidebar">
+      <h3>Contents</h3>
+  
+      <div class="card mb-4">
+      <a data-bs-toggle="collapse" href="#vars-0"
+         aria-expanded="false" aria-controls="vars-0">
+         <h4 class="card-header bg-primary text-white">Variables</h4>
+      </a>
+      <div id="vars-0" class="collapse">
+        <div class="list-group list-group-flush">
+            <a class="list-group-item" href="../type/array_container.html#variable-x~38">x</a>
+        </div>
+      </div>
+    </div>
+
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+
+
+  </div>
+
+    </div>
+    
+    <div class="col-md-9" id='text'>
+      <h2>
+        type, public :: array_container</h2>
+    <p>Provides a container for a real-valued array.  A practical use of
+this construct is in the construction of jagged arrays.</p>
+    <br>
+
+    <section>
+    <h2>Components</h2>
+      <table class="table table-striped varlist">
+    <thead>
+      <tr>
+        <th scope="col">Type</th>
+<th scope="col">Visibility</th>        <th scope="col">Attributes</th>
+        <th scope="col"></th>
+        <th scope="col">Name</th>
+<th></th><th scope="col">Initial</th>        <th scope="col"></th>
+    </thead>
+    <tbody>
+        <tr>
+            <td>
+              <span class="anchor" id="variable-x~38"></span>
+              real(kind=real64),
+            </td>
+              <td>public,</td>
+            <td>
+              allocatable, dimension(:)
+            </td>
+            <td>::</td>
+            <td><strong>x</strong></td>
+                <td></td>
+                <td></td>
+            <td>
+                <p>The array.</p>
+            </td>
+        </tr>
+    </tbody>
+  </table>
+
+    </section>
+    <br>
+    
+
+
+
+    
+    </div>
+  </div>
+
+      <hr>
+    </div> <!-- /container -->
+    <footer>
+      <div class="container">
+        <div class="row justify-content-between">
+          <div class="col"><p>FSTATS was developed by Jason Christopherson<br>&copy; 2024 
+</p>
+          </div>
+          <div class="col">
+            <p class="text-end">
+              Documentation generated by
+              <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
+ on 2024-04-16 13:46              </p>
+          </div>
+        </div>
+        <br>
+      </div> <!-- /container -->
+    </footer>
+
+    <!-- Bootstrap core JavaScript -->
+    <!-- Placed at the end of the document so the pages load faster -->
+    <script src="https://cdn.jsdelivr.net/npm/bootstrap@5.1.3/dist/js/bootstrap.bundle.min.js"
+            integrity="sha384-ka7Sk0Gln4gmtz2MlQnikT1wXgYsOg+OMhuP+IlRH9sENBO0LRn5q+8nbTov4+1p" crossorigin="anonymous"></script>    
+
+    <!-- MathJax JavaScript
+             ================================================== -->
+             <!-- Placed at the end of the document so the pages load faster -->
+        <script type="text/x-mathjax-config">
+          MathJax.Hub.Config({
+          TeX: { extensions: ['AMSmath.js','AMSsymbols.js','noErrors.js','noUndefined.js'], equationNumbers: { autoNumber: 'AMS' } },
+          jax: ['input/TeX','input/MathML','output/HTML-CSS'],
+          extensions: ['tex2jax.js','mml2jax.js','MathMenu.js','MathZoom.js']
+          });
+        </script>
+        <script src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML"></script>
+
+          <script src="../tipuesearch/tipuesearch_content.js"></script>
+          <script src="../tipuesearch/tipuesearch_set.js"></script>
+          <script src="../tipuesearch/tipuesearch.js"></script>
+
+  </body>
+</html>
\ No newline at end of file
diff --git a/doc/type/binomial_distribution.html b/doc/type/binomial_distribution.html
index 6eff008..d8eca06 100644
--- a/doc/type/binomial_distribution.html
+++ b/doc/type/binomial_distribution.html
@@ -74,7 +74,7 @@ <h1>binomial_distribution
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title="<p> 7.8% of total for derived types.</p>Including implementation: 47 statements, 12.9% of total for derived types.">11 statements</a>
+                 title="<p> 7.6% of total for derived types.</p>Including implementation: 47 statements, 12.8% of total for derived types.">11 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -114,8 +114,8 @@ <h4 class="card-header bg-primary text-white">Variables</h4>
       </a>
       <div id="vars-0" class="collapse">
         <div class="list-group list-group-flush">
-            <a class="list-group-item" href="../type/binomial_distribution.html#variable-n~12">n</a>
-            <a class="list-group-item" href="../type/binomial_distribution.html#variable-p~2">p</a>
+            <a class="list-group-item" href="../type/binomial_distribution.html#variable-n~35">n</a>
+            <a class="list-group-item" href="../type/binomial_distribution.html#variable-p~10">p</a>
         </div>
       </div>
     </div>
@@ -147,7 +147,7 @@ <h4 class="card-header bg-primary text-white">Type-Bound Procedures</h4>
             <a class="list-group-item" href="../type/binomial_distribution.html#boundprocedure-median~6">median</a>
             <a class="list-group-item" href="../type/binomial_distribution.html#boundprocedure-mode~6">mode</a>
             <a class="list-group-item" href="../type/binomial_distribution.html#boundprocedure-pdf~6">pdf</a>
-            <a class="list-group-item" href="../type/binomial_distribution.html#boundprocedure-variance~6">variance</a>
+            <a class="list-group-item" href="../type/binomial_distribution.html#boundprocedure-variance~7">variance</a>
         </div>
       </div>
     </div>
@@ -181,7 +181,7 @@ <h2>Components</h2>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-n~12"></span>
+              <span class="anchor" id="variable-n~35"></span>
               integer(kind=int32),
             </td>
               <td>public</td>
@@ -198,7 +198,7 @@ <h2>Components</h2>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-p~2"></span>
+              <span class="anchor" id="variable-p~10"></span>
               real(kind=real64),
             </td>
               <td>public</td>
@@ -557,7 +557,7 @@ <h4>
           <div class="row">
               <div class="card mt-3">
     <div class="card-header codesum">
-      <span class="anchor" id="boundprocedure-variance~6"></span>
+      <span class="anchor" id="boundprocedure-variance~7"></span>
       <h3>
           procedure, public ::
   <strong>variance</strong> => bd_variance
@@ -630,7 +630,7 @@ <h4>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/type/bootstrap_regression_statistics.html b/doc/type/bootstrap_regression_statistics.html
index e514984..6e29672 100644
--- a/doc/type/bootstrap_regression_statistics.html
+++ b/doc/type/bootstrap_regression_statistics.html
@@ -74,7 +74,7 @@ <h1>bootstrap_regression_statistics
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title="<p> 5.0% of total for derived types.</p>Including implementation: 7 statements,  1.9% of total for derived types.">7 statements</a>
+                 title="<p> 4.9% of total for derived types.</p>Including implementation: 7 statements,  1.9% of total for derived types.">7 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -287,7 +287,7 @@ <h2>Components</h2>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/type/bootstrap_statistics.html b/doc/type/bootstrap_statistics.html
index 96e7c99..6dba925 100644
--- a/doc/type/bootstrap_statistics.html
+++ b/doc/type/bootstrap_statistics.html
@@ -74,7 +74,7 @@ <h1>bootstrap_statistics
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title="<p> 5.7% of total for derived types.</p>Including implementation: 8 statements,  2.2% of total for derived types.">8 statements</a>
+                 title="<p> 5.6% of total for derived types.</p>Including implementation: 8 statements,  2.2% of total for derived types.">8 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -294,7 +294,7 @@ <h2>Components</h2>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/type/chi_squared_distribution.html b/doc/type/chi_squared_distribution.html
index 69f4f34..bfc487c 100644
--- a/doc/type/chi_squared_distribution.html
+++ b/doc/type/chi_squared_distribution.html
@@ -74,7 +74,7 @@ <h1>chi_squared_distribution
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title="<p> 7.1% of total for derived types.</p>Including implementation: 46 statements, 12.6% of total for derived types.">10 statements</a>
+                 title="<p> 6.9% of total for derived types.</p>Including implementation: 46 statements, 12.5% of total for derived types.">10 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -114,7 +114,7 @@ <h4 class="card-header bg-primary text-white">Variables</h4>
       </a>
       <div id="vars-0" class="collapse">
         <div class="list-group list-group-flush">
-            <a class="list-group-item" href="../type/chi_squared_distribution.html#variable-dof~2">dof</a>
+            <a class="list-group-item" href="../type/chi_squared_distribution.html#variable-dof~6">dof</a>
         </div>
       </div>
     </div>
@@ -146,7 +146,7 @@ <h4 class="card-header bg-primary text-white">Type-Bound Procedures</h4>
             <a class="list-group-item" href="../type/chi_squared_distribution.html#boundprocedure-median~5">median</a>
             <a class="list-group-item" href="../type/chi_squared_distribution.html#boundprocedure-mode~5">mode</a>
             <a class="list-group-item" href="../type/chi_squared_distribution.html#boundprocedure-pdf~5">pdf</a>
-            <a class="list-group-item" href="../type/chi_squared_distribution.html#boundprocedure-variance~5">variance</a>
+            <a class="list-group-item" href="../type/chi_squared_distribution.html#boundprocedure-variance~6">variance</a>
         </div>
       </div>
     </div>
@@ -179,7 +179,7 @@ <h2>Components</h2>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-dof~2"></span>
+              <span class="anchor" id="variable-dof~6"></span>
               integer(kind=int32),
             </td>
               <td>public</td>
@@ -533,7 +533,7 @@ <h4>
           <div class="row">
               <div class="card mt-3">
     <div class="card-header codesum">
-      <span class="anchor" id="boundprocedure-variance~5"></span>
+      <span class="anchor" id="boundprocedure-variance~6"></span>
       <h3>
           procedure, public ::
   <strong>variance</strong> => cs_variance
@@ -606,7 +606,7 @@ <h4>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/type/convergence_info.html b/doc/type/convergence_info.html
index 675034b..2d0af59 100644
--- a/doc/type/convergence_info.html
+++ b/doc/type/convergence_info.html
@@ -74,7 +74,7 @@ <h1>convergence_info
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title="<p> 9.2% of total for derived types.</p>Including implementation: 13 statements,  3.6% of total for derived types.">13 statements</a>
+                 title="<p> 9.0% of total for derived types.</p>Including implementation: 13 statements,  3.5% of total for derived types.">13 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -387,7 +387,7 @@ <h2>Components</h2>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/type/distribution.html b/doc/type/distribution.html
index 7d65bc2..fe97a95 100644
--- a/doc/type/distribution.html
+++ b/doc/type/distribution.html
@@ -74,7 +74,7 @@ <h1>distribution
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title="<p> 6.4% of total for derived types.</p>Including implementation: 9 statements,  2.5% of total for derived types.">9 statements</a>
+                 title="<p> 6.2% of total for derived types.</p>Including implementation: 9 statements,  2.4% of total for derived types.">9 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -135,7 +135,7 @@ <h4 class="card-header bg-primary text-white">Type-Bound Procedures</h4>
             <a class="list-group-item" href="../type/distribution.html#boundprocedure-median">median</a>
             <a class="list-group-item" href="../type/distribution.html#boundprocedure-mode">mode</a>
             <a class="list-group-item" href="../type/distribution.html#boundprocedure-pdf">pdf</a>
-            <a class="list-group-item" href="../type/distribution.html#boundprocedure-variance">variance</a>
+            <a class="list-group-item" href="../type/distribution.html#boundprocedure-variance~2">variance</a>
         </div>
       </div>
     </div>
@@ -502,7 +502,7 @@ <h4>
           <div class="row">
               <div class="card mt-3">
     <div class="card-header codesum">
-      <span class="anchor" id="boundprocedure-variance"></span>
+      <span class="anchor" id="boundprocedure-variance~2"></span>
       <h3>
           procedure(<a href='..\interface\distribution_property.html'>distribution_property</a>), public, deferred, pass ::
   <strong>variance</strong>
@@ -579,7 +579,7 @@ <h4>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/type/f_distribution.html b/doc/type/f_distribution.html
index 0b11120..be3760b 100644
--- a/doc/type/f_distribution.html
+++ b/doc/type/f_distribution.html
@@ -74,7 +74,7 @@ <h1>f_distribution
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title="<p> 7.8% of total for derived types.</p>Including implementation: 64 statements, 17.5% of total for derived types.">11 statements</a>
+                 title="<p> 7.6% of total for derived types.</p>Including implementation: 64 statements, 17.4% of total for derived types.">11 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -114,8 +114,8 @@ <h4 class="card-header bg-primary text-white">Variables</h4>
       </a>
       <div id="vars-0" class="collapse">
         <div class="list-group list-group-flush">
-            <a class="list-group-item" href="../type/f_distribution.html#variable-d1">d1</a>
-            <a class="list-group-item" href="../type/f_distribution.html#variable-d2">d2</a>
+            <a class="list-group-item" href="../type/f_distribution.html#variable-d1~3">d1</a>
+            <a class="list-group-item" href="../type/f_distribution.html#variable-d2~3">d2</a>
         </div>
       </div>
     </div>
@@ -147,7 +147,7 @@ <h4 class="card-header bg-primary text-white">Type-Bound Procedures</h4>
             <a class="list-group-item" href="../type/f_distribution.html#boundprocedure-median~4">median</a>
             <a class="list-group-item" href="../type/f_distribution.html#boundprocedure-mode~4">mode</a>
             <a class="list-group-item" href="../type/f_distribution.html#boundprocedure-pdf~4">pdf</a>
-            <a class="list-group-item" href="../type/f_distribution.html#boundprocedure-variance~4">variance</a>
+            <a class="list-group-item" href="../type/f_distribution.html#boundprocedure-variance~5">variance</a>
         </div>
       </div>
     </div>
@@ -180,7 +180,7 @@ <h2>Components</h2>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-d1"></span>
+              <span class="anchor" id="variable-d1~3"></span>
               real(kind=real64),
             </td>
               <td>public</td>
@@ -197,7 +197,7 @@ <h2>Components</h2>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-d2"></span>
+              <span class="anchor" id="variable-d2~3"></span>
               real(kind=real64),
             </td>
               <td>public</td>
@@ -552,7 +552,7 @@ <h4>
           <div class="row">
               <div class="card mt-3">
     <div class="card-header codesum">
-      <span class="anchor" id="boundprocedure-variance~4"></span>
+      <span class="anchor" id="boundprocedure-variance~5"></span>
       <h3>
           procedure, public ::
   <strong>variance</strong> => fd_variance
@@ -625,7 +625,7 @@ <h4>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/type/iteration_controls.html b/doc/type/iteration_controls.html
index 4713090..562af94 100644
--- a/doc/type/iteration_controls.html
+++ b/doc/type/iteration_controls.html
@@ -74,7 +74,7 @@ <h1>iteration_controls
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title="<p> 7.8% of total for derived types.</p>Including implementation: 21 statements,  5.8% of total for derived types.">11 statements</a>
+                 title="<p> 7.6% of total for derived types.</p>Including implementation: 21 statements,  5.7% of total for derived types.">11 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -381,7 +381,7 @@ <h4>Arguments</h4>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/type/lm_solver_options.html b/doc/type/lm_solver_options.html
index 84b0d09..3237fb9 100644
--- a/doc/type/lm_solver_options.html
+++ b/doc/type/lm_solver_options.html
@@ -74,7 +74,7 @@ <h1>lm_solver_options
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title="<p> 5.7% of total for derived types.</p>Including implementation: 15 statements,  4.1% of total for derived types.">8 statements</a>
+                 title="<p> 5.6% of total for derived types.</p>Including implementation: 15 statements,  4.1% of total for derived types.">8 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -328,7 +328,7 @@ <h4>Arguments</h4>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/type/normal_distribution.html b/doc/type/normal_distribution.html
index 677cfbe..cd921d4 100644
--- a/doc/type/normal_distribution.html
+++ b/doc/type/normal_distribution.html
@@ -74,7 +74,7 @@ <h1>normal_distribution
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title="<p> 8.5% of total for derived types.</p>Including implementation: 49 statements, 13.4% of total for derived types.">12 statements</a>
+                 title="<p> 8.3% of total for derived types.</p>Including implementation: 49 statements, 13.3% of total for derived types.">12 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -148,7 +148,7 @@ <h4 class="card-header bg-primary text-white">Type-Bound Procedures</h4>
             <a class="list-group-item" href="../type/normal_distribution.html#boundprocedure-mode~3">mode</a>
             <a class="list-group-item" href="../type/normal_distribution.html#boundprocedure-pdf~3">pdf</a>
             <a class="list-group-item" href="../type/normal_distribution.html#boundprocedure-standardize">standardize</a>
-            <a class="list-group-item" href="../type/normal_distribution.html#boundprocedure-variance~3">variance</a>
+            <a class="list-group-item" href="../type/normal_distribution.html#boundprocedure-variance~4">variance</a>
         </div>
       </div>
     </div>
@@ -606,7 +606,7 @@ <h4>Arguments</h4>
           <div class="row">
               <div class="card mt-3">
     <div class="card-header codesum">
-      <span class="anchor" id="boundprocedure-variance~3"></span>
+      <span class="anchor" id="boundprocedure-variance~4"></span>
       <h3>
           procedure, public ::
   <strong>variance</strong> => nd_variance
@@ -679,7 +679,7 @@ <h4>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/type/regression_statistics.html b/doc/type/regression_statistics.html
index f3915e6..765b854 100644
--- a/doc/type/regression_statistics.html
+++ b/doc/type/regression_statistics.html
@@ -74,7 +74,7 @@ <h1>regression_statistics
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title="<p> 4.3% of total for derived types.</p>Including implementation: 6 statements,  1.6% of total for derived types.">6 statements</a>
+                 title="<p> 4.2% of total for derived types.</p>Including implementation: 6 statements,  1.6% of total for derived types.">6 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -115,7 +115,7 @@ <h4 class="card-header bg-primary text-white">Variables</h4>
       <div id="vars-0" class="collapse">
         <div class="list-group list-group-flush">
             <a class="list-group-item" href="../type/regression_statistics.html#variable-confidence_interval">confidence_interval</a>
-            <a class="list-group-item" href="../type/regression_statistics.html#variable-probability~2">probability</a>
+            <a class="list-group-item" href="../type/regression_statistics.html#variable-probability~3">probability</a>
             <a class="list-group-item" href="../type/regression_statistics.html#variable-standard_error~3">standard_error</a>
             <a class="list-group-item" href="../type/regression_statistics.html#variable-t_statistic~2">t_statistic</a>
         </div>
@@ -187,7 +187,7 @@ <h2>Components</h2>
         </tr>
         <tr>
             <td>
-              <span class="anchor" id="variable-probability~2"></span>
+              <span class="anchor" id="variable-probability~3"></span>
               real(kind=real64),
             </td>
               <td>public</td>
@@ -275,7 +275,7 @@ <h2>Components</h2>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/type/single_factor_anova_table.html b/doc/type/single_factor_anova_table.html
index 0502a6e..156c593 100644
--- a/doc/type/single_factor_anova_table.html
+++ b/doc/type/single_factor_anova_table.html
@@ -74,7 +74,7 @@ <h1>single_factor_anova_table
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title="<p> 5.7% of total for derived types.</p>Including implementation: 8 statements,  2.2% of total for derived types.">8 statements</a>
+                 title="<p> 5.6% of total for derived types.</p>Including implementation: 8 statements,  2.2% of total for derived types.">8 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -293,7 +293,7 @@ <h2>Components</h2>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/type/t_distribution.html b/doc/type/t_distribution.html
index a5e7670..cdd7940 100644
--- a/doc/type/t_distribution.html
+++ b/doc/type/t_distribution.html
@@ -74,7 +74,7 @@ <h1>t_distribution
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title="<p> 7.1% of total for derived types.</p>Including implementation: 55 statements, 15.1% of total for derived types.">10 statements</a>
+                 title="<p> 6.9% of total for derived types.</p>Including implementation: 55 statements, 14.9% of total for derived types.">10 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -114,7 +114,7 @@ <h4 class="card-header bg-primary text-white">Variables</h4>
       </a>
       <div id="vars-0" class="collapse">
         <div class="list-group list-group-flush">
-            <a class="list-group-item" href="../type/t_distribution.html#variable-dof">dof</a>
+            <a class="list-group-item" href="../type/t_distribution.html#variable-dof~5">dof</a>
         </div>
       </div>
     </div>
@@ -146,7 +146,7 @@ <h4 class="card-header bg-primary text-white">Type-Bound Procedures</h4>
             <a class="list-group-item" href="../type/t_distribution.html#boundprocedure-median~2">median</a>
             <a class="list-group-item" href="../type/t_distribution.html#boundprocedure-mode~2">mode</a>
             <a class="list-group-item" href="../type/t_distribution.html#boundprocedure-pdf~2">pdf</a>
-            <a class="list-group-item" href="../type/t_distribution.html#boundprocedure-variance~2">variance</a>
+            <a class="list-group-item" href="../type/t_distribution.html#boundprocedure-variance~3">variance</a>
         </div>
       </div>
     </div>
@@ -179,7 +179,7 @@ <h2>Components</h2>
     <tbody>
         <tr>
             <td>
-              <span class="anchor" id="variable-dof"></span>
+              <span class="anchor" id="variable-dof~5"></span>
               real(kind=real64),
             </td>
               <td>public</td>
@@ -535,7 +535,7 @@ <h4>
           <div class="row">
               <div class="card mt-3">
     <div class="card-header codesum">
-      <span class="anchor" id="boundprocedure-variance~2"></span>
+      <span class="anchor" id="boundprocedure-variance~3"></span>
       <h3>
           procedure, public ::
   <strong>variance</strong> => td_variance
@@ -608,7 +608,7 @@ <h4>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/doc/type/two_factor_anova_table.html b/doc/type/two_factor_anova_table.html
index 378cbfd..7a8d71e 100644
--- a/doc/type/two_factor_anova_table.html
+++ b/doc/type/two_factor_anova_table.html
@@ -74,7 +74,7 @@ <h1>two_factor_anova_table
             <li class="list-inline-item" id="statements"><i class="fa fa-list-ol"></i>
               <a data-bs-toggle="tooltip"
                  data-bs-placement="bottom" data-html="true"
-                 title="<p> 7.1% of total for derived types.</p>Including implementation: 10 statements,  2.7% of total for derived types.">10 statements</a>
+                 title="<p> 6.9% of total for derived types.</p>Including implementation: 10 statements,  2.7% of total for derived types.">10 statements</a>
             </li>
 
             <li class="list-inline-item" id="source-file">
@@ -329,7 +329,7 @@ <h2>Components</h2>
             <p class="text-end">
               Documentation generated by
               <a href="https://github.com/Fortran-FOSS-Programmers/ford">FORD</a>
- on 2024-03-26 07:52              </p>
+ on 2024-04-16 13:46              </p>
           </div>
         </div>
         <br>
diff --git a/src/fstats_hypothesis.f90 b/src/fstats_hypothesis.f90
index 6b6ce3d..7f278c4 100644
--- a/src/fstats_hypothesis.f90
+++ b/src/fstats_hypothesis.f90
@@ -319,6 +319,9 @@ subroutine bartletts_test(x, stat, p)
     !! \left(n_{i} - 1 \right) \ln(S_{i}^{2})}{1 + 
     !! \frac{1}{3 \left( k - 1 \right)} \left( \sum_{i = 1}^{k} 
     !! \left( \frac{1}{n_{i} - 1} \right) - \frac{1}{N - k} \right)} $$
+    !!
+    !! Where \( N = \sum_{i = 1}^{k} n_{i} \) and \( S_{p}^{2} \) is the pooled
+    !! variance.
     type(array_container), intent(in), dimension(:) :: x
         !! The arrays of data to analyze.
     real(real64), intent(out) :: stat