Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 84 for “"root-finding"”.

  1. Square Root Finding In Graphs

    Abstract: Root and root finding are concepts familiar to most branches of mathematics. In graph theory, H is a square root of G and G is the square of H if two vertices x,y have an edge in G if and only if x,y are of distance at most two in H. Graph square is a basic operation with a number of …

    brock Repository record for Square Root Finding In Graphs (opens in a new tab)

  2. Polynomial Real Root Finding in Bernstein Form

    … in floating-point arithmetic, all real roots (simple, clustered, and multiple) over the unit interval of polynomials in Bernstein form with real coefficients.

    byu Repository record for Polynomial Real Root Finding in Bernstein Form (opens in a new tab) Download PDF for Polynomial Real Root Finding in Bernstein Form (opens in a new tab)

  3. Attractor basins of various root-finding methods

    … numerical approximation methods, such as root-finding methods, can be used. The goal is, by making use of a variety of root-finding methods (Newton-Rhapson, Chebyshev, Halley and Laguerre), to gain a qualitative appreciation on how various root- finding methods address many prevailing …

    nps Repository record for Attractor basins of various root-finding methods (opens in a new tab)

  4. Probabilistic Bisection Search For Stochastic Root-Finding

    The goal of a stochastic root-finding algorithm is to locate a point x* such that g (x* ) = 0 for a given function g that can only be observed with noise. In this thesis we investigate the performance of the Probabilistic Bisection Algorithm (PBA), which is a one-dimensional stochastic root-finding …

    cornell Repository record for Probabilistic Bisection Search For Stochastic Root-Finding (opens in a new tab)

  5. A Root Finding Algorithm for Parallel Architecture Machines

    … accuracy an algorithm of determining up to ten roots, with error of approximation less than or equal to tolerance, on parallel systems like Distributed Array Processor (OAP) and N-cube is considered. A variation of the bisection method has been adapted for this purpose. At each level of …

    odu Repository record for A Root Finding Algorithm for Parallel Architecture Machines (opens in a new tab)

  6. Sampling Controlled Stochastic Recursions: Applications to Simulation Optimization and Stochastic Root Finding

    We consider unconstrained Simulation Optimization (SO) problems, that is, optimization problems where the underlying objective function is unknown but can be estimated at any chosen point by repeatedly executing a Monte Carlo (stochastic) simulation. SO, introduced more than six decades ago through …

    vt Repository record for Sampling Controlled Stochastic Recursions: Applications to Simulation Optimization and Stochastic Root Finding (opens in a new tab)

  7. Analysis of classical root-finding methods applied to digital maximum power point tracking for photovoltaic energy generation

    … examines the application of various classical root finding methods to digital maximum power point tracking (DMPPT). An overview of root finding methods such as the Newton Raphson Method (NRM), Secant Method (SM), Bisection Method (BSM), Regula Falsi Method (RFM) and a proposed Modified Regula …

    texas Repository record for Analysis of classical root-finding methods applied to digital maximum power point tracking for photovoltaic energy generation (opens in a new tab)

  8. Newton's Method

    Root-finding algorithms have been studied for ages for their various applications. Newton's Method is just one of these root-finding algorithms. This report discusses Newton's Method and aims to describe the procedures behind the method and to determine its capabilities in finding the zeros for …

    texas Repository record for Newton's Method (opens in a new tab)

  9. An accelerated dual method for SPGL1

    … solver SPGL1, which applies a general root-finding process to solve the basis pursuit denoising problem. This process involves a nested loop. The outer loop is an inexact Newton root-finding process, and the inner loop approximately solves LASSO (least absolute shrinkage and selection …

    ubc Repository record for An accelerated dual method for SPGL1 (opens in a new tab) Download PDF for An accelerated dual method for SPGL1 (opens in a new tab)

  10. VLSI implementation of an efficient method for the computation of line spectral frequencies

    … of the symmetric and antisymmetric polynomial roots limit the region which must be searched, however it is still necessary to perform a root-finding algorithm on a high-order polynomial. Certain algorithms have been developed to reduce the complexity of the root finding exercise. One such …

    rowan Repository record for VLSI implementation of an efficient method for the computation of line spectral frequencies (opens in a new tab)

  11. Domain decomposition algorithms for the solution of sparse symmetric generalized eigenvalue problems

    … categories: (1) filtering techniques, and (2) root-finding techniques. Filtering techniques are projection methods applied to a transformation of the original matrix pencil chosen so that, ideally, the eigenvalues of interest are mapped to the only nonzero eigenvalues in the transformed pencil. …

    umn Repository record for Domain decomposition algorithms for the solution of sparse symmetric generalized eigenvalue problems (opens in a new tab)

  12. An Examination of the Strengths and Weaknesses of Newton's Method for Nonlinear Optimization

    … Because Newton's method is primarily viewed as a root-finding method, we start with the basic root-finding algorithm for single variable functions and show its progression into a useful, and often efficient, multivariable optimization algorithm. Comparisons are made between a pure Newton algorithm …

    wku-diss Repository record for An Examination of the Strengths and Weaknesses of Newton's Method for Nonlinear Optimization (opens in a new tab)

  13. Complex wavenumber determination for seismo-acoustic propagation scenarios

    … characteristic equation is encountered. The roots to the characteristic equation represent the poles, or eigenvalues, for the problem and can be both subtle and difficult to calculate. Following methods previously developed [S. Ivansson et al., J. Sound Vib. 161 (1993)], a root finding …

    colo-mines Repository record for Complex wavenumber determination for seismo-acoustic propagation scenarios (opens in a new tab)

  14. Cyclic Stochastic Optimization: Generalizations, Convergence, and Applications in Multi-Agent Systems

    … class of iterative algorithms for nonlinear root-finding that can be used for minimizing a loss function, L(θ), with respect to a parameter vector θ, when only noisy observations of L(θ) or its gradient are available (through the natural connection between root-finding and minimization); SA …

    jhu Repository record for Cyclic Stochastic Optimization: Generalizations, Convergence, and Applications in Multi-Agent Systems (opens in a new tab)

  15. New Fast Polynomial Root-Finders

    Univariate polynomial root-finding has been studied for four millennia and very intensively in the last decades. Our {\em black box root-finder} involves no coefficients and works for a black box polynomial, defined by an oracle (that is, black box subroutine) for its evaluation. Such root-finders …

    cuny-grad Repository record for New Fast Polynomial Root-Finders (opens in a new tab)

  16. Iteration as an avenue for mathematical exploration

    … has to the Wada Property, bifurcation diagram, root finding, and applications in geometry are all investigated. Finally, a rationale for incorporating iteration into secondary mathematics courses to support a more robust curriculum is discussed.

    texas Repository record for Iteration as an avenue for mathematical exploration (opens in a new tab)

  17. Near-axis coherent diffractive scatter in one and two-aperture systems.

    … In addition, because this theory relies on root finding techniques to determine points of diffraction, a modification is made to the one-dimensional bisection method for use as a global root-finding technique for the case of two apertures. Comparison of theoretical and experimental data …

    arizona-thes Repository record for Near-axis coherent diffractive scatter in one and two-aperture systems. (opens in a new tab)

Page 1 of 5