Sökning: "error bounds"
Visar resultat 11 - 15 av 116 avhandlingar innehållade orden error bounds.
11. Finite element approximation of the linear stochastic Cahn-Hilliard equation
Sammanfattning : The linearized Cahn-Hilliard-Cook equation is discretized in the spatial variables by a standard finite element method. Strong convergence estimates are proved under suitable assumptions on the covariance operator of the Wiener process, which is driving the equation. The backward Euler time stepping is also studied. LÄS MER
12. Analysis of Computational Algorithms for Linear Multistep Methods
Sammanfattning : Linear multistep methods (LMMs) constitute a class of time-stepping methods for the solution of initial value ODEs; the most well-known methods of this class are the Adams methods (AMs) and the backward differentiation formulae (BDFs). For the fixed stepsize LMMs there exists an extensive error and stability analysis; in practical computations, however, one always uses a variable stepsize. LÄS MER
13. Finite element approximation of the deterministic and the stochastic Cahn-Hilliard equation
Sammanfattning : This thesis consists of three papers on numerical approximation of the Cahn-Hilliard equation. The main part of the work is concerned with the Cahn-Hilliard equation perturbed by noise, also known as the Cahn-Hilliard-Cook equation. LÄS MER
14. Adaptive Concatenated Coding for Wireless Real-Time Communications
Sammanfattning : The objective of this thesis is to improve the performance of real-time communication overa wireless channel, by means of specifically tailored channel coding. The deadlinedependent coding (DDC) communication protocol presented here lets the timeliness and thereliability of the delivered information constitute quality of service (QoS) parametersrequested by the application. LÄS MER
15. Bounds on the maximum coding rate of multiple-access channels and feedback channels
Sammanfattning : We provide upper and lower bounds on the coding rate of multiple-access channels (MACs) and feedback channels.Traditional MACs have been extensively studied under the assumption of availability of perfect channel state information (CSI).In Paper A we relax this assumption for a Rayleigh block-fading MAC and provide bounds on the sum-rate capacity. LÄS MER