MCPcopy Create free account

hub / github.com/b45ch1/algopy / functions

Functions1,636 in github.com/b45ch1/algopy

↓ 2 callersFunctioneval_hess_f_eigh
compute the hessian of f in the forward mode of AD
documentation/sphinx/examples/matrixexponential.py:104
↓ 2 callersMethodeval_jac_g_forward
(self, x)
documentation/sphinx/examples/ampl_minimization_problem.py:29
↓ 2 callersFunctionexpm_pade
Compute the matrix exponential using a fixed-order Pade approximation.
algopy/linalg/compound.py:75
↓ 2 callersMethodextract_UTPM_jacobian
(self)
algopy/tracer/tracer.py:1337
↓ 2 callersFunctionf
(x)
experimental/performance_tests/comparison_forward_reverse.py:33
↓ 2 callersFunctiongamma
i and j multi-indices
experimental/exact_interpolation.py:52
↓ 2 callersFunctiongauss_algopy
(eval_f, x0, tol=10e-5)
documentation/sphinx/examples/gauss_newton.py:8
↓ 2 callersFunctionge
(a,b)
experimental/tests/scalar_reverse.py:645
↓ 2 callersFunctiongen_named_functions
()
algopy/tests/test_nthderiv.py:59
↓ 2 callersFunctiongenerate_permutations
(in_x)
experimental/exact_interpolation.py:36
↓ 2 callersFunctionget_Q
Notation is from Yang and Nielsen 2008. The first group of args consists of precomputed ndarrays. The second group is only the fixation f
documentation/sphinx/examples/codon_model.py:578
↓ 2 callersFunctiongradient
(f,in_x)
experimental/exact_interpolation.py:200
↓ 2 callersFunctiongradient_from_graph
(cg,x=None)
experimental/vectorized_taylor_arithmetic.py:652
↓ 2 callersFunctiongt
(a,b)
experimental/tests/scalar_reverse.py:651
↓ 2 callersFunctionheaviside
(x)
documentation/sphinx/examples/if_then_else.py:16
↓ 2 callersMethodhessian
computes the Hessian H = self.hessian(x) Parameters ---------- x: array_like x.ndim == 1 Return
algopy/tracer/tracer.py:450
↓ 2 callersFunctionhouse
computes the Householder vector v and twice its norm beta (v,beta) = house(x) Parameters ---------- x: array_like l
documentation/sphinx/examples/householder_qr.py:3
↓ 2 callersMethodhyp0f1
computes y = hyp0f1(b, x) in UTP arithmetic
algopy/utpm/utpm.py:834
↓ 2 callersMethodhyp2f0
computes y = hyp2f0(a1, a2, x) in UTP arithmetic
algopy/utpm/utpm.py:811
↓ 2 callersFunctionincrement
this is a helper function for a summation of the type :math:`sum_{0 <= k <= i}`, where i and k are multi-indices. Parameters
algopy/exact_interpolation.py:165
↓ 2 callersMethodinit_UTPM_jacobian
(self)
algopy/tracer/tracer.py:1334
↓ 2 callersFunctionis_set
(o)
algopy/tracer/tracer.py:20
↓ 2 callersFunctionle
(a,b)
experimental/tests/scalar_reverse.py:657
↓ 2 callersFunctionlt
(a,b)
experimental/tests/scalar_reverse.py:663
↓ 2 callersMethodlu
univariate Taylor arithmetic of scipy.linalg.lu
algopy/utpm/utpm.py:2146
↓ 2 callersFunctionmtime
experimental/performance_tests/adolc_implementation_for_speed_comparison/main.cpp:7
↓ 2 callersFunctionmul
(D,x_data, y_data, z_data)
experimental/pullback_alternative.py:3
↓ 2 callersFunctionne
(a,b)
experimental/tests/scalar_reverse.py:675
↓ 2 callersFunctionones_like
generic implementation of numpy.ones_like
algopy/globalfuncs.py:240
↓ 2 callersMethodpb_eigh1
(cls, Lbar, Qbar, bbar_list, A, L, Q, b_list, out = None)
algopy/utpm/utpm.py:2777
↓ 2 callersMethodpb_logdet
(cls, ybar, x, y, out = None)
algopy/utpm/utpm.py:1495
↓ 2 callersMethodpb_lu2
(cls, PIVbar, Lbar, Ubar, A, PIV, L, U, out = None)
algopy/utpm/utpm.py:2239
↓ 2 callersMethodpb_mul
(cls, zbar, x, y , z, out = None)
algopy/utpm/utpm.py:2392
↓ 2 callersMethodpb_prod
(cls, ybar, x, y, out=None)
algopy/utpm/utpm.py:1233
↓ 2 callersMethodpb_qr_full
(cls, Qbar, Rbar, A, Q, R, out = None)
algopy/utpm/utpm.py:2701
↓ 2 callersMethodpb_sum
(cls, ybar, x, y, axis, dtype, out2, out = None)
algopy/utpm/utpm.py:1194
↓ 2 callersMethodpb_svd
(cls, Ubar, sbar, Vbar, A, U, s, V, out = None)
algopy/utpm/utpm.py:2959
↓ 2 callersMethodpb_truediv
(cls, zbar, x, y, z, out=None)
algopy/utpm/utpm.py:2449
↓ 2 callersFunctionpbr_mul
(D, x_data, y_data, z_data, zbar_data, xbar_data, ybar_data)
experimental/pullback_alternative.py:10
↓ 2 callersFunctionqr_house
computes QR decomposition using Householder relections (Q,R) = qr_house(A) such that 0 = Q R - A 0 = dot(Q.T,Q) - eye(M)
documentation/sphinx/examples/householder_qr.py:46
↓ 2 callersMethodset_zero
(self)
experimental/vectorized_taylor_arithmetic.py:66
↓ 2 callersFunctionshow_local_curvature
(f, g, h, x0)
documentation/sphinx/examples/minimization/minhelper.py:35
↓ 2 callersMethodsolve
(self,rhs)
algopy/tracer/tracer.py:1196
↓ 2 callersMethodsvd
(self)
algopy/tracer/tracer.py:1193
↓ 2 callersFunctionsym_ddf
(x)
experimental/tests/trash/unit_test_with_sympy_x_as_matrix_input.py:79
↓ 2 callersFunctionsym_df
(x)
experimental/tests/trash/unit_test_with_sympy_x_as_matrix_input.py:72
↓ 2 callersFunctionsym_df
(x)
experimental/tests/trash/unit_test_with_sympy.py:65
↓ 2 callersFunctiontape
(f,in_x)
experimental/vectorized_taylor_arithmetic.py:641
↓ 2 callersMethodtile
UTPM implementation of numpy.tile(A, reps)
algopy/utpm/utpm.py:3173
↓ 2 callersFunctiontransform_params
(Y)
documentation/sphinx/examples/preferred_nucleotide.py:96
↓ 2 callersFunctionvdot
vectorized dot z = vdot(x,y) Rationale: given two iteratable containers (list,array,...) x and y this function compute
algopy/utpm/algorithms.py:162
↓ 2 callersMethodvec_jac
computes the Jacobian-vector product w^T*J of a function F:R^N --> R^M in the reverse mode wJ = self.vec_jac(w, x) Paramete
algopy/tracer/tracer.py:407
↓ 2 callersFunctionzeros_like
generic implementation of numpy.zeros_like
algopy/globalfuncs.py:230
↓ 2 callersMethodzeros_like
(self)
experimental/utps/utps.py:182
↓ 1 callersFunctionF
(p,q,ts,Sigma, etas)
experimental/examples/gradient_of_optimal_experimental_design_objective_function.py:54
↓ 1 callersFunctionF
(p,q,ts,Sigma, etas)
experimental/examples/q-robust-OED.py:66
↓ 1 callersFunctionF
(p,q,ts,Sigma, etas)
experimental/examples/q_robust_OED.py:71
↓ 1 callersFunctionH_fcn
(x)
documentation/AD_tutorial_TU_Berlin/example7_simple_computation_of_the_hessian.py:27
↓ 1 callersFunctionO_tilde
this is the objective function
documentation/sphinx/examples/minimal_surface.py:4
↓ 1 callersFunctionP
(x, s, alpha)
documentation/sphinx/examples/minimal_surface.py:58
↓ 1 callersFunctionPhi
(F)
experimental/examples/newtons_method.py:22
↓ 1 callersFunctionPhi
prototypical OED objective function
experimental/examples/q-robust-OED.py:71
↓ 1 callersFunctionPhi
prototypical OED objective function
experimental/examples/q_robust_OED.py:83
↓ 1 callersMethod__itruediv__
(self,rhs)
experimental/vectorized_taylor_arithmetic.py:122
↓ 1 callersMethod__repr__
(self)
experimental/sparse_test.py:13
↓ 1 callersMethod__repr__
human readable output of the UTPS object or debugging UTPS([1,2,3]).__repr__()
experimental/utps/utps.py:189
↓ 1 callersMethod__scalar_to_data__
(cls, xdata, x)
experimental/ctps/ctps.py:28
↓ 1 callersMethod__str__
(self)
algopy/utpm/utpm.py:1648
↓ 1 callersMethod__str__
(self)
experimental/vectorized_taylor_arithmetic.py:395
↓ 1 callersMethod__str__
(self)
experimental/sequential_tape_prototype.py:16
↓ 1 callersMethod__str__
(self)
experimental/ctps/ctps.py:70
↓ 1 callersMethod_arccos
(cls, x_data, out = None)
algopy/utpm/algorithms.py:962
↓ 1 callersMethod_arcsin
(cls, x_data, out = None)
algopy/utpm/algorithms.py:944
↓ 1 callersMethod_arctan
(cls, x_data, out = None)
algopy/utpm/algorithms.py:980
↓ 1 callersMethod_argmax
(cls, a_data, axis = None)
algopy/utpm/algorithms.py:578
↓ 1 callersMethod_botched_clip
In this function the args are permuted w.r.t numpy.
algopy/utpm/algorithms.py:777
↓ 1 callersMethod_cholesky
compute the choleksy decomposition in Taylor arithmetic of a symmetric positive definite matrix A i.e. ..math:
algopy/utpm/algorithms.py:1512
↓ 1 callersMethod_compare_pre_release
Compare alpha/beta/rc/final.
algopy/_npversion.py:99
↓ 1 callersMethod_compare_version
Compare major.minor.bugfix
algopy/_npversion.py:78
↓ 1 callersMethod_diag_pullback
computes tr(ybar.T, dy) = tr(xbar.T,dx) where y = diag(x)
algopy/utpm/algorithms.py:2397
↓ 1 callersMethod_dot_non_UTPM_x
z = dot(x,y)
algopy/utpm/algorithms.py:1235
↓ 1 callersMethod_dot_non_UTPM_y
z = dot(x,y)
algopy/utpm/algorithms.py:1213
↓ 1 callersMethod_dot_pullback
(cls, zbar_data, x_data, y_data, z_data, out = None)
algopy/utpm/algorithms.py:1201
↓ 1 callersMethod_eigh
computes the eigenvalue decompositon L,Q = eig(A) for symmetric matrix A with possibly repeated eigenvalues, i.e. w
algopy/utpm/algorithms.py:1929
↓ 1 callersMethod_eigh1_pullback
(cls, Lambar_data, Qbar_data, A_data, Lam_data, Q_data, b_list, out = None)
algopy/utpm/algorithms.py:2189
↓ 1 callersMethod_eigh_pullback
(cls, lambar_data, Qbar_data, A_data, lam_data, Q_data, out = None)
algopy/utpm/algorithms.py:2140
↓ 1 callersMethod_erf
(cls, x_data, out=None)
algopy/utpm/algorithms.py:1036
↓ 1 callersMethod_erfi
(cls, x_data, out=None)
algopy/utpm/algorithms.py:1049
↓ 1 callersMethod_expit
(cls, x_data, out=None)
algopy/utpm/algorithms.py:744
↓ 1 callersMethod_expm1
(cls, x_data, out=None)
algopy/utpm/algorithms.py:718
↓ 1 callersFunction_expm_pade13
Helper function for Pade approximation of expm.
algopy/linalg/compound.py:166
↓ 1 callersFunction_expm_pade3
Helper function for Pade approximation of expm.
algopy/linalg/compound.py:123
↓ 1 callersFunction_expm_pade5
Helper function for Pade approximation of expm.
algopy/linalg/compound.py:132
↓ 1 callersFunction_expm_pade7
Helper function for Pade approximation of expm.
algopy/linalg/compound.py:142
↓ 1 callersFunction_expm_pade9
Helper function for Pade approximation of expm.
algopy/linalg/compound.py:153
↓ 1 callersMethod_floordiv
z = x // y use L'Hospital's rule when leading coefficients of y_data are zero
algopy/utpm/algorithms.py:429
↓ 1 callersMethod_gammaln
(cls, x_data, out=None)
algopy/utpm/algorithms.py:1159
↓ 1 callersMethod_inv_pullback
(cls, ybar_data, x_data, y_data, out = None)
algopy/utpm/algorithms.py:1358
↓ 1 callersMethod_itruediv
(cls, z_data, x_data)
algopy/utpm/algorithms.py:371
↓ 1 callersMethod_log1p
(cls, x_data, out=None)
algopy/utpm/algorithms.py:841
← previousnext →301–400 of 1,636, ranked by callers