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 14 of 14 for “"QUADRATIC CONVERGENCE"”.

  1. Intersection Algorithms Based On Geometric Intervals

    … these new algorithms generally exhibit cubic convergence, improving on the observed quadratic convergence rate of Bézier clipping. This is achieved without significantly increasing computational complexity at each iteration. Timing tests show that the geometric interval algorithm is generally …

    byu Repository record for Intersection Algorithms Based On Geometric Intervals (opens in a new tab)

  2. IMPLEMENTATION OF A VERTICALLY INTEGRATED ICE SHEET MOMENTUM BALANCE MODEL

    … are to develop a model which converges quickly (quadratic convergence rates) for non-Newtonian Stokes flow approximations, and to provide a clear and low-level discussion of its derivation, variation and discretization. The model utilizes the Finite Element Method to discretize variational forms …

    montana-tech Repository record for IMPLEMENTATION OF A VERTICALLY INTEGRATED ICE SHEET MOMENTUM BALANCE MODEL (opens in a new tab)

  3. IMPLEMENTATION OF A VERTICALLY INTEGRATED ICE SHEET MOMENTUM BALANCE MODEL

    … are to develop a model which converges quickly (quadratic convergence rates) for non-Newtonian Stokes flow approximations, and to provide a clear and low-level discussion of its derivation, variation and discretization. The model utilizes the Finite Element Method to discretize variational forms …

    montana Repository record for IMPLEMENTATION OF A VERTICALLY INTEGRATED ICE SHEET MOMENTUM BALANCE MODEL (opens in a new tab)

  4. A method to significantly improve finite element stress predictions

    … that the stresses of the new method converge quadratically in ID and 2D solutions, i.e. with the same order as the displacements, and conclude that the new stress improvement method shows much promise for the analysis of solids, structures and multiphysics problems, to calculate improved …

    mit Repository record for A method to significantly improve finite element stress predictions (opens in a new tab)

  5. Geometry of Feedback Control and Learning

    … study optimal control problems, e.g. linear-quadratic-regulator (LQR), least squares stationary optimal control, linear quadratic (LQ) dynamic games, through the lens of first-order algorithms. The developed theories on these topics are largely derived from model-based dynamic programming. …

    washington Repository record for Geometry of Feedback Control and Learning (opens in a new tab)

  6. Investigation of general-purpose computing on graphics processing units and its application to the finite element analysis of electromagnetic problems

    … the number of nonlinear iterations through its quadratic convergence. Various nonlinear examples are presented to show the different Kerr effects observed through the third-order nonlinearity. With the acceleration using MPI+GPU under large cluster environments, the solution times for the …

    uiuc Repository record for Investigation of general-purpose computing on graphics processing units and its application to the finite element analysis of electromagnetic problems (opens in a new tab)

  7. Levenberg-Marquardt Algorithms for Nonlinear Equations, Multi-objective Optimization, and Complementarity Problems

    … to be a valuable principle for obtaining fast convergence to a solution of the nonlinear system if the classical nonsingularity assumption is replaced by a weaker error bound condition. In this way also problems with nonisolated solutions can be treated successfully. Such problems increasingly …

    qucosa-diss

  8. Topology Optimization Using Load Path and Homogenization

    … using the Gauss- Newton method which has a quadratic convergence, speeding up the convergence towards the optimal structure.</p>

    embry-riddle Repository record for Topology Optimization Using Load Path and Homogenization (opens in a new tab)

  9. A first-order method for the extremization of constrained and unconstrained functions

    … 0 of the performance index is sought by applying quadratically convergent algorithms for unconstrained function minimization: the (n+qj-vector Y = [x,^]T is the independent variable associated with the performance index R(y). Since the performance index R(y) involves the first derivatives f and …

    rice Repository record for A first-order method for the extremization of constrained and unconstrained functions (opens in a new tab)

  10. Solving The Prandtl Boundary Layer Equation in Fluid Dynamics Via Non-Linear Numerical Optimization

    … BFGS Quasi-Newton iteration is applied with a quadratic convergence rate [41][43] while the conventional FVM converges linearly using the SIMPLE iteration approach. In this work, an Objective Function (or Penalty Function) and a gradient vector, as well as a Golden Section Search or Equality …

    claremont Repository record for Solving The Prandtl Boundary Layer Equation in Fluid Dynamics Via Non-Linear Numerical Optimization (opens in a new tab)

  11. A variational multiscale framework for non-Newtonian fluid models

    … computational algorithms that are based on quadratic convergence properties of consistent tangent tensors are derived for efficient nonlinear solution of the system of equations. The new methods are implemented for equal-order linear and quadratic finite elements in two and three-dimensional …

    uiuc Repository record for A variational multiscale framework for non-Newtonian fluid models (opens in a new tab)

  12. On the performance of distributed algorithms for network optimization problems

    … under certain conditions we can improve their convergence. Finally, we study an important problem within engineering and computer science, namely, network resource allocation. For solving this problem, we propose distributed Lagrangian methods and show that our methods are robust to resource …

    uiuc Repository record for On the performance of distributed algorithms for network optimization problems (opens in a new tab)

  13. Jacobi-type methods on semisimple Lie algebras : a Lie algebraic approach to numerical linear algebra

    Es wird eine Lie-algebraische Verallgemeinerung sowohl des klassischen als auch des Sortier-Jacobi-Verfahrens für das symmetrische Eigenwertproblem behandelt. Der koordinatenfreie Zugang ermöglicht durch eine neue Betrachtungsweise die Vereinheitlichung strukturierter Eigen- und …

    wurz-thes Repository record for Jacobi-type methods on semisimple Lie algebras : a Lie algebraic approach to numerical linear algebra (opens in a new tab)

  14. ΝΕΕΣ ΜΕΘΟΔΟΙ ΕΠΙΛΥΣΗΣ ΣΥΣΤΗΜΑΤΩΝ ΜΗ ΓΡΑΜΜΙΚΩΝ ΑΛΓΕΒΡΙΚΩΝ Η/ΚΑΙ ΥΠΕΡΒΑΤΙΚΩΝ ΕΞΙΣΩΣΕΩΝ

    … A SEQUENCE OF POINTS IN IR WHICH CONVERGES QUADRATICALLY TO ONE COMPONENT OF THE SOLUTION AND AFTERWARDS IT EVALUATES THE OTHER COMPONENT USING ONE SIMPLE COMPUTATION. IT DOES NOT REQUIRE A GOOD INITIAL GUESS OF THE SOLUTION AND IT DOES NOT DIRECTLY NEED FUNCTION EVALUATIONS. A PROOF OF …

    greece Repository record for ΝΕΕΣ ΜΕΘΟΔΟΙ ΕΠΙΛΥΣΗΣ ΣΥΣΤΗΜΑΤΩΝ ΜΗ ΓΡΑΜΜΙΚΩΝ ΑΛΓΕΒΡΙΚΩΝ Η/ΚΑΙ ΥΠΕΡΒΑΤΙΚΩΝ ΕΞΙΣΩΣΕΩΝ (opens in a new tab)