We provide a comprehensive convergence analysis of the asymptotic preserving implicit-explicit particle-in-cell (IMEX-PIC) methods for the Vlasov–Poisson system with a strong magnetic field. This study is of utmost importance for understanding the behavior of plasmas in magnetic fusion devices such as tokamaks, where such a large magnetic field needs to be applied in order to keep the plasma particles on desired tracks.
This document summarizes a presentation on developing a natural finite element for axisymmetric problems. It introduces an axisymmetric model problem, defines appropriate axisymmetric Sobolev spaces, and presents a discrete formulation using a P1 finite element on triangles. Numerical results on a test problem show the method achieves the same convergence rates as classical approaches but with significantly smaller errors. The analysis draws on previous work to prove first-order approximation properties under certain mesh assumptions.
The document describes Approximate Bayesian Computation (ABC), a technique for performing Bayesian inference when the likelihood function is intractable or impossible to evaluate directly. ABC works by simulating data under different parameter values, and accepting simulations that are close to the observed data according to a distance measure and tolerance level. ABC provides an approximation to the posterior distribution that improves as the tolerance level decreases and more informative summary statistics are used. The document discusses the ABC algorithm, properties of the exact ABC posterior distribution, and challenges in selecting appropriate summary statistics.
ABC stands for approximate Bayesian computation. It is a method for performing Bayesian inference when the likelihood function is intractable or impossible to evaluate directly. ABC produces samples from an approximate posterior distribution by simulating parameter and summary statistic values that match the observed summary statistics within a tolerance level. The choice of summary statistics is important but difficult, as there is typically no sufficient statistic. Several strategies have been developed for selecting good summary statistics, including using random forests or the Lasso to evaluate and select from a large set of potential summaries.
The document discusses Approximate Bayesian Computation (ABC), a simulation-based method for conducting Bayesian inference when the likelihood function is intractable or unavailable. ABC works by simulating data from the model, accepting simulations that are close to the observed data based on a distance measure and tolerance level. This provides samples from an approximation of the posterior distribution. The document provides examples that motivate ABC and outlines the basic ABC algorithm. It also discusses extensions and improvements to the standard ABC method.
This document discusses nested sampling, a technique for Bayesian computation and evidence evaluation. It begins by introducing Bayesian inference and the evidence integral. It then shows that nested sampling transforms the multidimensional evidence integral into a one-dimensional integral over the prior mass constrained to have likelihood above a given value. The document outlines the nested sampling algorithm and shows that it provides samples from the posterior distribution. It also discusses termination criteria and choices of sample size for the algorithm. Finally, it provides a numerical example of nested sampling applied to a Gaussian model.
A new Perron-Frobenius theorem for nonnegative tensorsFrancesco Tudisco
Based on the concept of dimensional partition we consider a general tensor spectral problem that includes all known tensor spectral problems as special cases. We formulate irreducibility and symmetry properties in terms of the dimensional partition and use the theory of multi-homogeneous order-preserving maps to derive a general and unifying Perron-Frobenius theorem for nonnegative tensors that either includes previous results of this kind or improves them by weakening the assumptions there considered.
Talk presented at SIAM Applied Linear Algebra conference Hong Kong 2018
This document describes a new method called component-wise approximate Bayesian computation (ABCG or ABC-Gibbs) that combines approximate Bayesian computation (ABC) with Gibbs sampling. ABCG aims to more efficiently explore parameter spaces when the number of parameters is large. It works by alternately sampling each parameter from its ABC-approximated conditional distribution given current values of other parameters. The document provides theoretical analysis showing ABCG converges to a stationary distribution under certain conditions. It also presents examples demonstrating ABCG can better separate estimates from the prior compared to simple ABC, especially for hierarchical models.
Estimation of the score vector and observed information matrix in intractable...Pierre Jacob
This document discusses methods for estimating the score vector and observed information matrix for intractable models. It begins with an overview of using derivatives in sampling algorithms. It then discusses iterated filtering, a method for estimating derivatives in hidden Markov models when the likelihood is not available in closed form. Iterated filtering introduces a perturbed model and relates the posterior mean to the score and posterior variance to the observed information matrix. The document outlines proofs that show this relationship as the prior concentration increases.
This document summarizes a presentation on developing a natural finite element for axisymmetric problems. It introduces an axisymmetric model problem, defines appropriate axisymmetric Sobolev spaces, and presents a discrete formulation using a P1 finite element on triangles. Numerical results on a test problem show the method achieves the same convergence rates as classical approaches but with significantly smaller errors. The analysis draws on previous work to prove first-order approximation properties under certain mesh assumptions.
The document describes Approximate Bayesian Computation (ABC), a technique for performing Bayesian inference when the likelihood function is intractable or impossible to evaluate directly. ABC works by simulating data under different parameter values, and accepting simulations that are close to the observed data according to a distance measure and tolerance level. ABC provides an approximation to the posterior distribution that improves as the tolerance level decreases and more informative summary statistics are used. The document discusses the ABC algorithm, properties of the exact ABC posterior distribution, and challenges in selecting appropriate summary statistics.
ABC stands for approximate Bayesian computation. It is a method for performing Bayesian inference when the likelihood function is intractable or impossible to evaluate directly. ABC produces samples from an approximate posterior distribution by simulating parameter and summary statistic values that match the observed summary statistics within a tolerance level. The choice of summary statistics is important but difficult, as there is typically no sufficient statistic. Several strategies have been developed for selecting good summary statistics, including using random forests or the Lasso to evaluate and select from a large set of potential summaries.
The document discusses Approximate Bayesian Computation (ABC), a simulation-based method for conducting Bayesian inference when the likelihood function is intractable or unavailable. ABC works by simulating data from the model, accepting simulations that are close to the observed data based on a distance measure and tolerance level. This provides samples from an approximation of the posterior distribution. The document provides examples that motivate ABC and outlines the basic ABC algorithm. It also discusses extensions and improvements to the standard ABC method.
This document discusses nested sampling, a technique for Bayesian computation and evidence evaluation. It begins by introducing Bayesian inference and the evidence integral. It then shows that nested sampling transforms the multidimensional evidence integral into a one-dimensional integral over the prior mass constrained to have likelihood above a given value. The document outlines the nested sampling algorithm and shows that it provides samples from the posterior distribution. It also discusses termination criteria and choices of sample size for the algorithm. Finally, it provides a numerical example of nested sampling applied to a Gaussian model.
A new Perron-Frobenius theorem for nonnegative tensorsFrancesco Tudisco
Based on the concept of dimensional partition we consider a general tensor spectral problem that includes all known tensor spectral problems as special cases. We formulate irreducibility and symmetry properties in terms of the dimensional partition and use the theory of multi-homogeneous order-preserving maps to derive a general and unifying Perron-Frobenius theorem for nonnegative tensors that either includes previous results of this kind or improves them by weakening the assumptions there considered.
Talk presented at SIAM Applied Linear Algebra conference Hong Kong 2018
This document describes a new method called component-wise approximate Bayesian computation (ABCG or ABC-Gibbs) that combines approximate Bayesian computation (ABC) with Gibbs sampling. ABCG aims to more efficiently explore parameter spaces when the number of parameters is large. It works by alternately sampling each parameter from its ABC-approximated conditional distribution given current values of other parameters. The document provides theoretical analysis showing ABCG converges to a stationary distribution under certain conditions. It also presents examples demonstrating ABCG can better separate estimates from the prior compared to simple ABC, especially for hierarchical models.
Estimation of the score vector and observed information matrix in intractable...Pierre Jacob
This document discusses methods for estimating the score vector and observed information matrix for intractable models. It begins with an overview of using derivatives in sampling algorithms. It then discusses iterated filtering, a method for estimating derivatives in hidden Markov models when the likelihood is not available in closed form. Iterated filtering introduces a perturbed model and relates the posterior mean to the score and posterior variance to the observed information matrix. The document outlines proofs that show this relationship as the prior concentration increases.
Multiple estimators for Monte Carlo approximationsChristian Robert
This document discusses multiple estimators that can be used to approximate integrals using Monte Carlo simulations. It begins by introducing concepts like multiple importance sampling, Rao-Blackwellisation, and delayed acceptance that allow combining multiple estimators to improve accuracy. It then discusses approaches like mixtures as proposals, global adaptation, and nonparametric maximum likelihood estimation (NPMLE) that frame Monte Carlo estimation as a statistical estimation problem. The document notes various advantages of the statistical formulation, like the ability to directly estimate simulation error from the Fisher information. Overall, the document presents an overview of different techniques for combining Monte Carlo simulations to obtain more accurate integral approximations.
Nodal Domain Theorem for the p-Laplacian on Graphs and the Related Multiway C...Francesco Tudisco
We consider the p-Laplacian on discrete graphs, a nonlinear operator that generalizes the standard graph Laplacian (obtained for p=2). We consider a set of variational eigenvalues of this operator and analyze the nodal domain count of the corresponding eigenfunctions. In particular, we show that the famous Courant’s nodal domain theorem for the linear Laplacian carries over almost unchanged to the nonlinear case. Moreover, we use the nodal domains to prove a higher-order Cheeger inequality that relates the k-way graph cut to the k-th variational eigenvalue of the p-Laplacian
The document describes a new method called component-wise approximate Bayesian computation (ABC) that combines ABC with Gibbs sampling. It aims to improve ABC's ability to efficiently explore parameter spaces when the number of parameters is large. The method works by alternating sampling from each parameter's ABC posterior conditional distribution given current values of other parameters and the observed data. The method is proven to converge to a stationary distribution under certain assumptions, especially for hierarchical models where conditional distributions are often simplified. Numerical experiments on toy examples demonstrate the method can provide a better approximation of the true posterior than vanilla ABC.
The document summarizes Approximate Bayesian Computation (ABC). It discusses how ABC provides a way to approximate Bayesian inference when the likelihood function is intractable or too computationally expensive to evaluate directly. ABC works by simulating data under different parameter values and accepting simulations that are close to the observed data according to a distance measure and tolerance level. Key points discussed include:
- ABC provides an approximation to the posterior distribution by sampling from simulations that fall within a tolerance of the observed data.
- Summary statistics are often used to reduce the dimension of the data and improve the signal-to-noise ratio when applying the tolerance criterion.
- Random forests can help select informative summary statistics and provide semi-automated ABC
The document discusses exponential decay of solutions to a second-order linear differential equation involving a self-adjoint positive operator A and an accretive damping operator D. Several theorems establish conditions under which the associated operator semigroup or pencil generates exponential decay. If D is accretive and satisfies certain positivity conditions, the semigroup will decay exponentially. Explicit bounds on the rate of decay and estimates of the spectrum are provided depending on properties of A and D.
Small updates of matrix functions used for network centralityFrancesco Tudisco
Many relevant measures of importance for nodes and edges of a network are defined in terms of suitable entries of matrix functions $f(A)$, for different choices of $f$ and $A$. Addressing the entries of $f(A)$ can be computationally challenging and this is particularly prohibitive when $A$ undergoes a perturbation $A+\delta A$ and the entries of $f(A)$ have to be updated. Given the adjacency matrix $A$ of a graph $G=(V,E)$, in this talk we consider the case where $\delta A$ is a sparse matrix that yields a small perturbation of the edge structure of $G$.
In particular, we present a bound showing that the variation of the entry $f(A)_{u,v}$ decays exponentially with the distance in $G$ that separates either $u$ or $v$ from the set of nodes touched by the edges that are perturbed. Our bound depends only on the distances in the original graph $G$ and on the field of values of the perturbed matrix $A+\delta A$. We show several numerical examples in support of the proposed result.
Talk presented at the IMA Numerical Analysis and Optimization conference, Birmingham 2018
The talk is based on the paper:
S. Pozza and F. Tudisco, On the stability of network indices defined by means of matrix functions, SIMAX, 2018
Image sciences, image processing, image restoration, photo manipulation. Image and videos representation. Digital versus analog imagery. Quantization and sampling. Sources and models of noises in digital CCD imagery: photon, thermal and readout noises. Sources and models of blurs. Convolutions and point spread functions. Overview of other standard models, problems and tasks: salt-and-pepper and impulse noises, half toning, inpainting, super-resolution, compressed sensing, high dynamic range imagery, demosaicing. Short introduction to other types of imagery: SAR, Sonar, ultrasound, CT and MRI. Linear and ill-posed restoration problems.
The document discusses computational aspects of stochastic phase-field models. It begins by motivating the inclusion of thermal noise in phase-field simulations through examples of dendrite formation. It then provides background on the deterministic phase-field and Allen-Cahn models before introducing the stochastic Allen-Cahn equation with additive white noise. The remainder of the document discusses the importance of studying this problem both theoretically and computationally, as well as outlining the topics to be covered in more depth.
This document summarizes approximate Bayesian computation (ABC) methods. It begins with an overview of ABC, which provides a likelihood-free rejection technique for Bayesian inference when the likelihood function is intractable. The ABC algorithm works by simulating parameters and data until the simulated and observed data are close according to some distance measure and tolerance level. The document then discusses the asymptotic properties of ABC, including consistency of ABC posteriors and rates of convergence under certain assumptions. It also notes relationships between ABC and k-nearest neighbor methods. Examples applying ABC to autoregressive time series models are provided.
- The document discusses nonparametric kernel estimation methods for copula density functions.
- It proposes using a probit transformation of the data to estimate the copula density on the unit square, which improves consistency at the boundaries compared to standard kernel methods.
- Two improved probit-transformation kernel copula density estimators are presented - one using a local log-linear approximation and one using a local log-quadratic approximation.
Estimation of the score vector and observed information matrix in intractable...Pierre Jacob
This document discusses methods for estimating derivatives of the likelihood function in intractable models, such as hidden Markov models, where the likelihood does not have a closed form. It presents three key ideas:
1) Iterated filtering, which approximates the score by perturbing the parameter and tracking the evolution of the perturbation through sequential updates.
2) Proximity mapping, which relates the shift in the posterior mode to the prior mode as the prior variance goes to zero to the score via Moreau's approximation.
3) Posterior concentration induced by a normal prior concentrating at a point, where Taylor expansions show the shift in posterior moments is order of the prior variance, relating it to the derivatives of the log
Rao-Blackwellisation schemes for accelerating Metropolis-Hastings algorithmsChristian Robert
Aggregate of three different papers on Rao-Blackwellisation, from Casella & Robert (1996), to Douc & Robert (2010), to Banterle et al. (2015), presented during an OxWaSP workshop on MCMC methods, Warwick, Nov 20, 2015
ABC convergence under well- and mis-specified modelsChristian Robert
1. Approximate Bayesian computation (ABC) is a simulation-based method for performing Bayesian inference when the likelihood function is intractable or unavailable. ABC works by simulating data from the model, accepting simulations where the simulated and observed data are close according to some distance measure.
2. Advances in ABC include modifying the proposal distribution to increase efficiency, viewing it as a conditional density estimation problem to allow for larger tolerances, and including a tolerance parameter in the inferential framework.
3. Recent studies have analyzed the asymptotic properties of ABC, showing the posterior distributions and means can be consistent under certain conditions on the summary statistics and tolerance decreasing rates.
Sampling strategies for Sequential Monte Carlo (SMC) methodsStephane Senecal
Sequential Monte Carlo methods use importance sampling and resampling to estimate distributions in state space models recursively over time. This document discusses strategies for sampling in sequential Monte Carlo methods, including:
- Using the optimal proposal distribution of the one-step ahead predictive distribution to minimize weight variance.
- Approximating the predictive distribution using mixtures, expansions, auxiliary variables, or Markov chain Monte Carlo methods.
- Considering blocks of variables over time rather than individual time steps to better diffuse particles, such as using a lagged block, reweighting particles before resampling, or sampling an extended block with an augmented state space.
On estimating the integrated co volatility usingkkislas
This document proposes a method to estimate the integrated co-volatility of two asset prices using high-frequency data that contains both microstructure noise and jumps.
It considers two cases - when the jump processes of the two assets are independent, and when they are dependent. For the independent case, it proposes an estimator that is robust to jumps. For the dependent case, it proposes a threshold estimator that combines pre-averaging to remove noise with a threshold method to reduce the effect of jumps. It proves the estimators are consistent and establishes their central limit theorems. Simulation results are also presented to illustrate the performance of the proposed methods.
This document discusses linear response theory and time-dependent density functional theory (TDDFT) for calculating absorption spectroscopy. It begins by motivating the use of absorption spectroscopy to study many-body effects. It then outlines how to calculate the response of a system to a perturbation within linear response theory and the Kubo formula. The document discusses using TDDFT to include electron correlation effects beyond the independent particle and time-dependent Hartree approximations. It emphasizes that TDDFT provides an exact framework for calculating neutral excitations if the correct exchange-correlation functional is used.
Multiple estimators for Monte Carlo approximationsChristian Robert
This document discusses multiple estimators that can be used to approximate integrals using Monte Carlo simulations. It begins by introducing concepts like multiple importance sampling, Rao-Blackwellisation, and delayed acceptance that allow combining multiple estimators to improve accuracy. It then discusses approaches like mixtures as proposals, global adaptation, and nonparametric maximum likelihood estimation (NPMLE) that frame Monte Carlo estimation as a statistical estimation problem. The document notes various advantages of the statistical formulation, like the ability to directly estimate simulation error from the Fisher information. Overall, the document presents an overview of different techniques for combining Monte Carlo simulations to obtain more accurate integral approximations.
Nodal Domain Theorem for the p-Laplacian on Graphs and the Related Multiway C...Francesco Tudisco
We consider the p-Laplacian on discrete graphs, a nonlinear operator that generalizes the standard graph Laplacian (obtained for p=2). We consider a set of variational eigenvalues of this operator and analyze the nodal domain count of the corresponding eigenfunctions. In particular, we show that the famous Courant’s nodal domain theorem for the linear Laplacian carries over almost unchanged to the nonlinear case. Moreover, we use the nodal domains to prove a higher-order Cheeger inequality that relates the k-way graph cut to the k-th variational eigenvalue of the p-Laplacian
The document describes a new method called component-wise approximate Bayesian computation (ABC) that combines ABC with Gibbs sampling. It aims to improve ABC's ability to efficiently explore parameter spaces when the number of parameters is large. The method works by alternating sampling from each parameter's ABC posterior conditional distribution given current values of other parameters and the observed data. The method is proven to converge to a stationary distribution under certain assumptions, especially for hierarchical models where conditional distributions are often simplified. Numerical experiments on toy examples demonstrate the method can provide a better approximation of the true posterior than vanilla ABC.
The document summarizes Approximate Bayesian Computation (ABC). It discusses how ABC provides a way to approximate Bayesian inference when the likelihood function is intractable or too computationally expensive to evaluate directly. ABC works by simulating data under different parameter values and accepting simulations that are close to the observed data according to a distance measure and tolerance level. Key points discussed include:
- ABC provides an approximation to the posterior distribution by sampling from simulations that fall within a tolerance of the observed data.
- Summary statistics are often used to reduce the dimension of the data and improve the signal-to-noise ratio when applying the tolerance criterion.
- Random forests can help select informative summary statistics and provide semi-automated ABC
The document discusses exponential decay of solutions to a second-order linear differential equation involving a self-adjoint positive operator A and an accretive damping operator D. Several theorems establish conditions under which the associated operator semigroup or pencil generates exponential decay. If D is accretive and satisfies certain positivity conditions, the semigroup will decay exponentially. Explicit bounds on the rate of decay and estimates of the spectrum are provided depending on properties of A and D.
Small updates of matrix functions used for network centralityFrancesco Tudisco
Many relevant measures of importance for nodes and edges of a network are defined in terms of suitable entries of matrix functions $f(A)$, for different choices of $f$ and $A$. Addressing the entries of $f(A)$ can be computationally challenging and this is particularly prohibitive when $A$ undergoes a perturbation $A+\delta A$ and the entries of $f(A)$ have to be updated. Given the adjacency matrix $A$ of a graph $G=(V,E)$, in this talk we consider the case where $\delta A$ is a sparse matrix that yields a small perturbation of the edge structure of $G$.
In particular, we present a bound showing that the variation of the entry $f(A)_{u,v}$ decays exponentially with the distance in $G$ that separates either $u$ or $v$ from the set of nodes touched by the edges that are perturbed. Our bound depends only on the distances in the original graph $G$ and on the field of values of the perturbed matrix $A+\delta A$. We show several numerical examples in support of the proposed result.
Talk presented at the IMA Numerical Analysis and Optimization conference, Birmingham 2018
The talk is based on the paper:
S. Pozza and F. Tudisco, On the stability of network indices defined by means of matrix functions, SIMAX, 2018
Image sciences, image processing, image restoration, photo manipulation. Image and videos representation. Digital versus analog imagery. Quantization and sampling. Sources and models of noises in digital CCD imagery: photon, thermal and readout noises. Sources and models of blurs. Convolutions and point spread functions. Overview of other standard models, problems and tasks: salt-and-pepper and impulse noises, half toning, inpainting, super-resolution, compressed sensing, high dynamic range imagery, demosaicing. Short introduction to other types of imagery: SAR, Sonar, ultrasound, CT and MRI. Linear and ill-posed restoration problems.
The document discusses computational aspects of stochastic phase-field models. It begins by motivating the inclusion of thermal noise in phase-field simulations through examples of dendrite formation. It then provides background on the deterministic phase-field and Allen-Cahn models before introducing the stochastic Allen-Cahn equation with additive white noise. The remainder of the document discusses the importance of studying this problem both theoretically and computationally, as well as outlining the topics to be covered in more depth.
This document summarizes approximate Bayesian computation (ABC) methods. It begins with an overview of ABC, which provides a likelihood-free rejection technique for Bayesian inference when the likelihood function is intractable. The ABC algorithm works by simulating parameters and data until the simulated and observed data are close according to some distance measure and tolerance level. The document then discusses the asymptotic properties of ABC, including consistency of ABC posteriors and rates of convergence under certain assumptions. It also notes relationships between ABC and k-nearest neighbor methods. Examples applying ABC to autoregressive time series models are provided.
- The document discusses nonparametric kernel estimation methods for copula density functions.
- It proposes using a probit transformation of the data to estimate the copula density on the unit square, which improves consistency at the boundaries compared to standard kernel methods.
- Two improved probit-transformation kernel copula density estimators are presented - one using a local log-linear approximation and one using a local log-quadratic approximation.
Estimation of the score vector and observed information matrix in intractable...Pierre Jacob
This document discusses methods for estimating derivatives of the likelihood function in intractable models, such as hidden Markov models, where the likelihood does not have a closed form. It presents three key ideas:
1) Iterated filtering, which approximates the score by perturbing the parameter and tracking the evolution of the perturbation through sequential updates.
2) Proximity mapping, which relates the shift in the posterior mode to the prior mode as the prior variance goes to zero to the score via Moreau's approximation.
3) Posterior concentration induced by a normal prior concentrating at a point, where Taylor expansions show the shift in posterior moments is order of the prior variance, relating it to the derivatives of the log
Rao-Blackwellisation schemes for accelerating Metropolis-Hastings algorithmsChristian Robert
Aggregate of three different papers on Rao-Blackwellisation, from Casella & Robert (1996), to Douc & Robert (2010), to Banterle et al. (2015), presented during an OxWaSP workshop on MCMC methods, Warwick, Nov 20, 2015
ABC convergence under well- and mis-specified modelsChristian Robert
1. Approximate Bayesian computation (ABC) is a simulation-based method for performing Bayesian inference when the likelihood function is intractable or unavailable. ABC works by simulating data from the model, accepting simulations where the simulated and observed data are close according to some distance measure.
2. Advances in ABC include modifying the proposal distribution to increase efficiency, viewing it as a conditional density estimation problem to allow for larger tolerances, and including a tolerance parameter in the inferential framework.
3. Recent studies have analyzed the asymptotic properties of ABC, showing the posterior distributions and means can be consistent under certain conditions on the summary statistics and tolerance decreasing rates.
Sampling strategies for Sequential Monte Carlo (SMC) methodsStephane Senecal
Sequential Monte Carlo methods use importance sampling and resampling to estimate distributions in state space models recursively over time. This document discusses strategies for sampling in sequential Monte Carlo methods, including:
- Using the optimal proposal distribution of the one-step ahead predictive distribution to minimize weight variance.
- Approximating the predictive distribution using mixtures, expansions, auxiliary variables, or Markov chain Monte Carlo methods.
- Considering blocks of variables over time rather than individual time steps to better diffuse particles, such as using a lagged block, reweighting particles before resampling, or sampling an extended block with an augmented state space.
On estimating the integrated co volatility usingkkislas
This document proposes a method to estimate the integrated co-volatility of two asset prices using high-frequency data that contains both microstructure noise and jumps.
It considers two cases - when the jump processes of the two assets are independent, and when they are dependent. For the independent case, it proposes an estimator that is robust to jumps. For the dependent case, it proposes a threshold estimator that combines pre-averaging to remove noise with a threshold method to reduce the effect of jumps. It proves the estimators are consistent and establishes their central limit theorems. Simulation results are also presented to illustrate the performance of the proposed methods.
This document discusses linear response theory and time-dependent density functional theory (TDDFT) for calculating absorption spectroscopy. It begins by motivating the use of absorption spectroscopy to study many-body effects. It then outlines how to calculate the response of a system to a perturbation within linear response theory and the Kubo formula. The document discusses using TDDFT to include electron correlation effects beyond the independent particle and time-dependent Hartree approximations. It emphasizes that TDDFT provides an exact framework for calculating neutral excitations if the correct exchange-correlation functional is used.
Iterative procedure for uniform continuous mapping.Alexander Decker
This document presents an iterative procedure for finding a common fixed point of a finite family of self-maps on a nonempty closed convex subset of a normed linear space. Specifically:
1. It defines an m-step iterative process that generates a sequence from an initial point by applying m self-maps from the family sequentially at each step.
2. It proves that if one of the maps is uniformly continuous and hemicontractive, with bounded range, and the family has a nonempty common fixed point set, then the iterative sequence converges strongly to a common fixed point.
3. It extends previous results by allowing some maps in the family to satisfy only asymptotic conditions, rather than uniform continuity. The conditions
This document summarizes a lecture on linear systems and convolution in continuous time. It discusses how any continuous signal can be represented as the limit of thin, delayed pulses using the sifting property. Convolution for continuous-time linear and time-invariant (LTI) systems is defined by the convolution integral. The convolution integral calculates the output of an LTI system by integrating the product of the input signal and impulse response over all time. Examples are provided to demonstrate calculating the output of an LTI system using convolution integrals.
NONLINEAR DIFFERENCE EQUATIONS WITH SMALL PARAMETERS OF MULTIPLE SCALESTahia ZERIZER
In this article we study a general model of nonlinear difference equations including small parameters of multiple scales. For two kinds of perturbations, we describe algorithmic methods giving asymptotic solutions to boundary value problems.
The problem of existence and uniqueness of the solution is also addressed.
On Twisted Paraproducts and some other Multilinear Singular IntegralsVjekoslavKovac1
Presentation.
9th International Conference on Harmonic Analysis and Partial Differential Equations, El Escorial, June 12, 2012.
The 24th International Conference on Operator Theory, Timisoara, July 3, 2012.
This document introduces stochastic differential equations (SDEs). It defines SDEs as differential equations where at least one term is a stochastic process. It provides examples of SDEs including the Wiener process (also called Brownian motion), which describes the random motion of particles suspended in a fluid. The document also discusses properties of Brownian motion such as its probability distribution and independence over time intervals. It introduces the Lévy–Ciesielski construction method for building Brownian motion using Haar functions.
Complete l fuzzy metric spaces and common fixed point theoremsAlexander Decker
This document presents definitions and theorems related to complete L-fuzzy metric spaces and common fixed point theorems. It begins with introducing concepts such as L-fuzzy sets, L-fuzzy metric spaces, and triangular norms. It then defines Cauchy sequences and completeness in L-fuzzy metric spaces. The main result is Theorem 2.2, which establishes conditions under which four self-mappings of a complete L-fuzzy metric space have a unique common fixed point. These conditions include the mappings having compatible pairs, one mapping having a closed range, and the mappings satisfying a contractive-type inequality condition. The proof of the theorem constructs appropriate sequences to show convergence.
This paper studies an approximate dynamic programming (ADP) strategy of a group of nonlinear switched systems, where the external disturbances are considered. The neural network (NN) technique is regarded to estimate the unknown part of actor as well as critic to deal with the corresponding nominal system. The training technique is simul-taneously carried out based on the solution of minimizing the square error Hamilton function. The closed system’s tracking error is analyzed to converge to an attraction region of origin point with the uniformly ultimately bounded (UUB) description. The simulation results are implemented to determine the effectiveness of the ADP based controller.
Estimation of the score vector and observed information matrix in intractable...Pierre Jacob
This document discusses methods for estimating derivatives of intractable likelihoods. It introduces shift estimators that use a normal prior distribution centered on the parameter value. As the prior variance goes to zero, the posterior mean approximates the score vector. Monte Carlo methods can be used to estimate the posterior moments and provide estimators of the score vector and observed information matrix with good asymptotic properties. Shift estimators are more robust than finite difference methods when the likelihood estimators have high variance. The methods have applications to hidden Markov models and other intractable models.
The existence of common fixed point theorems of generalized contractive mappi...Alexander Decker
The document presents a common fixed point theorem for a sequence of self maps satisfying a generalized contractive condition in a non-normal cone metric space. It begins with introducing concepts such as cone metric spaces, normal and non-normal cones, and generalized contraction mappings. It then proves the main theorem: if a sequence of self maps {Tn} on a complete cone metric space X satisfies a generalized contractive condition with constants α, β, γ, δ, η, μ ∈ [0,1] such that their sum is less than 1, and x0 ∈ X with xn = Tnxn-1, then the sequence {xn} converges to a unique common fixed point v of the maps
This document discusses linear response theory and how to calculate the dielectric constant from first principles. It introduces Maxwell's equations and the relationship between polarization, electric field, and dielectric constant. The key steps are: 1) Expressing response functions in a single-particle basis set; 2) Setting up the time-dependent Hamiltonian and density matrix equation of motion; 3) Solving the equation of motion to obtain the linear response function χ0 in terms of single-particle energies and occupations. Local field effects beyond the independent particle approximation are included within the random phase approximation. The dielectric function ε is then constructed from the linear response function χ0.
This document discusses various methods for estimating normalizing constants that arise when evaluating integrals numerically. It begins by noting there are many computational methods for approximating normalizing constants across different communities. It then lists the topics that will be covered in the upcoming workshop, including discussions on estimating constants using Monte Carlo methods and Bayesian versus frequentist approaches. The document provides examples of estimating normalizing constants using Monte Carlo integration, reverse logistic regression, and Xiao-Li Meng's maximum likelihood estimation approach. It concludes by discussing some of the challenges in bringing a statistical framework to constant estimation problems.
-contraction and some fixed point results via modified !-distance mappings in t...IJECEIAES
In this Article, we introduce the notion of an -contraction, which is based on modified !-distance mappings, and employ this new definition to prove some fixed point result. Moreover, to highlight the significance of our work, we present an interesting example along with an application. '
The document provides notes on signals and systems from an EECE 301 course. It includes:
- An overview of continuous-time (C-T) and discrete-time (D-T) signal and system models.
- Details on chapters covering differentials/differences, convolution, Fourier analysis (both C-T and D-T), Laplace transforms, and Z-transforms.
- Examples of calculating the Fourier transform of specific signals like a decaying exponential and rectangular pulse. These illustrate properties of the Fourier transform.
Spillover Dynamics for Systemic Risk Measurement Using Spatial Financial Time...SYRTO Project
Spillover Dynamics for Systemic Risk Measurement Using Spatial Financial Time Series Models. Andre Lucas. Amsterdam - June, 25 2015. European Financial Management Association 2015 Annual Meetings.
Seminar Talk: Multilevel Hybrid Split Step Implicit Tau-Leap for Stochastic R...Chiheb Ben Hammouda
The document describes a multilevel hybrid split-step implicit tau-leap method for simulating stochastic reaction networks. It begins with background on modeling biochemical reaction networks stochastically. It then discusses challenges with existing simulation methods like the chemical master equation and stochastic simulation algorithm. The document introduces the split-step implicit tau-leap method as an improvement over explicit tau-leap for stiff systems. It proposes a multilevel Monte Carlo estimator using this method to efficiently estimate expectations of observables with near-optimal computational work.
1) The lecture discusses the time domain analysis of continuous time linear and time-invariant systems. It covers topics such as impulse response, convolution, and how the output of an LTI system can be determined from its impulse response and the input signal.
2) An example of analyzing the voltage response of an RC circuit to an arbitrary input is presented. The output is the sum of the zero-input response, due to initial conditions, and zero-state response, which is a convolution of the impulse response and input signal.
3) Detectors of high energy photons can be modeled as having an exponential decay impulse response. Examples of characterizing real detectors through measurements of energy resolution, timing resolution, and coincidence point spread
This document discusses the origins and concepts of asymptotic preserving (AP) schemes for numerically solving multiscale differential equations. AP schemes allow for a parameter-independent grid size while maintaining stability and convergence to the correct solution even as the parameter approaches zero. They originated from work studying boundary layers in advection-diffusion equations and the interaction between grid size and multiscale parameters. Key properties of AP schemes are that they use a parameter-independent grid, remain stable for any parameter value, and converge to the proper asymptotic limit as the parameter goes to zero.
This document discusses the normal equations method and QR decomposition method for solving linear regression problems. It notes that while the normal equations method is simpler, the QR decomposition method is numerically more stable. Specifically, it notes that the normal equations method is only backward stable if the data matrix X is well-conditioned, whereas the QR method is always backward stable. It concludes that the normal equations method is useful for teaching but to be aware of its disadvantages compared to the QR method.
Can you count on your computer for the Gaussian elimination?Hamed Zakerzadeh
Gaussian elimination is a reliable method for solving linear systems of equations when done by hand, but its reliability comes into question when performed on a computer with finite precision arithmetic. This project aims to get familiar with how finite precision affects Gaussian elimination, observe the effects, and investigate remedies by coding examples in MATLAB. Basic MATLAB coding skills are required.
1. This document summarizes key concepts in numerical analysis related to floating point arithmetic, including: the floating point number system; relative error; rounding; IEEE standard; precision versus accuracy; exceptional results; cancellation; and fused multiply-add instructions.
2. It discusses common misconceptions around floating point arithmetic, including the ideas that innocuous calculations are always accurate; increasing precision improves accuracy; and cancellation eliminates rounding errors.
3. The document uses examples to illustrate concepts like loss of accuracy from repeated operations, sensitivity to precision levels, and how cancellation can expose existing errors.
The document discusses the development of entropy stable essentially non-oscillatory (ENO) schemes of arbitrary order for systems of conservation laws. Key points include:
1) Existing ENO schemes are combined with entropy conservative fluxes to create new entropy stable ENO schemes.
2) It is shown that the jump of an ENO reconstruction has the same sign and is upper-bounded by the underlying cell averages.
3) Numerical experiments demonstrate the entropy stability and non-oscillatory properties of the new schemes.
Temple of Asclepius in Thrace. Excavation resultsKrassimira Luka
The temple and the sanctuary around were dedicated to Asklepios Zmidrenus. This name has been known since 1875 when an inscription dedicated to him was discovered in Rome. The inscription is dated in 227 AD and was left by soldiers originating from the city of Philippopolis (modern Plovdiv).
This presentation was provided by Rebecca Benner, Ph.D., of the American Society of Anesthesiologists, for the second session of NISO's 2024 Training Series "DEIA in the Scholarly Landscape." Session Two: 'Expanding Pathways to Publishing Careers,' was held June 13, 2024.
THE SACRIFICE HOW PRO-PALESTINE PROTESTS STUDENTS ARE SACRIFICING TO CHANGE T...indexPub
The recent surge in pro-Palestine student activism has prompted significant responses from universities, ranging from negotiations and divestment commitments to increased transparency about investments in companies supporting the war on Gaza. This activism has led to the cessation of student encampments but also highlighted the substantial sacrifices made by students, including academic disruptions and personal risks. The primary drivers of these protests are poor university administration, lack of transparency, and inadequate communication between officials and students. This study examines the profound emotional, psychological, and professional impacts on students engaged in pro-Palestine protests, focusing on Generation Z's (Gen-Z) activism dynamics. This paper explores the significant sacrifices made by these students and even the professors supporting the pro-Palestine movement, with a focus on recent global movements. Through an in-depth analysis of printed and electronic media, the study examines the impacts of these sacrifices on the academic and personal lives of those involved. The paper highlights examples from various universities, demonstrating student activism's long-term and short-term effects, including disciplinary actions, social backlash, and career implications. The researchers also explore the broader implications of student sacrifices. The findings reveal that these sacrifices are driven by a profound commitment to justice and human rights, and are influenced by the increasing availability of information, peer interactions, and personal convictions. The study also discusses the broader implications of this activism, comparing it to historical precedents and assessing its potential to influence policy and public opinion. The emotional and psychological toll on student activists is significant, but their sense of purpose and community support mitigates some of these challenges. However, the researchers call for acknowledging the broader Impact of these sacrifices on the future global movement of FreePalestine.
BÀI TẬP BỔ TRỢ TIẾNG ANH LỚP 9 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2024-2025 - ...
Congrès SMAI 2019
1. Convergence Analysis of Asymptotic Preserving Schemes
for strongly magnetized plasmas
Hamed Zakerzadeh¶
Institut de Math´ematiques de Toulouse, Universit´e Toulouse III - Paul Sabatier
joint work with: F. Filbet (Toulouse), M. Rodrigues (Rennes)
SMAI 2019
May 16 th 2019
¶
supported by LabEx CIMI Toulouse and Institut Universitaire de France
2. Introduction Continuous estimates Discrete estimates Numerical example References
Outline
Introduction
Continuous estimates
Discrete estimates
Numerical example
1/19
3. Introduction Continuous estimates Discrete estimates Numerical example References
Outline
Introduction
Continuous estimates
Discrete estimates
Numerical example
1/19
4. Introduction Continuous estimates Discrete estimates Numerical example References
Fusion reactor (TOKAMAK):
Тороидальная Камера с Магнитными Катушками
“toroidal chamber with magnetic coils”
requires a quite large magnetic field!
very challenging to control the plasma in the core!
not economical yet!
2/19
5. Introduction Continuous estimates Discrete estimates Numerical example References
Fusion reactor (TOKAMAK):
Тороидальная Камера с Магнитными Катушками
“toroidal chamber with magnetic coils”
requires a quite large magnetic field!
very challenging to control the plasma in the core!
not economical yet!
Vlasov equation: evolution of charged particles
∂f
∂t
+ divx (vf ) + divv (Ff ) = 0
f (0, ·, ·) = f0
electro-magnetic force field: F =
q
m
(E + v × B)
2/19
6. Introduction Continuous estimates Discrete estimates Numerical example References
Vlasov systems:
Vlasov-Maxwell system
∂f
∂t
+ divx (vf ) + divv ((E + v × B) f ) = 0, (x, v) ∈ R4
,
where E and B are solutions of Maxwell equations:
∂t E − c2 × B = − J
0
,
∂t B + × E = 0,
· E =
0
, · B = 0
with
(t, x) := q f (t, x, v)dv, J(t, x) := q vf (t, x, v)dv.
3/19
7. Introduction Continuous estimates Discrete estimates Numerical example References
Long-time Vlasov–Poisson system
with an external uniform magnetic field B(t, x) = 1
ε
(0, 0, 1)T :
ε
∂f ε
∂t
+ divx (vf ε
) + divv (E −
1
ε
v⊥
)f ε
= 0 ,
where E = − x φ such that −∆x φ = ε0
.
Singular limit ε → 0:
limit system for the weak limit f ε f :
∂f
∂t
− E⊥
· x f −
1
2
∆φ v⊥
· v f = 0 , (x, v) ∈ R4
,
limit of charge density:
∂
∂t
− x · E⊥
= 0 , x ∈ R2
.
4/19
8. Introduction Continuous estimates Discrete estimates Numerical example References
Particle-In-Cell (PIC) methods:
(i) Solve the characteristic system for N macro-particles:
εxε(t) = vε(t), xε(t0) = x0
ε ,
εvε(t) = E(t, xε(t)) −
1
ε
v⊥
ε (t), vε(t0) = v0
ε .
(ii) approximate f ε:
fN,α(t, x, v) :=
1≤k≤N
ωk ϕα(x − xk (t)) ϕα(x − vk (t)).
Proposition [Cohen and Perthame, 2000]
lim
α→0
lim
N→∞
f (t) − fN,α(t) Lp → 0, 1 ≤ p ≤ ∞,
with N number of particles and ϕα as a smooth approximation of the Dirac mass s.t.:
numerical noise
more efficient compared to direct methods (in phase space)
5/19
9. Introduction Continuous estimates Discrete estimates Numerical example References
Stiffness!
very stiff system of ODEs where ε 1:
εxε(t) = vε
εvε(t) = E(t, xε) −
1
ε
v⊥
ε
ε→0
−−−→ lim
ε→0
x(t) =?
6/19
10. Introduction Continuous estimates Discrete estimates Numerical example References
Stiffness!
very stiff system of ODEs where ε 1:
εxε(t) = vε
εvε(t) = E(t, xε) −
1
ε
v⊥
ε
ε→0
−−−→ lim
ε→0
x(t) =?
Guiding center approximation
E-cross-B drift: slow drift normal to E, in a plane perpendicular to B:
x (t) = −E⊥
(t, x(t))
(Wikipedia)
6/19
11. Introduction Continuous estimates Discrete estimates Numerical example References
Stiffness!
very stiff system of ODEs where ε 1:
εxε(t) = vε
εvε(t) = E(t, xε) −
1
ε
v⊥
ε
ε→0
−−−→ lim
ε→0
x(t) =?
Guiding center approximation
E-cross-B drift: slow drift normal to E, in a plane perpendicular to B:
x (t) = −E⊥
(t, x(t))
(Wikipedia)
[Filbet and Rodrigues, 2017]
highly oscillatory ∼ ε−2 → capture macroscopic behaviour with ∆t = O(1)
6/19
12. Introduction Continuous estimates Discrete estimates Numerical example References
Asymptotic Preserving (AP) schemes
Introduced by [Jin, 1999]
- [Il’in, 1969]: BVP
- [Larsen et al., 1987] : Neutron transport
asymptotic efficiency: uniform efficiency wrt ε
asymptotic consistency: consistent with the asymptotic system as ε → 0
asymptotic stability: uniformly stable in ε
7/19
13. Introduction Continuous estimates Discrete estimates Numerical example References
Uniform convergence
Estimate the error Uε
∆ − Uε for an r-th order scheme:
E2 = O(∆r
/ε)
8/19
14. Introduction Continuous estimates Discrete estimates Numerical example References
Uniform convergence
[Jin, 2010]
Estimate the error Uε
∆ − Uε for an r-th order scheme:
E1 = O(∆r
+ ε)
E2 = O(∆r
/ε)
Uniform estimate:
Uε
∆ − Uε
≤ min(E1, E2).
8/19
15. Introduction Continuous estimates Discrete estimates Numerical example References
Uniform convergence
[Jin, 2010]
Estimate the error Uε
∆ − Uε for an r-th order scheme:
E1 = O(∆r
+ ε)
E2 = O(∆r
/ε)
Uniform estimate:
Uε
∆ − Uε
≤ min(E1, E2).
Can we improve E1 and E2?
E1 = O(∆r
+ εq
), q > 1,
E2 = O(
∆r
εp
), p < 1.
Uε
∆ − Uε ≈ (∆r )
q
p+q
8/19
16. Introduction Continuous estimates Discrete estimates Numerical example References
Outline
Introduction
Continuous estimates
Discrete estimates
Numerical example
8/19
17. Introduction Continuous estimates Discrete estimates Numerical example References
Oscillatory limit of the continuous model
yε(t) := xε(t) − ε v⊥
ε (t) slower than xε: yε(t) = −E⊥
(t, xε(t))
(Xε(t, s, xs
ε, vs
ε), Vε(t, s, xs
ε, vs
ε), Yε(t, s, xs
ε, vs
ε)) := (xε(t), vε(t), yε(t))
K0 := E L∞ , Kt := ∂t E L∞ , Kx := dx E L∞ , Kxx := d2
x E L∞ .
9/19
18. Introduction Continuous estimates Discrete estimates Numerical example References
Oscillatory limit of the continuous model
yε(t) := xε(t) − ε v⊥
ε (t) slower than xε: yε(t) = −E⊥
(t, xε(t))
(Xε(t, s, xs
ε, vs
ε), Vε(t, s, xs
ε, vs
ε), Yε(t, s, xs
ε, vs
ε)) := (xε(t), vε(t), yε(t))
K0 := E L∞ , Kt := ∂t E L∞ , Kx := dx E L∞ , Kxx := d2
x E L∞ .
Theorem [Filbet et al., 2019]
(i) Assume that E ∈ W 1,∞. Then, for any ε > 0:
Xε(t, 0, x0
ε , v0
ε ) − X(t, 0, x0
ε )
E
ε eKx t
(1 + t2
) ( v0
ε + ε) .
(ii) Assume that E ∈ W 2,∞. Then, for any ε > 0:
Yε(t, 0, x0
ε , v0
ε ) − X(t, 0, x0
ε − ε(v0
ε )⊥
)
E
ε2
(1 + t4
) e2 Kx t
1 + ε2
+ v0
ε
2
.
9/19
19. Introduction Continuous estimates Discrete estimates Numerical example References
Proof
1. zε(t) := vε + ε E⊥
such that zε(t) = −
1
ε2
z⊥
ε (t) + ε
d
dt
E⊥
(t, xε(t))
10/19
20. Introduction Continuous estimates Discrete estimates Numerical example References
Proof
1. zε(t) := vε + ε E⊥
such that zε(t) = −
1
ε2
z⊥
ε (t) + ε
d
dt
E⊥
(t, xε(t))
2. zε(t) ≤ eKx t v0
ε + ε K0 + ε t eKx t (Kt + Kx K0)
10/19
21. Introduction Continuous estimates Discrete estimates Numerical example References
Proof
1. zε(t) := vε + ε E⊥
such that zε(t) = −
1
ε2
z⊥
ε (t) + ε
d
dt
E⊥
(t, xε(t))
2. zε(t) ≤ eKx t v0
ε + ε K0 + ε t eKx t (Kt + Kx K0)
3. vε(t) ≤ zε(t) + K0 ε
10/19
22. Introduction Continuous estimates Discrete estimates Numerical example References
Proof
1. zε(t) := vε + ε E⊥
such that zε(t) = −
1
ε2
z⊥
ε (t) + ε
d
dt
E⊥
(t, xε(t))
2. zε(t) ≤ eKx t v0
ε + ε K0 + ε t eKx t (Kt + Kx K0)
3. vε(t) ≤ zε(t) + K0 ε
4. Taylor expansion:
yε(t) = −E⊥
(t, yε(t) + εv⊥
ε (t))
= −E⊥
(t, yε) − ε dx E⊥
(t, yε) v⊥
ε + ε2
Θ0(t, yε, vε) ,
with the remainder Θ0 such that Θ0(t, yε, vε) ≤ 1
2
Kxx vε
2 .
10/19
41. Introduction Continuous estimates Discrete estimates Numerical example References
Conclusion
We have analyzed IMEX-PIC scheme for Vlasov–Poisson equations (with a given E):
ε-uniform stability
uniform convergence estimates (continuous, discrete)
Perspectives
second-order schemes → O(ε3)-estimates
inhomogeneous magnetic field [Filbet and Rodrigues, 2017]
velocity converges weakly to zero
kinetic energy converges strongly to non-zero!
3d [Degond and Filbet, 2016; Filbet et al., 2017]
Thanks For Your Attention!
18/19
42. Introduction Continuous estimates Discrete estimates Numerical example References
References I
Albert Cohen and Benoit Perthame. Optimal approximations of transport equations by particle and
pseudoparticle methods. SIAM Journal on Mathematical Analysis, 32(3):616–636, 2000.
Pierre Degond and Francis Filbet. On the asymptotic limit of the three dimensional Vlasov–Poisson
system for large magnetic field: formal derivation. arXiv preprint arXiv:1603.03666, 2016.
Francis Filbet and Luis M. Rodrigues. Asymptotically stable particle-in-cell methods for the
Vlasov–Poisson system with a strong external magnetic field. SIAM Journal on Numerical Analysis,
54(2):1120–1146, 2016.
Francis Filbet and Luis Miguel Rodrigues. Asymptotically preserving particle-in-cell methods for
inhomogeneous strongly magnetized plasmas. SIAM Journal on Numerical Analysis, 55(5):
2416–2443, 2017.
Francis Filbet, Tao Xiong, and Eric Sonnendr¨ucker. On the Vlasov–Maxwell system with a strong
external magnetic field. 2017.
Francis Filbet, L. Miguel Rodrigues, and Hamed Zakerzadeh. Convergence analysis of asymptotic
preserving schemes for strongly magnetized plasmas. In preparation, 2019.
Arlen M. Il’in. Differencing scheme for a differential equation with a small parameter affecting the
highest derivative. Mathematical Notes of the Academy of Sciences of the USSR, 6(2):596–602, 1969.
Shi Jin. Efficient asymptotic-preserving (AP) schemes for some multiscale kinetic equations. SIAM
Journal on Scientific Computing, 21(2):441–454, 1999.
Shi Jin. Asymptotic preserving (AP) schemes for multiscale kinetic and hyperbolic equations: A review.
Lecture Notes for Summer School on “Methods and Models of Kinetic Theory” (M&MKT), Porto
Ercole (Grosseto, Italy), pages 177–216, 2010.
Edward W. Larsen, J. E. Morel, and Warren F. Miller. Asymptotic solutions of numerical transport
problems in optically thick, diffusive regimes. Journal of Computational Physics, 69(2):283–324, 1987.
19/19