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 63 for “"Newton method"”.

  1. Parallel Gauss-Newton method for CP decomposition

    In this thesis, we formulate the Gauss-Newton algorithm to make it viable for running on distributed memory architectures and comparative to Alternating least squares algorithm for CP decomposition. Alternating least squares may exhibit slow or no convergence, especially when high accuracy is …

    uiuc Repository record for Parallel Gauss-Newton method for CP decomposition (opens in a new tab)

  2. Shape optimization using a matrix-free Newton method

    Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.

    mit Repository record for Shape optimization using a matrix-free Newton method (opens in a new tab)

  3. Aeroelastic analysis and sensitivity calculations using the Newton method

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 1995.

    mit Repository record for Aeroelastic analysis and sensitivity calculations using the Newton method (opens in a new tab)

  4. A Newton Method For The Continuation Of Invariant Tori

    This thesis proposes a novel method for locating a p-dimensional invariant torus of an n-dimensional map. A set of non-linear equations is formulated and solved using the Newton-Raphson scheme. The method requires a set of sampled points on a guess invariant torus. An interpolant is passed through …

    vt Repository record for A Newton Method For The Continuation Of Invariant Tori (opens in a new tab)

  5. The Computational Kleinman-Newton Method in Solving Nonlinear Nonquadratic Control Problems

    … system and a related iterative numerical method, the Kleinman-Newton method, for solving the problem. The thesis proves the local convergence of Kleinman-Newton method using the contraction mapping theorem and then describes how this Kleinman-Newton method may be used to numerically solve …

    vt Repository record for The Computational Kleinman-Newton Method in Solving Nonlinear Nonquadratic Control Problems (opens in a new tab)

  6. Analytical study of the Least Squares Quasi-Newton method for interaction problems

    … thesis to find, describe and analyze solution methods to solve the equations resulting from the mathematical models describing those interacting systems. Even if powerful solvers often already exist for problems in a single physical domain (e.g. structural or fluid problems), the development of …

    ghent Repository record for Analytical study of the Least Squares Quasi-Newton method for interaction problems (opens in a new tab)

  7. Analysis of Multi-Physics Problems: A Multi-Level Newton Method for Non-Conforming Interfaces

    The suggested algorithm is extended to accommodate non-conforming interface meshes by accurately transferring the boundary data of one domain to another. The data transfer procedure satisfies the convergence and conservation requirements by employing the common refinement based discretization of …

    uiuc Repository record for Analysis of Multi-Physics Problems: A Multi-Level Newton Method for Non-Conforming Interfaces (opens in a new tab)

  8. Location of stable and unstable equilibrium configurations using a model trust region quasi-Newton method and tunnelling

    A hybrid method consists of a quasi-Newton method and a homotopy method for locating multiple equilibrium configurations has been proposed recently. The hybrid method combined the efficiency of a quasi-Newton method capable of locating stable and unstable equilibrium solutions with a robust …

    vt Repository record for Location of stable and unstable equilibrium configurations using a model trust region quasi-Newton method and tunnelling (opens in a new tab)

  9. The updated subspaces method in optimization and in solving linear systems of equations

    The Updated Conjugate Subspaces method, an modified quasi-Newton method for solving nonlinear unconstrained minimization problems, has flexibility of choosing different quadratic approximation at each iteration and therefore has potential of improving the rate of convergence given by the …

    uiuc Repository record for The updated subspaces method in optimization and in solving linear systems of equations (opens in a new tab)

  10. A modified augmented Lagrangian merit function, and Q-superlinear characterization results for primal-dual Quasi-Newton interior-point method for nonlinear programming

    Two classes of primal-dual interior-point methods for nonlinear programming are studied. The first class corresponds to a path-following Newton method formulated in terms of the nonnegative variables rather than all primal and dual variables. The centrality condition is a relaxation of the …

    rice Repository record for A modified augmented Lagrangian merit function, and Q-superlinear characterization results for primal-dual Quasi-Newton interior-point method for nonlinear programming (opens in a new tab)

  11. Determination and interpretation of earthquake source locations in Sichuan Province, China

    … To achieve these objectives, the Gauss-Newton method is applied iteratively to find the nonlinear least squares solution. The Monte Carlo method and the Gauss- Newton method were jointly used to locate events and simultaneously optimize the crust model. The iterative station correction …

    mit Repository record for Determination and interpretation of earthquake source locations in Sichuan Province, China (opens in a new tab)

  12. Quasi-Newton Methods for Nonlinear Programming

    … class of symmetric updates for use in a quasi-Newton method for nonlinear programming. We show how these updates model the underlying nonlinear equation better than the standard symmetric updates and also how they require less overall work for large problems.

    uiuc Repository record for Quasi-Newton Methods for Nonlinear Programming (opens in a new tab)

  13. Defect correction based domain decomposition methods for some nonlinear problems

    … a class of nonoverlapping domain decomposition methods offer several advantages in the ways they split a complex problem into several subdomain problems with less complexity. The schemes need a nonlinear solver to take care of the residual at the interface. The adaptive-∝ solver can converge …

    greenwich Repository record for Defect correction based domain decomposition methods for some nonlinear problems (opens in a new tab)

  14. Estudio de la dinámica del método de Newton amortiguado

    … Specifically, we studied the iterative method known as damped Newton method, which is a modification of the classical Newton method. This method generates a sequence depending on a damping parameter, which in suitable conditions, converges to the desired solution. The thesis shows the …

    dialnet Repository record for Estudio de la dinámica del método de Newton amortiguado (opens in a new tab)

  15. Co-processor offloading applied to passive coherent location with Doppler and bearing data

    … differential correction (also known as the Gauss-Newton method) and uses Doppler and bearing data from a Passive Coherent Location (PCL) radar system. A PCL radar uses a network of receivers to track targets through their back-scatter from existing Continuous Wave (CW) transmissions, such as …

    cape-town Repository record for Co-processor offloading applied to passive coherent location with Doppler and bearing data (opens in a new tab)

  16. Scalable second-order Riemannian optimization for K-means clustering

    … implement the cubic-regularized Riemannian Newton method by exploiting the structure of the Hessian. Numerical results show that our proposed algorithm converges faster while achieving similar accuracy compared with existing methods.

    uiuc Repository record for Scalable second-order Riemannian optimization for K-means clustering (opens in a new tab)

  17. Forward and inverse American option pricing via a complementarity approach

    … discretization schemes, a finite difference method and a finite element method, for the discretization of the complementarity systems into a collection of linear complementarity problems (LCPs). In Chapter 3, we discuss four popular existing numerical algorithms---a PSOR method, a two phase …

    uiuc Repository record for Forward and inverse American option pricing via a complementarity approach (opens in a new tab)

  18. One-dimensional simulation of vertical-cavity surface-emitting lasers including energy transport

    … is solved self-consistently with the full-Newton method. The calculated temperature increase within the structure results in experimentally observed degradation in performance in the L-I curve as well as in the modulation response. This is due to the shift in the gain spectrum away from the …

    uiuc Repository record for One-dimensional simulation of vertical-cavity surface-emitting lasers including energy transport (opens in a new tab)

  19. Energy management for a multiple-pulse missile

    … which is solved using a second-order, quasi-Newton method with constraint projection. The two solutions are found to compare well. This result allows confidence in the use of the nonlinear-programming technique to solve optimization problems in flight mechanics for which no analytical …

    vt Repository record for Energy management for a multiple-pulse missile (opens in a new tab)

  20. Gauss-newton Based Learning For Fully Recurrent Neural Networks

    … of RTRL is presented, that is based on the Gauss-Newton method. The method itself is an approximate Newton's method tailored to the specific optimization problem, (non-linear least squares), which aims to speed up the process of FRNN training. The new approach stands as a robust and effective …

    ucf

Page 1 of 4