vecbinsolv           package:EbayesThresh           R Documentation

_S_o_l_v_e _s_y_s_t_e_m_s _o_f _n_o_n_l_i_n_e_a_r _e_q_u_a_t_i_o_n_s _b_a_s_e_d _o_n _a _m_o_n_o_t_o_n_i_c _f_u_n_c_t_i_o_n

_D_e_s_c_r_i_p_t_i_o_n:

     Solve a nonlinear equation or a vector of nonlinear equations 
     based on an increasing function in a specified interval

_U_s_a_g_e:

     vecbinsolv(zf, fun, tlo, thi, nits = 30, ... )

_A_r_g_u_m_e_n_t_s:

      zf: the right hand side of the equation(s) to be solved

     fun: an increasing function of a scalar argument, or a vector of
          such functions

     tlo: lower limit of interval over which the solution is sought

     thi: upper limit of interval over which the solution is sought

    nits: number of binary subdivisions carried out

     ...: additional arguments to the function 'fun'

_D_e_t_a_i_l_s:

     If 'fun' is a scalar monotone function, the routine finds a vector
     't' the same length as 'zf' such that,  component-wise, fun(t) =
     zf,  where this is possible within the interval (tlo, thi).  The
     relevant value returned is the nearer extreme to the solution if
     there  is no solution in the specified range for any particular
     component of 'zf'. The routine will also work if 'fun' is a vector
     of monotone functions,  allowing different functions to be
     considered for different components.   The interval over which the
     search is conducted has to be the same for each  component.

     The accuracy of the solution is determined by the number of binary
     subdivisions; if nits=30 then the solution(s) will be accurate to
     about 9 orders of  magnitude less than the length of the original
     interval (tlo,thi).

_A_u_t_h_o_r(_s):

     Bernard Silverman

_R_e_f_e_r_e_n_c_e_s:

     See 'ebayesthresh' and <URL: http://www.bernardsilverman.com>

