Certified Rapid Solution of Parametrized Linear Elliptic Equations: Application to Parameter Estimation

We present a technique for the rapid and reliable evaluation of linear-functional output of elliptic partial differential equations with affine parameter dependence. The essential components are (i) rapidly uniformly convergent reduced-basis approximations — Galerkin projection onto a space WN spanned by solutions of the governing partial differential equation at N (optimally) selected points in parameter space; (ii) a posteriori error estimation — relaxations of the residual equation that provide inexpensive yet sharp and rigorous bounds for the error in the outputs; and (iii) offline/online computational procedures — stratagems that exploit affine parameter dependence to de-couple the generation and projection stages of the approximation process. The operation count for the online stage — in which, given a new parameter value, we calculate the output and associated error bound — depends only on N (typically small) and the parametric complexity of the problem. The method is thus ideally suited to the many-query and real-time contexts. In this paper, based on the technique we develop a robust inverse computational method for very fast solution of inverse problems characterized by parametrized partial differential equations. The essential ideas are in three-fold: first, we apply the technique to the forward problem for the rapid certified evaluation of PDE input-output relations and associated rigorous error bounds; second, we incorporate the reduced-basis approximation and error bounds into the inverse problem formulation; and third, rather than regularize the goodness-of-fit objective, we may instead identify all (or almost all, in the probabilistic sense) system configurations consistent with the available experimental data — well-posedness is reflected in a bounded "possibility region" that furthermore shrinks as the experimental error is decreased.

Ordinary Differential Equations

Exercises and solutions about ordinary differential equations.

Differential Equations II

Exercises and solutions for a second year differential equations course.

Upwind solution of singular differential equations arising from steady channel flows

We study ordinary nonlinear singular differential equations which arise from steady conservation laws with source terms. An example of steady conservation laws which leads to those scalar equations is the Saint–Venant equations. The numerical solution of these scalar equations is sought by using the ideas of upwinding and discretisation of source terms. Both the Engquist–Osher scheme and the Roe scheme are used with different strategies for discretising the source terms.

On the Convergence of Two-Stage Iterative Processes for Solving Linear Equations

This paper considers two-stage iterative processes for solving the linear system $Af = b$. The outer iteration is defined by $Mf^{k + 1} = Nf^k + b$, where $M$ is a nonsingular matrix such that $M - N = A$. At each stage $f^{k + 1} $ is computed approximately using an inner iteration process to solve $Mv = Nf^k + b$ for $v$. At the $k$th outer iteration, $p_k $ inner iterations are performed. It is shown that this procedure converges if $p_k \geqq P$ for some $P$ provided that the inner iteration is convergent and that the outer process would converge if $f^{k + 1} $ were determined exactly at every step. Convergence is also proved under more specialized conditions, and for the procedure where $p_k = p$ for all $k$, an estimate for $p$ is obtained which optimizes the convergence rate. Examples are given for systems arising from the numerical solution of elliptic partial differential equations and numerical results are presented.

Axonal velocity distributions in neural feld equations

By modelling the average activity of large neuronal populations, continuum mean field models (MFMs) have become an increasingly important theoretical tool for understanding the emergent activity of cortical tissue. In order to be computationally tractable, long-range propagation of activity in MFMs is often approximated with partial differential equations (PDEs). However, PDE approximations in current use correspond to underlying axonal velocity distributions incompatible with experimental measurements. In order to rectify this deficiency, we here introduce novel propagation PDEs that give rise to smooth unimodal distributions of axonal conduction velocities. We also argue that velocities estimated from fibre diameters in slice and from latency measurements, respectively, relate quite differently to such distributions, a significant point for any phenomenological description. Our PDEs are then successfully fit to fibre diameter data from human corpus callosum and rat subcortical white matter. This allows for the first time to simulate long-range conduction in the mammalian brain with realistic, convenient PDEs. Furthermore, the obtained results suggest that the propagation of activity in rat and human differs significantly beyond mere scaling. The dynamical consequences of our new formulation are investigated in the context of a well known neural field model. On the basis of Turing instability analyses, we conclude that pattern formation is more easily initiated using our more realistic propagator. By increasing characteristic conduction velocities, a smooth transition can occur from self-sustaining bulk oscillations to travelling waves of various wavelengths, which may influence axonal growth during development. Our analytic results are also corroborated numerically using simulations on a large spatial grid. Thus we provide here a comprehensive analysis of empirically constrained activity propagation in the context of MFMs, which will allow more realistic studies of mammalian brain activity in the future.

Averaging for retarded functional differential equations

We consider retarded functional differential equations in the setting of Kurzweil-Henstock integrable functions and we state an averaging result for these equations. Our result generalizes previous ones. (C) 2011 Elsevier Inc. All rights reserved.