diff options
| author |  brett koonce <koonce@hello.com> | 2018-03-17 12:22:23 -0700 |
|---|---|---|
| committer |  Shanqing Cai <cais@google.com> | 2018-03-17 15:22:23 -0400 |
| commit | 705afa34fc4540593b6aa6dc6dd22ae02d41abea (patch) | |
| tree | 15709ee714354257acf748f9580028beb8ccc9c5 /tensorflow/contrib/solvers/python | |
| parent | 6e20f3bdbdaf9bae2a67ee9cc9728963bc8b563f (diff) | |
contrib: minor spelling tweaks (#17788)
packages:
model_pruning
rnn
solvers
tensorrt
Diffstat (limited to 'tensorflow/contrib/solvers/python')
| -rw-r--r-- | tensorflow/contrib/solvers/python/ops/least_squares.py | 2 | ||||
| -rw-r--r-- | tensorflow/contrib/solvers/python/ops/linear_equations.py | 2 |
2 files changed, 2 insertions, 2 deletions
diff --git a/tensorflow/contrib/solvers/python/ops/least_squares.py b/tensorflow/contrib/solvers/python/ops/least_squares.py index fb7c0eb649..6e164f5342 100644 --- a/tensorflow/contrib/solvers/python/ops/least_squares.py +++ b/tensorflow/contrib/solvers/python/ops/least_squares.py @@ -33,7 +33,7 @@ def cgls(operator, rhs, tol=1e-6, max_iter=20, name="cgls"): r"""Conjugate gradient least squares solver. Solves a linear least squares problem \\(||A x - rhs||_2\\) for a single - righ-hand side, using an iterative, matrix-free algorithm where the action of + right-hand side, using an iterative, matrix-free algorithm where the action of the matrix A is represented by `operator`. The CGLS algorithm implicitly applies the symmetric conjugate gradient algorithm to the normal equations \\(A^* A x = A^* rhs\\). The iteration terminates when either diff --git a/tensorflow/contrib/solvers/python/ops/linear_equations.py b/tensorflow/contrib/solvers/python/ops/linear_equations.py index d791d46763..9305c6a11c 100644 --- a/tensorflow/contrib/solvers/python/ops/linear_equations.py +++ b/tensorflow/contrib/solvers/python/ops/linear_equations.py @@ -41,7 +41,7 @@ def conjugate_gradient(operator, r"""Conjugate gradient solver. Solves a linear system of equations `A*x = rhs` for selfadjoint, positive - definite matrix `A` and righ-hand side vector `rhs`, using an iterative, + definite matrix `A` and right-hand side vector `rhs`, using an iterative, matrix-free algorithm where the action of the matrix A is represented by `operator`. The iteration terminates when either the number of iterations exceeds `max_iter` or when the residual norm has been reduced to `tol` |