Sökning: "convergence order"
Visar resultat 1 - 5 av 296 avhandlingar innehållade orden convergence order.
1. Selected Topics in Homogenization
Sammanfattning : The main focus of the present thesis is on the homogenization of some selected elliptic and parabolic problems. More precisely, we homogenize: non-periodic linear elliptic problems in two dimensions exhibiting a homothetic scaling property; two types of evolution-multiscale linear parabolic problems, one having two spatial and two temporal microscopic scales where the latter ones are given in terms of a two-parameter family, and one having two spatial and three temporal microscopic scales that are fixed power functions; and, finally, evolution-multiscale monotone parabolic problems with one spatial and an arbitrary number of temporal microscopic scales that are not restricted to be given in terms of power functions. LÄS MER
2. A tale of trees and leaves : subtrees and local convergence
Sammanfattning : Given a tree T, a subtree in T is a subgraph that is a tree itself. The set of subtrees in a tree is related to many important graph parameters, one of which is the mean subtree order. LÄS MER
3. On Specifying and Estimating Economic Growth as a Spatial Process : Convergence, Inequality, and Migration
Sammanfattning : This thesis includes three self-contained papers. The first paper considers the effect of geographically dependent observations on cross-sectional growth convergence and proposes a way of decomposing the level of technology taking into account geographical variation in growth rates. LÄS MER
4. Discretizations of nonlinear dissipative evolution equations. Order and convergence
Sammanfattning : The theme of this thesis is to study discretizations of nonlinear dissipative evolution equations, which arise in e.g. advection-diffusion-reaction processes. LÄS MER
5. Accelerating Convergence of Large-scale Optimization Algorithms
Sammanfattning : Several recent engineering applications in multi-agent systems, communication networks, and machine learning deal with decision problems that can be formulated as optimization problems. For many of these problems, new constraints limit the usefulness of traditional optimization algorithms. LÄS MER