From ea75ce8c017faa4594cdc28a4068faaa51c37fc7 Mon Sep 17 00:00:00 2001 From: Alexander Seiler Date: Tue, 4 Apr 2023 03:54:16 +0200 Subject: [PATCH] Fix some typos Signed-off-by: Alexander Seiler --- docs/src/solvers/solvers.md | 4 ++-- test/sparse_vector.jl | 2 +- 2 files changed, 3 insertions(+), 3 deletions(-) diff --git a/docs/src/solvers/solvers.md b/docs/src/solvers/solvers.md index 345a88f3f..3b75c7b07 100644 --- a/docs/src/solvers/solvers.md +++ b/docs/src/solvers/solvers.md @@ -1,6 +1,6 @@ # [Linear System Solvers](@id linearsystemsolvers) -`solve(prob::LinearProlem,alg;kwargs)` +`solve(prob::LinearProblem,alg;kwargs)` Solves for ``Au=b`` in the problem defined by `prob` using the algorithm `alg`. If no algorithm is given, a default algorithm will be chosen. @@ -171,7 +171,7 @@ subroutines from the book "Computer Solution of Large Sparse Positive Definite Systems" by Alan George and Joseph Liu. Originally written in Fortran 77, later rewritten in Fortran 90. Here is the software translated into Julia. The Julia rewrite is released under the MIT license with an express permission -from the authors of the Fortran package. The package uses mutiple +from the authors of the Fortran package. The package uses multiple dispatch to route around standard BLAS routines in the case e.g. of arbitrary-precision floating point numbers or ForwardDiff.Dual. This e.g. allows for Automatic Differentiation (AD) of a sparse-matrix solve. diff --git a/test/sparse_vector.jl b/test/sparse_vector.jl index 7af5b469f..63fc75355 100644 --- a/test/sparse_vector.jl +++ b/test/sparse_vector.jl @@ -37,7 +37,7 @@ n = length(x0) hess_mat = sparse(rowval, colval, hess_sparse(x0), n, n) grad_vec = sparsevec(gradinds, grad_sparse(x0), n) -# # Converting grad_vec to dense succeds in solving +# # Converting grad_vec to dense succeeds in solving prob = LinearProblem(hess_mat, grad_vec) linsolve = init(prob) @test solve(linsolve).u ≈ hess_mat \ Array(grad_vec)