Search for dissertations about: "Newtons method"

Showing result 1 - 5 of 25 swedish dissertations containing the words Newtons method.

2. 1. Inference techniques for stochastic nonlinear system identification with application to the Wiener-Hammerstein models

   Author : Giuseppe Giordano; Chalmers tekniska högskola; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; nonlinear systems; system identification; stochastic; Maximum Likelihood; Wiener-Hammerstein; Monte Carlo; Newton s method;

   Abstract : Stochastic nonlinear systems are a specific class of nonlinear systems where unknown disturbances affect the system's output through a nonlinear transformation. In general, the identification of parametric models for this kind of systems can be very challenging. READ MORE

4. 2. Algorithms in data mining using matrix and tensor methods

   Author : Berkant Savas; Lars Eldén; Lieven De Lathauwer; Linköpings universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Volume; Minimization criterion; Determinant; Rank deficient matrix; Reduced rank regression; System identification; Rank reduction; Volume minimization; General algorithm; Handwritten digit classification; Tensors; Higher order singular value decomposition; Tensor approximation; Least squares; Tucker model; Multilinear algebra; Notation; Contraction; Tensor matricization; Newton s method; Grassmann manifolds; Product manifolds; Quasi-Newton algorithms; BFGS and L-BFGS; Symmetric tensor approximation; Local intrinsic coordinates; Global embedded coordinates; ; Numerical analysis; Numerisk analys;

   Abstract : In many fields of science, engineering, and economics large amounts of data are stored and there is a need to analyze these data in order to extract information for various purposes. Data mining is a general concept involving different tools for performing this kind of analysis. READ MORE

5. 3. A Newton Method for Solving Non-Linear Optimal Control Problems with General Constraints

   Author : Henrik Jonson; Torkel Glad; Linköpings universitet; []
   Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Newton method; Non-linear; Control problems;

   Abstract : Optimal control of general dynamic systems under realistic constraints on input signals and state variables is an important problem area in control theory. Many practical control problems can be formulated as optimization tasks, and this leads toa significant demand for efficient numerical solution algorithms. READ MORE

6. 4. Mechanisms of adhesive mixing for drug particle inhalation (Numerical investigation of the interplay between formulation variables)

   Author : Mohammadreza Tamadondar; Chalmers tekniska högskola; []
   Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Discrete Element Method; Agglomerate; Carrier Particle; Adhesive mixing; Dispersion; DPI-formulation;

   Abstract : Formulation of therapeutic dry powders for lung drug delivery via inhalation is done via adhesive mixing. In this process, micron-sized active pharmaceutical ingredient particles are blended with relatively coarse carrier particles until stable adhesive units of carrier and drug particles are formed. READ MORE

7. 5. Approaches to accelerate methods for solving systems of equations arising in nonlinear optimization

   Author : David Ek; Anders Forsgren; Jacek Gondzio; KTH; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Nonlinear optimization; mathematical programming; interior-point methods; approximate solutions to systems of linear equations; method of conjugate gradients; quasi-Newton methods; modified Newton methods; Ickelinjär optimering; matematisk programmering; inre-punktsmetoder; approximativa lösningar till linjära ekvationssystem; konjugerade gradientmetoden; kvasi-Newtonmetoder; modifierade Newtonmetoder.; Optimization and Systems Theory; Optimeringslära och systemteori;

   Abstract : Methods for solving nonlinear optimization problems typically involve solving systems of equations. This thesis concerns approaches for accelerating some of those methods. In our setting, accelerating involves finding a trade-off between the computational cost of an iteration and the quality of the computed search direction. READ MORE