Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Adapt to new typos version #817

Merged
merged 2 commits into from
Apr 3, 2024
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 2 additions & 0 deletions .typos.toml
Original file line number Diff line number Diff line change
Expand Up @@ -7,6 +7,8 @@ OT = "OT"
ND = "ND"
GIR = "GIR"
AKS = "AKS"
FRE = "FRE"
Ein = "Ein"

[files]
# do not check the following files:
Expand Down
3 changes: 2 additions & 1 deletion docs/src/tutorials/linear_methods/introduction.md
Original file line number Diff line number Diff line change
Expand Up @@ -18,7 +18,8 @@ discretization for systems of linear differential equations of the form
x'(t) = Ax(t),\qquad x(0) ∈ X_0 ∈ \mathbb{R}^n.
```
for all times ``t ∈ [0, T]``. Linear systems with non-deterministic inputs
is disussed in another section of this manual. We also consider an invariant specification: ``x(t) ∈ X`` for all times.
is discussed in another section of this manual. We also consider an invariant
specification: ``x(t) ∈ X`` for all times.

The final part of this section introduces support function techniques and discusses
the helicopter model application. For ease of exposition, this section only considers.
Expand Down
2 changes: 1 addition & 1 deletion src/Algorithms/TMJets/TMJets20/reach.jl
Original file line number Diff line number Diff line change
Expand Up @@ -243,7 +243,7 @@ function validated_step!(f!, t::Taylor1{T}, x::Vector{Taylor1{TaylorN{T}}},
local success, _t0

for nchecks in 1:25
# Validate the solution: remainder consistent with Schauder thm
# Validate the solution: remainder consistent with Schauder theorem
δtI = sign_tstep * IA.interval(0, sign_tstep * δt)
(success, Δ, _t0) = remainder_taylorstep!(f!, t, x, dx, xI, dxI, symIbox, δtI, params,
adaptive)
Expand Down
Loading