Skip to content
Merged
Changes from 1 commit
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
6 changes: 3 additions & 3 deletions dpnp/dpnp_iface_linearalgebra.py
Original file line number Diff line number Diff line change
Expand Up @@ -457,7 +457,7 @@ def einsum(
)


def einsum_path(*operands, optimize="greedy", einsum_call=False):
def einsum_path(*operands, optimize="greedy"):
"""
einsum_path(subscripts, *operands, optimize="greedy")

Expand All @@ -483,7 +483,7 @@ def einsum_path(*operands, optimize="greedy", einsum_call=False):
* if a list is given that starts with ``einsum_path``, uses this as the
contraction path
* if ``False`` or ``None`` no optimization is taken
* if ``True`` defaults to the "greedy" algorithm
* if ``True`` defaults to the ``"greedy"`` algorithm
* ``"optimal"`` is an algorithm that combinatorially explores all
possible ways of contracting the listed tensors and chooses the
least costly path. Scales exponentially with the number of terms
Expand Down Expand Up @@ -586,7 +586,7 @@ def einsum_path(*operands, optimize="greedy", einsum_call=False):
return numpy.einsum_path(
*operands,
optimize=optimize,
einsum_call=einsum_call,
einsum_call=False,
)


Expand Down
Loading