Commit 16a2161 1 parent d550e64 commit 16a2161 Copy full SHA for 16a2161
File tree 4 files changed +30
-4
lines changed
4 files changed +30
-4
lines changed Original file line number Diff line number Diff line change @@ -14,15 +14,17 @@ jobs:
14
14
name : coverage
15
15
runs-on : ubuntu-latest
16
16
container :
17
- image : xd009642/tarpaulin:develop-nightly
17
+ # image: xd009642/tarpaulin:develop-nightly
18
+ image : xd009642/tarpaulin
18
19
options : --security-opt seccomp=unconfined
19
20
steps :
20
21
- name : Checkout repository
21
22
uses : actions/checkout@v3
22
23
23
24
- name : Generate code coverage
24
25
run : |
25
- cargo +nightly tarpaulin --force-clean --verbose --all-features --engine llvm --timeout 120 --out Lcov
26
+ cargo tarpaulin --force-clean --verbose --all-features --engine llvm --timeout 120 --out Lcov
27
+ # cargo +nightly tarpaulin --force-clean --verbose --all-features --engine llvm --timeout 120 --out Lcov
26
28
27
29
- name : upload to Coveralls
28
30
uses : coverallsapp/github-action@master
Original file line number Diff line number Diff line change @@ -19,3 +19,5 @@ Cargo.lock
19
19
20
20
# ide folders
21
21
.idea /
22
+
23
+ lcov.info
Original file line number Diff line number Diff line change 8
8
//!
9
9
//! ## Multiple Right Hand Sides
10
10
//!
11
- //! Since version 0.8.0, support for global fitting with multiple right hand
11
+ //! Since version 0.8.0, support for _global fitting_ with multiple right hand
12
12
//! sides has been added to this library. This is a powerful technique for suitable
13
13
//! problems and is explained at the end of this introductory chapter.
14
14
//!
366
366
//!
367
367
//! To take advantage of global fitting we don't need to change anything about the
368
368
//! model, we just have to make a slight modification to the way we build a problem.
369
+ //! The crucial differences to the single right hand side case are:
370
+ //!
371
+ //! 1. We have to use the [`LevMarProblemBuilder::mrhs`](crate::solvers::levmar::LevMarProblemBuilder::mrhs)
372
+ //! constructor rather than `new`.
373
+ //! 2. We have to sort the right hand sides into a matrix, where each right
374
+ //! hand side, which is a column-vector on its own, will become a column
375
+ //! of the resulting matrix.
376
+ //!
377
+ //! For a set of observations `$\vec{y}_1,\dots,\vec{y}_S$` (column vectors) we
378
+ //! now have to pass a _matrix_ `$Y$` of observations, rather than a single
379
+ //! vector to the builder. As explained above, the resulting matrix would look
380
+ //! like this.
381
+ //!
382
+ //! ```math
383
+ //! \boldsymbol{Y}=\left(\begin{matrix}
384
+ //! \vert & & \vert \\
385
+ //! \vec{y}_1 & \dots & \vec{y}_S \\
386
+ //! \vert & & \vert \\
387
+ //! \end{matrix}\right)
388
+ //! ```
389
+ //!
390
+ //! The order of the vectors in the matrix doesn't matter.
369
391
//!
370
392
//! ## Example
371
393
//! ```no_run
Original file line number Diff line number Diff line change @@ -159,7 +159,7 @@ where
159
159
}
160
160
161
161
/// creata a new solver using the given underlying solver. This allows
162
- /// us to configure the underlying with non-default parameters
162
+ /// us to configure the underlying solver with non-default parameters
163
163
pub fn with_solver ( solver : LevenbergMarquardt < Model :: ScalarType > ) -> Self {
164
164
Self { solver }
165
165
}
You can’t perform that action at this time.
0 commit comments