@@ -407,7 +407,6 @@ def perform(self, node, inputs, outputs):
407407 trans = self .trans ,
408408 unit_diagonal = self .unit_diagonal ,
409409 check_finite = self .check_finite ,
410- overwrite_b = self .overwrite_b ,
411410 )
412411
413412 def L_op (self , inputs , outputs , output_gradients ):
@@ -436,7 +435,6 @@ def solve_triangular(
436435 trans : int | str = 0 ,
437436 lower : bool = False ,
438437 unit_diagonal : bool = False ,
439- overwrite_b : bool = False ,
440438 check_finite : bool = True ,
441439 b_ndim : int | None = None ,
442440) -> TensorVariable :
@@ -462,8 +460,6 @@ def solve_triangular(
462460 Whether to check that the input matrices contain only finite numbers.
463461 Disabling may give a performance gain, but may result in problems
464462 (crashes, non-termination) if the inputs do contain infinities or NaNs.
465- overwrite_b: bool, optional
466- If True, memory allocated to input B will be re-used for the output. Default is False.
467463 b_ndim : int
468464 Whether the core case of b is a vector (1) or matrix (2).
469465 This will influence how batched dimensions are interpreted.
@@ -475,7 +471,6 @@ def solve_triangular(
475471 trans = trans ,
476472 unit_diagonal = unit_diagonal ,
477473 check_finite = check_finite ,
478- overwrite_b = overwrite_b ,
479474 b_ndim = b_ndim ,
480475 )
481476 )(a , b )
@@ -541,8 +536,6 @@ def solve(
541536 lower = False ,
542537 check_finite = True ,
543538 transposed = False ,
544- overwrite_a = False ,
545- overwrite_b = False ,
546539 b_ndim : int | None = None ,
547540):
548541 """Solves the linear equation set ``a * x = b`` for the unknown ``x`` for square ``a`` matrix.
@@ -580,10 +573,6 @@ def solve(
580573 (crashes, non-termination) if the inputs do contain infinities or NaNs.
581574 assume_a : str, optional
582575 Valid entries are explained above.
583- overwrite_a: bool, optional
584- If True, use A as a work space to avoid allocating new memory. Default is False
585- overwrite_b: bool, optional
586- If True, use B to store result. Otherwise, allocate new memory. Default is False
587576 transposed: bool, optional
588577 If True, solve ``A.T @ x = b``
589578 b_ndim : int
@@ -598,8 +587,6 @@ def solve(
598587 assume_a = assume_a ,
599588 b_ndim = b_ndim ,
600589 transposed = transposed ,
601- overwrite_a = overwrite_a ,
602- overwrite_b = overwrite_b ,
603590 )
604591 )(a , b )
605592
0 commit comments