Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA Computational Information Criterion for Particle-Tracking with Sparse or Noisy Data
108
0
0.0
(
0
)
Added by
Stephen Pankavich
Publication date
2021
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Traditional probabilistic methods for the simulation of advection-diffusion equations (ADEs) often overlook the entropic contribution of the discretization, e.g., the number of particles, within associated numerical methods. Many times, the gain in accuracy of a highly discretized numerical model is outweighed by its associated computational costs or the noise within the data. We address the question of how many particles are needed in a simulation to best approximate and estimate parameters in one-dimensional advective-diffusive transport. To do so, we use the well-known Akaike Information Criterion (AIC) and a recently-developed correction called the Computational Information Criterion (COMIC) to guide the model selection process. Random-walk and mass-transfer particle tracking methods are employed to solve the model equations at various levels of discretization. Numerical results demonstrate that the COMIC provides an optimal number of particles that can describe a more efficient model in terms of parameter estimation and model prediction compared to the model selected by the AIC even when the data is sparse or noisy, the sampling volume is not uniform throughout the physical domain, or the error distribution of the data is non-IID Gaussian.
rate research
Read More
A new shock-tracking technique that avoids re-meshing the computational grid around the moving shock-front was recently proposed by the authors [1]. This paper describes further algorithmic improvements which make the extrapolated Discontinuity Tracking Technique (eDIT) capable of dealing with complex shock-topologies featuring shock-shock and shock-wall interactions. Various test-cases are included to describe the key features of the methodology and prove its order-of-convergence properties.
Measurement data in linear systems arising from real-world applications often suffers from both large, sparse corruptions, and widespread small-scale noise. This can render many popular solvers ineffective, as the least squares solution is far from the desired solution, and the underlying consistent system becomes harder to identify and solve. QuantileRK is a member of the Kaczmarz family of iterative projective methods that has been shown to converge exponentially for systems with arbitrarily large sparse corruptions. In this paper, we extend the analysis to the case where there are not only corruptions present, but also noise that may affect every data point, and prove that QuantileRK converges with the same rate up to an error threshold. We give both theoretical and experimental results demonstrating QuantileRKs strength.
Pseudospectral numerical schemes for solving the Dirac equation in general static curved space are derived using a pseudodifferential representation of the Dirac equation along with a simple Fourier-basis technique. Owing to the presence of non-constant coefficients in the curved space Dirac equation, convolution products usually appear when the Fourier transform is performed. The strategy based on pseudodifferential operators allows for efficient computations of these convolution products by using an ordinary fast Fourier transform algorithm. The resulting numerical methods are efficient and have spectral convergence. Simultaneously, wave absorption at the boundary can be easily derived using absorbing layers to cope with some potential negative effects of periodic conditions inherent to spectral methods. The numerical schemes are first tested on simple systems to verify the convergence and are then applied to the dynamics of charge carriers in strained graphene.
We present both modeling and computational advancements to a unique three-dimensional discontinuous Petrov-Galerkin finite element model for the simulation of laser amplification in a fiber amplifier. Our model is based on the time-harmonic Maxwell equations, and it incorporates both amplification via an active dopant and thermal effects via coupling with the heat equation. As a full vectorial finite element simulation, this model distinguishes itself from other fiber amplifier models that are typically posed as an initial value problem and make significantly more approximations. Our model supports co-, counter-, and bi-directional pumping configurations, as well as inhomogeneous and anisotropic material properties. The longer-term goal of this modeling effort is to study nonlinear phenomena that prohibit achieving unprecedented power levels in fiber amplifiers, along with validating typical approximations used in lower-fidelity models. The high-fidelity simulation comes at the cost of a high-order finite element discretization with many degrees of freedom per wavelength. This is necessary to counter the effect of numerical pollution due to the high-frequency nature of the wave simulation. To make the computation more feasible, we have developed a novel longitudinal model rescaling, using artificial material parameters with the goal of preserving certain quantities of interest. Our numerical tests demonstrate the applicability and utility of this scaled model in the simulation of an ytterbium-doped, step-index fiber amplifier that experiences laser amplification and heating. We present numerical results for the nonlinear coupled Maxwell/heat model with up to 240 wavelengths.
In this paper a deterministic sparse Fourier transform algorithm is presented which breaks the quadratic-in-sparsity runtime bottleneck for a large class of periodic functions exhibiting structured frequency support. These functions include, e.g., the oft-considered set of block frequency sparse functions of the form $$f(x) = sum^{n}_{j=1} sum^{B-1}_{k=0} c_{omega_j + k} e^{i(omega_j + k)x},~~{ omega_1, dots, omega_n } subset left(-leftlceil frac{N}{2}rightrceil, leftlfloor frac{N}{2}rightrfloorright]capmathbb{Z}$$ as a simple subclass. Theoretical error bounds in combination with numerical experiments demonstrate that the newly proposed algorithms are both fast and robust to noise. In particular, they outperform standard sparse Fourier transforms in the rapid recovery of block frequency sparse functions of the type above.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
