• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 4
  • Tagged with
  • 5
  • 5
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 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

A study of Besov-Lipschitz and Triebel-Lizorkin spaces using non-smooth kernels : a thesis submitted in partial fulfilment of the requirements for the degree of Master of Science in Mathematics at the University of Canterbury /

Candy, Timothy. January 2008 (has links)
Thesis (M. Sc.)--University of Canterbury, 2008. / Typescript (photocopy). Includes bibliographical references (p. [58]). Also available via the World Wide Web.
2

Smoothness of invariant densities for certain classes of dynamical systems /

Osman, Abdusslam. January 1996 (has links)
Thesis (M. Sc.)--Dept. of Mathematics and Statistics, Concordia University, 1996. / "May 1996." Includes bibliographical references. Available also on the Internet.
3

The division theorem for smooth functions

De Wet, P.O. (Pieter Oloff) 22 July 2005 (has links)
We discuss Lojasiewicz's beautiful proof of the division theorem for smooth functions. The standard proofs are based on the Weierstrass preparation theorem for analytic functions and use techniques from the theory of partial differential equations. Lojasiewicz's approach is more geometric and syn¬thetic. In the appendices appear new proofs of results which are required for the theorem. / Dissertation (MSc (Mathematics))--University of Pretoria, 2006. / Mathematics and Applied Mathematics / unrestricted
4

Stability of first-order methods in tame optimization

Lai, Lexiao January 2024 (has links)
Modern data science applications demand solving large-scale optimization problems. The prevalent approaches are first-order methods, valued for their scalability. These methods are implemented to tackle highly irregular problems where assumptions of convexity and smoothness are untenable. Seeking to deepen the understanding of these methods, we study first-order methods with constant step size for minimizing locally Lipschitz tame functions. To do so, we propose notions of discrete Lyapunov stability for optimization methods. Concerning common first-order methods, we provide necessary and sufficient conditions for stability. We also show that certain local minima can be unstable, without additional noise in the method. Our analysis relies on the connection between the iterates of the first-order methods and continuous-time dynamics.
5

A Kudla-Rapoport Formula for Exotic Smooth Models of Odd Dimension

Yao, Haodong January 2024 (has links)
In this thesis, we prove a Kudla-Rapoport conjecture for 𝓨-cycles on exotic smooth unitary Rapoport-Zink spaces of odd arithmetic dimension, i.e. the arithmetic intersection numbers for 𝓨-cycles equals the derivatives of local representation density. We also compare 𝓩-cycles and 𝓨-cycles on these RZ spaces. The method is to relate both geometric and analytic sides to the even dimensional case and reduce the conjecture to the results in \cite{LL22}.

Page generated in 0.0892 seconds