• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • No language data
  • Tagged with
  • 5
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Newton method based iterative learning control for nonlinear systems

Lin, Tian January 2006 (has links)
No description available.
2

Finitely iterated inductive definitions over a predicative arithmetic

Williams, Richard Stuart January 2004 (has links)
No description available.
3

High performance stationary iterative methods

Zhu, Qiwei January 2009 (has links)
Iterative methods are well-established in the context of scientific computing. They solve a problem by finding successive approximations to the true solution starting from an initial guess. Iterative methods are preferred when dealing with large size problems, as direct methods would be prohibitively expensive. They are commonly used for solving polynomial systems, systems of linear equations, and partial differential equations. Iterative methods normally make heavy demands on computational resources, both in terms of computing power and data storage requirements, and are thus required to be partitioned and executed in parallel. However, their standard sequential order offers little opportunity for parallelism. Hence, it is necessary to re-order their execution in order to exploit the parallel computing power of the underlying computational resources.
4

Iterative methods for heterogeneous media

Lechner, Patrick O. January 2006 (has links)
No description available.
5

Discontinuous Galerkin methods for Friedrichs systems with irregular solutions

Jensen, Max January 2005 (has links)
This work is concerned with the numerical solution of Friedrichs systems by discontinuous Galerkin finite element methods (DGFEMs). Friedrichs systems are boundary value problems with symmetric, positive, linear first-order partial differential operators and allow the unified treatment of a wide range of elliptic, parabolic, hyperbolic and mixed-type equations. We do not assume that the exact solution of a Friedrichs system belongs to a Sobolev space, but only require that it is contained in the associated graph space, which amounts to differentiability in the characteristic direction. We show that the numerical approximations to the solution of a Friedrichs system by the DGFEM converge in the energy norm under hierarchical h- and p- refinement. We introduce a new compatibility condition for the boundary data, from which we can deduce, for instance, the validity of the integration-by-parts formula. Consequently, we can admit domains with corners and allow changes of the inertial type of the boundary, which corresponds in special cases to the componentwise transition from in- to outflow boundaries. To establish the convergence result we consider in equal parts the theory of graph spaces, Friedrichs systems and DGFEMs. Based on the density of smooth functions in graph spaces over Lipschitz domains, we study trace and extension operators and also investigate the eigensystem associated with the differential operator. We pay particular attention to regularity properties of the traces, that limit the applicability of energy integral methods, which are the theoretical underpinning of Friedrichs systems. We provide a general framework for Friedrichs systems which incorporates a wide range of singular boundary conditions. Assuming the aforementioned compatibility condition we deduce well-posedness of admissible Friedrichs systems and the stability of the DGFEM. In a separate study we prove hp-optimality of least-squares stabilised DGFEMs.

Page generated in 0.0448 seconds