Tube wave signatures in cylindrically layered poroelastic media computed with spectral method

NASA Astrophysics Data System (ADS)

Karpfinger, Florian; Gurevich, Boris; Valero, Henri-Pierre; Bakulin, Andrey; Sinha, Bikash

2010-11-01

This paper describes a new algorithm based on the spectral method for the computation of Stoneley wave dispersion and attenuation propagating in cylindrical structures composed of fluid, elastic and poroelastic layers. The spectral method is a numerical method which requires discretization of the structure along the radial axis using Chebyshev points. To approximate the differential operators of the underlying differential equations, we use spectral differentiation matrices. After discretizing equations of motion along the radial direction, we can solve the problem as a generalized algebraic eigenvalue problem. For a given frequency, calculated eigenvalues correspond to the wavenumbers of different modes. The advantage of this approach is that it can very efficiently analyse structures with complicated radial layering composed of different fluid, solid and poroelastic layers. This work summarizes the fundamental equations, followed by an outline of how they are implemented in the numerical spectral schema. The interface boundary conditions are then explained for fluid/porous, elastic/porous and porous interfaces. Finally, we discuss three examples from borehole acoustics. The first model is a fluid-filled borehole surrounded by a poroelastic formation. The second considers an additional elastic layer sandwiched between the borehole and the formation, and finally a model with radially increasing permeability is considered.

The spectra of rectangular lattices of quantum waveguides

NASA Astrophysics Data System (ADS)

Nazarov, S. A.

2017-02-01

We obtain asymptotic formulae for the spectral segments of a thin (h\\ll 1) rectangular lattice of quantum waveguides which is described by a Dirichlet problem for the Laplacian. We establish that the structure of the spectrum of the lattice is incorrectly described by the commonly accepted quantum graph model with the traditional Kirchhoff conditions at the vertices. It turns out that the lengths of the spectral segments are infinitesimals of order O(e-δ/h), δ> 0, and O(h) as h\\to+0, and gaps of width O(h-2) and O(1) arise between them in the low- frequency and middle- frequency spectral ranges respectively. The first spectral segment is generated by the (unique) eigenvalue in the discrete spectrum of an infinite cross-shaped waveguide \\Theta. The absence of bounded solutions of the problem in \\Theta at the threshold frequency means that the correct model of the lattice is a graph with Dirichlet conditions at the vertices which splits into two infinite subsets of identical edges- intervals. By using perturbations of finitely many joints, we construct any given number of discrete spectrum points of the lattice below the essential spectrum as well as inside the gaps.

Optimal network modification for spectral radius dependent phase transitions

NASA Astrophysics Data System (ADS)

Rosen, Yonatan; Kirsch, Lior; Louzoun, Yoram

2016-09-01

The dynamics of contact processes on networks is often determined by the spectral radius of the networks adjacency matrices. A decrease of the spectral radius can prevent the outbreak of an epidemic, or impact the synchronization among systems of coupled oscillators. The spectral radius is thus tightly linked to network dynamics and function. As such, finding the minimal change in network structure necessary to reach the intended spectral radius is important theoretically and practically. Given contemporary big data resources such as large scale communication or social networks, this problem should be solved with a low runtime complexity. We introduce a novel method for the minimal decrease in weights of edges required to reach a given spectral radius. The problem is formulated as a convex optimization problem, where a global optimum is guaranteed. The method can be easily adjusted to an efficient discrete removal of edges. We introduce a variant of the method which finds optimal decrease with a focus on weights of vertices. The proposed algorithm is exceptionally scalable, solving the problem for real networks of tens of millions of edges in a short time.

Least-squares Legendre spectral element solutions to sound propagation problems.

PubMed

Lin, W H

2001-02-01

This paper presents a novel algorithm and numerical results of sound wave propagation. The method is based on a least-squares Legendre spectral element approach for spatial discretization and the Crank-Nicolson [Proc. Cambridge Philos. Soc. 43, 50-67 (1947)] and Adams-Bashforth [D. Gottlieb and S. A. Orszag, Numerical Analysis of Spectral Methods: Theory and Applications (CBMS-NSF Monograph, Siam 1977)] schemes for temporal discretization to solve the linearized acoustic field equations for sound propagation. Two types of NASA Computational Aeroacoustics (CAA) Workshop benchmark problems [ICASE/LaRC Workshop on Benchmark Problems in Computational Aeroacoustics, edited by J. C. Hardin, J. R. Ristorcelli, and C. K. W. Tam, NASA Conference Publication 3300, 1995a] are considered: a narrow Gaussian sound wave propagating in a one-dimensional space without flows, and the reflection of a two-dimensional acoustic pulse off a rigid wall in the presence of a uniform flow of Mach 0.5 in a semi-infinite space. The first problem was used to examine the numerical dispersion and dissipation characteristics of the proposed algorithm. The second problem was to demonstrate the capability of the algorithm in treating sound propagation in a flow. Comparisons were made of the computed results with analytical results and results obtained by other methods. It is shown that all results computed by the present method are in good agreement with the analytical solutions and results of the first problem agree very well with those predicted by other schemes.

A spectral mimetic least-squares method

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bochev, Pavel; Gerritsma, Marc

We present a spectral mimetic least-squares method for a model diffusion–reaction problem, which preserves key conservation properties of the continuum problem. Casting the model problem into a first-order system for two scalar and two vector variables shifts material properties from the differential equations to a pair of constitutive relations. We also use this system to motivate a new least-squares functional involving all four fields and show that its minimizer satisfies the differential equations exactly. Discretization of the four-field least-squares functional by spectral spaces compatible with the differential operators leads to a least-squares method in which the differential equations are alsomore » satisfied exactly. Additionally, the latter are reduced to purely topological relationships for the degrees of freedom that can be satisfied without reference to basis functions. Furthermore, numerical experiments confirm the spectral accuracy of the method and its local conservation.« less

A spectral mimetic least-squares method

DOE PAGES

Bochev, Pavel; Gerritsma, Marc

2014-09-01

We present a spectral mimetic least-squares method for a model diffusion–reaction problem, which preserves key conservation properties of the continuum problem. Casting the model problem into a first-order system for two scalar and two vector variables shifts material properties from the differential equations to a pair of constitutive relations. We also use this system to motivate a new least-squares functional involving all four fields and show that its minimizer satisfies the differential equations exactly. Discretization of the four-field least-squares functional by spectral spaces compatible with the differential operators leads to a least-squares method in which the differential equations are alsomore » satisfied exactly. Additionally, the latter are reduced to purely topological relationships for the degrees of freedom that can be satisfied without reference to basis functions. Furthermore, numerical experiments confirm the spectral accuracy of the method and its local conservation.« less

A Spectral Algorithm for Envelope Reduction of Sparse Matrices

NASA Technical Reports Server (NTRS)

Barnard, Stephen T.; Pothen, Alex; Simon, Horst D.

1993-01-01

The problem of reordering a sparse symmetric matrix to reduce its envelope size is considered. A new spectral algorithm for computing an envelope-reducing reordering is obtained by associating a Laplacian matrix with the given matrix and then sorting the components of a specified eigenvector of the Laplacian. This Laplacian eigenvector solves a continuous relaxation of a discrete problem related to envelope minimization called the minimum 2-sum problem. The permutation vector computed by the spectral algorithm is a closest permutation vector to the specified Laplacian eigenvector. Numerical results show that the new reordering algorithm usually computes smaller envelope sizes than those obtained from the current standard algorithms such as Gibbs-Poole-Stockmeyer (GPS) or SPARSPAK reverse Cuthill-McKee (RCM), in some cases reducing the envelope by more than a factor of two.

A spectral approach for discrete dislocation dynamics simulations of nanoindentation

NASA Astrophysics Data System (ADS)

Bertin, Nicolas; Glavas, Vedran; Datta, Dibakar; Cai, Wei

2018-07-01

We present a spectral approach to perform nanoindentation simulations using three-dimensional nodal discrete dislocation dynamics. The method relies on a two step approach. First, the contact problem between an indenter of arbitrary shape and an isotropic elastic half-space is solved using a spectral iterative algorithm, and the contact pressure is fully determined on the half-space surface. The contact pressure is then used as a boundary condition of the spectral solver to determine the resulting stress field produced in the simulation volume. In both stages, the mechanical fields are decomposed into Fourier modes and are efficiently computed using fast Fourier transforms. To further improve the computational efficiency, the method is coupled with a subcycling integrator and a special approach is devised to approximate the displacement field associated with surface steps. As a benchmark, the method is used to compute the response of an elastic half-space using different types of indenter. An example of a dislocation dynamics nanoindentation simulation with complex initial microstructure is presented.

Domain decomposition methods for systems of conservation laws: Spectral collocation approximations

NASA Technical Reports Server (NTRS)

Quarteroni, Alfio

1989-01-01

Hyperbolic systems of conversation laws are considered which are discretized in space by spectral collocation methods and advanced in time by finite difference schemes. At any time-level a domain deposition method based on an iteration by subdomain procedure was introduced yielding at each step a sequence of independent subproblems (one for each subdomain) that can be solved simultaneously. The method is set for a general nonlinear problem in several space variables. The convergence analysis, however, is carried out only for a linear one-dimensional system with continuous solutions. A precise form of the error reduction factor at each iteration is derived. Although the method is applied here to the case of spectral collocation approximation only, the idea is fairly general and can be used in a different context as well. For instance, its application to space discretization by finite differences is straight forward.

A method based on the Jacobi tau approximation for solving multi-term time-space fractional partial differential equations

NASA Astrophysics Data System (ADS)

Bhrawy, A. H.; Zaky, M. A.

2015-01-01

In this paper, we propose and analyze an efficient operational formulation of spectral tau method for multi-term time-space fractional differential equation with Dirichlet boundary conditions. The shifted Jacobi operational matrices of Riemann-Liouville fractional integral, left-sided and right-sided Caputo fractional derivatives are presented. By using these operational matrices, we propose a shifted Jacobi tau method for both temporal and spatial discretizations, which allows us to present an efficient spectral method for solving such problem. Furthermore, the error is estimated and the proposed method has reasonable convergence rates in spatial and temporal discretizations. In addition, some known spectral tau approximations can be derived as special cases from our algorithm if we suitably choose the corresponding special cases of Jacobi parameters θ and ϑ. Finally, in order to demonstrate its accuracy, we compare our method with those reported in the literature.

A Legendre–Fourier spectral method with exact conservation laws for the Vlasov–Poisson system

DOE Office of Scientific and Technical Information (OSTI.GOV)

Manzini, Gianmarco; Delzanno, Gian Luca; Vencels, Juris

In this study, we present the design and implementation of an L 2-stable spectral method for the discretization of the Vlasov–Poisson model of a collisionless plasma in one space and velocity dimension. The velocity and space dependence of the Vlasov equation are resolved through a truncated spectral expansion based on Legendre and Fourier basis functions, respectively. The Poisson equation, which is coupled to the Vlasov equation, is also resolved through a Fourier expansion. The resulting system of ordinary differential equation is discretized by the implicit second-order accurate Crank–Nicolson time discretization. The non-linear dependence between the Vlasov and Poisson equations ismore » iteratively solved at any time cycle by a Jacobian-Free Newton–Krylov method. In this work we analyze the structure of the main conservation laws of the resulting Legendre–Fourier model, e.g., mass, momentum, and energy, and prove that they are exactly satisfied in the semi-discrete and discrete setting. The L 2-stability of the method is ensured by discretizing the boundary conditions of the distribution function at the boundaries of the velocity domain by a suitable penalty term. The impact of the penalty term on the conservation properties is investigated theoretically and numerically. An implementation of the penalty term that does not affect the conservation of mass, momentum and energy, is also proposed and studied. A collisional term is introduced in the discrete model to control the filamentation effect, but does not affect the conservation properties of the system. Numerical results on a set of standard test problems illustrate the performance of the method.« less

A Legendre–Fourier spectral method with exact conservation laws for the Vlasov–Poisson system

DOE PAGES

Manzini, Gianmarco; Delzanno, Gian Luca; Vencels, Juris; ...

2016-04-22

In this study, we present the design and implementation of an L 2-stable spectral method for the discretization of the Vlasov–Poisson model of a collisionless plasma in one space and velocity dimension. The velocity and space dependence of the Vlasov equation are resolved through a truncated spectral expansion based on Legendre and Fourier basis functions, respectively. The Poisson equation, which is coupled to the Vlasov equation, is also resolved through a Fourier expansion. The resulting system of ordinary differential equation is discretized by the implicit second-order accurate Crank–Nicolson time discretization. The non-linear dependence between the Vlasov and Poisson equations ismore » iteratively solved at any time cycle by a Jacobian-Free Newton–Krylov method. In this work we analyze the structure of the main conservation laws of the resulting Legendre–Fourier model, e.g., mass, momentum, and energy, and prove that they are exactly satisfied in the semi-discrete and discrete setting. The L 2-stability of the method is ensured by discretizing the boundary conditions of the distribution function at the boundaries of the velocity domain by a suitable penalty term. The impact of the penalty term on the conservation properties is investigated theoretically and numerically. An implementation of the penalty term that does not affect the conservation of mass, momentum and energy, is also proposed and studied. A collisional term is introduced in the discrete model to control the filamentation effect, but does not affect the conservation properties of the system. Numerical results on a set of standard test problems illustrate the performance of the method.« less

Discrete ordinates solutions of nongray radiative transfer with diffusely reflecting walls

NASA Technical Reports Server (NTRS)

Menart, J. A.; Lee, Haeok S.; Kim, Tae-Kuk

1993-01-01

Nongray gas radiation in a plane parallel slab bounded by gray, diffusely reflecting walls is studied using the discrete ordinates method. The spectral equation of transfer is averaged over a narrow wavenumber interval preserving the spectral correlation effect. The governing equations are derived by considering the history of multiple reflections between two reflecting wails. A closure approximation is applied so that only a finite number of reflections have to be explicitly included. The closure solutions express the physics of the problem to a very high degree and show relatively little error. Numerical solutions are obtained by applying a statistical narrow-band model for gas properties and a discrete ordinates code. The net radiative wail heat fluxes and the radiative source distributions are obtained for different temperature profiles. A zeroth-degree formulation, where no wall reflection is handled explicitly, is sufficient to predict the radiative transfer accurately for most cases considered, when compared with increasingly accurate solutions based on explicitly tracing a larger number of wail reflections without any closure approximation applied.

An automatic multigrid method for the solution of sparse linear systems

NASA Technical Reports Server (NTRS)

Shapira, Yair; Israeli, Moshe; Sidi, Avram

1993-01-01

An automatic version of the multigrid method for the solution of linear systems arising from the discretization of elliptic PDE's is presented. This version is based on the structure of the algebraic system solely, and does not use the original partial differential operator. Numerical experiments show that for the Poisson equation the rate of convergence of our method is equal to that of classical multigrid methods. Moreover, the method is robust in the sense that its high rate of convergence is conserved for other classes of problems: non-symmetric, hyperbolic (even with closed characteristics) and problems on non-uniform grids. No double discretization or special treatment of sub-domains (e.g. boundaries) is needed. When supplemented with a vector extrapolation method, high rates of convergence are achieved also for anisotropic and discontinuous problems and also for indefinite Helmholtz equations. A new double discretization strategy is proposed for finite and spectral element schemes and is found better than known strategies.

Legendre spectral-collocation method for solving some types of fractional optimal control problems

PubMed Central

Sweilam, Nasser H.; Al-Ajami, Tamer M.

2014-01-01

In this paper, the Legendre spectral-collocation method was applied to obtain approximate solutions for some types of fractional optimal control problems (FOCPs). The fractional derivative was described in the Caputo sense. Two different approaches were presented, in the first approach, necessary optimality conditions in terms of the associated Hamiltonian were approximated. In the second approach, the state equation was discretized first using the trapezoidal rule for the numerical integration followed by the Rayleigh–Ritz method to evaluate both the state and control variables. Illustrative examples were included to demonstrate the validity and applicability of the proposed techniques. PMID:26257937

Mixed mimetic spectral element method for Stokes flow: A pointwise divergence-free solution

NASA Astrophysics Data System (ADS)

Kreeft, Jasper; Gerritsma, Marc

2013-05-01

In this paper we apply the recently developed mimetic discretization method to the mixed formulation of the Stokes problem in terms of vorticity, velocity and pressure. The mimetic discretization presented in this paper and in Kreeft et al. [51] is a higher-order method for curvilinear quadrilaterals and hexahedrals. Fundamental is the underlying structure of oriented geometric objects, the relation between these objects through the boundary operator and how this defines the exterior derivative, representing the grad, curl and div, through the generalized Stokes theorem. The mimetic method presented here uses the language of differential k-forms with k-cochains as their discrete counterpart, and the relations between them in terms of the mimetic operators: reduction, reconstruction and projection. The reconstruction consists of the recently developed mimetic spectral interpolation functions. The most important result of the mimetic framework is the commutation between differentiation at the continuous level with that on the finite dimensional and discrete level. As a result operators like gradient, curl and divergence are discretized exactly. For Stokes flow, this implies a pointwise divergence-free solution. This is confirmed using a set of test cases on both Cartesian and curvilinear meshes. It will be shown that the method converges optimally for all admissible boundary conditions.

Dynamics of nonautonomous discrete rogue wave solutions for an Ablowitz-Musslimani equation with PT-symmetric potential.

PubMed

Yu, Fajun

2017-02-01

Starting from a discrete spectral problem, we derive a hierarchy of nonlinear discrete equations which include the Ablowitz-Ladik (AL) equation. We analytically study the discrete rogue-wave (DRW) solutions of AL equation with three free parameters. The trajectories of peaks and depressions of profiles for the first- and second-order DRWs are produced by means of analytical and numerical methods. In particular, we study the solutions with dispersion in parity-time ( PT) symmetric potential for Ablowitz-Musslimani equation. And we consider the non-autonomous DRW solutions, parameters controlling and their interactions with variable coefficients, and predict the long-living rogue wave solutions. Our results might provide useful information for potential applications of synthetic PT symmetric systems in nonlinear optics and condensed matter physics.

Galerkin v. discrete-optimal projection in nonlinear model reduction

DOE Office of Scientific and Technical Information (OSTI.GOV)

Carlberg, Kevin Thomas; Barone, Matthew Franklin; Antil, Harbir

Discrete-optimal model-reduction techniques such as the Gauss{Newton with Approximated Tensors (GNAT) method have shown promise, as they have generated stable, accurate solutions for large-scale turbulent, compressible ow problems where standard Galerkin techniques have failed. However, there has been limited comparative analysis of the two approaches. This is due in part to difficulties arising from the fact that Galerkin techniques perform projection at the time-continuous level, while discrete-optimal techniques do so at the time-discrete level. This work provides a detailed theoretical and experimental comparison of the two techniques for two common classes of time integrators: linear multistep schemes and Runge{Kutta schemes.more » We present a number of new ndings, including conditions under which the discrete-optimal ROM has a time-continuous representation, conditions under which the two techniques are equivalent, and time-discrete error bounds for the two approaches. Perhaps most surprisingly, we demonstrate both theoretically and experimentally that decreasing the time step does not necessarily decrease the error for the discrete-optimal ROM; instead, the time step should be `matched' to the spectral content of the reduced basis. In numerical experiments carried out on a turbulent compressible- ow problem with over one million unknowns, we show that increasing the time step to an intermediate value decreases both the error and the simulation time of the discrete-optimal reduced-order model by an order of magnitude.« less

Stability analysis of spectral methods for hyperbolic initial-boundary value systems

NASA Technical Reports Server (NTRS)

Gottlieb, D.; Lustman, L.; Tadmor, E.

1986-01-01

A constant coefficient hyperbolic system in one space variable, with zero initial data is discussed. Dissipative boundary conditions are imposed at the two points x = + or - 1. This problem is discretized by a spectral approximation in space. Sufficient conditions under which the spectral numerical solution is stable are demonstrated - moreover, these conditions have to be checked only for scalar equations. The stability theorems take the form of explicit bounds for the norm of the solution in terms of the boundary data. The dependence of these bounds on N, the number of points in the domain (or equivalently the degree of the polynomials involved), is investigated for a class of standard spectral methods, including Chebyshev and Legendre collocations.

Endmember extraction from hyperspectral image based on discrete firefly algorithm (EE-DFA)

NASA Astrophysics Data System (ADS)

Zhang, Chengye; Qin, Qiming; Zhang, Tianyuan; Sun, Yuanheng; Chen, Chao

2017-04-01

This study proposed a novel method to extract endmembers from hyperspectral image based on discrete firefly algorithm (EE-DFA). Endmembers are the input of many spectral unmixing algorithms. Hence, in this paper, endmember extraction from hyperspectral image is regarded as a combinational optimization problem to get best spectral unmixing results, which can be solved by the discrete firefly algorithm. Two series of experiments were conducted on the synthetic hyperspectral datasets with different SNR and the AVIRIS Cuprite dataset, respectively. The experimental results were compared with the endmembers extracted by four popular methods: the sequential maximum angle convex cone (SMACC), N-FINDR, Vertex Component Analysis (VCA), and Minimum Volume Constrained Nonnegative Matrix Factorization (MVC-NMF). What's more, the effect of the parameters in the proposed method was tested on both synthetic hyperspectral datasets and AVIRIS Cuprite dataset, and the recommended parameters setting was proposed. The results in this study demonstrated that the proposed EE-DFA method showed better performance than the existing popular methods. Moreover, EE-DFA is robust under different SNR conditions.

The Ablowitz–Ladik system on a finite set of integers

NASA Astrophysics Data System (ADS)

Xia, Baoqiang

2018-07-01

We show how to solve initial-boundary value problems for integrable nonlinear differential–difference equations on a finite set of integers. The method we employ is the discrete analogue of the unified transform (Fokas method). The implementation of this method to the Ablowitz–Ladik system yields the solution in terms of the unique solution of a matrix Riemann–Hilbert problem, which has a jump matrix with explicit -dependence involving certain functions referred to as spectral functions. Some of these functions are defined in terms of the initial value, while the remaining spectral functions are defined in terms of two sets of boundary values. These spectral functions are not independent but satisfy an algebraic relation called global relation. We analyze the global relation to characterize the unknown boundary values in terms of the given initial and boundary values. We also discuss the linearizable boundary conditions.

Finite Volume Element (FVE) discretization and multilevel solution of the axisymmetric heat equation

NASA Astrophysics Data System (ADS)

Litaker, Eric T.

1994-12-01

The axisymmetric heat equation, resulting from a point-source of heat applied to a metal block, is solved numerically; both iterative and multilevel solutions are computed in order to compare the two processes. The continuum problem is discretized in two stages: finite differences are used to discretize the time derivatives, resulting is a fully implicit backward time-stepping scheme, and the Finite Volume Element (FVE) method is used to discretize the spatial derivatives. The application of the FVE method to a problem in cylindrical coordinates is new, and results in stencils which are analyzed extensively. Several iteration schemes are considered, including both Jacobi and Gauss-Seidel; a thorough analysis of these schemes is done, using both the spectral radii of the iteration matrices and local mode analysis. Using this discretization, a Gauss-Seidel relaxation scheme is used to solve the heat equation iteratively. A multilevel solution process is then constructed, including the development of intergrid transfer and coarse grid operators. Local mode analysis is performed on the components of the amplification matrix, resulting in the two-level convergence factors for various combinations of the operators. A multilevel solution process is implemented by using multigrid V-cycles; the iterative and multilevel results are compared and discussed in detail. The computational savings resulting from the multilevel process are then discussed.

Global spectral graph wavelet signature for surface analysis of carpal bones

NASA Astrophysics Data System (ADS)

Masoumi, Majid; Rezaei, Mahsa; Ben Hamza, A.

2018-02-01

Quantitative shape comparison is a fundamental problem in computer vision, geometry processing and medical imaging. In this paper, we present a spectral graph wavelet approach for shape analysis of carpal bones of the human wrist. We employ spectral graph wavelets to represent the cortical surface of a carpal bone via the spectral geometric analysis of the Laplace-Beltrami operator in the discrete domain. We propose global spectral graph wavelet (GSGW) descriptor that is isometric invariant, efficient to compute, and combines the advantages of both low-pass and band-pass filters. We perform experiments on shapes of the carpal bones of ten women and ten men from a publicly-available database of wrist bones. Using one-way multivariate analysis of variance (MANOVA) and permutation testing, we show through extensive experiments that the proposed GSGW framework gives a much better performance compared to the global point signature embedding approach for comparing shapes of the carpal bones across populations.

Global spectral graph wavelet signature for surface analysis of carpal bones.

PubMed

Masoumi, Majid; Rezaei, Mahsa; Ben Hamza, A

2018-02-05

Quantitative shape comparison is a fundamental problem in computer vision, geometry processing and medical imaging. In this paper, we present a spectral graph wavelet approach for shape analysis of carpal bones of the human wrist. We employ spectral graph wavelets to represent the cortical surface of a carpal bone via the spectral geometric analysis of the Laplace-Beltrami operator in the discrete domain. We propose global spectral graph wavelet (GSGW) descriptor that is isometric invariant, efficient to compute, and combines the advantages of both low-pass and band-pass filters. We perform experiments on shapes of the carpal bones of ten women and ten men from a publicly-available database of wrist bones. Using one-way multivariate analysis of variance (MANOVA) and permutation testing, we show through extensive experiments that the proposed GSGW framework gives a much better performance compared to the global point signature embedding approach for comparing shapes of the carpal bones across populations.

Topics in spectral methods

NASA Technical Reports Server (NTRS)

Gottlieb, D.; Turkel, E.

1985-01-01

After detailing the construction of spectral approximations to time-dependent mixed initial boundary value problems, a study is conducted of differential equations of the form 'partial derivative of u/partial derivative of t = Lu + f', where for each t, u(t) belongs to a Hilbert space such that u satisfies homogeneous boundary conditions. For the sake of simplicity, it is assumed that L is an unbounded, time-independent linear operator. Attention is given to Fourier methods of both Galerkin and pseudospectral method types, the Galerkin method, the pseudospectral Chebyshev and Legendre methods, the error equation, hyperbolic partial differentiation equations, and time discretization and iterative methods.

Homogenization of Winkler-Steklov spectral conditions in three-dimensional linear elasticity

NASA Astrophysics Data System (ADS)

Gómez, D.; Nazarov, S. A.; Pérez, M. E.

2018-04-01

We consider a homogenization Winkler-Steklov spectral problem that consists of the elasticity equations for a three-dimensional homogeneous anisotropic elastic body which has a plane part of the surface subject to alternating boundary conditions on small regions periodically placed along the plane. These conditions are of the Dirichlet type and of the Winkler-Steklov type, the latter containing the spectral parameter. The rest of the boundary of the body is fixed, and the period and size of the regions, where the spectral parameter arises, are of order ɛ . For fixed ɛ , the problem has a discrete spectrum, and we address the asymptotic behavior of the eigenvalues {β _k^ɛ }_{k=1}^{∞} as ɛ → 0. We show that β _k^ɛ =O(ɛ ^{-1}) for each fixed k, and we observe a common limit point for all the rescaled eigenvalues ɛ β _k^ɛ while we make it evident that, although the periodicity of the structure only affects the boundary conditions, a band-gap structure of the spectrum is inherited asymptotically. Also, we provide the asymptotic behavior for certain "groups" of eigenmodes.

Reflectionless Discrete Schrödinger Operators are Spectrally Atypical

NASA Astrophysics Data System (ADS)

VandenBoom, Tom

2017-12-01

We prove that, if an isospectral torus contains a discrete Schrödinger operator with nonconstant potential, the shift dynamics on that torus cannot be minimal. Consequently, we specify a generic sense in which finite unions of nondegenerate closed intervals having capacity one are not the spectrum of any reflectionless discrete Schrödinger operator. We also show that the only reflectionless discrete Schrödinger operators having zero, one, or two spectral gaps are periodic.

Quasi-periodic solutions to the hierarchy of four-component Toda lattices

NASA Astrophysics Data System (ADS)

Wei, Jiao; Geng, Xianguo; Zeng, Xin

2016-08-01

Starting from a discrete 3×3 matrix spectral problem, the hierarchy of four-component Toda lattices is derived by using the stationary discrete zero-curvature equation. Resorting to the characteristic polynomial of the Lax matrix for the hierarchy, we introduce a trigonal curve Km-2 of genus m - 2 and present the related Baker-Akhiezer function and meromorphic function on it. Asymptotic expansions for the Baker-Akhiezer function and meromorphic function are given near three infinite points on the trigonal curve, from which explicit quasi-periodic solutions for the hierarchy of four-component Toda lattices are obtained in terms of the Riemann theta function.

Nonconforming mortar element methods: Application to spectral discretizations

NASA Technical Reports Server (NTRS)

Maday, Yvon; Mavriplis, Cathy; Patera, Anthony

1988-01-01

Spectral element methods are p-type weighted residual techniques for partial differential equations that combine the generality of finite element methods with the accuracy of spectral methods. Presented here is a new nonconforming discretization which greatly improves the flexibility of the spectral element approach as regards automatic mesh generation and non-propagating local mesh refinement. The method is based on the introduction of an auxiliary mortar trace space, and constitutes a new approach to discretization-driven domain decomposition characterized by a clean decoupling of the local, structure-preserving residual evaluations and the transmission of boundary and continuity conditions. The flexibility of the mortar method is illustrated by several nonconforming adaptive Navier-Stokes calculations in complex geometry.

Analysis of the spectral vanishing viscosity method for periodic conservation laws

NASA Technical Reports Server (NTRS)

Maday, Yvon; Tadmor, Eitan

1988-01-01

The convergence of the spectral vanishing method for both the spectral and pseudospectral discretizations of the inviscid Burgers' equation is analyzed. It is proven that this kind of vanishing viscosity is responsible for a spectral decay of those Fourier coefficients located toward the end of the computed spectrum; consequently, the discretization error is shown to be spectrally small independent of whether the underlying solution is smooth or not. This in turn implies that the numerical solution remains uniformly bounded and convergence follows by compensated compactness arguments.

Studies of Inviscid Flux Schemes for Acoustics and Turbulence Problems

NASA Technical Reports Server (NTRS)

Morris, C. I.

2013-01-01

The last two decades have witnessed tremendous growth in computational power, the development of computational fluid dynamics (CFD) codes which scale well over thousands of processors, and the refinement of unstructured grid-generation tools which facilitate rapid surface and volume gridding of complex geometries. Thus, engineering calculations of 10(exp 7) - 10(exp 8) finite-volume cells have become routine for some types of problems. Although the Reynolds Averaged Navier Stokes (RANS) approach to modeling turbulence is still in extensive and wide use, increasingly large-eddy simulation (LES) and hybrid RANS-LES approaches are being applied to resolve the largest scales of turbulence in many engineering problems. However, it has also become evident that LES places different requirements on the numerical approaches for both the spatial and temporal discretization of the Navier Stokes equations than does RANS. In particular, LES requires high time accuracy and minimal intrinsic numerical dispersion and dissipation over a wide spectral range. In this paper, the performance of both central-difference and upwind-biased spatial discretizations is examined for a one-dimensional acoustic standing wave problem, the Taylor-Green vortex problem, and the turbulent channel fl ow problem.

Studies of Inviscid Flux Schemes for Acoustics and Turbulence Problems

NASA Technical Reports Server (NTRS)

Morris, Christopher I.

2013-01-01

The last two decades have witnessed tremendous growth in computational power, the development of computational fluid dynamics (CFD) codes which scale well over thousands of processors, and the refinement of unstructured grid-generation tools which facilitate rapid surface and volume gridding of complex geometries. Thus, engineering calculations of 10(exp 7) - 10(exp 8) finite-volume cells have become routine for some types of problems. Although the Reynolds Averaged Navier Stokes (RANS) approach to modeling turbulence is still in extensive and wide use, increasingly large-eddy simulation (LES) and hybrid RANS-LES approaches are being applied to resolve the largest scales of turbulence in many engineering problems. However, it has also become evident that LES places different requirements on the numerical approaches for both the spatial and temporal discretization of the Navier Stokes equations than does RANS. In particular, LES requires high time accuracy and minimal intrinsic numerical dispersion and dissipation over a wide spectral range. In this paper, the performance of both central-difference and upwind-biased spatial discretizations is examined for a one-dimensional acoustic standing wave problem, the Taylor-Green vortex problem, and the turbulent channel ow problem.

Research of generalized wavelet transformations of Haar correctness in remote sensing of the Earth

NASA Astrophysics Data System (ADS)

Kazaryan, Maretta; Shakhramanyan, Mihail; Nedkov, Roumen; Richter, Andrey; Borisova, Denitsa; Stankova, Nataliya; Ivanova, Iva; Zaharinova, Mariana

2017-10-01

In this paper, Haar's generalized wavelet functions are applied to the problem of ecological monitoring by the method of remote sensing of the Earth. We study generalized Haar wavelet series and suggest the use of Tikhonov's regularization method for investigating them for correctness. In the solution of this problem, an important role is played by classes of functions that were introduced and described in detail by I.M. Sobol for studying multidimensional quadrature formulas and it contains functions with rapidly convergent series of wavelet Haar. A theorem on the stability and uniform convergence of the regularized summation function of the generalized wavelet-Haar series of a function from this class with approximate coefficients is proved. The article also examines the problem of using orthogonal transformations in Earth remote sensing technologies for environmental monitoring. Remote sensing of the Earth allows to receive from spacecrafts information of medium, high spatial resolution and to conduct hyperspectral measurements. Spacecrafts have tens or hundreds of spectral channels. To process the images, the device of discrete orthogonal transforms, and namely, wavelet transforms, was used. The aim of the work is to apply the regularization method in one of the problems associated with remote sensing of the Earth and subsequently to process the satellite images through discrete orthogonal transformations, in particular, generalized Haar wavelet transforms. General methods of research. In this paper, Tikhonov's regularization method, the elements of mathematical analysis, the theory of discrete orthogonal transformations, and methods for decoding of satellite images are used. Scientific novelty. The task of processing of archival satellite snapshots (images), in particular, signal filtering, was investigated from the point of view of an incorrectly posed problem. The regularization parameters for discrete orthogonal transformations were determined.

Spectral collocation for multiparameter eigenvalue problems arising from separable boundary value problems

NASA Astrophysics Data System (ADS)

Plestenjak, Bor; Gheorghiu, Călin I.; Hochstenbach, Michiel E.

2015-10-01

In numerous science and engineering applications a partial differential equation has to be solved on some fairly regular domain that allows the use of the method of separation of variables. In several orthogonal coordinate systems separation of variables applied to the Helmholtz, Laplace, or Schrödinger equation leads to a multiparameter eigenvalue problem (MEP); important cases include Mathieu's system, Lamé's system, and a system of spheroidal wave functions. Although multiparameter approaches are exploited occasionally to solve such equations numerically, MEPs remain less well known, and the variety of available numerical methods is not wide. The classical approach of discretizing the equations using standard finite differences leads to algebraic MEPs with large matrices, which are difficult to solve efficiently. The aim of this paper is to change this perspective. We show that by combining spectral collocation methods and new efficient numerical methods for algebraic MEPs it is possible to solve such problems both very efficiently and accurately. We improve on several previous results available in the literature, and also present a MATLAB toolbox for solving a wide range of problems.

Jacobi spectral Galerkin method for elliptic Neumann problems

NASA Astrophysics Data System (ADS)

Doha, E.; Bhrawy, A.; Abd-Elhameed, W.

2009-01-01

This paper is concerned with fast spectral-Galerkin Jacobi algorithms for solving one- and two-dimensional elliptic equations with homogeneous and nonhomogeneous Neumann boundary conditions. The paper extends the algorithms proposed by Shen (SIAM J Sci Comput 15:1489-1505, 1994) and Auteri et al. (J Comput Phys 185:427-444, 2003), based on Legendre polynomials, to Jacobi polynomials with arbitrary α and β. The key to the efficiency of our algorithms is to construct appropriate basis functions with zero slope at the endpoints, which lead to systems with sparse matrices for the discrete variational formulations. The direct solution algorithm developed for the homogeneous Neumann problem in two-dimensions relies upon a tensor product process. Nonhomogeneous Neumann data are accounted for by means of a lifting. Numerical results indicating the high accuracy and effectiveness of these algorithms are presented.

Unstructured High-Order Galerkin-Temporal- Boundary Methods for the Klein-Gordon Equation with Non-Reflecting Boundary Conditions

DTIC Science & Technology

2010-06-01

9 C. Conservation of Momentum . . . . . . . . . . . . . . . . . . . . . 11 1. Gravity Effects . . . . . . . . . . . . . . . . . . . . . . . . . 12 2...describe the high-order spectral element method used to discretize the problem in space (up to 16th order polynomials ) in Chapter IV. Chapter V discusses...inertial frame. Body forces are those acting on the fluid volume that are proportional to the mass. The body forces considered here are gravity and

Toward an optimal solver for time-spectral fluid-dynamic and aeroelastic solutions on unstructured meshes

NASA Astrophysics Data System (ADS)

Mundis, Nathan L.; Mavriplis, Dimitri J.

2017-09-01

The time-spectral method applied to the Euler and coupled aeroelastic equations theoretically offers significant computational savings for purely periodic problems when compared to standard time-implicit methods. However, attaining superior efficiency with time-spectral methods over traditional time-implicit methods hinges on the ability rapidly to solve the large non-linear system resulting from time-spectral discretizations which become larger and stiffer as more time instances are employed or the period of the flow becomes especially short (i.e. the maximum resolvable wave-number increases). In order to increase the efficiency of these solvers, and to improve robustness, particularly for large numbers of time instances, the Generalized Minimal Residual Method (GMRES) is used to solve the implicit linear system over all coupled time instances. The use of GMRES as the linear solver makes time-spectral methods more robust, allows them to be applied to a far greater subset of time-accurate problems, including those with a broad range of harmonic content, and vastly improves the efficiency of time-spectral methods. In previous work, a wave-number independent preconditioner that mitigates the increased stiffness of the time-spectral method when applied to problems with large resolvable wave numbers has been developed. This preconditioner, however, directly inverts a large matrix whose size increases in proportion to the number of time instances. As a result, the computational time of this method scales as the cube of the number of time instances. In the present work, this preconditioner has been reworked to take advantage of an approximate-factorization approach that effectively decouples the spatial and temporal systems. Once decoupled, the time-spectral matrix can be inverted in frequency space, where it has entries only on the main diagonal and therefore can be inverted quite efficiently. This new GMRES/preconditioner combination is shown to be over an order of magnitude more efficient than the previous wave-number independent preconditioner for problems with large numbers of time instances and/or large reduced frequencies.

Quasi-periodic solutions of the Belov-Chaltikian lattice hierarchy

NASA Astrophysics Data System (ADS)

Geng, Xianguo; Zeng, Xin

Utilizing the characteristic polynomial of Lax matrix for the Belov-Chaltikian (BC) lattice hierarchy associated with a 3 × 3 discrete matrix spectral problem, we introduce a trigonal curve with three infinite points, from which we establish the associated Dubrovin-type equations. The essential properties of the Baker-Akhiezer function and the meromorphic function are discussed, that include their asymptotic behavior near three infinite points on the trigonal curve and the divisor of the meromorphic function. The Abel map is introduced to straighten out the continuous flow and the discrete flow in the Jacobian variety, from which the quasi-periodic solutions of the entire BC lattice hierarchy are obtained in terms of the Riemann theta function.

Two-dimensional HID light source radiative transfer using discrete ordinates method

NASA Astrophysics Data System (ADS)

Ghrib, Basma; Bouaoun, Mohamed; Elloumi, Hatem

2016-08-01

This paper shows the implementation of the Discrete Ordinates Method for handling radiation problems in High Intensity Discharge (HID) lamps. Therefore, we start with presenting this rigorous method for treatment of radiation transfer in a two-dimensional, axisymmetric HID lamp. Furthermore, the finite volume method is used for the spatial discretization of the Radiative Transfer Equation. The atom and electron densities were calculated using temperature profiles established by a 2D semi-implicit finite-element scheme for the solution of conservation equations relative to energy, momentum, and mass. Spectral intensities as a function of position and direction are first calculated, and then axial and radial radiative fluxes are evaluated as well as the net emission coefficient. The results are given for a HID mercury lamp on a line-by-line basis. A particular attention is paid on the 253.7 nm resonance and 546.1 nm green lines.

Model Order Reduction Algorithm for Estimating the Absorption Spectrum

DOE Office of Scientific and Technical Information (OSTI.GOV)

Van Beeumen, Roel; Williams-Young, David B.; Kasper, Joseph M.

The ab initio description of the spectral interior of the absorption spectrum poses both a theoretical and computational challenge for modern electronic structure theory. Due to the often spectrally dense character of this domain in the quantum propagator’s eigenspectrum for medium-to-large sized systems, traditional approaches based on the partial diagonalization of the propagator often encounter oscillatory and stagnating convergence. Electronic structure methods which solve the molecular response problem through the solution of spectrally shifted linear systems, such as the complex polarization propagator, offer an alternative approach which is agnostic to the underlying spectral density or domain location. This generality comesmore » at a seemingly high computational cost associated with solving a large linear system for each spectral shift in some discretization of the spectral domain of interest. In this work, we present a novel, adaptive solution to this high computational overhead based on model order reduction techniques via interpolation. Model order reduction reduces the computational complexity of mathematical models and is ubiquitous in the simulation of dynamical systems and control theory. The efficiency and effectiveness of the proposed algorithm in the ab initio prediction of X-ray absorption spectra is demonstrated using a test set of challenging water clusters which are spectrally dense in the neighborhood of the oxygen K-edge. On the basis of a single, user defined tolerance we automatically determine the order of the reduced models and approximate the absorption spectrum up to the given tolerance. We also illustrate that, for the systems studied, the automatically determined model order increases logarithmically with the problem dimension, compared to a linear increase of the number of eigenvalues within the energy window. Furthermore, we observed that the computational cost of the proposed algorithm only scales quadratically with respect to the problem dimension.« less

Spectral Elements Analysis for Viscoelastic Fluids at High Weissenberg Number Using Logarithmic conformation Tensor Model

NASA Astrophysics Data System (ADS)

Jafari, Azadeh; Deville, Michel O.; Fiétier, Nicolas

2008-09-01

This study discusses the capability of the constitutive laws for the matrix logarithm of the conformation tensor (LCT model) within the framework of the spectral elements method. The high Weissenberg number problems (HWNP) usually produce a lack of convergence of the numerical algorithms. Even though the question whether the HWNP is a purely numerical problem or rather a breakdown of the constitutive law of the model has remained somewhat of a mystery, it has been recognized that the selection of an appropriate constitutive equation constitutes a very crucial step although implementing a suitable numerical technique is still important for successful discrete modeling of non-Newtonian flows. The LCT model formulation of the viscoelastic equations originally suggested by Fattal and Kupferman is applied for 2-dimensional (2D) FENE-CR model. The Planar Poiseuille flow is considered as a benchmark problem to test this representation at high Weissenberg number. The numerical results are compared with numerical solution of the standard constitutive equation.

Convergence of Spectral Discretizations of the Vlasov--Poisson System

DOE PAGES

Manzini, G.; Funaro, D.; Delzanno, G. L.

2017-09-26

Here we prove the convergence of a spectral discretization of the Vlasov-Poisson system. The velocity term of the Vlasov equation is discretized using either Hermite functions on the infinite domain or Legendre polynomials on a bounded domain. The spatial term of the Vlasov and Poisson equations is discretized using periodic Fourier expansions. Boundary conditions are treated in weak form through a penalty type term that can be applied also in the Hermite case. As a matter of fact, stability properties of the approximated scheme descend from this added term. The convergence analysis is carried out in detail for the 1D-1Vmore » case, but results can be generalized to multidimensional domains, obtained as Cartesian product, in both space and velocity. The error estimates show the spectral convergence under suitable regularity assumptions on the exact solution.« less

Development and Application of Compatible Discretizations of Maxwell's Equations

DOE Office of Scientific and Technical Information (OSTI.GOV)

White, D; Koning, J; Rieben, R

We present the development and application of compatible finite element discretizations of electromagnetics problems derived from the time dependent, full wave Maxwell equations. We review the H(curl)-conforming finite element method, using the concepts and notations of differential forms as a theoretical framework. We chose this approach because it can handle complex geometries, it is free of spurious modes, it is numerically stable without the need for filtering or artificial diffusion, it correctly models the discontinuity of fields across material boundaries, and it can be very high order. Higher-order H(curl) and H(div) conforming basis functions are not unique and we havemore » designed an extensible C++ framework that supports a variety of specific instantiations of these such as standard interpolatory bases, spectral bases, hierarchical bases, and semi-orthogonal bases. Virtually any electromagnetics problem that can be cast in the language of differential forms can be solved using our framework. For time dependent problems a method-of-lines scheme is used where the Galerkin method reduces the PDE to a semi-discrete system of ODE's, which are then integrated in time using finite difference methods. For time integration of wave equations we employ the unconditionally stable implicit Newmark-Beta method, as well as the high order energy conserving explicit Maxwell Symplectic method; for diffusion equations, we employ a generalized Crank-Nicholson method. We conclude with computational examples from resonant cavity problems, time-dependent wave propagation problems, and transient eddy current problems, all obtained using the authors massively parallel computational electromagnetics code EMSolve.« less

Large-eddy simulation of a backward facing step flow using a least-squares spectral element method

NASA Technical Reports Server (NTRS)

Chan, Daniel C.; Mittal, Rajat

1996-01-01

We report preliminary results obtained from the large eddy simulation of a backward facing step at a Reynolds number of 5100. The numerical platform is based on a high order Legendre spectral element spatial discretization and a least squares time integration scheme. A non-reflective outflow boundary condition is in place to minimize the effect of downstream influence. Smagorinsky model with Van Driest near wall damping is used for sub-grid scale modeling. Comparisons of mean velocity profiles and wall pressure show good agreement with benchmark data. More studies are needed to evaluate the sensitivity of this method on numerical parameters before it is applied to complex engineering problems.

Recovery Discontinuous Galerkin Jacobian-Free Newton-Krylov Method for All-Speed Flows

DOE Office of Scientific and Technical Information (OSTI.GOV)

HyeongKae Park; Robert Nourgaliev; Vincent Mousseau

2008-07-01

A novel numerical algorithm (rDG-JFNK) for all-speed fluid flows with heat conduction and viscosity is introduced. The rDG-JFNK combines the Discontinuous Galerkin spatial discretization with the implicit Runge-Kutta time integration under the Jacobian-free Newton-Krylov framework. We solve fully-compressible Navier-Stokes equations without operator-splitting of hyperbolic, diffusion and reaction terms, which enables fully-coupled high-order temporal discretization. The stability constraint is removed due to the L-stable Explicit, Singly Diagonal Implicit Runge-Kutta (ESDIRK) scheme. The governing equations are solved in the conservative form, which allows one to accurately compute shock dynamics, as well as low-speed flows. For spatial discretization, we develop a “recovery” familymore » of DG, exhibiting nearly-spectral accuracy. To precondition the Krylov-based linear solver (GMRES), we developed an “Operator-Split”-(OS) Physics Based Preconditioner (PBP), in which we transform/simplify the fully-coupled system to a sequence of segregated scalar problems, each can be solved efficiently with Multigrid method. Each scalar problem is designed to target/cluster eigenvalues of the Jacobian matrix associated with a specific physics.« less

A discrete spherical harmonics method for radiative transfer analysis in inhomogeneous polarized planar atmosphere

NASA Astrophysics Data System (ADS)

Tapimo, Romuald; Tagne Kamdem, Hervé Thierry; Yemele, David

2018-03-01

A discrete spherical harmonics method is developed for the radiative transfer problem in inhomogeneous polarized planar atmosphere illuminated at the top by a collimated sunlight while the bottom reflects the radiation. The method expands both the Stokes vector and the phase matrix in a finite series of generalized spherical functions and the resulting vector radiative transfer equation is expressed in a set of polar directions. Hence, the polarized characteristics of the radiance within the atmosphere at any polar direction and azimuthal angle can be determined without linearization and/or interpolations. The spatial dependent of the problem is solved using the spectral Chebyshev method. The emergent and transmitted radiative intensity and the degree of polarization are predicted for both Rayleigh and Mie scattering. The discrete spherical harmonics method predictions for optical thin atmosphere using 36 streams are found in good agreement with benchmark literature results. The maximum deviation between the proposed method and literature results and for polar directions \\vert μ \\vert ≥0.1 is less than 0.5% and 0.9% for the Rayleigh and Mie scattering, respectively. These deviations for directions close to zero are about 3% and 10% for Rayleigh and Mie scattering, respectively.

A high-order Lagrangian-decoupling method for the incompressible Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Ho, Lee-Wing; Maday, Yvon; Patera, Anthony T.; Ronquist, Einar M.

1989-01-01

A high-order Lagrangian-decoupling method is presented for the unsteady convection-diffusion and incompressible Navier-Stokes equations. The method is based upon: (1) Lagrangian variational forms that reduce the convection-diffusion equation to a symmetric initial value problem; (2) implicit high-order backward-differentiation finite-difference schemes for integration along characteristics; (3) finite element or spectral element spatial discretizations; and (4) mesh-invariance procedures and high-order explicit time-stepping schemes for deducing function values at convected space-time points. The method improves upon previous finite element characteristic methods through the systematic and efficient extension to high order accuracy, and the introduction of a simple structure-preserving characteristic-foot calculation procedure which is readily implemented on modern architectures. The new method is significantly more efficient than explicit-convection schemes for the Navier-Stokes equations due to the decoupling of the convection and Stokes operators and the attendant increase in temporal stability. Numerous numerical examples are given for the convection-diffusion and Navier-Stokes equations for the particular case of a spectral element spatial discretization.

Topological susceptibility from twisted mass fermions using spectral projectors and the gradient flow

NASA Astrophysics Data System (ADS)

Alexandrou, Constantia; Athenodorou, Andreas; Cichy, Krzysztof; Constantinou, Martha; Horkel, Derek P.; Jansen, Karl; Koutsou, Giannis; Larkin, Conor

2018-04-01

We compare lattice QCD determinations of topological susceptibility using a gluonic definition from the gradient flow and a fermionic definition from the spectral-projector method. We use ensembles with dynamical light, strange and charm flavors of maximally twisted mass fermions. For both definitions of the susceptibility we employ ensembles at three values of the lattice spacing and several quark masses at each spacing. The data are fitted to chiral perturbation theory predictions with a discretization term to determine the continuum chiral condensate in the massless limit and estimate the overall discretization errors. We find that both approaches lead to compatible results in the continuum limit, but the gluonic ones are much more affected by cutoff effects. This finally yields a much smaller total error in the spectral-projector results. We show that there exists, in principle, a value of the spectral cutoff which would completely eliminate discretization effects in the topological susceptibility.

A spectral multi-domain technique applied to high-speed chemically reacting flows

NASA Technical Reports Server (NTRS)

Macaraeg, Michele G.; Streett, Craig L.; Hussaini, M. Yousuff

1989-01-01

The first applications of a spectral multidomain method for viscous compressible flow is presented. The method imposes a global flux balance condition at the interface so that high-order continuity of the solution is preserved. The global flux balance is imposed in terms of a spectral integral of the discrete equations across adjoining domains. Since the discretized equations interior to each domain solved are uncoupled from each other, and since the interface relation has a block structure, the solution scheme can be adapted to the particular requirements of each subdomain. The spectral multidomain technique presented is well-suited for the multiple scales associated with the chemically reacting and transition flows in hypersonic research. A nonstaggered multidomain discretization is used for the chemically reacting flow calculation, and the first implementation of a staggered multidomain mesh is presented for accurately solving the stability equation for a viscous compressible fluid.

Atmospheric Transmission and Particle Size Measurements, Proceedings of Workshop: 23-25 October 1979, Dayton Ohio

DTIC Science & Technology

1980-05-01

102 17. A Feasibility Study: Application of Lidar Transmission Measurement in the Slant Visual Range Problem - Ronald H. Kohl 108 18. Multiwavelength ...discrete filters gives greater spectral resolution over the whole band. The success of the Model 14-703 System led to the development of a more advanced...REQUIREMENTS Success in a wide range of atmospheric transmission measurement applications has led to the reqi,-st for more advanced capabilities which are listed

Spectral functions of strongly correlated extended systems via an exact quantum embedding

NASA Astrophysics Data System (ADS)

Booth, George H.; Chan, Garnet Kin-Lic

2015-04-01

Density matrix embedding theory (DMET) [Phys. Rev. Lett. 109, 186404 (2012), 10.1103/PhysRevLett.109.186404], introduced an approach to quantum cluster embedding methods whereby the mapping of strongly correlated bulk problems to an impurity with finite set of bath states was rigorously formulated to exactly reproduce the entanglement of the ground state. The formalism provided similar physics to dynamical mean-field theory at a tiny fraction of the cost but was inherently limited by the construction of a bath designed to reproduce ground-state, static properties. Here, we generalize the concept of quantum embedding to dynamic properties and demonstrate accurate bulk spectral functions at similarly small computational cost. The proposed spectral DMET utilizes the Schmidt decomposition of a response vector, mapping the bulk dynamic correlation functions to that of a quantum impurity cluster coupled to a set of frequency-dependent bath states. The resultant spectral functions are obtained on the real-frequency axis, without bath discretization error, and allows for the construction of arbitrary dynamic correlation functions. We demonstrate the method on the one- (1D) and two-dimensional (2D) Hubbard model, where we obtain zero temperature and thermodynamic limit spectral functions, and show the trivial extension to two-particle Green's functions. This advance therefore extends the scope and applicability of DMET in condensed-matter problems as a computationally tractable route to correlated spectral functions of extended systems and provides a competitive alternative to dynamical mean-field theory for dynamic quantities.

High-throughput quantum cascade laser (QCL) spectral histopathology: a practical approach towards clinical translation.

PubMed

Pilling, Michael J; Henderson, Alex; Bird, Benjamin; Brown, Mick D; Clarke, Noel W; Gardner, Peter

2016-06-23

Infrared microscopy has become one of the key techniques in the biomedical research field for interrogating tissue. In partnership with multivariate analysis and machine learning techniques, it has become widely accepted as a method that can distinguish between normal and cancerous tissue with both high sensitivity and high specificity. While spectral histopathology (SHP) is highly promising for improved clinical diagnosis, several practical barriers currently exist, which need to be addressed before successful implementation in the clinic. Sample throughput and speed of acquisition are key barriers and have been driven by the high volume of samples awaiting histopathological examination. FTIR chemical imaging utilising FPA technology is currently state-of-the-art for infrared chemical imaging, and recent advances in its technology have dramatically reduced acquisition times. Despite this, infrared microscopy measurements on a tissue microarray (TMA), often encompassing several million spectra, takes several hours to acquire. The problem lies with the vast quantities of data that FTIR collects; each pixel in a chemical image is derived from a full infrared spectrum, itself composed of thousands of individual data points. Furthermore, data management is quickly becoming a barrier to clinical translation and poses the question of how to store these incessantly growing data sets. Recently, doubts have been raised as to whether the full spectral range is actually required for accurate disease diagnosis using SHP. These studies suggest that once spectral biomarkers have been predetermined it may be possible to diagnose disease based on a limited number of discrete spectral features. In this current study, we explore the possibility of utilising discrete frequency chemical imaging for acquiring high-throughput, high-resolution chemical images. Utilising a quantum cascade laser imaging microscope with discrete frequency collection at key diagnostic wavelengths, we demonstrate that we can diagnose prostate cancer with high sensitivity and specificity. Finally we extend the study to a large patient dataset utilising tissue microarrays, and show that high sensitivity and specificity can be achieved using high-throughput, rapid data collection, thereby paving the way for practical implementation in the clinic.

Map-invariant spectral analysis for the identification of DNA periodicities

PubMed Central

2012-01-01

Many signal processing based methods for finding hidden periodicities in DNA sequences have primarily focused on assigning numerical values to the symbolic DNA sequence and then applying spectral analysis tools such as the short-time discrete Fourier transform (ST-DFT) to locate these repeats. The key results pertaining to this approach are however obtained using a very specific symbolic to numerical map, namely the so-called Voss representation. An important research problem is to therefore quantify the sensitivity of these results to the choice of the symbolic to numerical map. In this article, a novel algebraic approach to the periodicity detection problem is presented and provides a natural framework for studying the role of the symbolic to numerical map in finding these repeats. More specifically, we derive a new matrix-based expression of the DNA spectrum that comprises most of the widely used mappings in the literature as special cases, shows that the DNA spectrum is in fact invariable under all these mappings, and generates a necessary and sufficient condition for the invariance of the DNA spectrum to the symbolic to numerical map. Furthermore, the new algebraic framework decomposes the periodicity detection problem into several fundamental building blocks that are totally independent of each other. Sophisticated digital filters and/or alternate fast data transforms such as the discrete cosine and sine transforms can therefore be always incorporated in the periodicity detection scheme regardless of the choice of the symbolic to numerical map. Although the newly proposed framework is matrix based, identification of these periodicities can be achieved at a low computational cost. PMID:23067324

Hybrid parallelization of the XTOR-2F code for the simulation of two-fluid MHD instabilities in tokamaks

NASA Astrophysics Data System (ADS)

Marx, Alain; Lütjens, Hinrich

2017-03-01

A hybrid MPI/OpenMP parallel version of the XTOR-2F code [Lütjens and Luciani, J. Comput. Phys. 229 (2010) 8130] solving the two-fluid MHD equations in full tokamak geometry by means of an iterative Newton-Krylov matrix-free method has been developed. The present work shows that the code has been parallelized significantly despite the numerical profile of the problem solved by XTOR-2F, i.e. a discretization with pseudo-spectral representations in all angular directions, the stiffness of the two-fluid stability problem in tokamaks, and the use of a direct LU decomposition to invert the physical pre-conditioner at every Krylov iteration of the solver. The execution time of the parallelized version is an order of magnitude smaller than the sequential one for low resolution cases, with an increasing speedup when the discretization mesh is refined. Moreover, it allows to perform simulations with higher resolutions, previously forbidden because of memory limitations.

Wavelet-based spectral finite element dynamic analysis for an axially moving Timoshenko beam

NASA Astrophysics Data System (ADS)

Mokhtari, Ali; Mirdamadi, Hamid Reza; Ghayour, Mostafa

2017-08-01

In this article, wavelet-based spectral finite element (WSFE) model is formulated for time domain and wave domain dynamic analysis of an axially moving Timoshenko beam subjected to axial pretension. The formulation is similar to conventional FFT-based spectral finite element (SFE) model except that Daubechies wavelet basis functions are used for temporal discretization of the governing partial differential equations into a set of ordinary differential equations. The localized nature of Daubechies wavelet basis functions helps to rule out problems of SFE model due to periodicity assumption, especially during inverse Fourier transformation and back to time domain. The high accuracy of WSFE model is then evaluated by comparing its results with those of conventional finite element and SFE results. The effects of moving beam speed and axial tensile force on vibration and wave characteristics, and static and dynamic stabilities of moving beam are investigated.

The extended Fourier transform for 2D spectral estimation.

PubMed

Armstrong, G S; Mandelshtam, V A

2001-11-01

We present a linear algebraic method, named the eXtended Fourier Transform (XFT), for spectral estimation from truncated time signals. The method is a hybrid of the discrete Fourier transform (DFT) and the regularized resolvent transform (RRT) (J. Chen et al., J. Magn. Reson. 147, 129-137 (2000)). Namely, it estimates the remainder of a finite DFT by RRT. The RRT estimation corresponds to solution of an ill-conditioned problem, which requires regularization. The regularization depends on a parameter, q, that essentially controls the resolution. By varying q from 0 to infinity one can "tune" the spectrum between a high-resolution spectral estimate and the finite DFT. The optimal value of q is chosen according to how well the data fits the form of a sum of complex sinusoids and, in particular, the signal-to-noise ratio. Both 1D and 2D XFT are presented with applications to experimental NMR signals. Copyright 2001 Academic Press.

Stable multi-domain spectral penalty methods for fractional partial differential equations

NASA Astrophysics Data System (ADS)

Xu, Qinwu; Hesthaven, Jan S.

2014-01-01

We propose stable multi-domain spectral penalty methods suitable for solving fractional partial differential equations with fractional derivatives of any order. First, a high order discretization is proposed to approximate fractional derivatives of any order on any given grids based on orthogonal polynomials. The approximation order is analyzed and verified through numerical examples. Based on the discrete fractional derivative, we introduce stable multi-domain spectral penalty methods for solving fractional advection and diffusion equations. The equations are discretized in each sub-domain separately and the global schemes are obtained by weakly imposed boundary and interface conditions through a penalty term. Stability of the schemes are analyzed and numerical examples based on both uniform and nonuniform grids are considered to highlight the flexibility and high accuracy of the proposed schemes.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wintermeyer, Niklas; Winters, Andrew R., E-mail: awinters@math.uni-koeln.de; Gassner, Gregor J.

We design an arbitrary high-order accurate nodal discontinuous Galerkin spectral element approximation for the non-linear two dimensional shallow water equations with non-constant, possibly discontinuous, bathymetry on unstructured, possibly curved, quadrilateral meshes. The scheme is derived from an equivalent flux differencing formulation of the split form of the equations. We prove that this discretization exactly preserves the local mass and momentum. Furthermore, combined with a special numerical interface flux function, the method exactly preserves the mathematical entropy, which is the total energy for the shallow water equations. By adding a specific form of interface dissipation to the baseline entropy conserving schememore » we create a provably entropy stable scheme. That is, the numerical scheme discretely satisfies the second law of thermodynamics. Finally, with a particular discretization of the bathymetry source term we prove that the numerical approximation is well-balanced. We provide numerical examples that verify the theoretical findings and furthermore provide an application of the scheme for a partial break of a curved dam test problem.« less

Spectral Discrete Probability Density Function of Measured Wind Turbine Noise in the Far Field

PubMed Central

Ashtiani, Payam; Denison, Adelaide

2015-01-01

Of interest is the spectral character of wind turbine noise at typical residential set-back distances. In this paper, a spectral statistical analysis has been applied to immission measurements conducted at three locations. This method provides discrete probability density functions for the Turbine ONLY component of the measured noise. This analysis is completed for one-third octave sound levels, at integer wind speeds, and is compared to existing metrics for measuring acoustic comfort as well as previous discussions on low-frequency noise sources. PMID:25905097

Eigensolution analysis of spectral/hp continuous Galerkin approximations to advection-diffusion problems: Insights into spectral vanishing viscosity

NASA Astrophysics Data System (ADS)

Moura, R. C.; Sherwin, S. J.; Peiró, J.

2016-02-01

This study addresses linear dispersion-diffusion analysis for the spectral/hp continuous Galerkin (CG) formulation in one dimension. First, numerical dispersion and diffusion curves are obtained for the advection-diffusion problem and the role of multiple eigencurves peculiar to spectral/hp methods is discussed. From the eigencurves' behaviour, we observe that CG might feature potentially undesirable non-smooth dispersion/diffusion characteristics for under-resolved simulations of problems strongly dominated by either convection or diffusion. Subsequently, the linear advection equation augmented with spectral vanishing viscosity (SVV) is analysed. Dispersion and diffusion characteristics of CG with SVV-based stabilization are verified to display similar non-smooth features in flow regions where convection is much stronger than dissipation or vice-versa, owing to a dependency of the standard SVV operator on a local Péclet number. First a modification is proposed to the traditional SVV scaling that enforces a globally constant Péclet number so as to avoid the previous issues. In addition, a new SVV kernel function is suggested and shown to provide a more regular behaviour for the eigencurves along with a consistent increase in resolution power for higher-order discretizations, as measured by the extent of the wavenumber range where numerical errors are negligible. The dissipation characteristics of CG with the SVV modifications suggested are then verified to be broadly equivalent to those obtained through upwinding in the discontinuous Galerkin (DG) scheme. Nevertheless, for the kernel function proposed, the full upwind DG scheme is found to have a slightly higher resolution power for the same dissipation levels. These results show that improved CG-SVV characteristics can be pursued via different kernel functions with the aid of optimization algorithms.

On the velocity space discretization for the Vlasov-Poisson system: Comparison between implicit Hermite spectral and Particle-in-Cell methods

NASA Astrophysics Data System (ADS)

Camporeale, E.; Delzanno, G. L.; Bergen, B. K.; Moulton, J. D.

2016-01-01

We describe a spectral method for the numerical solution of the Vlasov-Poisson system where the velocity space is decomposed by means of an Hermite basis, and the configuration space is discretized via a Fourier decomposition. The novelty of our approach is an implicit time discretization that allows exact conservation of charge, momentum and energy. The computational efficiency and the cost-effectiveness of this method are compared to the fully-implicit PIC method recently introduced by Markidis and Lapenta (2011) and Chen et al. (2011). The following examples are discussed: Langmuir wave, Landau damping, ion-acoustic wave, two-stream instability. The Fourier-Hermite spectral method can achieve solutions that are several orders of magnitude more accurate at a fraction of the cost with respect to PIC.

Relating zeta functions of discrete and quantum graphs

NASA Astrophysics Data System (ADS)

Harrison, Jonathan; Weyand, Tracy

2018-02-01

We write the spectral zeta function of the Laplace operator on an equilateral metric graph in terms of the spectral zeta function of the normalized Laplace operator on the corresponding discrete graph. To do this, we apply a relation between the spectrum of the Laplacian on a discrete graph and that of the Laplacian on an equilateral metric graph. As a by-product, we determine how the multiplicity of eigenvalues of the quantum graph, that are also in the spectrum of the graph with Dirichlet conditions at the vertices, depends on the graph geometry. Finally we apply the result to calculate the vacuum energy and spectral determinant of a complete bipartite graph and compare our results with those for a star graph, a graph in which all vertices are connected to a central vertex by a single edge.

Unifying perspective: Solitary traveling waves as discrete breathers in Hamiltonian lattices and energy criteria for their stability

NASA Astrophysics Data System (ADS)

Cuevas-Maraver, Jesús; Kevrekidis, Panayotis G.; Vainchtein, Anna; Xu, Haitao

2017-09-01

In this work, we provide two complementary perspectives for the (spectral) stability of solitary traveling waves in Hamiltonian nonlinear dynamical lattices, of which the Fermi-Pasta-Ulam and the Toda lattice are prototypical examples. One is as an eigenvalue problem for a stationary solution in a cotraveling frame, while the other is as a periodic orbit modulo shifts. We connect the eigenvalues of the former with the Floquet multipliers of the latter and using this formulation derive an energy-based spectral stability criterion. It states that a sufficient (but not necessary) condition for a change in the wave stability occurs when the functional dependence of the energy (Hamiltonian) H of the model on the wave velocity c changes its monotonicity. Moreover, near the critical velocity where the change of stability occurs, we provide an explicit leading-order computation of the unstable eigenvalues, based on the second derivative of the Hamiltonian H''(c0) evaluated at the critical velocity c0. We corroborate this conclusion with a series of analytically and numerically tractable examples and discuss its parallels with a recent energy-based criterion for the stability of discrete breathers.

High-Order Moving Overlapping Grid Methodology in a Spectral Element Method

NASA Astrophysics Data System (ADS)

Merrill, Brandon E.

A moving overlapping mesh methodology that achieves spectral accuracy in space and up to second-order accuracy in time is developed for solution of unsteady incompressible flow equations in three-dimensional domains. The targeted applications are in aerospace and mechanical engineering domains and involve problems in turbomachinery, rotary aircrafts, wind turbines and others. The methodology is built within the dual-session communication framework initially developed for stationary overlapping meshes. The methodology employs semi-implicit spectral element discretization of equations in each subdomain and explicit treatment of subdomain interfaces with spectrally-accurate spatial interpolation and high-order accurate temporal extrapolation, and requires few, if any, iterations, yet maintains the global accuracy and stability of the underlying flow solver. Mesh movement is enabled through the Arbitrary Lagrangian-Eulerian formulation of the governing equations, which allows for prescription of arbitrary velocity values at discrete mesh points. The stationary and moving overlapping mesh methodologies are thoroughly validated using two- and three-dimensional benchmark problems in laminar and turbulent flows. The spatial and temporal global convergence, for both methods, is documented and is in agreement with the nominal order of accuracy of the underlying solver. Stationary overlapping mesh methodology was validated to assess the influence of long integration times and inflow-outflow global boundary conditions on the performance. In a turbulent benchmark of fully-developed turbulent pipe flow, the turbulent statistics are validated against the available data. Moving overlapping mesh simulations are validated on the problems of two-dimensional oscillating cylinder and a three-dimensional rotating sphere. The aerodynamic forces acting on these moving rigid bodies are determined, and all results are compared with published data. Scaling tests, with both methodologies, show near linear strong scaling, even for moderately large processor counts. The moving overlapping mesh methodology is utilized to investigate the effect of an upstream turbulent wake on a three-dimensional oscillating NACA0012 extruded airfoil. A direct numerical simulation (DNS) at Reynolds Number 44,000 is performed for steady inflow incident upon the airfoil oscillating between angle of attack 5.6° and 25° with reduced frequency k=0.16. Results are contrasted with subsequent DNS of the same oscillating airfoil in a turbulent wake generated by a stationary upstream cylinder.

Tempest - Efficient Computation of Atmospheric Flows Using High-Order Local Discretization Methods

NASA Astrophysics Data System (ADS)

Ullrich, P. A.; Guerra, J. E.

2014-12-01

The Tempest Framework composes several compact numerical methods to easily facilitate intercomparison of atmospheric flow calculations on the sphere and in rectangular domains. This framework includes the implementations of Spectral Elements, Discontinuous Galerkin, Flux Reconstruction, and Hybrid Finite Element methods with the goal of achieving optimal accuracy in the solution of atmospheric problems. Several advantages of this approach are discussed such as: improved pressure gradient calculation, numerical stability by vertical/horizontal splitting, arbitrary order of accuracy, etc. The local numerical discretization allows for high performance parallel computation and efficient inclusion of parameterizations. These techniques are used in conjunction with a non-conformal, locally refined, cubed-sphere grid for global simulations and standard Cartesian grids for simulations at the mesoscale. A complete implementation of the methods described is demonstrated in a non-hydrostatic setting.

The cosmological constant as an eigenvalue of a Sturm-Liouville problem

NASA Astrophysics Data System (ADS)

Astashenok, Artyom V.; Elizalde, Emilio; Yurov, Artyom V.

2014-01-01

It is observed that one of Einstein-Friedmann's equations has formally the aspect of a Sturm-Liouville problem, and that the cosmological constant, Λ, plays thereby the role of spectral parameter (what hints to its connection with the Casimir effect). The subsequent formulation of appropriate boundary conditions leads to a set of admissible values for Λ, considered as eigenvalues of the corresponding linear operator. Simplest boundary conditions are assumed, namely that the eigenfunctions belong to L 2 space, with the result that, when all energy conditions are satisfied, they yield a discrete spectrum for Λ>0 and a continuous one for Λ<0. A very interesting situation is seen to occur when the discrete spectrum contains only one point: then, there is the possibility to obtain appropriate cosmological conditions without invoking the anthropic principle. This possibility is shown to be realized in cyclic cosmological models, provided the potential of the matter field is similar to the potential of the scalar field. The dynamics of the universe in this case contains a sudden future singularity.

Solutions of the Taylor-Green Vortex Problem Using High-Resolution Explicit Finite Difference Methods

NASA Technical Reports Server (NTRS)

DeBonis, James R.

2013-01-01

A computational fluid dynamics code that solves the compressible Navier-Stokes equations was applied to the Taylor-Green vortex problem to examine the code s ability to accurately simulate the vortex decay and subsequent turbulence. The code, WRLES (Wave Resolving Large-Eddy Simulation), uses explicit central-differencing to compute the spatial derivatives and explicit Low Dispersion Runge-Kutta methods for the temporal discretization. The flow was first studied and characterized using Bogey & Bailley s 13-point dispersion relation preserving (DRP) scheme. The kinetic energy dissipation rate, computed both directly and from the enstrophy field, vorticity contours, and the energy spectra are examined. Results are in excellent agreement with a reference solution obtained using a spectral method and provide insight into computations of turbulent flows. In addition the following studies were performed: a comparison of 4th-, 8th-, 12th- and DRP spatial differencing schemes, the effect of the solution filtering on the results, the effect of large-eddy simulation sub-grid scale models, and the effect of high-order discretization of the viscous terms.

Spectral analysis of airflow sounds in patent versus occluded tracheostomy tubes: a pilot study in tracheostomized adult patients.

PubMed

Rao, A J; Niwa, H; Watanabe, Y; Fukuta, S; Yanagita, N

1990-05-01

Cannula occlusion is a life-threatening postoperative complication of tracheostomy. Current management largely relies on nursing care for prevention of fatalities because no proven mechanical, machine-based support monitoring exists. The objective of this paper was to address the problem of monitoring the state of cannula patency, based on analysis of airflow acoustic spectral patterns in tracheostomized adult patients in the patent and partially occluded cannula. Tracheal airflow sounds were picked up via a condenser microphone air-coupled to the skin just below the tracheal stoma. Signal output from Mic was amplified, high-pass filtered, digital tape-recorded, and analyzed on a mainframe computer. Although airflow frequencies for patient cannulae were predominantly low-pitched (0.1 to 0.3 kHz), occluded tubes had discrete high-pitched spectral peaks (1.3 to 1.6 kHz). These results suggest that frequency analysis of airflow sounds can identify a change in the status of cannula patency.

Integration of the shallow water equations on the sphere using a vector semi-Lagrangian scheme with a multigrid solver

NASA Technical Reports Server (NTRS)

Bates, J. R.; Semazzi, F. H. M.; Higgins, R. W.; Barros, Saulo R. M.

1990-01-01

A vector semi-Lagrangian semi-implicit two-time-level finite-difference integration scheme for the shallow water equations on the sphere is presented. A C-grid is used for the spatial differencing. The trajectory-centered discretization of the momentum equation in vector form eliminates pole problems and, at comparable cost, gives greater accuracy than a previous semi-Lagrangian finite-difference scheme which used a rotated spherical coordinate system. In terms of the insensitivity of the results to increasing timestep, the new scheme is as successful as recent spectral semi-Lagrangian schemes. In addition, the use of a multigrid method for solving the elliptic equation for the geopotential allows efficient integration with an operation count which, at high resolution, is of lower order than in the case of the spectral models. The properties of the new scheme should allow finite-difference models to compete with spectral models more effectively than has previously been possible.

Efficient spectral computation of the stationary states of rotating Bose-Einstein condensates by preconditioned nonlinear conjugate gradient methods

NASA Astrophysics Data System (ADS)

Antoine, Xavier; Levitt, Antoine; Tang, Qinglin

2017-08-01

We propose a preconditioned nonlinear conjugate gradient method coupled with a spectral spatial discretization scheme for computing the ground states (GS) of rotating Bose-Einstein condensates (BEC), modeled by the Gross-Pitaevskii Equation (GPE). We first start by reviewing the classical gradient flow (also known as imaginary time (IMT)) method which considers the problem from the PDE standpoint, leading to numerically solve a dissipative equation. Based on this IMT equation, we analyze the forward Euler (FE), Crank-Nicolson (CN) and the classical backward Euler (BE) schemes for linear problems and recognize classical power iterations, allowing us to derive convergence rates. By considering the alternative point of view of minimization problems, we propose the preconditioned steepest descent (PSD) and conjugate gradient (PCG) methods for the GS computation of the GPE. We investigate the choice of the preconditioner, which plays a key role in the acceleration of the convergence process. The performance of the new algorithms is tested in 1D, 2D and 3D. We conclude that the PCG method outperforms all the previous methods, most particularly for 2D and 3D fast rotating BECs, while being simple to implement.

Symplectic discretization for spectral element solution of Maxwell's equations

NASA Astrophysics Data System (ADS)

Zhao, Yanmin; Dai, Guidong; Tang, Yifa; Liu, Qinghuo

2009-08-01

Applying the spectral element method (SEM) based on the Gauss-Lobatto-Legendre (GLL) polynomial to discretize Maxwell's equations, we obtain a Poisson system or a Poisson system with at most a perturbation. For the system, we prove that any symplectic partitioned Runge-Kutta (PRK) method preserves the Poisson structure and its implied symplectic structure. Numerical examples show the high accuracy of SEM and the benefit of conserving energy due to the use of symplectic methods.

Transport of phase space densities through tetrahedral meshes using discrete flow mapping

NASA Astrophysics Data System (ADS)

Bajars, Janis; Chappell, David J.; Søndergaard, Niels; Tanner, Gregor

2017-01-01

Discrete flow mapping was recently introduced as an efficient ray based method determining wave energy distributions in complex built up structures. Wave energy densities are transported along ray trajectories through polygonal mesh elements using a finite dimensional approximation of a ray transfer operator. In this way the method can be viewed as a smoothed ray tracing method defined over meshed surfaces. Many applications require the resolution of wave energy distributions in three-dimensional domains, such as in room acoustics, underwater acoustics and for electromagnetic cavity problems. In this work we extend discrete flow mapping to three-dimensional domains by propagating wave energy densities through tetrahedral meshes. The geometric simplicity of the tetrahedral mesh elements is utilised to efficiently compute the ray transfer operator using a mixture of analytic and spectrally accurate numerical integration. The important issue of how to choose a suitable basis approximation in phase space whilst maintaining a reasonable computational cost is addressed via low order local approximations on tetrahedral faces in the position coordinate and high order orthogonal polynomial expansions in momentum space.

An entropy stable nodal discontinuous Galerkin method for the two dimensional shallow water equations on unstructured curvilinear meshes with discontinuous bathymetry

NASA Astrophysics Data System (ADS)

Wintermeyer, Niklas; Winters, Andrew R.; Gassner, Gregor J.; Kopriva, David A.

2017-07-01

We design an arbitrary high-order accurate nodal discontinuous Galerkin spectral element approximation for the non-linear two dimensional shallow water equations with non-constant, possibly discontinuous, bathymetry on unstructured, possibly curved, quadrilateral meshes. The scheme is derived from an equivalent flux differencing formulation of the split form of the equations. We prove that this discretization exactly preserves the local mass and momentum. Furthermore, combined with a special numerical interface flux function, the method exactly preserves the mathematical entropy, which is the total energy for the shallow water equations. By adding a specific form of interface dissipation to the baseline entropy conserving scheme we create a provably entropy stable scheme. That is, the numerical scheme discretely satisfies the second law of thermodynamics. Finally, with a particular discretization of the bathymetry source term we prove that the numerical approximation is well-balanced. We provide numerical examples that verify the theoretical findings and furthermore provide an application of the scheme for a partial break of a curved dam test problem.

Properties of Spectral Shapes of Whistler-Mode Emissions

NASA Astrophysics Data System (ADS)

Macusova, E.; Santolik, O.; Pickett, J. S.; Gurnett, D. A.; Cornilleau-Wehrlin, N.

2014-12-01

Whistler-mode emissions play an important role in wave-particle interactions occurring in the radiation belt region. Whistler mode chorus emissions consist of discrete wave packets which exhibit different spectral shapes. Rising tones (events with positive value of the frequency sweep rate) are frequently observed. Other categories of chorus spectral shapes, such as falling tones, hooks, broadband patterns, are also known. Whistler-mode emissions can additionally occur as hiss or combinations of hiss with discrete patterns. In this study, we have analyzed more than 11 years of high-time resolution measurements provided by the Wideband Data (WBD) instrument onboard four Cluster spacecraft to identify different spectral shapes of whistler mode emissions. We determine the distribution of individual groups of chorus spectral shapes in the Earth's magnetosphere and the effect of the different geomagnetic conditions on their occurrence. We focus on average polarization and propagation properties of the different types of spectral shapes, obtained during visually identified time intervals from multicomponent measurements of the STAFF-SA instrument recorded with a time resolution of 4 seconds.

A New High-Order Spectral Difference Method for Simulating Viscous Flows on Unstructured Grids with Mixed Elements

DOE Office of Scientific and Technical Information (OSTI.GOV)

Li, Mao; Qiu, Zihua; Liang, Chunlei

In the present study, a new spectral difference (SD) method is developed for viscous flows on meshes with a mixture of triangular and quadrilateral elements. The standard SD method for triangular elements, which employs Lagrangian interpolating functions for fluxes, is not stable when the designed accuracy of spatial discretization is third-order or higher. Unlike the standard SD method, the method examined here uses vector interpolating functions in the Raviart-Thomas (RT) spaces to construct continuous flux functions on reference elements. Studies have been performed for 2D wave equation and Euler equa- tions. Our present results demonstrated that the SDRT method ismore » stable and high-order accurate for a number of test problems by using triangular-, quadrilateral-, and mixed- element meshes.« less

Solution to the indexing problem of frequency domain simulation experiments

NASA Technical Reports Server (NTRS)

Mitra, Mousumi; Park, Stephen K.

1991-01-01

A frequency domain simulation experiment is one in which selected system parameters are oscillated sinusoidally to induce oscillations in one or more system statistics of interest. A spectral (Fourier) analysis of these induced oscillations is then performed. To perform this spectral analysis, all oscillation frequencies must be referenced to a common, independent variable - an oscillation index. In a discrete-event simulation, the global simulation clock is the most natural choice for the oscillation index. However, past efforts to reference all frequencies to the simulation clock generally yielded unsatisfactory results. The reason for these unsatisfactory results is explained in this paper and a new methodology which uses the simulation clock as the oscillation index is presented. Techniques for implementing this new methodology are demonstrated by performing a frequency domain simulation experiment for a network of queues.

Autopiquer - a Robust and Reliable Peak Detection Algorithm for Mass Spectrometry

NASA Astrophysics Data System (ADS)

Kilgour, David P. A.; Hughes, Sam; Kilgour, Samantha L.; Mackay, C. Logan; Palmblad, Magnus; Tran, Bao Quoc; Goo, Young Ah; Ernst, Robert K.; Clarke, David J.; Goodlett, David R.

2017-02-01

We present a simple algorithm for robust and unsupervised peak detection by determining a noise threshold in isotopically resolved mass spectrometry data. Solving this problem will greatly reduce the subjective and time-consuming manual picking of mass spectral peaks and so will prove beneficial in many research applications. The Autopiquer approach uses autocorrelation to test for the presence of (isotopic) structure in overlapping windows across the spectrum. Within each window, a noise threshold is optimized to remove the most unstructured data, whilst keeping as much of the (isotopic) structure as possible. This algorithm has been successfully demonstrated for both peak detection and spectral compression on data from many different classes of mass spectrometer and for different sample types, and this approach should also be extendible to other types of data that contain regularly spaced discrete peaks.

Autopiquer - a Robust and Reliable Peak Detection Algorithm for Mass Spectrometry.

PubMed

Kilgour, David P A; Hughes, Sam; Kilgour, Samantha L; Mackay, C Logan; Palmblad, Magnus; Tran, Bao Quoc; Goo, Young Ah; Ernst, Robert K; Clarke, David J; Goodlett, David R

2017-02-01

We present a simple algorithm for robust and unsupervised peak detection by determining a noise threshold in isotopically resolved mass spectrometry data. Solving this problem will greatly reduce the subjective and time-consuming manual picking of mass spectral peaks and so will prove beneficial in many research applications. The Autopiquer approach uses autocorrelation to test for the presence of (isotopic) structure in overlapping windows across the spectrum. Within each window, a noise threshold is optimized to remove the most unstructured data, whilst keeping as much of the (isotopic) structure as possible. This algorithm has been successfully demonstrated for both peak detection and spectral compression on data from many different classes of mass spectrometer and for different sample types, and this approach should also be extendible to other types of data that contain regularly spaced discrete peaks. Graphical Abstract ᅟ.

A shifted Jacobi collocation algorithm for wave type equations with non-local conservation conditions

NASA Astrophysics Data System (ADS)

Doha, Eid H.; Bhrawy, Ali H.; Abdelkawy, Mohammed A.

2014-09-01

In this paper, we propose an efficient spectral collocation algorithm to solve numerically wave type equations subject to initial, boundary and non-local conservation conditions. The shifted Jacobi pseudospectral approximation is investigated for the discretization of the spatial variable of such equations. It possesses spectral accuracy in the spatial variable. The shifted Jacobi-Gauss-Lobatto (SJ-GL) quadrature rule is established for treating the non-local conservation conditions, and then the problem with its initial and non-local boundary conditions are reduced to a system of second-order ordinary differential equations in temporal variable. This system is solved by two-stage forth-order A-stable implicit RK scheme. Five numerical examples with comparisons are given. The computational results demonstrate that the proposed algorithm is more accurate than finite difference method, method of lines and spline collocation approach

Transfer matrix spectrum for cyclic representations of the 6-vertex reflection algebra by quantum separation of variables

NASA Astrophysics Data System (ADS)

Pezelier, Baptiste

2018-02-01

In this proceeding, we recall the notion of quantum integrable systems on a lattice and then introduce the Sklyanin’s Separation of Variables method. We sum up the main results for the transfer matrix spectral problem for the cyclic representations of the trigonometric 6-vertex reflection algebra associated to the Bazanov-Stroganov Lax operator. These results apply as well to the spectral analysis of the lattice sine-Gordon model with open boundary conditions. The transfer matrix spectrum (both eigenvalues and eigenstates) is completely characterized in terms of the set of solutions to a discrete system of polynomial equations. We state an equivalent characterization as the set of solutions to a Baxter’s like T-Q functional equation, allowing us to rewrite the transfer matrix eigenstates in an algebraic Bethe ansatz form.

Design of Unstructured Adaptive (UA) NAS Parallel Benchmark Featuring Irregular, Dynamic Memory Accesses

NASA Technical Reports Server (NTRS)

Feng, Hui-Yu; VanderWijngaart, Rob; Biswas, Rupak; Biegel, Bryan (Technical Monitor)

2001-01-01

We describe the design of a new method for the measurement of the performance of modern computer systems when solving scientific problems featuring irregular, dynamic memory accesses. The method involves the solution of a stylized heat transfer problem on an unstructured, adaptive grid. A Spectral Element Method (SEM) with an adaptive, nonconforming mesh is selected to discretize the transport equation. The relatively high order of the SEM lowers the fraction of wall clock time spent on inter-processor communication, which eases the load balancing task and allows us to concentrate on the memory accesses. The benchmark is designed to be three-dimensional. Parallelization and load balance issues of a reference implementation will be described in detail in future reports.

A spectral approach for the stability analysis of turbulent open-channel flows over granular beds

NASA Astrophysics Data System (ADS)

Camporeale, C.; Canuto, C.; Ridolfi, L.

2012-01-01

A novel Orr-Sommerfeld-like equation for gravity-driven turbulent open-channel flows over a granular erodible bed is here derived, and the linear stability analysis is developed. The whole spectrum of eigenvalues and eigenvectors of the complete generalized eigenvalue problem is computed and analyzed. The fourth-order eigenvalue problem presents singular non-polynomial coefficients with non-homogenous Robin-type boundary conditions that involve first and second derivatives. Furthermore, the Exner condition is imposed at an internal point. We propose a numerical discretization of spectral type based on a single-domain Galerkin scheme. In order to manage the presence of singular coefficients, some properties of Jacobi polynomials have been carefully blended with numerical integration of Gauss-Legendre type. The results show a positive agreement with the classical experimental data and allow one to relate the different types of instability to such parameters as the Froude number, wavenumber, and the roughness scale. The eigenfunctions allow two types of boundary layers to be distinguished, scaling, respectively, with the roughness height and the saltation layer for the bedload sediment transport.

CNR LARA project, Italy: Airborne laboratory for environmental research

NASA Technical Reports Server (NTRS)

Bianchi, R.; Cavalli, R. M.; Fiumi, L.; Marino, C. M.; Pignatti, S.

1995-01-01

The increasing interest for the environmental problems and the study of the impact on the environment due to antropic activity produced an enhancement of remote sensing applications. The Italian National Research Council (CNR) established a new laboratory for airborne hyperspectral imaging, the LARA Project (Laboratorio Aero per Ricerche Ambientali - Airborne Laboratory for Environmental Research), equipping its airborne laboratory, a CASA-212, mainly with the Daedalus AA5000 MIVIS (Multispectral Infrared and Visible Imaging Spectrometer) instrument. MIVIS's channels, spectral bandwidths, and locations are chosen to meet the needs of scientific research for advanced applications of remote sensing data. MIVIS can make significant contributions to solving problems in many diverse areas such as geologic exploration, land use studies, mineralogy, agricultural crop studies, energy loss analysis, pollution assessment, volcanology, forest fire management and others. The broad spectral range and the many discrete narrow channels of MIVIS provide a fine quantization of spectral information that permits accurate definition of absorption features from a variety of materials, allowing the extraction of chemical and physical information of our environment. The availability of such a hyperspectral imager, that will operate mainly in the Mediterranean area, at the present represents a unique opportunity for those who are involved in environmental studies and land-management to collect systematically large-scale and high spectral-spatial resolution data of this part of the world. Nevertheless, MIVIS deployments will touch other parts of the world, where a major interest from the international scientific community is present.

Retrieval of the aerosol size distribution in the complex anomalous diffraction approximation

NASA Astrophysics Data System (ADS)

Franssens, Ghislain R.

This contribution reports some recently achieved results in aerosol size distribution retrieval in the complex anomalous diffraction approximation (ADA) to MIE scattering theory. This approximation is valid for spherical particles that are large compared to the wavelength and have a refractive index close to 1. The ADA kernel is compared with the exact MIE kernel. Despite being a simple approximation, the ADA seems to have some practical value for the retrieval of the larger modes of tropospheric and lower stratospheric aerosols. The ADA has the advantage over MIE theory that an analytic inversion of the associated Fredholm integral equation becomes possible. In addition, spectral inversion in the ADA can be formulated as a well-posed problem. In this way, a new inverse formula was obtained, which allows the direct computation of the size distribution as an integral over the spectral extinction function. This formula is valid for particles that both scatter and absorb light and it also takes the spectral dispersion of the refractive index into account. Some details of the numerical implementation of the inverse formula are illustrated using a modified gamma test distribution. Special attention is given to the integration of spectrally truncated discrete extinction data with errors.

Center for Efficient Exascale Discretizations Software Suite

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kolev, Tzanio; Dobrev, Veselin; Tomov, Vladimir

The CEED Software suite is a collection of generally applicable software tools focusing on the following computational motives: PDE discretizations on unstructured meshes, high-order finite element and spectral element methods and unstructured adaptive mesh refinement. All of this software is being developed as part of CEED, a co-design Center for Efficient Exascale Discretizations, within DOE's Exascale Computing Project (ECP) program.

A pseudospectral Legendre method for hyperbolic equations with an improved stability condition

NASA Technical Reports Server (NTRS)

Tal-Ezer, Hillel

1986-01-01

A new pseudospectral method is introduced for solving hyperbolic partial differential equations. This method uses different grid points than previously used pseudospectral methods: in fact the grid points are related to the zeroes of the Legendre polynomials. The main advantage of this method is that the allowable time step is proportional to the inverse of the number of grid points 1/N rather than to 1/n(2) (as in the case of other pseudospectral methods applied to mixed initial boundary value problems). A highly accurate time discretization suitable for these spectral methods is discussed.

A pseudospectral Legendre method for hyperbolic equations with an improved stability condition

NASA Technical Reports Server (NTRS)

Tal-Ezer, H.

1984-01-01

A new pseudospectral method is introduced for solving hyperbolic partial differential equations. This method uses different grid points than previously used pseudospectral methods: in fact the grid are related to the zeroes of the Legendre polynomials. The main advantage of this method is that the allowable time step is proportional to the inverse of the number of grid points 1/N rather than to 1/n(2) (as in the case of other pseudospectral methods applied to mixed initial boundary value problems). A highly accurate time discretization suitable for these spectral methods is discussed.

The angular difference function and its application to image registration.

PubMed

Keller, Yosi; Shkolnisky, Yoel; Averbuch, Amir

2005-06-01

The estimation of large motions without prior knowledge is an important problem in image registration. In this paper, we present the angular difference function (ADF) and demonstrate its applicability to rotation estimation. The ADF of two functions is defined as the integral of their spectral difference along the radial direction. It is efficiently computed using the pseudopolar Fourier transform, which computes the discrete Fourier transform of an image on a near spherical grid. Unlike other Fourier-based registration schemes, the suggested approach does not require any interpolation. Thus, it is more accurate and significantly faster.

Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling

PubMed Central

Luo, Qifang; Zhou, Yongquan; Xie, Jian; Ma, Mingzhi; Li, Liangliang

2014-01-01

A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probability in the pulse emission and loudness phases. An intensive virtual population neighborhood search is integrated into the discrete bat algorithm to further improve the performance. Finally, the experimental results show the suitability and efficiency of the present discrete bat algorithm for optimal permutation flow shop scheduling problem. PMID:25243220

Discrete bat algorithm for optimal problem of permutation flow shop scheduling.

PubMed

Luo, Qifang; Zhou, Yongquan; Xie, Jian; Ma, Mingzhi; Li, Liangliang

2014-01-01

A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probability in the pulse emission and loudness phases. An intensive virtual population neighborhood search is integrated into the discrete bat algorithm to further improve the performance. Finally, the experimental results show the suitability and efficiency of the present discrete bat algorithm for optimal permutation flow shop scheduling problem.

Scalar discrete nonlinear multipoint boundary value problems

NASA Astrophysics Data System (ADS)

Rodriguez, Jesus; Taylor, Padraic

2007-06-01

In this paper we provide sufficient conditions for the existence of solutions to scalar discrete nonlinear multipoint boundary value problems. By allowing more general boundary conditions and by imposing less restrictions on the nonlinearities, we obtain results that extend previous work in the area of discrete boundary value problems [Debra L. Etheridge, Jesus Rodriguez, Periodic solutions of nonlinear discrete-time systems, Appl. Anal. 62 (1996) 119-137; Debra L. Etheridge, Jesus Rodriguez, Scalar discrete nonlinear two-point boundary value problems, J. Difference Equ. Appl. 4 (1998) 127-144].

A spectral Poisson solver for kinetic plasma simulation

NASA Astrophysics Data System (ADS)

Szeremley, Daniel; Obberath, Jens; Brinkmann, Ralf

2011-10-01

Plasma resonance spectroscopy is a well established plasma diagnostic method, realized in several designs. One of these designs is the multipole resonance probe (MRP). In its idealized - geometrically simplified - version it consists of two dielectrically shielded, hemispherical electrodes to which an RF signal is applied. A numerical tool is under development which is capable of simulating the dynamics of the plasma surrounding the MRP in electrostatic approximation. In this contribution we concentrate on the specialized Poisson solver for that tool. The plasma is represented by an ensemble of point charges. By expanding both the charge density and the potential into spherical harmonics, a largely analytical solution of the Poisson problem can be employed. For a practical implementation, the expansion must be appropriately truncated. With this spectral solver we are able to efficiently solve the Poisson equation in a kinetic plasma simulation without the need of introducing a spatial discretization.

Determination of design and operation parameters for upper atmospheric research instrumentation to yield optimum resolution with deconvolution, appendix 4

NASA Technical Reports Server (NTRS)

Ioup, George E.; Ioup, Juliette W.

1989-01-01

The power spectrum for a stationary random process can be defined with the Wiener-Khintchine Theorem, which says that the power spectrum and the auto correlation function are a Fourier transform pair. To implement this theorem for signals that are discrete and of finite length we can use the Blackman-Tukey method. Blackman and Tukey (1958) show that a function w(tau), called a lag window, can be applied to the auto correlation estimates to obtain power spectrum estimates that are statistically stable. The Fourier transform of w(r) is called a spectral window. Typical choices for spectral windows show a distinct trade-off between the main lobe width and side lobe strength. A new idea for designing windows by taking linear combinations of the standard windows to produce hybrid windows was introduced by Smith (1985). We implement Smith's idea to obtain spectral windows with narrow main lobes and smaller (compared with typical windows) near side lobes. One of the main contributions of this thesis is that we show that Smith's problem is equivalent to a Quadratic Programming (QP) problem with linear equality and inequality constraints. A computer program was written to produce hybrid windows by setting up and solving the QP problem. We also developed and solved two variations of the original problem. The two variations involved changing the inequality constraints in both cases from non negativity on the combination coefficients to non negativity on the hybrid lag window itself. For the second variation, the window functions used to construct the hybrid window were changed to a frequency-variable set of truncated cosinusoids. A series of tests was run with the three computer programs to investigate the behavior of the hybrid spectral and lag windows. Emphasis was put on obtaining spectral windows with both relatively narrow main lobes and the lowest possible (for these algorithms) near side lobes. Some success was achieved for this goal. A 10 dB peak side lobe reduction over the rectangular spectral window without significant main lobe broadening was achieved. Also, average side lobe levels of -117 dB were reached at a cost of doubling the main lobe width (at the -3 dB point).

A new approach for modeling composite materials

NASA Astrophysics Data System (ADS)

Alcaraz de la Osa, R.; Moreno, F.; Saiz, J. M.

2013-03-01

The increasing use of composite materials is due to their ability to tailor materials for special purposes, with applications evolving day by day. This is why predicting the properties of these systems from their constituents, or phases, has become so important. However, assigning macroscopical optical properties for these materials from the bulk properties of their constituents is not a straightforward task. In this research, we present a spectral analysis of three-dimensional random composite typical nanostructures using an Extension of the Discrete Dipole Approximation (E-DDA code), comparing different approaches and emphasizing the influences of optical properties of constituents and their concentration. In particular, we hypothesize a new approach that preserves the individual nature of the constituents introducing at the same time a variation in the optical properties of each discrete element that is driven by the surrounding medium. The results obtained with this new approach compare more favorably with the experiment than previous ones. We have also applied it to a non-conventional material composed of a metamaterial embedded in a dielectric matrix. Our version of the Discrete Dipole Approximation code, the EDDA code, has been formulated specifically to tackle this kind of problem, including materials with either magnetic and tensor properties.

A fast solver for the Helmholtz equation based on the generalized multiscale finite-element method

NASA Astrophysics Data System (ADS)

Fu, Shubin; Gao, Kai

2017-11-01

Conventional finite-element methods for solving the acoustic-wave Helmholtz equation in highly heterogeneous media usually require finely discretized mesh to represent the medium property variations with sufficient accuracy. Computational costs for solving the Helmholtz equation can therefore be considerably expensive for complicated and large geological models. Based on the generalized multiscale finite-element theory, we develop a novel continuous Galerkin method to solve the Helmholtz equation in acoustic media with spatially variable velocity and mass density. Instead of using conventional polynomial basis functions, we use multiscale basis functions to form the approximation space on the coarse mesh. The multiscale basis functions are obtained from multiplying the eigenfunctions of a carefully designed local spectral problem with an appropriate multiscale partition of unity. These multiscale basis functions can effectively incorporate the characteristics of heterogeneous media's fine-scale variations, thus enable us to obtain accurate solution to the Helmholtz equation without directly solving the large discrete system formed on the fine mesh. Numerical results show that our new solver can significantly reduce the dimension of the discrete Helmholtz equation system, and can also obviously reduce the computational time.

Generalized fictitious methods for fluid-structure interactions: Analysis and simulations

NASA Astrophysics Data System (ADS)

Yu, Yue; Baek, Hyoungsu; Karniadakis, George Em

2013-07-01

We present a new fictitious pressure method for fluid-structure interaction (FSI) problems in incompressible flow by generalizing the fictitious mass and damping methods we published previously in [1]. The fictitious pressure method involves modification of the fluid solver whereas the fictitious mass and damping methods modify the structure solver. We analyze all fictitious methods for simplified problems and obtain explicit expressions for the optimal reduction factor (convergence rate index) at the FSI interface [2]. This analysis also demonstrates an apparent similarity of fictitious methods to the FSI approach based on Robin boundary conditions, which have been found to be very effective in FSI problems. We implement all methods, including the semi-implicit Robin based coupling method, in the context of spectral element discretization, which is more sensitive to temporal instabilities than low-order methods. However, the methods we present here are simple and general, and hence applicable to FSI based on any other spatial discretization. In numerical tests, we verify the selection of optimal values for the fictitious parameters for simplified problems and for vortex-induced vibrations (VIV) even at zero mass ratio ("for-ever-resonance"). We also develop an empirical a posteriori analysis for complex geometries and apply it to 3D patient-specific flexible brain arteries with aneurysms for very large deformations. We demonstrate that the fictitious pressure method enhances stability and convergence, and is comparable or better in most cases to the Robin approach or the other fictitious methods.

Hybrid DG/FV schemes for magnetohydrodynamics and relativistic hydrodynamics

NASA Astrophysics Data System (ADS)

Núñez-de la Rosa, Jonatan; Munz, Claus-Dieter

2018-01-01

This paper presents a high order hybrid discontinuous Galerkin/finite volume scheme for solving the equations of the magnetohydrodynamics (MHD) and of the relativistic hydrodynamics (SRHD) on quadrilateral meshes. In this approach, for the spatial discretization, an arbitrary high order discontinuous Galerkin spectral element (DG) method is combined with a finite volume (FV) scheme in order to simulate complex flow problems involving strong shocks. Regarding the time discretization, a fourth order strong stability preserving Runge-Kutta method is used. In the proposed hybrid scheme, a shock indicator is computed at the beginning of each Runge-Kutta stage in order to flag those elements containing shock waves or discontinuities. Subsequently, the DG solution in these troubled elements and in the current time step is projected onto a subdomain composed of finite volume subcells. Right after, the DG operator is applied to those unflagged elements, which, in principle, are oscillation-free, meanwhile the troubled elements are evolved with a robust second/third order FV operator. With this approach we are able to numerically simulate very challenging problems in the context of MHD and SRHD in one, and two space dimensions and with very high order polynomials. We make convergence tests and show a comprehensive one- and two dimensional testbench for both equation systems, focusing in problems with strong shocks. The presented hybrid approach shows that numerical schemes of very high order of accuracy are able to simulate these complex flow problems in an efficient and robust manner.

The Hölder continuity of spectral measures of an extended CMV matrix

NASA Astrophysics Data System (ADS)

Munger, Paul E.; Ong, Darren C.

2014-09-01

We prove results about the Hölder continuity of the spectral measures of the extended CMV matrix, given power law bounds of the solution of the eigenvalue equation. We thus arrive at a unitary analogue of the results of Damanik, Killip, and Lenz ["Uniform spectral properties of one-dimensional quasicrystals, III. α-continuity," Commun. Math. Phys. 212, 191-204 (2000)] about the spectral measure of the discrete Schrödinger operator.

The Hölder continuity of spectral measures of an extended CMV matrix.

PubMed

Munger, Paul E; Ong, Darren C

2014-09-01

We prove results about the Hölder continuity of the spectral measures of the extended CMV matrix, given power law bounds of the solution of the eigenvalue equation. We thus arrive at a unitary analogue of the results of Damanik, Killip, and Lenz ["Uniform spectral properties of one-dimensional quasicrystals, III. α-continuity," Commun. Math. Phys.55, 191-204 (2000)] about the spectral measure of the discrete Schrödinger operator.

An Investigation of the Overlap Between the Statistical Discrete Gust and the Power Spectral Density Analysis Methods

NASA Technical Reports Server (NTRS)

Perry, Boyd, III; Pototzky, Anthony S.; Woods, Jessica A.

1989-01-01

The results of a NASA investigation of a claimed Overlap between two gust response analysis methods: the Statistical Discrete Gust (SDG) Method and the Power Spectral Density (PSD) Method are presented. The claim is that the ratio of an SDG response to the corresponding PSD response is 10.4. Analytical results presented for several different airplanes at several different flight conditions indicate that such an Overlap does appear to exist. However, the claim was not met precisely: a scatter of up to about 10 percent about the 10.4 factor can be expected.

Energy Criterion for the Spectral Stability of Discrete Breathers.

PubMed

Kevrekidis, Panayotis G; Cuevas-Maraver, Jesús; Pelinovsky, Dmitry E

2016-08-26

Discrete breathers are ubiquitous structures in nonlinear anharmonic models ranging from the prototypical example of the Fermi-Pasta-Ulam model to Klein-Gordon nonlinear lattices, among many others. We propose a general criterion for the emergence of instabilities of discrete breathers analogous to the well-established Vakhitov-Kolokolov criterion for solitary waves. The criterion involves the change of monotonicity of the discrete breather's energy as a function of the breather frequency. Our analysis suggests and numerical results corroborate that breathers with increasing (decreasing) energy-frequency dependence are generically unstable in soft (hard) nonlinear potentials.

Discrete Gust Model for Launch Vehicle Assessments

NASA Technical Reports Server (NTRS)

Leahy, Frank B.

2008-01-01

Analysis of spacecraft vehicle responses to atmospheric wind gusts during flight is important in the establishment of vehicle design structural requirements and operational capability. Typically, wind gust models can be either a spectral type determined by a random process having a wide range of wavelengths, or a discrete type having a single gust of predetermined magnitude and shape. Classical discrete models used by NASA during the Apollo and Space Shuttle Programs included a 9 m/sec quasi-square-wave gust with variable wavelength from 60 to 300 m. A later study derived discrete gust from a military specification (MIL-SPEC) document that used a "1-cosine" shape. The MIL-SPEC document contains a curve of non-dimensional gust magnitude as a function of non-dimensional gust half-wavelength based on the Dryden spectral model, but fails to list the equation necessary to reproduce the curve. Therefore, previous studies could only estimate a value of gust magnitude from the curve, or attempt to fit a function to it. This paper presents the development of the MIL-SPEC curve, and provides the necessary information to calculate discrete gust magnitudes as a function of both gust half-wavelength and the desired probability level of exceeding a specified gust magnitude.

Assessment of Power Quality based on Fuzzy Logic and Discrete Wavelet Transform for Nonstationary Disturbances

NASA Astrophysics Data System (ADS)

Sinha, Pampa; Nath, Sudipta

2010-10-01

The main aspects of power system delivery are reliability and quality. If all the customers of a power system get uninterrupted power through the year then the system is considered to be reliable. The term power quality may be referred to as maintaining near sinusoidal voltage at rated frequency at the consumers end. The power component definitions are defined according to the IEEE Standard 1459-2000 both for single phase and three phase unbalanced systems based on Fourier Transform (FFT). In the presence of nonstationary power quality (PQ) disturbances results in accurate values due to its sensitivity to the spectral leakage problem. To overcome these limitations the power quality components are calculated using Discrete Wavelet Transform (DWT). In order to handle the uncertainties associated with electric power systems operations fuzzy logic has been incorporated in this paper. A new power quality index has been introduced here which can assess the power quality under nonstationary disturbances.

Efficient and stable exponential time differencing Runge-Kutta methods for phase field elastic bending energy models

NASA Astrophysics Data System (ADS)

Wang, Xiaoqiang; Ju, Lili; Du, Qiang

2016-07-01

The Willmore flow formulated by phase field dynamics based on the elastic bending energy model has been widely used to describe the shape transformation of biological lipid vesicles. In this paper, we develop and investigate some efficient and stable numerical methods for simulating the unconstrained phase field Willmore dynamics and the phase field Willmore dynamics with fixed volume and surface area constraints. The proposed methods can be high-order accurate and are completely explicit in nature, by combining exponential time differencing Runge-Kutta approximations for time integration with spectral discretizations for spatial operators on regular meshes. We also incorporate novel linear operator splitting techniques into the numerical schemes to improve the discrete energy stability. In order to avoid extra numerical instability brought by use of large penalty parameters in solving the constrained phase field Willmore dynamics problem, a modified augmented Lagrange multiplier approach is proposed and adopted. Various numerical experiments are performed to demonstrate accuracy and stability of the proposed methods.

An interactive approach based on a discrete differential evolution algorithm for a class of integer bilevel programming problems

NASA Astrophysics Data System (ADS)

Li, Hong; Zhang, Li; Jiao, Yong-Chang

2016-07-01

This paper presents an interactive approach based on a discrete differential evolution algorithm to solve a class of integer bilevel programming problems, in which integer decision variables are controlled by an upper-level decision maker and real-value or continuous decision variables are controlled by a lower-level decision maker. Using the Karush--Kuhn-Tucker optimality conditions in the lower-level programming, the original discrete bilevel formulation can be converted into a discrete single-level nonlinear programming problem with the complementarity constraints, and then the smoothing technique is applied to deal with the complementarity constraints. Finally, a discrete single-level nonlinear programming problem is obtained, and solved by an interactive approach. In each iteration, for each given upper-level discrete variable, a system of nonlinear equations including the lower-level variables and Lagrange multipliers is solved first, and then a discrete nonlinear programming problem only with inequality constraints is handled by using a discrete differential evolution algorithm. Simulation results show the effectiveness of the proposed approach.

Robust Multipoint Water-Fat Separation Using Fat Likelihood Analysis

PubMed Central

Yu, Huanzhou; Reeder, Scott B.; Shimakawa, Ann; McKenzie, Charles A.; Brittain, Jean H.

2016-01-01

Fat suppression is an essential part of routine MRI scanning. Multiecho chemical-shift based water-fat separation methods estimate and correct for Bo field inhomogeneity. However, they must contend with the intrinsic challenge of water-fat ambiguity that can result in water-fat swapping. This problem arises because the signals from two chemical species, when both are modeled as a single discrete spectral peak, may appear indistinguishable in the presence of Bo off-resonance. In conventional methods, the water-fat ambiguity is typically removed by enforcing field map smoothness using region growing based algorithms. In reality, the fat spectrum has multiple spectral peaks. Using this spectral complexity, we introduce a novel concept that identifies water and fat for multiecho acquisitions by exploiting the spectral differences between water and fat. A fat likelihood map is produced to indicate if a pixel is likely to be water-dominant or fat-dominant by comparing the fitting residuals of two different signal models. The fat likelihood analysis and field map smoothness provide complementary information, and we designed an algorithm (Fat Likelihood Analysis for Multiecho Signals) to exploit both mechanisms. It is demonstrated in a wide variety of data that the Fat Likelihood Analysis for Multiecho Signals algorithm offers highly robust water-fat separation for 6-echo acquisitions, particularly in some previously challenging applications. PMID:21842498

Verification of a non-hydrostatic dynamical core using horizontally spectral element vertically finite difference method: 2-D aspects

NASA Astrophysics Data System (ADS)

Choi, S.-J.; Giraldo, F. X.; Kim, J.; Shin, S.

2014-06-01

The non-hydrostatic (NH) compressible Euler equations of dry atmosphere are solved in a simplified two dimensional (2-D) slice framework employing a spectral element method (SEM) for the horizontal discretization and a finite difference method (FDM) for the vertical discretization. The SEM uses high-order nodal basis functions associated with Lagrange polynomials based on Gauss-Lobatto-Legendre (GLL) quadrature points. The FDM employs a third-order upwind biased scheme for the vertical flux terms and a centered finite difference scheme for the vertical derivative terms and quadrature. The Euler equations used here are in a flux form based on the hydrostatic pressure vertical coordinate, which are the same as those used in the Weather Research and Forecasting (WRF) model, but a hybrid sigma-pressure vertical coordinate is implemented in this model. We verified the model by conducting widely used standard benchmark tests: the inertia-gravity wave, rising thermal bubble, density current wave, and linear hydrostatic mountain wave. The results from those tests demonstrate that the horizontally spectral element vertically finite difference model is accurate and robust. By using the 2-D slice model, we effectively show that the combined spatial discretization method of the spectral element and finite difference method in the horizontal and vertical directions, respectively, offers a viable method for the development of a NH dynamical core.

Discrete-continuous variable structural synthesis using dual methods

NASA Technical Reports Server (NTRS)

Schmit, L. A.; Fleury, C.

1980-01-01

Approximation concepts and dual methods are extended to solve structural synthesis problems involving a mix of discrete and continuous sizing type of design variables. Pure discrete and pure continuous variable problems can be handled as special cases. The basic mathematical programming statement of the structural synthesis problem is converted into a sequence of explicit approximate primal problems of separable form. These problems are solved by constructing continuous explicit dual functions, which are maximized subject to simple nonnegativity constraints on the dual variables. A newly devised gradient projection type of algorithm called DUAL 1, which includes special features for handling dual function gradient discontinuities that arise from the discrete primal variables, is used to find the solution of each dual problem. Computational implementation is accomplished by incorporating the DUAL 1 algorithm into the ACCESS 3 program as a new optimizer option. The power of the method set forth is demonstrated by presenting numerical results for several example problems, including a pure discrete variable treatment of a metallic swept wing and a mixed discrete-continuous variable solution for a thin delta wing with fiber composite skins.

Pseudo spectral collocation with Maxwell polynomials for kinetic equations with energy diffusion

NASA Astrophysics Data System (ADS)

Sánchez-Vizuet, Tonatiuh; Cerfon, Antoine J.

2018-02-01

We study the approximation and stability properties of a recently popularized discretization strategy for the speed variable in kinetic equations, based on pseudo-spectral collocation on a grid defined by the zeros of a non-standard family of orthogonal polynomials called Maxwell polynomials. Taking a one-dimensional equation describing energy diffusion due to Fokker-Planck collisions with a Maxwell-Boltzmann background distribution as the test bench for the performance of the scheme, we find that Maxwell based discretizations outperform other commonly used schemes in most situations, often by orders of magnitude. This provides a strong motivation for their use in high-dimensional gyrokinetic simulations. However, we also show that Maxwell based schemes are subject to a non-modal time stepping instability in their most straightforward implementation, so that special care must be given to the discrete representation of the linear operators in order to benefit from the advantages provided by Maxwell polynomials.

Direct Connection between the RII Chain and the Nonautonomous Discrete Modified KdV Lattice

NASA Astrophysics Data System (ADS)

Maeda, Kazuki; Tsujimoto, Satoshi

2013-11-01

The spectral transformation technique for symmetric RII polynomials is developed. Use of this technique reveals that the nonautonomous discrete modified KdV (nd-mKdV) lattice is directly connected with the RII chain. Hankel determinant solutions to the semi-infinite nd-mKdV lattice are also presented.

An investigation of the 'Overlap' between the Statistical-Discrete-Gust and the Power-Spectral-Density analysis methods

NASA Technical Reports Server (NTRS)

Perry, Boyd, III; Pototzky, Anthony S.; Woods, Jessica A.

1989-01-01

This paper presents the results of a NASA investigation of a claimed 'Overlap' between two gust response analysis methods: the Statistical Discrete Gust (SDG) method and the Power Spectral Density (PSD) method. The claim is that the ratio of an SDG response to the corresponding PSD response is 10.4. Analytical results presented in this paper for several different airplanes at several different flight conditions indicate that such an 'Overlap' does appear to exist. However, the claim was not met precisely: a scatter of up to about 10 percent about the 10.4 factor can be expected.

Cramer-Rao Bound for Gaussian Random Processes and Applications to Radar Processing of Atmospheric Signals

NASA Technical Reports Server (NTRS)

Frehlich, Rod

1993-01-01

Calculations of the exact Cramer-Rao Bound (CRB) for unbiased estimates of the mean frequency, signal power, and spectral width of Doppler radar/lidar signals (a Gaussian random process) are presented. Approximate CRB's are derived using the Discrete Fourier Transform (DFT). These approximate results are equal to the exact CRB when the DFT coefficients are mutually uncorrelated. Previous high SNR limits for CRB's are shown to be inaccurate because the discrete summations cannot be approximated with integration. The performance of an approximate maximum likelihood estimator for mean frequency approaches the exact CRB for moderate signal to noise ratio and moderate spectral width.

Augmenting the spectral efficiency of enhanced PAM-DMT-based optical wireless communications.

PubMed

Islim, Mohamed Sufyan; Haas, Harald

2016-05-30

The energy efficiency of pulse-amplitude-modulated discrete multitone modulation (PAM-DMT) decreases as the modulation order of M-PAM modulation increases. Enhanced PAM-DMT (ePAM-DMT) was proposed as a solution to the reduced energy efficiency of PAM-DMT. This was achieved by allowing multiple streams of PAM-DMT to be superimposed and successively demodulated at the receiver side. In order to maintain a distortion-free unipolar ePAM-DMT system, the multiple time-domain PAM-DMT streams are required to be aligned. However, aligning the antisymmetry in ePAM-DMT is complex and results in efficiency losses. In this paper, a novel simplified method to apply the superposition modulation on M-PAM modulated discrete multitone (DMT) is introduced. Contrary to ePAM-DMT, the signal generation of the proposed system, termed augmented spectral efficiency discrete multitone (ASE-DMT), occurs in the frequency domain. This results in an improved spectral and energy efficiency. The analytical bit error rate (BER) performance bound of the proposed system is derived and compared with Monte-Carlo simulations. The system performance is shown to offer significant electrical and optical energy savings compared with ePAM-DMT and DC-biased optical orthogonal frequency division multiplexing (DCO-OFDM).

Prompting children to reason proportionally: Processing discrete units as continuous amounts.

PubMed

Boyer, Ty W; Levine, Susan C

2015-05-01

Recent studies reveal that children can solve proportional reasoning problems presented with continuous amounts that enable intuitive strategies by around 6 years of age but have difficulties with problems presented with discrete units that tend to elicit explicit count-and-match strategies until at least 10 years of age. The current study tests whether performance on discrete unit problems might be improved by prompting intuitive reasoning with continuous-format problems. Participants were kindergarten, second-grade, and fourth-grade students (N = 194) assigned to either an experimental condition, where they were given continuous amount proportion problems before discrete unit proportion problems, or a control condition, where they were given all discrete unit problems. Results of a three-way mixed-model analysis of variance examining school grade, experimental condition, and block of trials indicated that fourth-grade students in the experimental condition outperformed those in the control condition on discrete unit problems in the second half of the experiment, but kindergarten and second-grade students did not differ by condition. This suggests that older children can be prompted to use intuitive strategies to reason proportionally. (c) 2015 APA, all rights reserved).

Properties of wavelet discretization of Black-Scholes equation

NASA Astrophysics Data System (ADS)

Finěk, Václav

2017-07-01

Using wavelet methods, the continuous problem is transformed into a well-conditioned discrete problem. And once a non-symmetric problem is given, squaring yields a symmetric positive definite formulation. However squaring usually makes the condition number of discrete problems substantially worse. This note is concerned with a wavelet based numerical solution of the Black-Scholes equation for pricing European options. We show here that in wavelet coordinates a symmetric part of the discretized equation dominates over an unsymmetric part in the standard economic environment with low interest rates. It provides some justification for using a fractional step method with implicit treatment of the symmetric part of the weak form of the Black-Scholes operator and with explicit treatment of its unsymmetric part. Then a well-conditioned discrete problem is obtained.

Spectral theory of extreme statistics in birth-death systems

NASA Astrophysics Data System (ADS)

Meerson, Baruch

2008-03-01

Statistics of rare events, or large deviations, in chemical reactions and systems of birth-death type have attracted a great deal of interest in many areas of science including cell biochemistry, astrochemistry, epidemiology, population biology, etc. Large deviations become of vital importance when discrete (non-continuum) nature of a population of ``particles'' (molecules, bacteria, cells, animals or even humans) and stochastic character of interactions can drive the population to extinction. I will briefly review the novel spectral method [1-3] for calculating the extreme statistics of a broad class of birth-death processes and reactions involving a single species. The spectral method combines the probability generating function formalism with the Sturm-Liouville theory of linear differential operators. It involves a controlled perturbative treatment based on a natural large parameter of the problem: the average number of particles/individuals in a stationary or metastable state. For extinction (the first passage) problems the method yields accurate results for the extinction statistics and for the quasi-stationary probability distribution, including the tails, of metastable states. I will demonstrate the power of the method on the example of a branching and annihilation reaction, A ->-2.8mm2mm2A,,A ->-2.8mm2mm , representative of a rather general class of processes. *M. Assaf and B. Meerson, Phys. Rev. Lett. 97, 200602 (2006). *M. Assaf and B. Meerson, Phys. Rev. E 74, 041115 (2006). *M. Assaf and B. Meerson, Phys. Rev. E 75, 031122 (2007).

Achieving algorithmic resilience for temporal integration through spectral deferred corrections

DOE PAGES

Grout, Ray; Kolla, Hemanth; Minion, Michael; ...

2017-05-08

Spectral deferred corrections (SDC) is an iterative approach for constructing higher-order-accurate numerical approximations of ordinary differential equations. SDC starts with an initial approximation of the solution defined at a set of Gaussian or spectral collocation nodes over a time interval and uses an iterative application of lower-order time discretizations applied to a correction equation to improve the solution at these nodes. Each deferred correction sweep increases the formal order of accuracy of the method up to the limit inherent in the accuracy defined by the collocation points. In this paper, we demonstrate that SDC is well suited to recovering frommore » soft (transient) hardware faults in the data. A strategy where extra correction iterations are used to recover from soft errors and provide algorithmic resilience is proposed. Specifically, in this approach the iteration is continued until the residual (a measure of the error in the approximation) is small relative to the residual of the first correction iteration and changes slowly between successive iterations. Here, we demonstrate the effectiveness of this strategy for both canonical test problems and a comprehensive situation involving a mature scientific application code that solves the reacting Navier-Stokes equations for combustion research.« less

Achieving algorithmic resilience for temporal integration through spectral deferred corrections

DOE Office of Scientific and Technical Information (OSTI.GOV)

Grout, Ray; Kolla, Hemanth; Minion, Michael

2017-05-08

Spectral deferred corrections (SDC) is an iterative approach for constructing higher- order accurate numerical approximations of ordinary differential equations. SDC starts with an initial approximation of the solution defined at a set of Gaussian or spectral collocation nodes over a time interval and uses an iterative application of lower-order time discretizations applied to a correction equation to improve the solution at these nodes. Each deferred correction sweep increases the formal order of accuracy of the method up to the limit inherent in the accuracy defined by the collocation points. In this paper, we demonstrate that SDC is well suited tomore » recovering from soft (transient) hardware faults in the data. A strategy where extra correction iterations are used to recover from soft errors and provide algorithmic resilience is proposed. Specifically, in this approach the iteration is continued until the residual (a measure of the error in the approximation) is small relative to the residual on the first correction iteration and changes slowly between successive iterations. We demonstrate the effectiveness of this strategy for both canonical test problems and a comprehen- sive situation involving a mature scientific application code that solves the reacting Navier-Stokes equations for combustion research.« less

Achieving algorithmic resilience for temporal integration through spectral deferred corrections

DOE Office of Scientific and Technical Information (OSTI.GOV)

Grout, Ray; Kolla, Hemanth; Minion, Michael

2017-05-08

Spectral deferred corrections (SDC) is an iterative approach for constructing higher-order-accurate numerical approximations of ordinary differential equations. SDC starts with an initial approximation of the solution defined at a set of Gaussian or spectral collocation nodes over a time interval and uses an iterative application of lower-order time discretizations applied to a correction equation to improve the solution at these nodes. Each deferred correction sweep increases the formal order of accuracy of the method up to the limit inherent in the accuracy defined by the collocation points. In this paper, we demonstrate that SDC is well suited to recovering frommore » soft (transient) hardware faults in the data. A strategy where extra correction iterations are used to recover from soft errors and provide algorithmic resilience is proposed. Specifically, in this approach the iteration is continued until the residual (a measure of the error in the approximation) is small relative to the residual of the first correction iteration and changes slowly between successive iterations. We demonstrate the effectiveness of this strategy for both canonical test problems and a comprehensive situation involving a mature scientific application code that solves the reacting Navier-Stokes equations for combustion research.« less

Eigenmodes of Ducted Flows With Radially-Dependent Axial and Swirl Velocity Components

NASA Technical Reports Server (NTRS)

Kousen, Kenneth A.

1999-01-01

This report characterizes the sets of small disturbances possible in cylindrical and annular ducts with mean flow whose axial and tangential components vary arbitrarily with radius. The linearized equations of motion are presented and discussed, and then exponential forms for the axial, circumferential, and time dependencies of any unsteady disturbances are assumed. The resultant equations form a generalized eigenvalue problem, the solution of which yields the axial wavenumbers and radial mode shapes of the unsteady disturbances. Two numerical discretizations are applied to the system of equations: (1) a spectral collocation technique based on Chebyshev polynomial expansions on the Gauss-Lobatto points, and (2) second and fourth order finite differences on uniform grids. The discretized equations are solved using a standard eigensystem package employing the QR algorithm. The eigenvalues fall into two primary categories: a discrete set (analogous to the acoustic modes found in uniform mean flows) and a continuous band (analogous to convected disturbances in uniform mean flows) where the phase velocities of the disturbances correspond to the local mean flow velocities. Sample mode shapes and eigensystem distributions are presented for both sheared axial and swirling flows. The physics of swirling flows is examined with reference to hydrodynamic stability and completeness of the eigensystem expansions. The effect of assuming exponential dependence in the axial direction is discussed.

Weak turbulence simulations with the Hermite-Fourier spectral method

NASA Astrophysics Data System (ADS)

Vencels, Juris; Delzanno, Gian Luca; Manzini, Gianmarco; Roytershteyn, Vadim; Markidis, Stefano

2015-11-01

Recently, a new (transform) method based on a Fourier-Hermite (FH) discretization of the Vlasov-Maxwell equations has been developed. The resulting set of moment equations is discretized implicitly in time with a Crank-Nicolson scheme and solved with a nonlinear Newton-Krylov technique. For periodic boundary conditions, this discretization delivers a scheme that conserves the total mass, momentum and energy of the system exactly. In this work, we apply the FH method to study a problem of Langmuir turbulence, where a low signal-to-noise ratio is important to follow the turbulent cascade and might require a lot of computational resources if studied with PIC. We simulate a weak (low density) electron beam moving in a Maxwellian plasma and subject to an instability that generates Langmuir waves and a weak turbulence field. We also discuss some optimization techniques to optimally select the Hermite basis in terms of its shift and scaling argument, and show that this technique improve the overall accuracy of the method. Finally, we discuss the applicability of the HF method for studying kinetic plasma turbulence. This work was funded by LDRD under the auspices of the NNSA of the U.S. by LANL under contract DE-AC52-06NA25396 and by EC through the EPiGRAM project (grant agreement no. 610598. epigram-project.eu).

Coupled atmosphere/canopy model for remote sensing of plant reflectance features

NASA Technical Reports Server (NTRS)

Gerstl, S. A.; Zardecki, A.

1985-01-01

Solar radiative transfer through a coupled system of atmosphere and plant canopy is modeled as a multiple-scattering problem through a layered medium of random scatterers. The radiative transfer equation is solved by the discrete-ordinates finite-element method. Analytic expressions are derived that allow the calculation of scattering and absorption cross sections for any plant canopy layer form measurable biophysical parameters such as the leaf area index, leaf angle distribution, and individual leaf reflectance and transmittance data. An expression for a canopy scattering phase function is also given. Computational results are in good agreement with spectral reflectance measurements directly above a soybean canopy, and the concept of greenness- and brightness-transforms of Landsat MSS data is reconfirmed with the computed results. A sensitivity analysis with the coupled atmosphere/canopy model quantifies how satellite-sensed spectral radiances are affected by increased atmospheric aerosols, by varying leaf area index, by anisotropic leaf scattering, and by non-Lambertian soil boundary conditions. Possible extensions to a 2-D model are also discussed.

Krylov Deferred Correction Accelerated Method of Lines Transpose for Parabolic Problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jia, Jun; Jingfang, Huang

2008-01-01

In this paper, a new class of numerical methods for the accurate and efficient solutions of parabolic partial differential equations is presented. Unlike traditional method of lines (MoL), the new {\\bf \\it Krylov deferred correction (KDC) accelerated method of lines transpose (MoL^T)} first discretizes the temporal direction using Gaussian type nodes and spectral integration, and symbolically applies low-order time marching schemes to form a preconditioned elliptic system, which is then solved iteratively using Newton-Krylov techniques such as Newton-GMRES or Newton-BiCGStab method. Each function evaluation in the Newton-Krylov method is simply one low-order time-stepping approximation of the error by solving amore » decoupled system using available fast elliptic equation solvers. Preliminary numerical experiments show that the KDC accelerated MoL^T technique is unconditionally stable, can be spectrally accurate in both temporal and spatial directions, and allows optimal time-step sizes in long-time simulations.« less

Audibility threshold spectrum for prominent discrete tone analysis

NASA Astrophysics Data System (ADS)

Kimizuka, Ikuo

2005-09-01

To evaluate the annoyance of tonal components in noise emissions, ANSI S1.13 (for general purposes) and/or ISO 7779/ECMA-74 (dedicatedfor IT equipment) state two similar metrics: tone-to-noise ratio (TNR) and prominence ratio(PR). By these or either of these two parameters, noise of question with a sharp spectral peak is analyzed by high resolution FFF and classified as prominent when it exceeds some criterion curve. According to present procedures, however this designation is dependent on only the spectral shape. To resolve this problem, the author proposes a threshold spectrum of human ear audibility. The spectrum is based on the reference threshold of hearing which is defined in ISO 389-7 and/or ISO 226. With this spectrum, one can objectively define whether the noise peak of question is audible or not, by simple comparison of the peak amplitude of noise emission and the corresponding value of threshold. Applying the threshold, one can avoid overkilling or unnecessary action for noise. Such a peak with absolutely low amplitude is not audible.

"Ersatz" and "hybrid" NMR spectral estimates using the filter diagonalization method.

PubMed

Ridge, Clark D; Shaka, A J

2009-03-12

The filter diagonalization method (FDM) is an efficient and elegant way to make a spectral estimate purely in terms of Lorentzian peaks. As NMR spectral peaks of liquids conform quite well to this model, the FDM spectral estimate can be accurate with far fewer time domain points than conventional discrete Fourier transform (DFT) processing. However, noise is not efficiently characterized by a finite number of Lorentzian peaks, or by any other analytical form, for that matter. As a result, noise can affect the FDM spectrum in different ways than it does the DFT spectrum, and the effect depends on the dimensionality of the spectrum. Regularization to suppress (or control) the influence of noise to give an "ersatz", or EFDM, spectrum is shown to sometimes miss weak features, prompting a more conservative implementation of filter diagonalization. The spectra obtained, called "hybrid" or HFDM spectra, are acquired by using regularized FDM to obtain an "infinite time" spectral estimate and then adding to it the difference between the DFT of the data and the finite time FDM estimate, over the same time interval. HFDM has a number of advantages compared to the EFDM spectra, where all features must be Lorentzian. They also show better resolution than DFT spectra. The HFDM spectrum is a reliable and robust way to try to extract more information from noisy, truncated data records and is less sensitive to the choice of regularization parameter. In multidimensional NMR of liquids, HFDM is a conservative way to handle the problems of noise, truncation, and spectral peaks that depart significantly from the model of a multidimensional Lorentzian peak.

Utilization of the Discrete Differential Evolution for Optimization in Multidimensional Point Clouds.

PubMed

Uher, Vojtěch; Gajdoš, Petr; Radecký, Michal; Snášel, Václav

2016-01-01

The Differential Evolution (DE) is a widely used bioinspired optimization algorithm developed by Storn and Price. It is popular for its simplicity and robustness. This algorithm was primarily designed for real-valued problems and continuous functions, but several modified versions optimizing both integer and discrete-valued problems have been developed. The discrete-coded DE has been mostly used for combinatorial problems in a set of enumerative variants. However, the DE has a great potential in the spatial data analysis and pattern recognition. This paper formulates the problem as a search of a combination of distinct vertices which meet the specified conditions. It proposes a novel approach called the Multidimensional Discrete Differential Evolution (MDDE) applying the principle of the discrete-coded DE in discrete point clouds (PCs). The paper examines the local searching abilities of the MDDE and its convergence to the global optimum in the PCs. The multidimensional discrete vertices cannot be simply ordered to get a convenient course of the discrete data, which is crucial for good convergence of a population. A novel mutation operator utilizing linear ordering of spatial data based on the space filling curves is introduced. The algorithm is tested on several spatial datasets and optimization problems. The experiments show that the MDDE is an efficient and fast method for discrete optimizations in the multidimensional point clouds.

Utilization of the Discrete Differential Evolution for Optimization in Multidimensional Point Clouds

PubMed Central

Radecký, Michal; Snášel, Václav

2016-01-01

The Differential Evolution (DE) is a widely used bioinspired optimization algorithm developed by Storn and Price. It is popular for its simplicity and robustness. This algorithm was primarily designed for real-valued problems and continuous functions, but several modified versions optimizing both integer and discrete-valued problems have been developed. The discrete-coded DE has been mostly used for combinatorial problems in a set of enumerative variants. However, the DE has a great potential in the spatial data analysis and pattern recognition. This paper formulates the problem as a search of a combination of distinct vertices which meet the specified conditions. It proposes a novel approach called the Multidimensional Discrete Differential Evolution (MDDE) applying the principle of the discrete-coded DE in discrete point clouds (PCs). The paper examines the local searching abilities of the MDDE and its convergence to the global optimum in the PCs. The multidimensional discrete vertices cannot be simply ordered to get a convenient course of the discrete data, which is crucial for good convergence of a population. A novel mutation operator utilizing linear ordering of spatial data based on the space filling curves is introduced. The algorithm is tested on several spatial datasets and optimization problems. The experiments show that the MDDE is an efficient and fast method for discrete optimizations in the multidimensional point clouds. PMID:27974884

Discrete bacteria foraging optimization algorithm for graph based problems - a transition from continuous to discrete

NASA Astrophysics Data System (ADS)

Sur, Chiranjib; Shukla, Anupam

2018-03-01

Bacteria Foraging Optimisation Algorithm is a collective behaviour-based meta-heuristics searching depending on the social influence of the bacteria co-agents in the search space of the problem. The algorithm faces tremendous hindrance in terms of its application for discrete problems and graph-based problems due to biased mathematical modelling and dynamic structure of the algorithm. This had been the key factor to revive and introduce the discrete form called Discrete Bacteria Foraging Optimisation (DBFO) Algorithm for discrete problems which exceeds the number of continuous domain problems represented by mathematical and numerical equations in real life. In this work, we have mainly simulated a graph-based road multi-objective optimisation problem and have discussed the prospect of its utilisation in other similar optimisation problems and graph-based problems. The various solution representations that can be handled by this DBFO has also been discussed. The implications and dynamics of the various parameters used in the DBFO are illustrated from the point view of the problems and has been a combination of both exploration and exploitation. The result of DBFO has been compared with Ant Colony Optimisation and Intelligent Water Drops Algorithms. Important features of DBFO are that the bacteria agents do not depend on the local heuristic information but estimates new exploration schemes depending upon the previous experience and covered path analysis. This makes the algorithm better in combination generation for graph-based problems and combination generation for NP hard problems.

Spectral analysis of point-vortex dynamics: first application to vortex polygons in a circular domain

NASA Astrophysics Data System (ADS)

Speetjens, M. F. M.; Meleshko, V. V.; van Heijst, G. J. F.

2014-06-01

The present study addresses the classical problem of the dynamics and stability of a cluster of N-point vortices of equal strength arranged in a polygonal configuration (‘N-vortex polygons’). In unbounded domains, such N-vortex polygons are unconditionally stable for N\\leqslant 7. Confinement in a circular domain tightens the stability conditions to N\\leqslant 6 and a maximum polygon size relative to the domain radius. This work expands on existing studies on stability and integrability by a first giving an exploratory spectral analysis of the dynamics of N vortex polygons in circular domains. Key to this is that the spectral signature of the time evolution of vortex positions reflects their qualitative behaviour. Expressing vortex motion by a generic evolution operator (the so-called Koopman operator) provides a rigorous framework for such spectral analyses. This paves the way to further differentiation and classification of point-vortex behaviour beyond stability and integrability. The concept of Koopman-based spectral analysis is demonstrated for N-vortex polygons. This reveals that conditional stability can be seen as a local form of integrability and confirms an important generic link between spectrum and dynamics: discrete spectra imply regular (quasi-periodic) motion; continuous (sub-)spectra imply chaotic motion. Moreover, this exposes rich nonlinear dynamics as intermittency between regular and chaotic motion and quasi-coherent structures formed by chaotic vortices. Dedicated to the memory of Slava Meleshko, a dear friend and inspiring colleague.

Modeling Electrokinetic Flows by the Smoothed Profile Method

PubMed Central

Luo, Xian; Beskok, Ali; Karniadakis, George Em

2010-01-01

We propose an efficient modeling method for electrokinetic flows based on the Smoothed Profile Method (SPM) [1–4] and spectral element discretizations. The new method allows for arbitrary differences in the electrical conductivities between the charged surfaces and the the surrounding electrolyte solution. The electrokinetic forces are included into the flow equations so that the Poisson-Boltzmann and electric charge continuity equations are cast into forms suitable for SPM. The method is validated by benchmark problems of electroosmotic flow in straight channels and electrophoresis of charged cylinders. We also present simulation results of electrophoresis of charged microtubules, and show that the simulated electrophoretic mobility and anisotropy agree with the experimental values. PMID:20352076

Bell-Curve Genetic Algorithm for Mixed Continuous and Discrete Optimization Problems

NASA Technical Reports Server (NTRS)

Kincaid, Rex K.; Griffith, Michelle; Sykes, Ruth; Sobieszczanski-Sobieski, Jaroslaw

2002-01-01

In this manuscript we have examined an extension of BCB that encompasses a mix of continuous and quasi-discrete, as well as truly-discrete applications. FVe began by testing two refinements to the discrete version of BCB. The testing of midpoint versus fitness (Tables 1 and 2) proved inconclusive. The testing of discrete normal tails versus standard mutation showed was conclusive and demonstrated that the discrete normal tails are better. Next, we implemented these refinements in a combined continuous and discrete BCB and compared the performance of two discrete distance on the hub problem. Here we found when "order does matter" it pays to take it into account.

A time-domain decomposition iterative method for the solution of distributed linear quadratic optimal control problems

NASA Astrophysics Data System (ADS)

Heinkenschloss, Matthias

2005-01-01

We study a class of time-domain decomposition-based methods for the numerical solution of large-scale linear quadratic optimal control problems. Our methods are based on a multiple shooting reformulation of the linear quadratic optimal control problem as a discrete-time optimal control (DTOC) problem. The optimality conditions for this DTOC problem lead to a linear block tridiagonal system. The diagonal blocks are invertible and are related to the original linear quadratic optimal control problem restricted to smaller time-subintervals. This motivates the application of block Gauss-Seidel (GS)-type methods for the solution of the block tridiagonal systems. Numerical experiments show that the spectral radii of the block GS iteration matrices are larger than one for typical applications, but that the eigenvalues of the iteration matrices decay to zero fast. Hence, while the GS method is not expected to convergence for typical applications, it can be effective as a preconditioner for Krylov-subspace methods. This is confirmed by our numerical tests.A byproduct of this research is the insight that certain instantaneous control techniques can be viewed as the application of one step of the forward block GS method applied to the DTOC optimality system.

An asymptotic-preserving stochastic Galerkin method for the radiative heat transfer equations with random inputs and diffusive scalings

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jin, Shi, E-mail: sjin@wisc.edu; Institute of Natural Sciences, Department of Mathematics, MOE-LSEC and SHL-MAC, Shanghai Jiao Tong University, Shanghai 200240; Lu, Hanqing, E-mail: hanqing@math.wisc.edu

2017-04-01

In this paper, we develop an Asymptotic-Preserving (AP) stochastic Galerkin scheme for the radiative heat transfer equations with random inputs and diffusive scalings. In this problem the random inputs arise due to uncertainties in cross section, initial data or boundary data. We use the generalized polynomial chaos based stochastic Galerkin (gPC-SG) method, which is combined with the micro–macro decomposition based deterministic AP framework in order to handle efficiently the diffusive regime. For linearized problem we prove the regularity of the solution in the random space and consequently the spectral accuracy of the gPC-SG method. We also prove the uniform (inmore » the mean free path) linear stability for the space-time discretizations. Several numerical tests are presented to show the efficiency and accuracy of proposed scheme, especially in the diffusive regime.« less

Discrete-Trial Functional Analysis and Functional Communication Training with Three Adults with Intellectual Disabilities and Problem Behavior

ERIC Educational Resources Information Center

Chezan, Laura C.; Drasgow, Erik; Martin, Christian A.

2014-01-01

We conducted a sequence of two studies on the use of discrete-trial functional analysis and functional communication training. First, we used discrete-trial functional analysis (DTFA) to identify the function of problem behavior in three adults with intellectual disabilities and problem behavior. Results indicated clear patterns of problem…

A Spectral Analysis of Discrete-Time Quantum Walks Related to the Birth and Death Chains

NASA Astrophysics Data System (ADS)

Ho, Choon-Lin; Ide, Yusuke; Konno, Norio; Segawa, Etsuo; Takumi, Kentaro

2018-04-01

In this paper, we consider a spectral analysis of discrete time quantum walks on the path. For isospectral coin cases, we show that the time averaged distribution and stationary distributions of the quantum walks are described by the pair of eigenvalues of the coins as well as the eigenvalues and eigenvectors of the corresponding random walks which are usually referred as the birth and death chains. As an example of the results, we derive the time averaged distribution of so-called Szegedy's walk which is related to the Ehrenfest model. It is represented by Krawtchouk polynomials which is the eigenvectors of the model and includes the arcsine law.

Spectral analysis and multigrid preconditioners for two-dimensional space-fractional diffusion equations

NASA Astrophysics Data System (ADS)

Moghaderi, Hamid; Dehghan, Mehdi; Donatelli, Marco; Mazza, Mariarosa

2017-12-01

Fractional diffusion equations (FDEs) are a mathematical tool used for describing some special diffusion phenomena arising in many different applications like porous media and computational finance. In this paper, we focus on a two-dimensional space-FDE problem discretized by means of a second order finite difference scheme obtained as combination of the Crank-Nicolson scheme and the so-called weighted and shifted Grünwald formula. By fully exploiting the Toeplitz-like structure of the resulting linear system, we provide a detailed spectral analysis of the coefficient matrix at each time step, both in the case of constant and variable diffusion coefficients. Such a spectral analysis has a very crucial role, since it can be used for designing fast and robust iterative solvers. In particular, we employ the obtained spectral information to define a Galerkin multigrid method based on the classical linear interpolation as grid transfer operator and damped-Jacobi as smoother, and to prove the linear convergence rate of the corresponding two-grid method. The theoretical analysis suggests that the proposed grid transfer operator is strong enough for working also with the V-cycle method and the geometric multigrid. On this basis, we introduce two computationally favourable variants of the proposed multigrid method and we use them as preconditioners for Krylov methods. Several numerical results confirm that the resulting preconditioning strategies still keep a linear convergence rate.

Higher modes of the Orr-Sommerfeld problem for boundary layer flows

NASA Technical Reports Server (NTRS)

Lakin, W. D.; Grosch, C. E.

1983-01-01

The discrete spectrum of the Orr-Sommerfeld problem of hydrodynamic stability for boundary layer flows in semi-infinite regions is examined. Related questions concerning the continuous spectrum are also addressed. Emphasis is placed on the stability problem for the Blasius boundary layer profile. A general theoretical result is given which proves that the discrete spectrum of the Orr-Sommerfeld problem for boundary layer profiles (U(y), 0,0) has only a finite number of discrete modes when U(y) has derivatives of all orders. Details are given of a highly accurate numerical technique based on collocation with splines for the calculation of stability characteristics. The technique includes replacement of 'outer' boundary conditions by asymptotic forms based on the proper large parameter in the stability problem. Implementation of the asymptotic boundary conditions is such that there is no need to make apriori distinctions between subcases of the discrete spectrum or between the discrete and continuous spectrums. Typical calculations for the usual Blasius problem are presented.

A Spectral Multi-Domain Penalty Method for Elliptic Problems Arising From a Time-Splitting Algorithm For the Incompressible Navier-Stokes Equations

NASA Astrophysics Data System (ADS)

Diamantopoulos, Theodore; Rowe, Kristopher; Diamessis, Peter

2017-11-01

The Collocation Penalty Method (CPM) solves a PDE on the interior of a domain, while weakly enforcing boundary conditions at domain edges via penalty terms, and naturally lends itself to high-order and multi-domain discretization. Such spectral multi-domain penalty methods (SMPM) have been used to solve the Navier-Stokes equations. Bounds for penalty coefficients are typically derived using the energy method to guarantee stability for time-dependent problems. The choice of collocation points and penalty parameter can greatly affect the conditioning and accuracy of a solution. Effort has been made in recent years to relate various high-order methods on multiple elements or domains under the umbrella of the Correction Procedure via Reconstruction (CPR). Most applications of CPR have focused on solving the compressible Navier-Stokes equations using explicit time-stepping procedures. A particularly important aspect which is still missing in the context of the SMPM is a study of the Helmholtz equation arising in many popular time-splitting schemes for the incompressible Navier-Stokes equations. Stability and convergence results for the SMPM for the Helmholtz equation will be presented. Emphasis will be placed on the efficiency and accuracy of high-order methods.

Graph-cut based discrete-valued image reconstruction.

PubMed

Tuysuzoglu, Ahmet; Karl, W Clem; Stojanovic, Ivana; Castañòn, David; Ünlü, M Selim

2015-05-01

Efficient graph-cut methods have been used with great success for labeling and denoising problems occurring in computer vision. Unfortunately, the presence of linear image mappings has prevented the use of these techniques in most discrete-amplitude image reconstruction problems. In this paper, we develop a graph-cut based framework for the direct solution of discrete amplitude linear image reconstruction problems cast as regularized energy function minimizations. We first analyze the structure of discrete linear inverse problem cost functions to show that the obstacle to the application of graph-cut methods to their solution is the variable mixing caused by the presence of the linear sensing operator. We then propose to use a surrogate energy functional that overcomes the challenges imposed by the sensing operator yet can be utilized efficiently in existing graph-cut frameworks. We use this surrogate energy functional to devise a monotonic iterative algorithm for the solution of discrete valued inverse problems. We first provide experiments using local convolutional operators and show the robustness of the proposed technique to noise and stability to changes in regularization parameter. Then we focus on nonlocal, tomographic examples where we consider limited-angle data problems. We compare our technique with state-of-the-art discrete and continuous image reconstruction techniques. Experiments show that the proposed method outperforms state-of-the-art techniques in challenging scenarios involving discrete valued unknowns.

[Research of Identify Spatial Object Using Spectrum Analysis Technique].

PubMed

Song, Wei; Feng, Shi-qi; Shi, Jing; Xu, Rong; Wang, Gong-chang; Li, Bin-yu; Liu, Yu; Li, Shuang; Cao Rui; Cai, Hong-xing; Zhang, Xi-he; Tan, Yong

2015-06-01

The high precision scattering spectrum of spatial fragment with the minimum brightness of 4.2 and the resolution of 0.5 nm has been observed using spectrum detection technology on the ground. The obvious differences for different types of objects are obtained by the normalizing and discrete rate analysis of the spectral data. Each of normalized multi-frame scattering spectral line shape for rocket debris is identical. However, that is different for lapsed satellites. The discrete rate of the single frame spectrum of normalized space debris for rocket debris ranges from 0.978% to 3.067%, and the difference of oscillation and average value is small. The discrete rate for lapsed satellites ranges from 3.118 4% to 19.472 7%, and the difference of oscillation and average value relatively large. The reason is that the composition of rocket debris is single, while that of the lapsed satellites is complex. Therefore, the spectrum detection technology on the ground can be used to the classification of the spatial fragment.

On the Discrete Spectrum of the Nonstationary Schrödinger Equation and Multipole Lumps of the Kadomtsev-Petviashvili I Equation

NASA Astrophysics Data System (ADS)

Villarroel, Javier; Ablowitz, Mark J.

The discrete spectrum of the nonstationary Schrödinger equation and localized solutions of the Kadomtsev-Petviashvili-I (KPI) equation are studied via the inverse scattering transform. It is shown that there exist infinitely many real and rationally decaying potentials which correspond to a discrete spectrum whose related eigenfunctions have multiple poles in the spectral parameter. An index or winding number is asssociated with each of these solutions. The resulting localized solutions of KPI behave as collection of individual humps with nonuniform dynamics.

Noniterative algorithm for improving the accuracy of a multicolor-light-emitting-diode-based colorimeter.

PubMed

Yang, Pao-Keng

2012-05-01

We present a noniterative algorithm to reliably reconstruct the spectral reflectance from discrete reflectance values measured by using multicolor light emitting diodes (LEDs) as probing light sources. The proposed algorithm estimates the spectral reflectance by a linear combination of product functions of the detector's responsivity function and the LEDs' line-shape functions. After introducing suitable correction, the resulting spectral reflectance was found to be free from the spectral-broadening effect due to the finite bandwidth of LED. We analyzed the data for a real sample and found that spectral reflectance with enhanced resolution gives a more accurate prediction in the color measurement.

Noniterative algorithm for improving the accuracy of a multicolor-light-emitting-diode-based colorimeter

NASA Astrophysics Data System (ADS)

Yang, Pao-Keng

2012-05-01

We present a noniterative algorithm to reliably reconstruct the spectral reflectance from discrete reflectance values measured by using multicolor light emitting diodes (LEDs) as probing light sources. The proposed algorithm estimates the spectral reflectance by a linear combination of product functions of the detector's responsivity function and the LEDs' line-shape functions. After introducing suitable correction, the resulting spectral reflectance was found to be free from the spectral-broadening effect due to the finite bandwidth of LED. We analyzed the data for a real sample and found that spectral reflectance with enhanced resolution gives a more accurate prediction in the color measurement.

Coupling finite element and spectral methods: First results

NASA Technical Reports Server (NTRS)

Bernardi, Christine; Debit, Naima; Maday, Yvon

1987-01-01

A Poisson equation on a rectangular domain is solved by coupling two methods: the domain is divided in two squares, a finite element approximation is used on the first square and a spectral discretization is used on the second one. Two kinds of matching conditions on the interface are presented and compared. In both cases, error estimates are proved.

Discretization vs. Rounding Error in Euler's Method

ERIC Educational Resources Information Center

Borges, Carlos F.

2011-01-01

Euler's method for solving initial value problems is an excellent vehicle for observing the relationship between discretization error and rounding error in numerical computation. Reductions in stepsize, in order to decrease discretization error, necessarily increase the number of steps and so introduce additional rounding error. The problem is…

A Bell-Curved Based Algorithm for Mixed Continuous and Discrete Structural Optimization

NASA Technical Reports Server (NTRS)

Kincaid, Rex K.; Weber, Michael; Sobieszczanski-Sobieski, Jaroslaw

2001-01-01

An evolutionary based strategy utilizing two normal distributions to generate children is developed to solve mixed integer nonlinear programming problems. This Bell-Curve Based (BCB) evolutionary algorithm is similar in spirit to (mu + mu) evolutionary strategies and evolutionary programs but with fewer parameters to adjust and no mechanism for self adaptation. First, a new version of BCB to solve purely discrete optimization problems is described and its performance tested against a tabu search code for an actuator placement problem. Next, the performance of a combined version of discrete and continuous BCB is tested on 2-dimensional shape problems and on a minimum weight hub design problem. In the latter case the discrete portion is the choice of the underlying beam shape (I, triangular, circular, rectangular, or U).

The minimum bandwidths of auroral kilometric radiation

NASA Technical Reports Server (NTRS)

Baumback, M. M.; Calvert, W.

1987-01-01

The bandwidths of the discrete spectral components of the auroral kilometric radiation can sometimes be as narrow as 5 Hz. Since this would imply an apparent source thickness of substantially less than the wavelength, it is inconsistent with the previous explanation for such discrete components based simply upon vertical localization of a cyclotron source. Instead, such narrow bandwidths can only be explained by radio lasing.

Quantum algorithm for solving some discrete mathematical problems by probing their energy spectra

NASA Astrophysics Data System (ADS)

Wang, Hefeng; Fan, Heng; Li, Fuli

2014-01-01

When a probe qubit is coupled to a quantum register that represents a physical system, the probe qubit will exhibit a dynamical response only when it is resonant with a transition in the system. Using this principle, we propose a quantum algorithm for solving discrete mathematical problems based on the circuit model. Our algorithm has favorable scaling properties in solving some discrete mathematical problems.

Fractional Programming for Communication Systems—Part II: Uplink Scheduling via Matching

NASA Astrophysics Data System (ADS)

Shen, Kaiming; Yu, Wei

2018-05-01

This two-part paper develops novel methodologies for using fractional programming (FP) techniques to design and optimize communication systems. Part I of this paper proposes a new quadratic transform for FP and treats its application for continuous optimization problems. In this Part II of the paper, we study discrete problems, such as those involving user scheduling, which are considerably more difficult to solve. Unlike the continuous problems, discrete or mixed discrete-continuous problems normally cannot be recast as convex problems. In contrast to the common heuristic of relaxing the discrete variables, this work reformulates the original problem in an FP form amenable to distributed combinatorial optimization. The paper illustrates this methodology by tackling the important and challenging problem of uplink coordinated multi-cell user scheduling in wireless cellular systems. Uplink scheduling is more challenging than downlink scheduling, because uplink user scheduling decisions significantly affect the interference pattern in nearby cells. Further, the discrete scheduling variable needs to be optimized jointly with continuous variables such as transmit power levels and beamformers. The main idea of the proposed FP approach is to decouple the interaction among the interfering links, thereby permitting a distributed and joint optimization of the discrete and continuous variables with provable convergence. The paper shows that the well-known weighted minimum mean-square-error (WMMSE) algorithm can also be derived from a particular use of FP; but our proposed FP-based method significantly outperforms WMMSE when discrete user scheduling variables are involved, both in term of run-time efficiency and optimizing results.

Spectral confocal reflection microscopy using a white light source

NASA Astrophysics Data System (ADS)

Booth, M.; Juškaitis, R.; Wilson, T.

2008-08-01

We present a reflection confocal microscope incorporating a white light supercontinuum source and spectral detection. The microscope provides images resolved spatially in three-dimensions, in addition to spectral resolution covering the wavelength range 450-650nm. Images and reflection spectra of artificial and natural specimens are presented, showing features that are not normally revealed in conventional microscopes or confocal microscopes using discrete line lasers. The specimens include thin film structures on semiconductor chips, iridescent structures in Papilio blumei butterfly scales, nacre from abalone shells and opal gemstones. Quantitative size and refractive index measurements of transparent beads are derived from spectral interference bands.

Methodology for processing pressure traces used as inputs for combustion analyses in diesel engines

NASA Astrophysics Data System (ADS)

Rašić, Davor; Vihar, Rok; Žvar Baškovič, Urban; Katrašnik, Tomaž

2017-05-01

This study proposes a novel methodology for designing an optimum equiripple finite impulse response (FIR) filter for processing in-cylinder pressure traces of a diesel internal combustion engine, which serve as inputs for high-precision combustion analyses. The proposed automated workflow is based on an innovative approach of determining the transition band frequencies and optimum filter order. The methodology is based on discrete Fourier transform analysis, which is the first step to estimate the location of the pass-band and stop-band frequencies. The second step uses short-time Fourier transform analysis to refine the estimated aforementioned frequencies. These pass-band and stop-band frequencies are further used to determine the most appropriate FIR filter order. The most widely used existing methods for estimating the FIR filter order are not effective in suppressing the oscillations in the rate- of-heat-release (ROHR) trace, thus hindering the accuracy of combustion analyses. To address this problem, an innovative method for determining the order of an FIR filter is proposed in this study. This method is based on the minimization of the integral of normalized signal-to-noise differences between the stop-band frequency and the Nyquist frequency. Developed filters were validated using spectral analysis and calculation of the ROHR. The validation results showed that the filters designed using the proposed innovative method were superior compared with those using the existing methods for all analyzed cases. Highlights • Pressure traces of a diesel engine were processed by finite impulse response (FIR) filters with different orders • Transition band frequencies were determined with an innovative method based on discrete Fourier transform and short-time Fourier transform • Spectral analyses showed deficiencies of existing methods in determining the FIR filter order • A new method of determining the FIR filter order for processing pressure traces was proposed • The efficiency of the new method was demonstrated by spectral analyses and calculations of rate-of-heat-release traces

Hybrid least squares multivariate spectral analysis methods

DOEpatents

Haaland, David M.

2004-03-23

A set of hybrid least squares multivariate spectral analysis methods in which spectral shapes of components or effects not present in the original calibration step are added in a following prediction or calibration step to improve the accuracy of the estimation of the amount of the original components in the sampled mixture. The hybrid method herein means a combination of an initial calibration step with subsequent analysis by an inverse multivariate analysis method. A spectral shape herein means normally the spectral shape of a non-calibrated chemical component in the sample mixture but can also mean the spectral shapes of other sources of spectral variation, including temperature drift, shifts between spectrometers, spectrometer drift, etc. The shape can be continuous, discontinuous, or even discrete points illustrative of the particular effect.

Hybrid least squares multivariate spectral analysis methods

DOEpatents

Haaland, David M.

2002-01-01

A set of hybrid least squares multivariate spectral analysis methods in which spectral shapes of components or effects not present in the original calibration step are added in a following estimation or calibration step to improve the accuracy of the estimation of the amount of the original components in the sampled mixture. The "hybrid" method herein means a combination of an initial classical least squares analysis calibration step with subsequent analysis by an inverse multivariate analysis method. A "spectral shape" herein means normally the spectral shape of a non-calibrated chemical component in the sample mixture but can also mean the spectral shapes of other sources of spectral variation, including temperature drift, shifts between spectrometers, spectrometer drift, etc. The "shape" can be continuous, discontinuous, or even discrete points illustrative of the particular effect.

Spectral determinations for discrete sources with EGRET

NASA Technical Reports Server (NTRS)

Hughes, E. B.; Nolan, P. L.

1990-01-01

The ability of the EGRET (Energetic Gamma-Ray Experimental Telescope) to determine the spectral parameters of point sources in 14-day exposures, as planned for the initial survey phase of the GRO (Gamma Ray Observatory) mission, is explored by numerical simulation. Results are given for both galactic and extragalactic objects as a function of source strength and for representative levels of diffuse background emission.

Sculpting narrowband Fano resonances inherent in the large-area mid-infrared photonic crystal microresonators for spectroscopic imaging

PubMed Central

Liu, Jui-Nung; Schulmerich, Matthew V.; Bhargava, Rohit; Cunningham, Brian T.

2014-01-01

Fourier transform infrared (FT-IR) imaging spectrometers are almost universally used to record microspectroscopic imaging data in the mid-infrared (mid-IR) spectral region. While the commercial standard, interferometry necessitates collection of large spectral regions, requires a large data handling overhead for microscopic imaging and is slow. Here we demonstrate an approach for mid-IR spectroscopic imaging at selected discrete wavelengths using narrowband resonant filtering of a broadband thermal source, enabled by high-performance guided-mode Fano resonances in one-layer, large-area mid-IR photonic crystals on a glass substrate. The microresonant devices enable discrete frequency IR (DF-IR), in which a limited number of wavelengths that are of interest are recorded using a mechanically robust instrument. This considerably simplifies instrumentation as well as overhead of data acquisition, storage and analysis for large format imaging with array detectors. To demonstrate the approach, we perform DF-IR spectral imaging of a polymer USAF resolution target and human tissue in the C−H stretching region (2600−3300 cm−1). DF-IR spectroscopy and imaging can be generalized to other IR spectral regions and can serve as an analytical tool for environmental and biomedical applications. PMID:25089433

Dimensional flow in discrete quantum geometries

NASA Astrophysics Data System (ADS)

Calcagni, Gianluca; Oriti, Daniele; Thürigen, Johannes

2015-04-01

In various theories of quantum gravity, one observes a change in the spectral dimension from the topological spatial dimension d at large length scales to some smaller value at small, Planckian scales. While the origin of such a flow is well understood in continuum approaches, in theories built on discrete structures a firm control of the underlying mechanism is still missing. We shed some light on the issue by presenting a particular class of quantum geometries with a flow in the spectral dimension, given by superpositions of states defined on regular complexes. For particular superposition coefficients parametrized by a real number 0 <α

Numerical modeling of zero-offset laboratory data in a strong topographic environment: results for a spectral-element method and a discretized Kirchhoff integral method

NASA Astrophysics Data System (ADS)

Favretto-Cristini, Nathalie; Tantsereva, Anastasiya; Cristini, Paul; Ursin, Bjørn; Komatitsch, Dimitri; Aizenberg, Arkady M.

2014-08-01

Accurate simulation of seismic wave propagation in complex geological structures is of particular interest nowadays. However conventional methods may fail to simulate realistic wavefields in environments with great and rapid structural changes, due for instance to the presence of shadow zones, diffractions and/or edge effects. Different methods, developed to improve seismic modeling, are typically tested on synthetic configurations against analytical solutions for simple canonical problems or reference methods, or via direct comparison with real data acquired in situ. Such approaches have limitations, especially if the propagation occurs in a complex environment with strong-contrast reflectors and surface irregularities, as it can be difficult to determine the method which gives the best approximation of the "real" solution, or to interpret the results obtained without an a priori knowledge of the geologic environment. An alternative approach for seismics consists in comparing the synthetic data with high-quality data collected in laboratory experiments under controlled conditions for a known configuration. In contrast with numerical experiments, laboratory data possess many of the characteristics of field data, as real waves propagate through models with no numerical approximations. We thus present a comparison of laboratory-scaled measurements of 3D zero-offset wave reflection of broadband pulses from a strong topographic environment immersed in a water tank with numerical data simulated by means of a spectral-element method and a discretized Kirchhoff integral method. The results indicate a good quantitative fit in terms of time arrivals and acceptable fit in amplitudes for all datasets.

[A correction method of baseline drift of discrete spectrum of NIR].

PubMed

Hu, Ai-Qin; Yuan, Hong-Fu; Song, Chun-Feng; Li, Xiao-Yu

2014-10-01

In the present paper, a new correction method of baseline drift of discrete spectrum is proposed by combination of cubic spline interpolation and first order derivative. A fitting spectrum is constructed by cubic spline interpolation, using the datum in discrete spectrum as interpolation nodes. The fitting spectrum is differentiable. First order derivative is applied to the fitting spectrum to calculate derivative spectrum. The spectral wavelengths which are the same as the original discrete spectrum were taken out from the derivative spectrum to constitute the first derivative spectra of the discrete spectra, thereby to correct the baseline drift of the discrete spectra. The effects of the new method were demonstrated by comparison of the performances of multivariate models built using original spectra, direct differential spectra and the spectra pretreated by the new method. The results show that negative effects on the performance of multivariate model caused by baseline drift of discrete spectra can be effectively eliminated by the new method.

Sleep Neurophysiological Dynamics Through the Lens of Multitaper Spectral Analysis

PubMed Central

Prerau, Michael J.; Brown, Ritchie E.; Bianchi, Matt T.; Ellenbogen, Jeffrey M.; Purdon, Patrick L.

2016-01-01

During sleep, cortical and subcortical structures within the brain engage in highly structured oscillatory dynamics that can be observed in the electroencephalogram (EEG). The ability to accurately describe changes in sleep state from these oscillations has thus been a major goal of sleep medicine. While numerous studies over the past 50 years have shown sleep to be a continuous, multifocal, dynamic process, long-standing clinical practice categorizes sleep EEG into discrete stages through visual inspection of 30-s epochs. By representing sleep as a coarsely discretized progression of stages, vital neurophysiological information on the dynamic interplay between sleep and arousal is lost. However, by using principled time-frequency spectral analysis methods, the rich dynamics of the sleep EEG are immediately visible—elegantly depicted and quantified at time scales ranging from a full night down to individual microevents. In this paper, we review the neurophysiology of sleep through this lens of dynamic spectral analysis. We begin by reviewing spectral estimation techniques traditionally used in sleep EEG analysis and introduce multitaper spectral analysis, a method that makes EEG spectral estimates clearer and more accurate than traditional approaches. Through the lens of the multitaper spectrogram, we review the oscillations and mechanisms underlying the traditional sleep stages. In doing so, we will demonstrate how multitaper spectral analysis makes the oscillatory structure of traditional sleep states instantaneously visible, closely paralleling the traditional hypnogram, but with a richness of information that suggests novel insights into the neural mechanisms of sleep, as well as novel clinical and research applications. PMID:27927806

Some unsolved problems in discrete mathematics and mathematical cybernetics

NASA Astrophysics Data System (ADS)

Korshunov, Aleksei D.

2009-10-01

There are many unsolved problems in discrete mathematics and mathematical cybernetics. Writing a comprehensive survey of such problems involves great difficulties. First, such problems are rather numerous and varied. Second, they greatly differ from each other in degree of completeness of their solution. Therefore, even a comprehensive survey should not attempt to cover the whole variety of such problems; only the most important and significant problems should be reviewed. An impersonal choice of problems to include is quite hard. This paper includes 13 unsolved problems related to combinatorial mathematics and computational complexity theory. The problems selected give an indication of the author's studies for 50 years; for this reason, the choice of the problems reviewed here is, to some extent, subjective. At the same time, these problems are very difficult and quite important for discrete mathematics and mathematical cybernetics. Bibliography: 74 items.

Fast and accurate implementation of Fourier spectral approximations of nonlocal diffusion operators and its applications

DOE Office of Scientific and Technical Information (OSTI.GOV)

Du, Qiang, E-mail: jyanghkbu@gmail.com; Yang, Jiang, E-mail: qd2125@columbia.edu

This work is concerned with the Fourier spectral approximation of various integral differential equations associated with some linear nonlocal diffusion and peridynamic operators under periodic boundary conditions. For radially symmetric kernels, the nonlocal operators under consideration are diagonalizable in the Fourier space so that the main computational challenge is on the accurate and fast evaluation of their eigenvalues or Fourier symbols consisting of possibly singular and highly oscillatory integrals. For a large class of fractional power-like kernels, we propose a new approach based on reformulating the Fourier symbols both as coefficients of a series expansion and solutions of some simplemore » ODE models. We then propose a hybrid algorithm that utilizes both truncated series expansions and high order Runge–Kutta ODE solvers to provide fast evaluation of Fourier symbols in both one and higher dimensional spaces. It is shown that this hybrid algorithm is robust, efficient and accurate. As applications, we combine this hybrid spectral discretization in the spatial variables and the fourth-order exponential time differencing Runge–Kutta for temporal discretization to offer high order approximations of some nonlocal gradient dynamics including nonlocal Allen–Cahn equations, nonlocal Cahn–Hilliard equations, and nonlocal phase-field crystal models. Numerical results show the accuracy and effectiveness of the fully discrete scheme and illustrate some interesting phenomena associated with the nonlocal models.« less

High sensitivity operation of discrete solid state detectors at 4 K

NASA Technical Reports Server (NTRS)

Rieke, G. H.; Montgomery, E. F.; Lebofsky, M. J.; Eisenhardt, P. R.

1981-01-01

Techniques are described to allow operation of discrete, solid state detectors at 4 K with optimized JFET amplifiers. Three detector types cover the 0.6 to 4 mm spectral range with NEP approximately equal to 10 to the 16th power Hz (-1/2) for two of the types and potential improvement to this performance for the third. Lower NEP's are anticipated at longer infrared wavelengths.

An optimization-based approach for solving a time-harmonic multiphysical wave problem with higher-order schemes

NASA Astrophysics Data System (ADS)

Mönkölä, Sanna

2013-06-01

This study considers developing numerical solution techniques for the computer simulations of time-harmonic fluid-structure interaction between acoustic and elastic waves. The focus is on the efficiency of an iterative solution method based on a controllability approach and spectral elements. We concentrate on the model, in which the acoustic waves in the fluid domain are modeled by using the velocity potential and the elastic waves in the structure domain are modeled by using displacement. Traditionally, the complex-valued time-harmonic equations are used for solving the time-harmonic problems. Instead of that, we focus on finding periodic solutions without solving the time-harmonic problems directly. The time-dependent equations can be simulated with respect to time until a time-harmonic solution is reached, but the approach suffers from poor convergence. To overcome this challenge, we follow the approach first suggested and developed for the acoustic wave equations by Bristeau, Glowinski, and Périaux. Thus, we accelerate the convergence rate by employing a controllability method. The problem is formulated as a least-squares optimization problem, which is solved with the conjugate gradient (CG) algorithm. Computation of the gradient of the functional is done directly for the discretized problem. A graph-based multigrid method is used for preconditioning the CG algorithm.

Estimation of beam material random field properties via sensitivity-based model updating using experimental frequency response functions

NASA Astrophysics Data System (ADS)

Machado, M. R.; Adhikari, S.; Dos Santos, J. M. C.; Arruda, J. R. F.

2018-03-01

Structural parameter estimation is affected not only by measurement noise but also by unknown uncertainties which are present in the system. Deterministic structural model updating methods minimise the difference between experimentally measured data and computational prediction. Sensitivity-based methods are very efficient in solving structural model updating problems. Material and geometrical parameters of the structure such as Poisson's ratio, Young's modulus, mass density, modal damping, etc. are usually considered deterministic and homogeneous. In this paper, the distributed and non-homogeneous characteristics of these parameters are considered in the model updating. The parameters are taken as spatially correlated random fields and are expanded in a spectral Karhunen-Loève (KL) decomposition. Using the KL expansion, the spectral dynamic stiffness matrix of the beam is expanded as a series in terms of discretized parameters, which can be estimated using sensitivity-based model updating techniques. Numerical and experimental tests involving a beam with distributed bending rigidity and mass density are used to verify the proposed method. This extension of standard model updating procedures can enhance the dynamic description of structural dynamic models.

A New Analysis of the Spectra Obtained by the Venera Missions in the Venusian Atmosphere. I. The Analysis of the Data Received from the Venera-11 Probe at Altitudes Below 37 km in the 0.44 0.66 µm Wavelength Range

NASA Astrophysics Data System (ADS)

Maiorov, B. S.; Ignat'ev, N. I.; Moroz, V. I.; Zasova, L. V.; Moshkin, B. E.; Khatuntsev, I. V.; Ekonomov, A. P.

2005-07-01

The processes of the solar radiation extinction in deep layers of the Venus atmosphere in a wavelength range from 0.44 to 0.66 µm have been considered. The spectra of the solar radiation scattered in the atmosphere of Venus at various altitudes above the planetary surface measured by the Venera-11 entry probe in December 1978 are used as observational data. The problem of the data analysis is solved by selecting an atmospheric model; the discrete-ordinate method is applied in calculations. For the altitude interval from 2 10 km to 36 km, the altitude and spectral dependencies of the volume coefficient of true absorption have been obtained. At altitudes of 3 19 km, the spectral dependence is close to the wavelength dependence of the absorption cross section of S3 molecules, whence it follows that the mixing ratio of this sulfur allotrope increases with altitude from 0.03 to 0.1 ppbv.

Characterization of a multi-module tunable EC-QCL system for mid-infrared biofluid spectroscopy for hospital use and personalized diabetes technology

NASA Astrophysics Data System (ADS)

Grafen, M.; Nalpantidis, K.; Ostendorf, A.; Ihrig, D.; Heise, H. M.

2016-03-01

Blood glucose monitoring systems are important point-of-care devices for the hospital and personalised diabetes technology. FTIR-spectrometers have been successfully employed for the development of continuous bed-side monitoring systems in combination with micro-dialysis. For implementation in miniaturised portable systems, external-cavity quantum cascade lasers (EC-QCL) are suited. An ultra-broadly tunable pulsed EC-QCL system, covering a spectral range from 1920 to 780 cm-1, has been characterised with regard to the spectral emission profiles and wavenumber scale accuracy. The measurement of glucose in aqueous solution is presented and problems with signal linearity using Peltier-cooled MCT-detectors are discussed. The use of larger optical sample pathlengths for attenuating the laser power in transmission measurements has recently been suggested and implemented, but implications for broad mid-infrared measurements have now been investigated. The utilization of discrete wavenumber variables as an alternative for sweep-tune measurements has also been studied and sparse multivariate calibration models intended for clinical chemistry applications are described for glucose and lactate.

Normal modes of the shallow water system on the cubed sphere

NASA Astrophysics Data System (ADS)

Kang, H. G.; Cheong, H. B.; Lee, C. H.

2017-12-01

Spherical harmonics expressed as the Rossby-Haurwitz waves are the normal modes of non-divergent barotropic model. Among the normal modes in the numerical models, the most unstable mode will contaminate the numerical results, and therefore the investigation of normal mode for a given grid system and a discretiztaion method is important. The cubed-sphere grid which consists of six identical faces has been widely adopted in many atmospheric models. This grid system is non-orthogonal grid so that calculation of the normal mode is quiet challenge problem. In the present study, the normal modes of the shallow water system on the cubed sphere discretized by the spectral element method employing the Gauss-Lobatto Lagrange interpolating polynomials as orthogonal basis functions is investigated. The algebraic equations for the shallow water equation on the cubed sphere are derived, and the huge global matrix is constructed. The linear system representing the eigenvalue-eigenvector relations is solved by numerical libraries. The normal mode calculated for the several horizontal resolution and lamb parameters will be discussed and compared to the normal mode from the spherical harmonics spectral method.

Discretization of Continuous Time Discrete Scale Invariant Processes: Estimation and Spectra

NASA Astrophysics Data System (ADS)

Rezakhah, Saeid; Maleki, Yasaman

2016-07-01

Imposing some flexible sampling scheme we provide some discretization of continuous time discrete scale invariant (DSI) processes which is a subsidiary discrete time DSI process. Then by introducing some simple random measure we provide a second continuous time DSI process which provides a proper approximation of the first one. This enables us to provide a bilateral relation between covariance functions of the subsidiary process and the new continuous time processes. The time varying spectral representation of such continuous time DSI process is characterized, and its spectrum is estimated. Also, a new method for estimation time dependent Hurst parameter of such processes is provided which gives a more accurate estimation. The performance of this estimation method is studied via simulation. Finally this method is applied to the real data of S & P500 and Dow Jones indices for some special periods.

Numerical treatment of a geometrically nonlinear planar Cosserat shell model

NASA Astrophysics Data System (ADS)

Sander, Oliver; Neff, Patrizio; Bîrsan, Mircea

2016-05-01

We present a new way to discretize a geometrically nonlinear elastic planar Cosserat shell. The kinematical model is similar to the general six-parameter resultant shell model with drilling rotations. The discretization uses geodesic finite elements (GFEs), which leads to an objective discrete model which naturally allows arbitrarily large rotations. GFEs of any approximation order can be constructed. The resulting algebraic problem is a minimization problem posed on a nonlinear finite-dimensional Riemannian manifold. We solve this problem using a Riemannian trust-region method, which is a generalization of Newton's method that converges globally without intermediate loading steps. We present the continuous model and the discretization, discuss the properties of the discrete model, and show several numerical examples, including wrinkling of thin elastic sheets in shear.

The inverse problem of the calculus of variations for discrete systems

NASA Astrophysics Data System (ADS)

Barbero-Liñán, María; Farré Puiggalí, Marta; Ferraro, Sebastián; Martín de Diego, David

2018-05-01

We develop a geometric version of the inverse problem of the calculus of variations for discrete mechanics and constrained discrete mechanics. The geometric approach consists of using suitable Lagrangian and isotropic submanifolds. We also provide a transition between the discrete and the continuous problems and propose variationality as an interesting geometric property to take into account in the design and computer simulation of numerical integrators for constrained systems. For instance, nonholonomic mechanics is generally non variational but some special cases admit an alternative variational description. We apply some standard nonholonomic integrators to such an example to study which ones conserve this property.

Josephson junction in the quantum mesoscopic electric circuits with charge discreteness

NASA Astrophysics Data System (ADS)

Pahlavani, H.

2018-04-01

A quantum mesoscopic electrical LC-circuit with charge discreteness including a Josephson junction is considered and a nonlinear Hamiltonian that describing the dynamic of such circuit is introduced. The quantum dynamical behavior (persistent current probability) is studied in the charge and phase regimes by numerical solution approaches. The time evolution of charge and current, number-difference and the bosonic phase and also the energy spectrum of a quantum mesoscopic electric LC-circuit with charge discreteness that coupled with a Josephson junction device are investigated. We show the role of the coupling energy and the electrostatic Coulomb energy of the Josephson junction in description of the quantum behavior and the spectral properties of a quantum mesoscopic electrical LC-circuits with charge discreteness.

A Summary of Some Discrete-Event System Control Problems

NASA Astrophysics Data System (ADS)

Rudie, Karen

A summary of the area of control of discrete-event systems is given. In this research area, automata and formal language theory is used as a tool to model physical problems that arise in technological and industrial systems. The key ingredients to discrete-event control problems are a process that can be modeled by an automaton, events in that process that cannot be disabled or prevented from occurring, and a controlling agent that manipulates the events that can be disabled to guarantee that the process under control either generates all the strings in some prescribed language or as many strings as possible in some prescribed language. When multiple controlling agents act on a process, decentralized control problems arise. In decentralized discrete-event systems, it is presumed that the agents effecting control cannot each see all event occurrences. Partial observation leads to some problems that cannot be solved in polynomial time and some others that are not even decidable.

Exact Analytical Solutions for Elastodynamic Impact

DTIC Science & Technology

2015-11-30

corroborated by derivation of exact discrete solutions from recursive equations for the impact problems. 15. SUBJECT TERMS One-dimensional impact; Elastic...wave propagation; Laplace transform; Floor function; Discrete solutions 16. SECURITY CLASSIFICATION OF: 17. LIMITATION OF ABSTRACT UU 18...impact Elastic wave propagation Laplace transform Floor function Discrete solutionsWe consider the one-dimensional impact problem in which a semi

High order spectral difference lattice Boltzmann method for incompressible hydrodynamics

NASA Astrophysics Data System (ADS)

Li, Weidong

2017-09-01

This work presents a lattice Boltzmann equation (LBE) based high order spectral difference method for incompressible flows. In the present method, the spectral difference (SD) method is adopted to discretize the convection and collision term of the LBE to obtain high order (≥3) accuracy. Because the SD scheme represents the solution as cell local polynomials and the solution polynomials have good tensor-product property, the present spectral difference lattice Boltzmann method (SD-LBM) can be implemented on arbitrary unstructured quadrilateral meshes for effective and efficient treatment of complex geometries. Thanks to only first oder PDEs involved in the LBE, no special techniques, such as hybridizable discontinuous Galerkin method (HDG), local discontinuous Galerkin method (LDG) and so on, are needed to discrete diffusion term, and thus, it simplifies the algorithm and implementation of the high order spectral difference method for simulating viscous flows. The proposed SD-LBM is validated with four incompressible flow benchmarks in two-dimensions: (a) the Poiseuille flow driven by a constant body force; (b) the lid-driven cavity flow without singularity at the two top corners-Burggraf flow; and (c) the unsteady Taylor-Green vortex flow; (d) the Blasius boundary-layer flow past a flat plate. Computational results are compared with analytical solutions of these cases and convergence studies of these cases are also given. The designed accuracy of the proposed SD-LBM is clearly verified.

Terrain Categorization using LIDAR and Multi-Spectral Data

DTIC Science & Technology

2007-01-01

the same spatial resolution cell will be distinguished. 3. PROCESSING The LIDAR data set used in this study was from a discrete-return...smoothing in the spatial dimension. While it was possible to distinguish different classes of materials using this technique, the spatial resolution was...alone and a combination of the two data-types. Results are compared to significant ground truth information. Keywords: LIDAR, multi- spectral

The Spectral Element Method for Geophysical Flows

NASA Astrophysics Data System (ADS)

Taylor, Mark

1998-11-01

We will describe SEAM, a Spectral Element Atmospheric Model. SEAM solves the 3D primitive equations used in climate modeling and medium range forecasting. SEAM uses a spectral element discretization for the surface of the globe and finite differences in the vertical direction. The model is spectrally accurate, as demonstrated by a variety of test cases. It is well suited for modern distributed-shared memory computers, sustaining over 24 GFLOPS on a 240 processor HP Exemplar. This performance has allowed us to run several interesting simulations in full spherical geometry at high resolution (over 22 million grid points).

Development and Evaluation of a Hydrostatic Dynamical Core Using the Spectral Element/Discontinuous Galerkin Methods

DTIC Science & Technology

2014-04-01

The CG and DG horizontal discretization employs high-order nodal basis functions associated with Lagrange polynomials based on Gauss-Lobatto- Legendre ...and DG horizontal discretization employs high-order nodal basis functions 29 associated with Lagrange polynomials based on Gauss-Lobatto- Legendre ...Inside 235 each element we build ( 1)N + Gauss-Lobatto- Legendre (GLL) quadrature points, where N 236 indicate the polynomial order of the basis

Orthogonal sets of data windows constructed from trigonometric polynomials

NASA Technical Reports Server (NTRS)

Greenhall, C. A.

1989-01-01

Suboptimal, easily computable substitutes for the discrete prolate-spheroidal windows used by Thomson for spectral estimation are given. Trigonometric coefficients and energy leakages of the window polynomials are tabulated.

Development of Proportional Reasoning: Where Young Children Go Wrong

PubMed Central

Boyer, Ty W.; Levine, Susan C.; Huttenlocher, Janellen

2008-01-01

Previous studies have found that children have difficulty solving proportional reasoning problems involving discrete units until 10- to 12-years of age, but can solve parallel problems involving continuous quantities by 6-years of age. The present studies examine where children go wrong in processing proportions that involve discrete quantities. A computerized proportional equivalence choice task was administered to kindergartners through fourth-graders in Study 1, and to first- and third-graders in Study 2. Both studies involved four between-subjects conditions that were formed by pairing continuous and discrete target proportions with continuous and discrete choice alternatives. In Study 1, target and choice alternatives were presented simultaneously and in Study 2 target and choice alternatives were presented sequentially. In both studies, children performed significantly worse when both the target and choice alternatives were represented with discrete quantities than when either or both of the proportions involved continuous quantities. Taken together, these findings indicate that children go astray on proportional reasoning problems involving discrete units only when a numerical match is possible, suggesting that their difficulty is due to an overextension of numerical equivalence concepts to proportional equivalence problems. PMID:18793078

Discrete Time McKean–Vlasov Control Problem: A Dynamic Programming Approach

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pham, Huyên, E-mail: pham@math.univ-paris-diderot.fr; Wei, Xiaoli, E-mail: tyswxl@gmail.com

We consider the stochastic optimal control problem of nonlinear mean-field systems in discrete time. We reformulate the problem into a deterministic control problem with marginal distribution as controlled state variable, and prove that dynamic programming principle holds in its general form. We apply our method for solving explicitly the mean-variance portfolio selection and the multivariate linear-quadratic McKean–Vlasov control problem.

Galerkin v. least-squares Petrov–Galerkin projection in nonlinear model reduction

DOE PAGES

Carlberg, Kevin Thomas; Barone, Matthew F.; Antil, Harbir

2016-10-20

Least-squares Petrov–Galerkin (LSPG) model-reduction techniques such as the Gauss–Newton with Approximated Tensors (GNAT) method have shown promise, as they have generated stable, accurate solutions for large-scale turbulent, compressible flow problems where standard Galerkin techniques have failed. Furthermore, there has been limited comparative analysis of the two approaches. This is due in part to difficulties arising from the fact that Galerkin techniques perform optimal projection associated with residual minimization at the time-continuous level, while LSPG techniques do so at the time-discrete level. This work provides a detailed theoretical and computational comparison of the two techniques for two common classes of timemore » integrators: linear multistep schemes and Runge–Kutta schemes. We present a number of new findings, including conditions under which the LSPG ROM has a time-continuous representation, conditions under which the two techniques are equivalent, and time-discrete error bounds for the two approaches. Perhaps most surprisingly, we demonstrate both theoretically and computationally that decreasing the time step does not necessarily decrease the error for the LSPG ROM; instead, the time step should be ‘matched’ to the spectral content of the reduced basis. In numerical experiments carried out on a turbulent compressible-flow problem with over one million unknowns, we show that increasing the time step to an intermediate value decreases both the error and the simulation time of the LSPG reduced-order model by an order of magnitude.« less

Galerkin v. least-squares Petrov–Galerkin projection in nonlinear model reduction

DOE Office of Scientific and Technical Information (OSTI.GOV)

Carlberg, Kevin Thomas; Barone, Matthew F.; Antil, Harbir

Least-squares Petrov–Galerkin (LSPG) model-reduction techniques such as the Gauss–Newton with Approximated Tensors (GNAT) method have shown promise, as they have generated stable, accurate solutions for large-scale turbulent, compressible flow problems where standard Galerkin techniques have failed. Furthermore, there has been limited comparative analysis of the two approaches. This is due in part to difficulties arising from the fact that Galerkin techniques perform optimal projection associated with residual minimization at the time-continuous level, while LSPG techniques do so at the time-discrete level. This work provides a detailed theoretical and computational comparison of the two techniques for two common classes of timemore » integrators: linear multistep schemes and Runge–Kutta schemes. We present a number of new findings, including conditions under which the LSPG ROM has a time-continuous representation, conditions under which the two techniques are equivalent, and time-discrete error bounds for the two approaches. Perhaps most surprisingly, we demonstrate both theoretically and computationally that decreasing the time step does not necessarily decrease the error for the LSPG ROM; instead, the time step should be ‘matched’ to the spectral content of the reduced basis. In numerical experiments carried out on a turbulent compressible-flow problem with over one million unknowns, we show that increasing the time step to an intermediate value decreases both the error and the simulation time of the LSPG reduced-order model by an order of magnitude.« less

Application of the trigonal curve to the Blaszak-Marciniak lattice hierarchy

NASA Astrophysics Data System (ADS)

Geng, Xianguo; Zeng, Xin

2017-01-01

We develop a method for constructing algebro-geometric solutions of the Blaszak-Marciniak ( BM) lattice hierarchy based on the theory of trigonal curves. We first derive the BM lattice hierarchy associated with a discrete (3×3)- matrix spectral problem using Lenard recurrence relations. Using the characteristic polynomial of the Lax matrix for the BM lattice hierarchy, we introduce a trigonal curve with two infinite points, which we use to establish the associated Dubrovin-type equations. We then study the asymptotic properties of the algebraic function carrying the data of the divisor and the Baker-Akhiezer function near the two infinite points on the trigonal curve. We finally obtain algebro-geometric solutions of the entire BM lattice hierarchy in terms of the Riemann theta function.

Monte Carlo and discrete-ordinate simulations of spectral radiances in a coupled air-tissue system.

PubMed

Hestenes, Kjersti; Nielsen, Kristian P; Zhao, Lu; Stamnes, Jakob J; Stamnes, Knut

2007-04-20

We perform a detailed comparison study of Monte Carlo (MC) simulations and discrete-ordinate radiative-transfer (DISORT) calculations of spectral radiances in a 1D coupled air-tissue (CAT) system consisting of horizontal plane-parallel layers. The MC and DISORT models have the same physical basis, including coupling between the air and the tissue, and we use the same air and tissue input parameters for both codes. We find excellent agreement between radiances obtained with the two codes, both above and in the tissue. Our tests cover typical optical properties of skin tissue at the 280, 540, and 650 nm wavelengths. The normalized volume scattering function for internal structures in the skin is represented by the one-parameter Henyey-Greenstein function for large particles and the Rayleigh scattering function for small particles. The CAT-DISORT code is found to be approximately 1000 times faster than the CAT-MC code. We also show that the spectral radiance field is strongly dependent on the inherent optical properties of the skin tissue.

Dual THz comb spectroscopy

NASA Astrophysics Data System (ADS)

Yasui, Takeshi

2017-08-01

Optical frequency combs are innovative tools for broadband spectroscopy because a series of comb modes can serve as frequency markers that are traceable to a microwave frequency standard. However, a mode distribution that is too discrete limits the spectral sampling interval to the mode frequency spacing even though individual mode linewidth is sufficiently narrow. Here, using a combination of a spectral interleaving and dual-comb spectroscopy in the terahertz (THz) region, we achieved a spectral sampling interval equal to the mode linewidth rather than the mode spacing. The spectrally interleaved THz comb was realized by sweeping the laser repetition frequency and interleaving additional frequency marks. In low-pressure gas spectroscopy, we achieved an improved spectral sampling density of 2.5 MHz and enhanced spectral accuracy of 8.39 × 10-7 in the THz region. The proposed method is a powerful tool for simultaneously achieving high resolution, high accuracy, and broad spectral coverage in THz spectroscopy.

A Novel Approach with Time-Splitting Spectral Technique for the Coupled Schrödinger-Boussinesq Equations Involving Riesz Fractional Derivative

NASA Astrophysics Data System (ADS)

Saha Ray, S.

2017-09-01

In the present paper the Riesz fractional coupled Schrödinger-Boussinesq (S-B) equations have been solved by the time-splitting Fourier spectral (TSFS) method. This proposed technique is utilized for discretizing the Schrödinger like equation and further, a pseudospectral discretization has been employed for the Boussinesq-like equation. Apart from that an implicit finite difference approach has also been proposed to compare the results with the solutions obtained from the time-splitting technique. Furthermore, the time-splitting method is proved to be unconditionally stable. The error norms along with the graphical solutions have also been presented here. Supported by NBHM, Mumbai, under Department of Atomic Energy, Government of India vide Grant No. 2/48(7)/2015/NBHM (R.P.)/R&D II/11403

Quadratic constrained mixed discrete optimization with an adiabatic quantum optimizer

NASA Astrophysics Data System (ADS)

Chandra, Rishabh; Jacobson, N. Tobias; Moussa, Jonathan E.; Frankel, Steven H.; Kais, Sabre

2014-07-01

We extend the family of problems that may be implemented on an adiabatic quantum optimizer (AQO). When a quadratic optimization problem has at least one set of discrete controls and the constraints are linear, we call this a quadratic constrained mixed discrete optimization (QCMDO) problem. QCMDO problems are NP-hard, and no efficient classical algorithm for their solution is known. Included in the class of QCMDO problems are combinatorial optimization problems constrained by a linear partial differential equation (PDE) or system of linear PDEs. An essential complication commonly encountered in solving this type of problem is that the linear constraint may introduce many intermediate continuous variables into the optimization while the computational cost grows exponentially with problem size. We resolve this difficulty by developing a constructive mapping from QCMDO to quadratic unconstrained binary optimization (QUBO) such that the size of the QUBO problem depends only on the number of discrete control variables. With a suitable embedding, taking into account the physical constraints of the realizable coupling graph, the resulting QUBO problem can be implemented on an existing AQO. The mapping itself is efficient, scaling cubically with the number of continuous variables in the general case and linearly in the PDE case if an efficient preconditioner is available.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ghatak, Ananya, E-mail: gananya04@gmail.com; Mandal, Raka Dona Ray, E-mail: rakad.ray@gmail.com; Mandal, Bhabani Prasad, E-mail: bhabani.mandal@gmail.com

We complexify a 1-d potential V(x)=V{sub 0}cosh{sup 2}μ(tanh[(x−μd)/d]+tanh(μ)){sup 2} which exhibits bound, reflecting and free states to study various properties of a non-Hermitian system. This potential turns out a PT-symmetric non-Hermitian potential when one of the parameters (μ,d) becomes imaginary. For the case of μ→iμ, we have an entire real bound state spectrum. Explicit scattering states are constructed to show reciprocity at certain discrete values of energy even though the potential is not parity symmetric. Coexistence of deep energy minima of transmissivity with the multiple spectral singularities (MSS) is observed. We further show that this potential becomes invisible from themore » left (or right) at certain discrete energies. The penetrating states in the other case (d→id) are always reciprocal even though it is PT-invariant and no spectral singularity (SS) is present in this case. The presence of MSS and reflectionlessness is also discussed for the free states in the later case. -- Highlights: •Existence of multiple spectral singularities (MSS) in PT-symmetric non-Hermitian system is shown. •Reciprocity is restored at discrete positive energies even for parity non-invariant complex system. •Co-existence of MSS with deep energy minima of transitivity is obtained. •Possibilities of both unidirectional and bidirectional invisibility are explored for a non-Hermitian system. •Penetrating states are shown to be reciprocal for all energies for PT-symmetric system.« less

Initial-boundary value problems associated with the Ablowitz-Ladik system

NASA Astrophysics Data System (ADS)

Xia, Baoqiang; Fokas, A. S.

2018-02-01

We employ the Ablowitz-Ladik system as an illustrative example in order to demonstrate how to analyze initial-boundary value problems for integrable nonlinear differential-difference equations via the unified transform (Fokas method). In particular, we express the solutions of the integrable discrete nonlinear Schrödinger and integrable discrete modified Korteweg-de Vries equations in terms of the solutions of appropriate matrix Riemann-Hilbert problems. We also discuss in detail, for both the above discrete integrable equations, the associated global relations and the process of eliminating of the unknown boundary values.

Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic

PubMed Central

2014-01-01

Berth allocation is the forefront operation performed when ships arrive at a port and is a critical task in container port optimization. Minimizing the time ships spend at berths constitutes an important objective of berth allocation problems. This study focuses on the discrete dynamic berth allocation problem (discrete DBAP), which aims to minimize total service time, and proposes an iterated greedy (IG) algorithm to solve it. The proposed IG algorithm is tested on three benchmark problem sets. Experimental results show that the proposed IG algorithm can obtain optimal solutions for all test instances of the first and second problem sets and outperforms the best-known solutions for 35 out of 90 test instances of the third problem set. PMID:25295295

Method of grid generation

DOEpatents

Barnette, Daniel W.

2002-01-01

The present invention provides a method of grid generation that uses the geometry of the problem space and the governing relations to generate a grid. The method can generate a grid with minimized discretization errors, and with minimal user interaction. The method of the present invention comprises assigning grid cell locations so that, when the governing relations are discretized using the grid, at least some of the discretization errors are substantially zero. Conventional grid generation is driven by the problem space geometry; grid generation according to the present invention is driven by problem space geometry and by governing relations. The present invention accordingly can provide two significant benefits: more efficient and accurate modeling since discretization errors are minimized, and reduced cost grid generation since less human interaction is required.

Discrete Dynamical Systems Meet the Classic Monkey-and-the-Bananas Problem.

ERIC Educational Resources Information Center

Gannon, Gerald E.; Martelli, Mario U.

2001-01-01

Presents a solution of the three-sailors-and-the-bananas problem and attempts a generalization. Introduces an interesting way of looking at the mathematics with an idea drawn from discrete dynamical systems. (KHR)

Computing the Feasible Spaces of Optimal Power Flow Problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Molzahn, Daniel K.

The solution to an optimal power flow (OPF) problem provides a minimum cost operating point for an electric power system. The performance of OPF solution techniques strongly depends on the problem’s feasible space. This paper presents an algorithm that is guaranteed to compute the entire feasible spaces of small OPF problems to within a specified discretization tolerance. Specifically, the feasible space is computed by discretizing certain of the OPF problem’s inequality constraints to obtain a set of power flow equations. All solutions to the power flow equations at each discretization point are obtained using the Numerical Polynomial Homotopy Continuation (NPHC)more » algorithm. To improve computational tractability, “bound tightening” and “grid pruning” algorithms use convex relaxations to preclude consideration of many discretization points that are infeasible for the OPF problem. Here, the proposed algorithm is used to generate the feasible spaces of two small test cases.« less

Computing the Feasible Spaces of Optimal Power Flow Problems

DOE PAGES

Molzahn, Daniel K.

2017-03-15

The solution to an optimal power flow (OPF) problem provides a minimum cost operating point for an electric power system. The performance of OPF solution techniques strongly depends on the problem’s feasible space. This paper presents an algorithm that is guaranteed to compute the entire feasible spaces of small OPF problems to within a specified discretization tolerance. Specifically, the feasible space is computed by discretizing certain of the OPF problem’s inequality constraints to obtain a set of power flow equations. All solutions to the power flow equations at each discretization point are obtained using the Numerical Polynomial Homotopy Continuation (NPHC)more » algorithm. To improve computational tractability, “bound tightening” and “grid pruning” algorithms use convex relaxations to preclude consideration of many discretization points that are infeasible for the OPF problem. Here, the proposed algorithm is used to generate the feasible spaces of two small test cases.« less

Discrete-Trial Functional Analysis and Functional Communication Training with Three Individuals with Autism and Severe Problem Behavior

ERIC Educational Resources Information Center

Schmidt, Jonathan D.; Drasgow, Erik; Halle, James W.; Martin, Christian A.; Bliss, Sacha A.

2014-01-01

Discrete-trial functional analysis (DTFA) is an experimental method for determining the variables maintaining problem behavior in the context of natural routines. Functional communication training (FCT) is an effective method for replacing problem behavior, once identified, with a functionally equivalent response. We implemented these procedures…

Spectral methods and their implementation to solution of aerodynamic and fluid mechanic problems

NASA Technical Reports Server (NTRS)

Streett, C. L.

1987-01-01

Fundamental concepts underlying spectral collocation methods, especially pertaining to their use in the solution of partial differential equations, are outlined. Theoretical accuracy results are reviewed and compared with results from test problems. A number of practical aspects of the construction and use of spectral methods are detailed, along with several solution schemes which have found utility in applications of spectral methods to practical problems. Results from a few of the successful applications of spectral methods to problems of aerodynamic and fluid mechanic interest are then outlined, followed by a discussion of the problem areas in spectral methods and the current research under way to overcome these difficulties.

Discrete Inverse and State Estimation Problems

NASA Astrophysics Data System (ADS)

Wunsch, Carl

2006-06-01

The problems of making inferences about the natural world from noisy observations and imperfect theories occur in almost all scientific disciplines. This book addresses these problems using examples taken from geophysical fluid dynamics. It focuses on discrete formulations, both static and time-varying, known variously as inverse, state estimation or data assimilation problems. Starting with fundamental algebraic and statistical ideas, the book guides the reader through a range of inference tools including the singular value decomposition, Gauss-Markov and minimum variance estimates, Kalman filters and related smoothers, and adjoint (Lagrange multiplier) methods. The final chapters discuss a variety of practical applications to geophysical flow problems. Discrete Inverse and State Estimation Problems is an ideal introduction to the topic for graduate students and researchers in oceanography, meteorology, climate dynamics, and geophysical fluid dynamics. It is also accessible to a wider scientific audience; the only prerequisite is an understanding of linear algebra. Provides a comprehensive introduction to discrete methods of inference from incomplete information Based upon 25 years of practical experience using real data and models Develops sequential and whole-domain analysis methods from simple least-squares Contains many examples and problems, and web-based support through MIT opencourseware

Efficient stabilization and acceleration of numerical simulation of fluid flows by residual recombination

NASA Astrophysics Data System (ADS)

Citro, V.; Luchini, P.; Giannetti, F.; Auteri, F.

2017-09-01

The study of the stability of a dynamical system described by a set of partial differential equations (PDEs) requires the computation of unstable states as the control parameter exceeds its critical threshold. Unfortunately, the discretization of the governing equations, especially for fluid dynamic applications, often leads to very large discrete systems. As a consequence, matrix based methods, like for example the Newton-Raphson algorithm coupled with a direct inversion of the Jacobian matrix, lead to computational costs too large in terms of both memory and execution time. We present a novel iterative algorithm, inspired by Krylov-subspace methods, which is able to compute unstable steady states and/or accelerate the convergence to stable configurations. Our new algorithm is based on the minimization of the residual norm at each iteration step with a projection basis updated at each iteration rather than at periodic restarts like in the classical GMRES method. The algorithm is able to stabilize any dynamical system without increasing the computational time of the original numerical procedure used to solve the governing equations. Moreover, it can be easily inserted into a pre-existing relaxation (integration) procedure with a call to a single black-box subroutine. The procedure is discussed for problems of different sizes, ranging from a small two-dimensional system to a large three-dimensional problem involving the Navier-Stokes equations. We show that the proposed algorithm is able to improve the convergence of existing iterative schemes. In particular, the procedure is applied to the subcritical flow inside a lid-driven cavity. We also discuss the application of Boostconv to compute the unstable steady flow past a fixed circular cylinder (2D) and boundary-layer flow over a hemispherical roughness element (3D) for supercritical values of the Reynolds number. We show that Boostconv can be used effectively with any spatial discretization, be it a finite-difference, finite-volume, finite-element or spectral method.

Solving ill-posed control problems by stabilized finite element methods: an alternative to Tikhonov regularization

NASA Astrophysics Data System (ADS)

Burman, Erik; Hansbo, Peter; Larson, Mats G.

2018-03-01

Tikhonov regularization is one of the most commonly used methods for the regularization of ill-posed problems. In the setting of finite element solutions of elliptic partial differential control problems, Tikhonov regularization amounts to adding suitably weighted least squares terms of the control variable, or derivatives thereof, to the Lagrangian determining the optimality system. In this note we show that the stabilization methods for discretely ill-posed problems developed in the setting of convection-dominated convection-diffusion problems, can be highly suitable for stabilizing optimal control problems, and that Tikhonov regularization will lead to less accurate discrete solutions. We consider some inverse problems for Poisson’s equation as an illustration and derive new error estimates both for the reconstruction of the solution from the measured data and reconstruction of the source term from the measured data. These estimates include both the effect of the discretization error and error in the measurements.

Spectrally interleaved, comb-mode-resolved spectroscopy using swept dual terahertz combs

PubMed Central

Hsieh, Yi-Da; Iyonaga, Yuki; Sakaguchi, Yoshiyuki; Yokoyama, Shuko; Inaba, Hajime; Minoshima, Kaoru; Hindle, Francis; Araki, Tsutomu; Yasui, Takeshi

2014-01-01

Optical frequency combs are innovative tools for broadband spectroscopy because a series of comb modes can serve as frequency markers that are traceable to a microwave frequency standard. However, a mode distribution that is too discrete limits the spectral sampling interval to the mode frequency spacing even though individual mode linewidth is sufficiently narrow. Here, using a combination of a spectral interleaving and dual-comb spectroscopy in the terahertz (THz) region, we achieved a spectral sampling interval equal to the mode linewidth rather than the mode spacing. The spectrally interleaved THz comb was realized by sweeping the laser repetition frequency and interleaving additional frequency marks. In low-pressure gas spectroscopy, we achieved an improved spectral sampling density of 2.5 MHz and enhanced spectral accuracy of 8.39 × 10−7 in the THz region. The proposed method is a powerful tool for simultaneously achieving high resolution, high accuracy, and broad spectral coverage in THz spectroscopy. PMID:24448604

Transport synthetic acceleration for long-characteristics assembly-level transport problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zika, M.R.; Adams, M.L.

2000-02-01

The authors apply the transport synthetic acceleration (TSA) scheme to the long-characteristics spatial discretization for the two-dimensional assembly-level transport problem. This synthetic method employs a simplified transport operator as its low-order approximation. Thus, in the acceleration step, the authors take advantage of features of the long-characteristics discretization that make it particularly well suited to assembly-level transport problems. The main contribution is to address difficulties unique to the long-characteristics discretization and produce a computationally efficient acceleration scheme. The combination of the long-characteristics discretization, opposing reflecting boundary conditions (which are present in assembly-level transport problems), and TSA presents several challenges. The authorsmore » devise methods for overcoming each of them in a computationally efficient way. Since the boundary angular data exist on different grids in the high- and low-order problems, they define restriction and prolongation operations specific to the method of long characteristics to map between the two grids. They implement the conjugate gradient (CG) method in the presence of opposing reflection boundary conditions to solve the TSA low-order equations. The CG iteration may be applied only to symmetric positive definite (SPD) matrices; they prove that the long-characteristics discretization yields an SPD matrix. They present results of the acceleration scheme on a simple test problem, a typical pressurized water reactor assembly, and a typical boiling water reactor assembly.« less

Real-time frequency-to-time mapping based on spectrally-discrete chromatic dispersion.

PubMed

Dai, Yitang; Li, Jilong; Zhang, Ziping; Yin, Feifei; Li, Wangzhe; Xu, Kun

2017-07-10

Traditional photonics-assisted real-time Fourier transform (RTFT) usually suffers from limited chromatic dispersion, huge volume, or large time delay and attendant loss. In this paper we propose frequency-to-time mapping (FTM) by spectrally-discrete dispersion to increase frequency sensitivity greatly. The novel media has periodic ON/OFF intensity frequency response while quadratic phase distribution along disconnected channels, which de-chirps matched optical input to repeated Fourier-transform-limited output. Real-time FTM is then obtained within each period. Since only discrete phase retardation rather than continuously-changed true time delay is required, huge equivalent dispersion is then available by compact device. Such FTM is theoretically analyzed, and implementation by cascaded optical ring resonators is proposed. After a numerical example, our theory is demonstrated by a proof-of-concept experiment, where a single loop containing 0.5-meters-long fiber is used. FTM under 400-MHz unambiguous bandwidth and 25-MHz resolution is reported. Highly-sensitive and linear mapping is achieved with 6.25 ps/MHz, equivalent to ~4.6 × 10 4 -km standard single mode fiber. Extended instantaneous bandwidth is expected by ring cascading. Our proposal may provide a promising method for real-time, low-latency Fourier transform.

A high-order staggered finite-element vertical discretization for non-hydrostatic atmospheric models

DOE PAGES

Guerra, Jorge E.; Ullrich, Paul A.

2016-06-01

Atmospheric modeling systems require economical methods to solve the non-hydrostatic Euler equations. Two major differences between hydrostatic models and a full non-hydrostatic description lies in the vertical velocity tendency and numerical stiffness associated with sound waves. In this work we introduce a new arbitrary-order vertical discretization entitled the staggered nodal finite-element method (SNFEM). Our method uses a generalized discrete derivative that consistently combines the discontinuous Galerkin and spectral element methods on a staggered grid. Our combined method leverages the accurate wave propagation and conservation properties of spectral elements with staggered methods that eliminate stationary (2Δ x) modes. Furthermore, high-order accuracymore » also eliminates the need for a reference state to maintain hydrostatic balance. In this work we demonstrate the use of high vertical order as a means of improving simulation quality at relatively coarse resolution. We choose a test case suite that spans the range of atmospheric flows from predominantly hydrostatic to nonlinear in the large-eddy regime. Lastly, our results show that there is a distinct benefit in using the high-order vertical coordinate at low resolutions with the same robust properties as the low-order alternative.« less

A high-order staggered finite-element vertical discretization for non-hydrostatic atmospheric models

DOE Office of Scientific and Technical Information (OSTI.GOV)

Guerra, Jorge E.; Ullrich, Paul A.

Atmospheric modeling systems require economical methods to solve the non-hydrostatic Euler equations. Two major differences between hydrostatic models and a full non-hydrostatic description lies in the vertical velocity tendency and numerical stiffness associated with sound waves. In this work we introduce a new arbitrary-order vertical discretization entitled the staggered nodal finite-element method (SNFEM). Our method uses a generalized discrete derivative that consistently combines the discontinuous Galerkin and spectral element methods on a staggered grid. Our combined method leverages the accurate wave propagation and conservation properties of spectral elements with staggered methods that eliminate stationary (2Δ x) modes. Furthermore, high-order accuracymore » also eliminates the need for a reference state to maintain hydrostatic balance. In this work we demonstrate the use of high vertical order as a means of improving simulation quality at relatively coarse resolution. We choose a test case suite that spans the range of atmospheric flows from predominantly hydrostatic to nonlinear in the large-eddy regime. Lastly, our results show that there is a distinct benefit in using the high-order vertical coordinate at low resolutions with the same robust properties as the low-order alternative.« less

Simultaneous optical flow and source estimation: Space–time discretization and preconditioning

PubMed Central

Andreev, R.; Scherzer, O.; Zulehner, W.

2015-01-01

We consider the simultaneous estimation of an optical flow field and an illumination source term in a movie sequence. The particular optical flow equation is obtained by assuming that the image intensity is a conserved quantity up to possible sources and sinks which represent varying illumination. We formulate this problem as an energy minimization problem and propose a space–time simultaneous discretization for the optimality system in saddle-point form. We investigate a preconditioning strategy that renders the discrete system well-conditioned uniformly in the discretization resolution. Numerical experiments complement the theory. PMID:26435561

Domain decomposition for a mixed finite element method in three dimensions

USGS Publications Warehouse

Cai, Z.; Parashkevov, R.R.; Russell, T.F.; Wilson, J.D.; Ye, X.

2003-01-01

We consider the solution of the discrete linear system resulting from a mixed finite element discretization applied to a second-order elliptic boundary value problem in three dimensions. Based on a decomposition of the velocity space, these equations can be reduced to a discrete elliptic problem by eliminating the pressure through the use of substructures of the domain. The practicality of the reduction relies on a local basis, presented here, for the divergence-free subspace of the velocity space. We consider additive and multiplicative domain decomposition methods for solving the reduced elliptic problem, and their uniform convergence is established.

Approximation-Based Discrete-Time Adaptive Position Tracking Control for Interior Permanent Magnet Synchronous Motors.

PubMed

Yu, Jinpeng; Shi, Peng; Yu, Haisheng; Chen, Bing; Lin, Chong

2015-07-01

This paper considers the problem of discrete-time adaptive position tracking control for a interior permanent magnet synchronous motor (IPMSM) based on fuzzy-approximation. Fuzzy logic systems are used to approximate the nonlinearities of the discrete-time IPMSM drive system which is derived by direct discretization using Euler method, and a discrete-time fuzzy position tracking controller is designed via backstepping approach. In contrast to existing results, the advantage of the scheme is that the number of the adjustable parameters is reduced to two only and the problem of coupling nonlinearity can be overcome. It is shown that the proposed discrete-time fuzzy controller can guarantee the tracking error converges to a small neighborhood of the origin and all the signals are bounded. Simulation results illustrate the effectiveness and the potentials of the theoretic results obtained.

Investigation of computational and spectral analysis methods for aeroacoustic wave propagation

NASA Technical Reports Server (NTRS)

Vanel, Florence O.

1995-01-01

Most computational fluid dynamics (CFD) schemes are not adequately accurate for solving aeroacoustics problems, which have wave amplitudes several orders of magnitude smaller yet with frequencies larger than the flow field variations generating the sound. Hence, a computational aeroacoustics (CAA) algorithm should have minimal dispersion and dissipation features. A dispersion relation preserving (DRP) scheme is, therefore, applied to solve the linearized Euler equations in order to simulate the propagation of three types of waves, namely: acoustic, vorticity, and entropy waves. The scheme is derived using an optimization procedure to ensure that the numerical derivatives preserve the wave number and angular frequency of the partial differential equations being discretized. Consequently, simulated waves propagate with the correct wave speeds and exhibit their appropriate properties. A set of radiation and outflow boundary conditions, compatible with the DRP scheme and derived from the asymptotic solutions of the governing equations, are also implemented. Numerical simulations are performed to test the effectiveness of the DRP scheme and its boundary conditions. The computed solutions are shown to agree favorably with the exact solutions. The major restriction appears to be that the dispersion relations can be preserved only for waves with wave lengths longer than four or five spacings. The boundary conditions are found to be transparent to the outgoing disturbances. However, when the disturbance source is placed closer to a boundary, small acoustic reflections start appearing. CAA generates enormous amounts of temporal data which needs to be reduced to understand the physical problem being simulated. Spectral analysis is one approach that helps us in extracting information which often can not be easily interpreted in the time domain. Thus, three different methods for the spectral analysis of numerically generated aeroacoustic data are studied. First, the capabilities of two traditional methods for spectral analysis, namely, the Blackman-Tukey method and periodogram method, are compared in estimating the spectra of a simple-periodic process. The periodogram is then applied to analyze transitory-deterministic processes. Finally, these two methods are compared with a more recent method, referred as the Weighted-Overlapped-Segment-Averaging (WOSA) method, in estimating the spectra of a chaotic (random-like) process. From the demonstrative case for the spectral analyses of data generated by simple-periodic process, the periodogram method is found to give a better estimate of the steep-sloped spectra than the Blackman-Tukey method. Also, for this problem, the Hanning window is found to perform better with the periodogram method than with the Blackman-Tukey method. Finally, for the spectral analysis of data generated by the chaotic process, the periodogram method does not perform well, whereas, the WOSA and Blackman-Tukey methods give equivalently good results.

Multi-level adaptive finite element methods. 1: Variation problems

NASA Technical Reports Server (NTRS)

Brandt, A.

1979-01-01

A general numerical strategy for solving partial differential equations and other functional problems by cycling between coarser and finer levels of discretization is described. Optimal discretization schemes are provided together with very fast general solvers. It is described in terms of finite element discretizations of general nonlinear minimization problems. The basic processes (relaxation sweeps, fine-grid-to-coarse-grid transfers of residuals, coarse-to-fine interpolations of corrections) are directly and naturally determined by the objective functional and the sequence of approximation spaces. The natural processes, however, are not always optimal. Concrete examples are given and some new techniques are reviewed. Including the local truncation extrapolation and a multilevel procedure for inexpensively solving chains of many boundary value problems, such as those arising in the solution of time-dependent problems.

A fast direct solver for boundary value problems on locally perturbed geometries

NASA Astrophysics Data System (ADS)

Zhang, Yabin; Gillman, Adrianna

2018-03-01

Many applications including optimal design and adaptive discretization techniques involve solving several boundary value problems on geometries that are local perturbations of an original geometry. This manuscript presents a fast direct solver for boundary value problems that are recast as boundary integral equations. The idea is to write the discretized boundary integral equation on a new geometry as a low rank update to the discretized problem on the original geometry. Using the Sherman-Morrison formula, the inverse can be expressed in terms of the inverse of the original system applied to the low rank factors and the right hand side. Numerical results illustrate for problems where perturbation is localized the fast direct solver is three times faster than building a new solver from scratch.

Development of a radiographic method for measuring the discrete spectrum of the electron beam from a plasma focus device

NASA Astrophysics Data System (ADS)

Shamsian, Neda; Bidabadi, Babak Shirani; Pirjamadi, Hosein

2017-07-01

An indirect method is proposed for measuring the relative energy spectrum of the pulsed electron beam of a plasma focus device. The Bremsstrahlung x-ray, generated by the collision of electrons against the anode surface, was measured behind lead filters with various thicknesses using a radiographic film system. A matrix equation was considered in order to explain the relation between the x-ray dose and the spectral amplitudes of the electron beam. The electron spectrum of the device was measured at 0.6 mbar argon and 22 kV charging voltage, in four discrete energy intervals extending up to 500 keV. The results of the experiments show that most of the electrons are emitted in the 125-375 keV energy range and the spectral amplitude becomes negligible beyond 375 keV.

Spectral methods for time dependent problems

NASA Technical Reports Server (NTRS)

Tadmor, Eitan

1990-01-01

Spectral approximations are reviewed for time dependent problems. Some basic ingredients from the spectral Fourier and Chebyshev approximations theory are discussed. A brief survey was made of hyperbolic and parabolic time dependent problems which are dealt with by both the energy method and the related Fourier analysis. The ideas presented above are combined in the study of accuracy stability and convergence of the spectral Fourier approximation to time dependent problems.

Metabolomic spectral libraries for data-independent SWATH liquid chromatography mass spectrometry acquisition.

PubMed

Bruderer, Tobias; Varesio, Emmanuel; Hidasi, Anita O; Duchoslav, Eva; Burton, Lyle; Bonner, Ron; Hopfgartner, Gérard

2018-03-01

High-quality mass spectral libraries have become crucial in mass spectrometry-based metabolomics. Here, we investigate a workflow to generate accurate mass discrete and composite spectral libraries for metabolite identification and for SWATH mass spectrometry data processing. Discrete collision energy (5-100 eV) accurate mass spectra were collected for 532 metabolites from the human metabolome database (HMDB) by flow injection analysis and compiled into composite spectra over a large collision energy range (e.g., 10-70 eV). Full scan response factors were also calculated. Software tools based on accurate mass and predictive fragmentation were specially developed and found to be essential for construction and quality control of the spectral library. First, elemental compositions constrained by the elemental composition of the precursor ion were calculated for all fragments. Secondly, all possible fragments were generated from the compound structure and were filtered based on their elemental compositions. From the discrete spectra, it was possible to analyze the specific fragment form at each collision energy and it was found that a relatively large collision energy range (10-70 eV) gives informative MS/MS spectra for library searches. From the composite spectra, it was possible to characterize specific neutral losses as radical losses using in silico fragmentation. Radical losses (generating radical cations) were found to be more prominent than expected. From 532 metabolites, 489 provided a signal in positive mode [M+H] + and 483 in negative mode [M-H] - . MS/MS spectra were obtained for 399 compounds in positive mode and for 462 in negative mode; 329 metabolites generated suitable spectra in both modes. Using the spectral library, LC retention time, response factors to analyze data-independent LC-SWATH-MS data allowed the identification of 39 (positive mode) and 72 (negative mode) metabolites in a plasma pool sample (total 92 metabolites) where 81 previously were reported in HMDB to be found in plasma. Graphical abstract Library generation workflow for LC-SWATH MS, using collision energy spread, accurate mass, and fragment annotation.

A prefiltering version of the Kalman filter with new numerical integration formulas for Riccati equations

NASA Technical Reports Server (NTRS)

Womble, M. E.; Potter, J. E.

1975-01-01

A prefiltering version of the Kalman filter is derived for both discrete and continuous measurements. The derivation consists of determining a single discrete measurement that is equivalent to either a time segment of continuous measurements or a set of discrete measurements. This prefiltering version of the Kalman filter easily handles numerical problems associated with rapid transients and ill-conditioned Riccati matrices. Therefore, the derived technique for extrapolating the Riccati matrix from one time to the next constitutes a new set of integration formulas which alleviate ill-conditioning problems associated with continuous Riccati equations. Furthermore, since a time segment of continuous measurements is converted into a single discrete measurement, Potter's square root formulas can be used to update the state estimate and its error covariance matrix. Therefore, if having the state estimate and its error covariance matrix at discrete times is acceptable, the prefilter extends square root filtering with all its advantages, to continuous measurement problems.

Stochastic Dual Algorithm for Voltage Regulation in Distribution Networks with Discrete Loads: Preprint

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dall-Anese, Emiliano; Zhou, Xinyang; Liu, Zhiyuan

This paper considers distribution networks with distributed energy resources and discrete-rate loads, and designs an incentive-based algorithm that allows the network operator and the customers to pursue given operational and economic objectives, while concurrently ensuring that voltages are within prescribed limits. Four major challenges include: (1) the non-convexity from discrete decision variables, (2) the non-convexity due to a Stackelberg game structure, (3) unavailable private information from customers, and (4) different update frequency from two types of devices. In this paper, we first make convex relaxation for discrete variables, then reformulate the non-convex structure into a convex optimization problem together withmore » pricing/reward signal design, and propose a distributed stochastic dual algorithm for solving the reformulated problem while restoring feasible power rates for discrete devices. By doing so, we are able to statistically achieve the solution of the reformulated problem without exposure of any private information from customers. Stability of the proposed schemes is analytically established and numerically corroborated.« less

The Benard problem: A comparison of finite difference and spectral collocation eigen value solutions

NASA Technical Reports Server (NTRS)

Skarda, J. Raymond Lee; Mccaughan, Frances E.; Fitzmaurice, Nessan

1995-01-01

The application of spectral methods, using a Chebyshev collocation scheme, to solve hydrodynamic stability problems is demonstrated on the Benard problem. Implementation of the Chebyshev collocation formulation is described. The performance of the spectral scheme is compared with that of a 2nd order finite difference scheme. An exact solution to the Marangoni-Benard problem is used to evaluate the performance of both schemes. The error of the spectral scheme is at least seven orders of magnitude smaller than finite difference error for a grid resolution of N = 15 (number of points used). The performance of the spectral formulation far exceeded the performance of the finite difference formulation for this problem. The spectral scheme required only slightly more effort to set up than the 2nd order finite difference scheme. This suggests that the spectral scheme may actually be faster to implement than higher order finite difference schemes.

Discrimination between discrete and continuum scattering from the sub-seafloor.

PubMed

Holland, Charles W; Steininger, Gavin; Dosso, Stan E

2015-08-01

There is growing evidence that seabed scattering is often dominated by heterogeneities within the sediment volume as opposed to seafloor roughness. From a theoretical viewpoint, sediment volume heterogeneities can be described either by a fluctuation continuum or by discrete particles. In at-sea experiments, heterogeneity characteristics generally are not known a priori. Thus, an uninformed model selection is generally made, i.e., the researcher must arbitrarily select either a discrete or continuum model. It is shown here that it is possible to (acoustically) discriminate between continuum and discrete heterogeneities in some instances. For example, when the spectral exponent γ3>4, the volume scattering cannot be described by discrete particles. Conversely, when γ3≤2, the heterogeneities likely arise from discrete particles. Furthermore, in the range 2<γ3≤4 it is sometimes possible to discriminate via physical bounds on the parameter values. The ability to so discriminate is important, because there are few tools for measuring small scale, O(10(-2) to 10(1)) m, sediment heterogeneities over large areas. Therefore, discriminating discrete vs continuum heterogeneities via acoustic remote sensing may lead to improved observations and concomitant increased understanding of the marine benthic environment.

Reduction of the discretization stencil of direct forcing immersed boundary methods on rectangular cells: The ghost node shifting method

NASA Astrophysics Data System (ADS)

Picot, Joris; Glockner, Stéphane

2018-07-01

We present an analytical study of discretization stencils for the Poisson problem and the incompressible Navier-Stokes problem when used with some direct forcing immersed boundary methods. This study uses, but is not limited to, second-order discretization and Ghost-Cell Finite-Difference methods. We show that the stencil size increases with the aspect ratio of rectangular cells, which is undesirable as it breaks assumptions of some linear system solvers. To circumvent this drawback, a modification of the Ghost-Cell Finite-Difference methods is proposed to reduce the size of the discretization stencil to the one observed for square cells, i.e. with an aspect ratio equal to one. Numerical results validate this proposed method in terms of accuracy and convergence, for the Poisson problem and both Dirichlet and Neumann boundary conditions. An improvement on error levels is also observed. In addition, we show that the application of the chosen Ghost-Cell Finite-Difference methods to the Navier-Stokes problem, discretized by a pressure-correction method, requires an additional interpolation step. This extra step is implemented and validated through well known test cases of the Navier-Stokes equations.

Modeling of Graphene Planar Grating in the THz Range by the Method of Singular Integral Equations

NASA Astrophysics Data System (ADS)

Kaliberda, Mstislav E.; Lytvynenko, Leonid M.; Pogarsky, Sergey A.

2018-04-01

Diffraction of the H-polarized electromagnetic wave by the planar graphene grating in the THz range is considered. The scattering and absorption characteristics are studied. The scattered field is represented in the spectral domain via unknown spectral function. The mathematical model is based on the graphene surface impedance and the method of singular integral equations. The numerical solution is obtained by the Nystrom-type method of discrete singularities.

Streaked x-ray spectrometer having a discrete selection of Bragg geometries for Omega

DOE Office of Scientific and Technical Information (OSTI.GOV)

Millecchia, M.; Regan, S. P.; Bahr, R. E.

2012-10-15

The streaked x-ray spectrometer (SXS) is used with streak cameras [D. H. Kalantar, P. M. Bell, R. L. Costa, B. A. Hammel, O. L. Landen, T. J. Orzechowski, J. D. Hares, and A. K. L. Dymoke-Bradshaw, in 22nd International Congress on High-Speed Photography and Photonics, edited by D. L. Paisley and A. M. Frank (SPIE, Bellingham, WA, 1997), Vol. 2869, p. 680] positioned with a ten-inch manipulator on OMEGA [T. R. Boehly et al., Opt. Commun. 133, 495 (1997)] and OMEGA EP [L. J. Waxer et al., Presented at CLEO/QELS 2008, San Jose, CA, 4-9 May 2008 (Paper JThB1)] formore » time-resolved, x-ray spectroscopy of laser-produced plasmas in the 1.4- to 20-keV photon-energy range. These experiments require measuring a portion of this photon-energy range to monitor a particular emission or absorption feature of interest. The SXS relies on a pinned mechanical reference system to create a discrete set of Bragg reflection geometries for a variety of crystals. A wide selection of spectral windows is achieved accurately and efficiently using this technique. It replaces the previous spectrometer designs that had a continuous Bragg angle adjustment and required a tedious alignment calibration procedure. The number of spectral windows needed for the SXS was determined by studying the spectral ranges selected by OMEGA users over the last decade. These selections are easily configured in the SXS using one of the 25 discrete Bragg reflection geometries and one of the six types of Bragg crystals, including two curved crystals.« less

Numerical calculation of ion runaway distributions

DOE Office of Scientific and Technical Information (OSTI.GOV)

Embréus, O.; Stahl, A.; Hirvijoki, E.

2015-05-15

Ions accelerated by electric fields (so-called runaway ions) in plasmas may explain observations in solar flares and fusion experiments; however, limitations of previous analytic work have prevented definite conclusions. In this work, we describe a numerical solver of the 2D non-relativistic linearized Fokker-Planck equation for ions. It solves the initial value problem in velocity space with a spectral-Eulerian discretization scheme, allowing arbitrary plasma composition and time-varying electric fields and background plasma parameters. The numerical ion distribution function is then used to consider the conditions for runaway ion acceleration in solar flares and tokamak plasmas. Typical time scales and electric fieldsmore » required for ion acceleration are determined for various plasma compositions, ion species, and temperatures, and the potential for excitation of toroidal Alfvén eigenmodes during tokamak disruptions is considered.« less

Matrix form for the instrument line shape of Fourier-transform spectrometers yielding a fast integration algorithm to theoretical spectra.

PubMed

Desbiens, Raphaël; Tremblay, Pierre; Genest, Jérôme; Bouchard, Jean-Pierre

2006-01-20

The instrument line shape (ILS) of a Fourier-transform spectrometer is expressed in a matrix form. For all line shape effects that scale with wavenumber, the ILS matrix is shown to be transposed in the spectral and interferogram domains. The novel representation of the ILS matrix in the interferogram domain yields an insightful physical interpretation of the underlying process producing self-apodization. Working in the interferogram domain circumvents the problem of taking into account the effects of finite optical path difference and permits a proper discretization of the equations. A fast algorithm in O(N log2 N), based on the fractional Fourier transform, is introduced that permits the application of a constant resolving power line shape to theoretical spectra or forward models. The ILS integration formalism is validated with experimental data.

An adaptive simplex cut-cell method for high-order discontinuous Galerkin discretizations of elliptic interface problems and conjugate heat transfer problems

NASA Astrophysics Data System (ADS)

Sun, Huafei; Darmofal, David L.

2014-12-01

In this paper we propose a new high-order solution framework for interface problems on non-interface-conforming meshes. The framework consists of a discontinuous Galerkin (DG) discretization, a simplex cut-cell technique, and an output-based adaptive scheme. We first present a DG discretization with a dual-consistent output evaluation for elliptic interface problems on interface-conforming meshes, and then extend the method to handle multi-physics interface problems, in particular conjugate heat transfer (CHT) problems. The method is then applied to non-interface-conforming meshes using a cut-cell technique, where the interface definition is completely separate from the mesh generation process. No assumption is made on the interface shape (other than Lipschitz continuity). We then equip our strategy with an output-based adaptive scheme for an accurate output prediction. Through numerical examples, we demonstrate high-order convergence for elliptic interface problems and CHT problems with both smooth and non-smooth interface shapes.

A design study for the addition of higher order parametric discrete elements to NASTRAN

NASA Technical Reports Server (NTRS)

Stanton, E. L.

1972-01-01

The addition of discrete elements to NASTRAN poses significant interface problems with the level 15.1 assembly modules and geometry modules. Potential problems in designing new modules for higher-order parametric discrete elements are reviewed in both areas. An assembly procedure is suggested that separates grid point degrees of freedom on the basis of admissibility. New geometric input data are described that facilitate the definition of surfaces in parametric space.

Spectral analysis of variable-length coded digital signals

NASA Astrophysics Data System (ADS)

Cariolaro, G. L.; Pierobon, G. L.; Pupolin, S. G.

1982-05-01

A spectral analysis is conducted for a variable-length word sequence by an encoder driven by a stationary memoryless source. A finite-state sequential machine is considered as a model of the line encoder, and the spectral analysis of the encoded message is performed under the assumption that the sourceword sequence is composed of independent identically distributed words. Closed form expressions for both the continuous and discrete parts of the spectral density are derived in terms of the encoder law and sourceword statistics. The jump part exhibits jumps at multiple integers of per lambda(sub 0)T, where lambda(sub 0) is the greatest common divisor of the possible codeword lengths, and T is the symbol period. The derivation of the continuous part can be conveniently factorized, and the theory is applied to the spectral analysis of BnZS and HDBn codes.

Discrete optimal control approach to a four-dimensional guidance problem near terminal areas

NASA Technical Reports Server (NTRS)

Nagarajan, N.

1974-01-01

Description of a computer-oriented technique to generate the necessary control inputs to guide an aircraft in a given time from a given initial state to a prescribed final state subject to the constraints on airspeed, acceleration, and pitch and bank angles of the aircraft. A discrete-time mathematical model requiring five state variables and three control variables is obtained, assuming steady wind and zero sideslip. The guidance problem is posed as a discrete nonlinear optimal control problem with a cost functional of Bolza form. A solution technique for the control problem is investigated, and numerical examples are presented. It is believed that this approach should prove to be useful in automated air traffic control schemes near large terminal areas.

Discrete Wavelet Transform-Based Whole-Spectral and Subspectral Analysis for Improved Brain Tumor Clustering Using Single Voxel MR Spectroscopy.

PubMed

Yang, Guang; Nawaz, Tahir; Barrick, Thomas R; Howe, Franklyn A; Slabaugh, Greg

2015-12-01

Many approaches have been considered for automatic grading of brain tumors by means of pattern recognition with magnetic resonance spectroscopy (MRS). Providing an improved technique which can assist clinicians in accurately identifying brain tumor grades is our main objective. The proposed technique, which is based on the discrete wavelet transform (DWT) of whole-spectral or subspectral information of key metabolites, combined with unsupervised learning, inspects the separability of the extracted wavelet features from the MRS signal to aid the clustering. In total, we included 134 short echo time single voxel MRS spectra (SV MRS) in our study that cover normal controls, low grade and high grade tumors. The combination of DWT-based whole-spectral or subspectral analysis and unsupervised clustering achieved an overall clustering accuracy of 94.8% and a balanced error rate of 7.8%. To the best of our knowledge, it is the first study using DWT combined with unsupervised learning to cluster brain SV MRS. Instead of dimensionality reduction on SV MRS or feature selection using model fitting, our study provides an alternative method of extracting features to obtain promising clustering results.

Discretizing singular point sources in hyperbolic wave propagation problems

DOE PAGES

Petersson, N. Anders; O'Reilly, Ossian; Sjogreen, Bjorn; ...

2016-06-01

Here, we develop high order accurate source discretizations for hyperbolic wave propagation problems in first order formulation that are discretized by finite difference schemes. By studying the Fourier series expansions of the source discretization and the finite difference operator, we derive sufficient conditions for achieving design accuracy in the numerical solution. Only half of the conditions in Fourier space can be satisfied through moment conditions on the source discretization, and we develop smoothness conditions for satisfying the remaining accuracy conditions. The resulting source discretization has compact support in physical space, and is spread over as many grid points as themore » number of moment and smoothness conditions. In numerical experiments we demonstrate high order of accuracy in the numerical solution of the 1-D advection equation (both in the interior and near a boundary), the 3-D elastic wave equation, and the 3-D linearized Euler equations.« less

A novel discrete PSO algorithm for solving job shop scheduling problem to minimize makespan

NASA Astrophysics Data System (ADS)

Rameshkumar, K.; Rajendran, C.

2018-02-01

In this work, a discrete version of PSO algorithm is proposed to minimize the makespan of a job-shop. A novel schedule builder has been utilized to generate active schedules. The discrete PSO is tested using well known benchmark problems available in the literature. The solution produced by the proposed algorithms is compared with best known solution published in the literature and also compared with hybrid particle swarm algorithm and variable neighborhood search PSO algorithm. The solution construction methodology adopted in this study is found to be effective in producing good quality solutions for the various benchmark job-shop scheduling problems.

On the coupling of hyperbolic and parabolic systems: Analytical and numerical approach

NASA Technical Reports Server (NTRS)

Gastaldi, Fabio; Quarteroni, Alfio

1988-01-01

The coupling of hyperbolic and parabolic systems is discussed in a domain Omega divided into two distinct subdomains omega(+) and omega(-). The main concern is to find the proper interface conditions to be fulfilled at the surface separating the two domains. Next, they are used in the numerical approximation of the problem. The justification of the interface conditions is based on a singular perturbation analysis, i.e., the hyperbolic system is rendered parabolic by adding a small artifical viscosity. As this goes to zero, the coupled parabolic-parabolic problem degenerates into the original one, yielding some conditions at the interface. These are taken as interface conditions for the hyperbolic-parabolic problem. Actually, two alternative sets of interface conditions are discussed according to whether the regularization procedure is variational or nonvariational. It is shown how these conditions can be used in the frame of a numerical approximation to the given problem. Furthermore, a method of resolution is discussed which alternates the resolution of the hyperbolic problem within omega(-) and of the parabolic one within omega(+). The spectral collocation method is proposed, as an example of space discretization (different methods could be used as well); both explicit and implicit time-advancing schemes are considered. The present study is a preliminary step toward the analysis of the coupling between Euler and Navier-Stokes equations for compressible flows.

Dynamic programming and graph algorithms in computer vision.

PubMed

Felzenszwalb, Pedro F; Zabih, Ramin

2011-04-01

Optimization is a powerful paradigm for expressing and solving problems in a wide range of areas, and has been successfully applied to many vision problems. Discrete optimization techniques are especially interesting since, by carefully exploiting problem structure, they often provide nontrivial guarantees concerning solution quality. In this paper, we review dynamic programming and graph algorithms, and discuss representative examples of how these discrete optimization techniques have been applied to some classical vision problems. We focus on the low-level vision problem of stereo, the mid-level problem of interactive object segmentation, and the high-level problem of model-based recognition.

Generalised Assignment Matrix Methodology in Linear Programming

ERIC Educational Resources Information Center

Jerome, Lawrence

2012-01-01

Discrete Mathematics instructors and students have long been struggling with various labelling and scanning algorithms for solving many important problems. This paper shows how to solve a wide variety of Discrete Mathematics and OR problems using assignment matrices and linear programming, specifically using Excel Solvers although the same…

Multisource Data Classification Using A Hybrid Semi-supervised Learning Scheme

DOE Office of Scientific and Technical Information (OSTI.GOV)

Vatsavai, Raju; Bhaduri, Budhendra L; Shekhar, Shashi

2009-01-01

In many practical situations thematic classes can not be discriminated by spectral measurements alone. Often one needs additional features such as population density, road density, wetlands, elevation, soil types, etc. which are discrete attributes. On the other hand remote sensing image features are continuous attributes. Finding a suitable statistical model and estimation of parameters is a challenging task in multisource (e.g., discrete and continuous attributes) data classification. In this paper we present a semi-supervised learning method by assuming that the samples were generated by a mixture model, where each component could be either a continuous or discrete distribution. Overall classificationmore » accuracy of the proposed method is improved by 12% in our initial experiments.« less

Spectral multigrid methods for elliptic equations 2

NASA Technical Reports Server (NTRS)

Zang, T. A.; Wong, Y. S.; Hussaini, M. Y.

1983-01-01

A detailed description of spectral multigrid methods is provided. This includes the interpolation and coarse-grid operators for both periodic and Dirichlet problems. The spectral methods for periodic problems use Fourier series and those for Dirichlet problems are based upon Chebyshev polynomials. An improved preconditioning for Dirichlet problems is given. Numerical examples and practical advice are included.

Optimization of Operations Resources via Discrete Event Simulation Modeling

NASA Technical Reports Server (NTRS)

Joshi, B.; Morris, D.; White, N.; Unal, R.

1996-01-01

The resource levels required for operation and support of reusable launch vehicles are typically defined through discrete event simulation modeling. Minimizing these resources constitutes an optimization problem involving discrete variables and simulation. Conventional approaches to solve such optimization problems involving integer valued decision variables are the pattern search and statistical methods. However, in a simulation environment that is characterized by search spaces of unknown topology and stochastic measures, these optimization approaches often prove inadequate. In this paper, we have explored the applicability of genetic algorithms to the simulation domain. Genetic algorithms provide a robust search strategy that does not require continuity and differentiability of the problem domain. The genetic algorithm successfully minimized the operation and support activities for a space vehicle, through a discrete event simulation model. The practical issues associated with simulation optimization, such as stochastic variables and constraints, were also taken into consideration.

A fast numerical method for the valuation of American lookback put options

NASA Astrophysics Data System (ADS)

Song, Haiming; Zhang, Qi; Zhang, Ran

2015-10-01

A fast and efficient numerical method is proposed and analyzed for the valuation of American lookback options. American lookback option pricing problem is essentially a two-dimensional unbounded nonlinear parabolic problem. We reformulate it into a two-dimensional parabolic linear complementary problem (LCP) on an unbounded domain. The numeraire transformation and domain truncation technique are employed to convert the two-dimensional unbounded LCP into a one-dimensional bounded one. Furthermore, the variational inequality (VI) form corresponding to the one-dimensional bounded LCP is obtained skillfully by some discussions. The resulting bounded VI is discretized by a finite element method. Meanwhile, the stability of the semi-discrete solution and the symmetric positive definiteness of the full-discrete matrix are established for the bounded VI. The discretized VI related to options is solved by a projection and contraction method. Numerical experiments are conducted to test the performance of the proposed method.

Space-time adaptive solution of inverse problems with the discrete adjoint method

NASA Astrophysics Data System (ADS)

Alexe, Mihai; Sandu, Adrian

2014-08-01

This paper develops a framework for the construction and analysis of discrete adjoint sensitivities in the context of time dependent, adaptive grid, adaptive step models. Discrete adjoints are attractive in practice since they can be generated with low effort using automatic differentiation. However, this approach brings several important challenges. The space-time adjoint of the forward numerical scheme may be inconsistent with the continuous adjoint equations. A reduction in accuracy of the discrete adjoint sensitivities may appear due to the inter-grid transfer operators. Moreover, the optimization algorithm may need to accommodate state and gradient vectors whose dimensions change between iterations. This work shows that several of these potential issues can be avoided through a multi-level optimization strategy using discontinuous Galerkin (DG) hp-adaptive discretizations paired with Runge-Kutta (RK) time integration. We extend the concept of dual (adjoint) consistency to space-time RK-DG discretizations, which are then shown to be well suited for the adaptive solution of time-dependent inverse problems. Furthermore, we prove that DG mesh transfer operators on general meshes are also dual consistent. This allows the simultaneous derivation of the discrete adjoint for both the numerical solver and the mesh transfer logic with an automatic code generation mechanism such as algorithmic differentiation (AD), potentially speeding up development of large-scale simulation codes. The theoretical analysis is supported by numerical results reported for a two-dimensional non-stationary inverse problem.

A scalable block-preconditioning strategy for divergence-conforming B-spline discretizations of the Stokes problem

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cortes, Adriano M.; Dalcin, Lisandro; Sarmiento, Adel F.

The recently introduced divergence-conforming B-spline discretizations allow the construction of smooth discrete velocity–pressure pairs for viscous incompressible flows that are at the same time inf–sup stable and pointwise divergence-free. When applied to the discretized Stokes problem, these spaces generate a symmetric and indefinite saddle-point linear system. The iterative method of choice to solve such system is the Generalized Minimum Residual Method. This method lacks robustness, and one remedy is to use preconditioners. For linear systems of saddle-point type, a large family of preconditioners can be obtained by using a block factorization of the system. In this paper, we show howmore » the nesting of “black-box” solvers and preconditioners can be put together in a block triangular strategy to build a scalable block preconditioner for the Stokes system discretized by divergence-conforming B-splines. Lastly, besides the known cavity flow problem, we used for benchmark flows defined on complex geometries: an eccentric annulus and hollow torus of an eccentric annular cross-section.« less

Vectorial finite elements for solving the radiative transfer equation

NASA Astrophysics Data System (ADS)

Badri, M. A.; Jolivet, P.; Rousseau, B.; Le Corre, S.; Digonnet, H.; Favennec, Y.

2018-06-01

The discrete ordinate method coupled with the finite element method is often used for the spatio-angular discretization of the radiative transfer equation. In this paper we attempt to improve upon such a discretization technique. Instead of using standard finite elements, we reformulate the radiative transfer equation using vectorial finite elements. In comparison to standard finite elements, this reformulation yields faster timings for the linear system assemblies, as well as for the solution phase when using scattering media. The proposed vectorial finite element discretization for solving the radiative transfer equation is cross-validated against a benchmark problem available in literature. In addition, we have used the method of manufactured solutions to verify the order of accuracy for our discretization technique within different absorbing, scattering, and emitting media. For solving large problems of radiation on parallel computers, the vectorial finite element method is parallelized using domain decomposition. The proposed domain decomposition method scales on large number of processes, and its performance is unaffected by the changes in optical thickness of the medium. Our parallel solver is used to solve a large scale radiative transfer problem of the Kelvin-cell radiation.

A scalable block-preconditioning strategy for divergence-conforming B-spline discretizations of the Stokes problem

DOE PAGES

Cortes, Adriano M.; Dalcin, Lisandro; Sarmiento, Adel F.; ...

2016-10-19

The recently introduced divergence-conforming B-spline discretizations allow the construction of smooth discrete velocity–pressure pairs for viscous incompressible flows that are at the same time inf–sup stable and pointwise divergence-free. When applied to the discretized Stokes problem, these spaces generate a symmetric and indefinite saddle-point linear system. The iterative method of choice to solve such system is the Generalized Minimum Residual Method. This method lacks robustness, and one remedy is to use preconditioners. For linear systems of saddle-point type, a large family of preconditioners can be obtained by using a block factorization of the system. In this paper, we show howmore » the nesting of “black-box” solvers and preconditioners can be put together in a block triangular strategy to build a scalable block preconditioner for the Stokes system discretized by divergence-conforming B-splines. Lastly, besides the known cavity flow problem, we used for benchmark flows defined on complex geometries: an eccentric annulus and hollow torus of an eccentric annular cross-section.« less

Energy-modeled flight in a wind field

DOE Office of Scientific and Technical Information (OSTI.GOV)

Feldman, M.A.; Cliff, E.M.

Optimal shaping of aerospace trajectories has provided the motivation for much modern study of optimization theory and algorithms. Current industrial practice favors approaches where the continuous-time optimal control problem is transcribed to a finite-dimensional nonlinear programming problem (NLP) by a discretization process. Two such formulations are implemented in the POST and the OTIS codes. In the present paper we use a discretization that is specially adapted to the flight problem of interest. Among the unique aspects of the present discretization are: a least-squares formulation for certain kinematic constraints; the use of an energy ideas to enforce Newton`s Laws; and, themore » inclusion of large magnitude horizontal winds. In the next section we shall provide a description of the flight problem and its NLP representation. Following this we provide some details of the constraint formulation. Finally, we present an overview of the NLP problem.« less

Spectral difference Lanczos method for efficient time propagation in quantum control theory

NASA Astrophysics Data System (ADS)

Farnum, John D.; Mazziotti, David A.

2004-04-01

Spectral difference methods represent the real-space Hamiltonian of a quantum system as a banded matrix which possesses the accuracy of the discrete variable representation (DVR) and the efficiency of finite differences. When applied to time-dependent quantum mechanics, spectral differences enhance the efficiency of propagation methods for evolving the Schrödinger equation. We develop a spectral difference Lanczos method which is computationally more economical than the sinc-DVR Lanczos method, the split-operator technique, and even the fast-Fourier-Transform Lanczos method. Application of fast propagation is made to quantum control theory where chirped laser pulses are designed to dissociate both diatomic and polyatomic molecules. The specificity of the chirped laser fields is also tested as a possible method for molecular identification and discrimination.

Peculiarities of Forming a Multiband Transmission Function Based on Multifrequency Acousto-Optic Diffraction

NASA Astrophysics Data System (ADS)

Proklov, V. V.; Rezvov, Yu. G.

2018-01-01

An analytical solution for the transmission function of noncoherent wideband radiation is obtained under acousto-optic (AO) filtering using a discrete set of monochromatic AO waves with a small spectral overlap. We studied characteristics of the AO transformation of a continuous spectrum of noncoherent radiation into a given set of discrete narrow bands of spectral transmission by excitation of a discrete set of sound frequencies. We carried out the analysis of transmission functions of individual channels taking into account a partial overlap of their spectra and possible intermodulation distortions. It is shown that a stationary value of the root-mean-square light power is found at the electronic output due to the photoelectric transformation and detecting diffracted light. Based on this, a necessary stationary, multiband, and nearly equidistant transmission function of a device can be formed by using a relevant spectrum of acoustic excitation. Peculiarities of this way of forming the multiband transmission function are revealed: the limitation of diffraction efficiency for an individual channel, the possibility of decoupling side lobes of adjacent channels, etc. A multiband acousto-optic filter (MAOF) was simulated that was based on a paratellurite monocrystal (TeO2), which was previously used for experimental optical encoding. The theoretical and experimental results are in gratifying agreement.

Discrete Mathematics Re "Tooled."

ERIC Educational Resources Information Center

Grassl, Richard M.; Mingus, Tabitha T. Y.

1999-01-01

Indicates the importance of teaching discrete mathematics. Describes how the use of technology can enhance the teaching and learning of discrete mathematics. Explorations using Excel, Derive, and the TI-92 proved how preservice and inservice teachers experienced a new dimension in problem solving and discovery. (ASK)

Adaptive Discrete Hypergraph Matching.

PubMed

Yan, Junchi; Li, Changsheng; Li, Yin; Cao, Guitao

2018-02-01

This paper addresses the problem of hypergraph matching using higher-order affinity information. We propose a solver that iteratively updates the solution in the discrete domain by linear assignment approximation. The proposed method is guaranteed to converge to a stationary discrete solution and avoids the annealing procedure and ad-hoc post binarization step that are required in several previous methods. Specifically, we start with a simple iterative discrete gradient assignment solver. This solver can be trapped in an -circle sequence under moderate conditions, where is the order of the graph matching problem. We then devise an adaptive relaxation mechanism to jump out this degenerating case and show that the resulting new path will converge to a fixed solution in the discrete domain. The proposed method is tested on both synthetic and real-world benchmarks. The experimental results corroborate the efficacy of our method.

Minding the gap: Children's difficulty conceptualizing spatial intervals as linear measurement units.

PubMed

Solomon, Tracy L; Vasilyeva, Marina; Huttenlocher, Janellen; Levine, Susan C

2015-11-01

Understanding measurement units is critical to mathematics and science learning, but it is a topic that American students find difficult. In 3 studies, we investigated the challenges underlying this difficulty in kindergarten and second grade by comparing performance on different versions of a linear measurement task. Children measured crayons that were either aligned or shifted relative to the left edge of either a continuous ruler or a row of discrete units. The alignment (aligned, shifted) and the measuring tool (ruler, discrete units) were crossed to form 4 types of problems. Study 1 showed good performance in both grades on both types of aligned problems as well as on the shifted problems with discrete units. In contrast, performance was at chance on the shifted ruler problems. Study 2 showed that performance on shifted discrete unit problems declined when numbers were placed on the units, particularly for kindergarteners, suggesting that on the shifted ruler problems, the presence of numbers may have contributed to children's difficulty. However, Study 3 showed that the difficulty on the shifted ruler problems persisted even when the numbers were removed from the ruler. Taken together, these findings suggest that there are multiple challenges to understanding measurement, but that a key challenge is conceptualizing the ruler as a set of countable spatial interval units. (c) 2015 APA, all rights reserved).

Dynamic Programming and Graph Algorithms in Computer Vision*

PubMed Central

Felzenszwalb, Pedro F.; Zabih, Ramin

2013-01-01

Optimization is a powerful paradigm for expressing and solving problems in a wide range of areas, and has been successfully applied to many vision problems. Discrete optimization techniques are especially interesting, since by carefully exploiting problem structure they often provide non-trivial guarantees concerning solution quality. In this paper we briefly review dynamic programming and graph algorithms, and discuss representative examples of how these discrete optimization techniques have been applied to some classical vision problems. We focus on the low-level vision problem of stereo; the mid-level problem of interactive object segmentation; and the high-level problem of model-based recognition. PMID:20660950

Conforming discretizations of boundary element solutions to the electroencephalography forward problem

NASA Astrophysics Data System (ADS)

Rahmouni, Lyes; Adrian, Simon B.; Cools, Kristof; Andriulli, Francesco P.

2018-01-01

In this paper, we present a new discretization strategy for the boundary element formulation of the Electroencephalography (EEG) forward problem. Boundary integral formulations, classically solved with the Boundary Element Method (BEM), are widely used in high resolution EEG imaging because of their recognized advantages, in several real case scenarios, in terms of numerical stability and effectiveness when compared with other differential equation based techniques. Unfortunately, however, it is widely reported in literature that the accuracy of standard BEM schemes for the forward EEG problem is often limited, especially when the current source density is dipolar and its location approaches one of the brain boundary surfaces. This is a particularly limiting problem given that during an high-resolution EEG imaging procedure, several EEG forward problem solutions are required, for which the source currents are near or on top of a boundary surface. This work will first present an analysis of standardly and classically discretized EEG forward problem operators, reporting on a theoretical issue of some of the formulations that have been used so far in the community. We report on the fact that several standardly used discretizations of these formulations are consistent only with an L2-framework, requiring the expansion term to be a square integrable function (i.e., in a Petrov-Galerkin scheme with expansion and testing functions). Instead, those techniques are not consistent when a more appropriate mapping in terms of fractional-order Sobolev spaces is considered. Such a mapping allows the expansion function term to be a less regular function, thus sensibly reducing the need for mesh refinements and low-precisions handling strategies that are currently required. These more favorable mappings, however, require a different and conforming discretization, which must be suitably adapted to them. In order to appropriately fulfill this requirement, we adopt a mixed discretization based on dual boundary elements residing on a suitably defined dual mesh. We devote also a particular attention to implementation-oriented details of our new technique that will allow the rapid incorporation of our finding in one's own EEG forward solution technology. We conclude by showing how the resulting forward EEG problems show favorable properties with respect to previously proposed schemes, and we show their applicability to real-case modeling scenarios obtained from Magnetic Resonance Imaging (MRI) data. xml:lang="fr" Malheureusement, il est également reconnu dans la littérature que leur précision diminue particulièrement lorsque la source de courant est dipolaire et se situe près de la surface du cerveau. Ce défaut constitue une importante limitation, étant donné qu'au cours d'une session d'imagerie EEG à haute résolution, plusieurs solutions du problème direct EEG sont requises, pour lesquelles les sources de courant sont proches ou sur la surface de cerveau. Ce travail présente d'abord une analyse des opérateurs intervenant dans le problème direct et leur discrétisation. Nous montrons que plusieurs discrétisations couramment utilisées ne conviennent que dans un cadre L2, nécessitant que le terme d'expansion soit une fonction de carré intégrable. Dès lors, ces techniques ne sont pas cohérentes avec les propriétés spectrales des opérateurs en termes d'espaces de Sobolev d'ordre fractionnaire. Nous développons ensuite une nouvelle stratégie de discrétisation conforme aux espaces de Sobolev avec des fonctions d'expansion moins régulières, donnant lieu à une nouvelle formulation intégrale. Le solveur résultant présente des propriétés favorables par rapport aux méthodes existantes et réduit sensiblement le recours à un maillage adaptatif et autres stratégies actuellement requises pour améliorer la précision du calcul. Les résultats numériques présentés corroborent les développements théoriques et mettent en évidence l'impact positif de la nouvelle approche.

Stability of semidiscrete approximations for hyperbolic initial-boundary-value problems: Stationary modes

NASA Technical Reports Server (NTRS)

Warming, Robert F.; Beam, Richard M.

1988-01-01

Spatially discrete difference approximations for hyperbolic initial-boundary-value problems (IBVPs) require numerical boundary conditions in addition to the analytical boundary conditions specified for the differential equations. Improper treatment of a numerical boundary condition can cause instability of the discrete IBVP even though the approximation is stable for the pure initial-value or Cauchy problem. In the discrete IBVP stability literature there exists a small class of discrete approximations called borderline cases. For nondissipative approximations, borderline cases are unstable according to the theory of the Gustafsson, Kreiss, and Sundstrom (GKS) but they may be Lax-Richtmyer stable or unstable in the L sub 2 norm on a finite domain. It is shown that borderline approximation can be characterized by the presence of a stationary mode for the finite-domain problem. A stationary mode has the property that it does not decay with time and a nontrivial stationary mode leads to algebraic growth of the solution norm with mesh refinement. An analytical condition is given which makes it easy to detect a stationary mode; several examples of numerical boundary conditions are investigated corresponding to borderline cases.

Discrete restricted four-body problem: Existence of proof of equilibria and reproducibility of periodic orbits

DOE Office of Scientific and Technical Information (OSTI.GOV)

Minesaki, Yukitaka

2015-01-01

We propose the discrete-time restricted four-body problem (d-R4BP), which approximates the orbits of the restricted four-body problem (R4BP). The d-R4BP is given as a special case of the discrete-time chain regularization of the general N-body problem published in Minesaki. Moreover, we analytically prove that the d-R4BP yields the correct orbits corresponding to the elliptic relative equilibrium solutions of the R4BP when the three primaries form an equilateral triangle at any time. Such orbits include the orbit of a relative equilibrium solution already discovered by Baltagiannis and Papadakis. Until the proof in this work, there has been no discrete analog thatmore » preserves the orbits of elliptic relative equilibrium solutions in the R4BP. For a long time interval, the d-R4BP can precisely compute some stable periodic orbits in the Sun–Jupiter–Trojan asteroid–spacecraft system that cannot necessarily be reproduced by other generic integrators.« less

Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning

NASA Technical Reports Server (NTRS)

Fayyad, U.; Irani, K.

1993-01-01

Since most real-world applications of classification learning involve continuous-valued attributes, properly addressing the discretization process is an important problem. This paper addresses the use of the entropy minimization heuristic for discretizing the range of a continuous-valued attribute into multiple intervals.

The Spectrum of Mathematical Models.

ERIC Educational Resources Information Center

Karplus, Walter J.

1983-01-01

Mathematical modeling problems encountered in many disciplines are discussed in terms of the modeling process and applications of models. The models are classified according to three types of abstraction: continuous-space-continuous-time, discrete-space-continuous-time, and discrete-space-discrete-time. Limitations in different kinds of modeling…

Estimating the proportion of true null hypotheses when the statistics are discrete.

PubMed

Dialsingh, Isaac; Austin, Stefanie R; Altman, Naomi S

2015-07-15

In high-dimensional testing problems π0, the proportion of null hypotheses that are true is an important parameter. For discrete test statistics, the P values come from a discrete distribution with finite support and the null distribution may depend on an ancillary statistic such as a table margin that varies among the test statistics. Methods for estimating π0 developed for continuous test statistics, which depend on a uniform or identical null distribution of P values, may not perform well when applied to discrete testing problems. This article introduces a number of π0 estimators, the regression and 'T' methods that perform well with discrete test statistics and also assesses how well methods developed for or adapted from continuous tests perform with discrete tests. We demonstrate the usefulness of these estimators in the analysis of high-throughput biological RNA-seq and single-nucleotide polymorphism data. implemented in R. © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

Periodic measure for the stochastic equation of the barotropic viscous gas in a discretized one-dimensional domain

DOE Office of Scientific and Technical Information (OSTI.GOV)

Benseghir, Rym, E-mail: benseghirrym@ymail.com, E-mail: benseghirrym@ymail.com; Benchettah, Azzedine, E-mail: abenchettah@hotmail.com; Raynaud de Fitte, Paul, E-mail: prf@univ-rouen.fr

2015-11-30

A stochastic equation system corresponding to the description of the motion of a barotropic viscous gas in a discretized one-dimensional domain with a weight regularizing the density is considered. In [2], the existence of an invariant measure was established for this discretized problem in the stationary case. In this paper, applying a slightly modified version of Khas’minskii’s theorem [5], we generalize this result in the periodic case by proving the existence of a periodic measure for this problem.

New discretization and solution techniques for incompressible viscous flow problems

NASA Technical Reports Server (NTRS)

Gunzburger, M. D.; Nicolaides, R. A.; Liu, C. H.

1983-01-01

Several topics arising in the finite element solution of the incompressible Navier-Stokes equations are considered. Specifically, the question of choosing finite element velocity/pressure spaces is addressed, particularly from the viewpoint of achieving stable discretizations leading to convergent pressure approximations. The role of artificial viscosity in viscous flow calculations is studied, emphasizing work by several researchers for the anisotropic case. The last section treats the problem of solving the nonlinear systems of equations which arise from the discretization. Time marching methods and classical iterative techniques, as well as some modifications are mentioned.

Solving phase appearance/disappearance two-phase flow problems with high resolution staggered grid and fully implicit schemes by the Jacobian-free Newton–Krylov Method

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zou, Ling; Zhao, Haihua; Zhang, Hongbin

2016-04-01

The phase appearance/disappearance issue presents serious numerical challenges in two-phase flow simulations. Many existing reactor safety analysis codes use different kinds of treatments for the phase appearance/disappearance problem. However, to our best knowledge, there are no fully satisfactory solutions. Additionally, the majority of the existing reactor system analysis codes were developed using low-order numerical schemes in both space and time. In many situations, it is desirable to use high-resolution spatial discretization and fully implicit time integration schemes to reduce numerical errors. In this work, we adapted a high-resolution spatial discretization scheme on staggered grid mesh and fully implicit time integrationmore » methods (such as BDF1 and BDF2) to solve the two-phase flow problems. The discretized nonlinear system was solved by the Jacobian-free Newton Krylov (JFNK) method, which does not require the derivation and implementation of analytical Jacobian matrix. These methods were tested with a few two-phase flow problems with phase appearance/disappearance phenomena considered, such as a linear advection problem, an oscillating manometer problem, and a sedimentation problem. The JFNK method demonstrated extremely robust and stable behaviors in solving the two-phase flow problems with phase appearance/disappearance. No special treatments such as water level tracking or void fraction limiting were used. High-resolution spatial discretization and second- order fully implicit method also demonstrated their capabilities in significantly reducing numerical errors.« less

Spectral characterization of biological aerosol particles using two-wavelength excited laser-induced fluorescence and elastic scattering measurements.

PubMed

Sivaprakasam, Vasanthi; Lin, Horn-Bond; Huston, Alan L; Eversole, Jay D

2011-03-28

A two-wavelength laser-induced fluorescence (LIF) instrument has been developed and used to characterize individual biological aerosol particles, including biological warfare (BW) agent surrogates. Fluorescence in discrete spectral bands from widely different species, and also from similar species under different growth conditions were measured and compared. The two-wavelength excitation approach was found to increase discrimination among several biological materials, and especially with respect to diesel exhaust particles, a common interferent for LIF BW detection systems. The spectral characteristics of a variety of biological materials and ambient air components have been studied as a function of aerosol particle size and incident fluence.

(p,q) deformations and (p,q)-vector coherent states of the Jaynes-Cummings model in the rotating wave approximation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ben Geloun, Joseph; Govaerts, Jan; Hounkonnou, M. Norbert

2007-03-15

Classes of (p,q) deformations of the Jaynes-Cummings model in the rotating wave approximation are considered. Diagonalization of the Hamiltonian is performed exactly, leading to useful spectral decompositions of a series of relevant operators. The latter include ladder operators acting between adjacent energy eigenstates within two separate infinite discrete towers, except for a singleton state. These ladder operators allow for the construction of (p,q)-deformed vector coherent states. Using (p,q) arithmetics, explicit and exact solutions to the associated moment problem are displayed, providing new classes of coherent states for such models. Finally, in the limit of decoupled spin sectors, our analysis translatesmore » into (p,q) deformations of the supersymmetric harmonic oscillator, such that the two supersymmetric sectors get intertwined through the action of the ladder operators as well as in the associated coherent states.« less

An Improved Neutron Transport Algorithm for HZETRN

NASA Technical Reports Server (NTRS)

Slaba, Tony C.; Blattnig, Steve R.; Clowdsley, Martha S.; Walker, Steven A.; Badavi, Francis F.

2010-01-01

Long term human presence in space requires the inclusion of radiation constraints in mission planning and the design of shielding materials, structures, and vehicles. In this paper, the numerical error associated with energy discretization in HZETRN is addressed. An inadequate numerical integration scheme in the transport algorithm is shown to produce large errors in the low energy portion of the neutron and light ion fluence spectra. It is further shown that the errors result from the narrow energy domain of the neutron elastic cross section spectral distributions, and that an extremely fine energy grid is required to resolve the problem under the current formulation. Two numerical methods are developed to provide adequate resolution in the energy domain and more accurately resolve the neutron elastic interactions. Convergence testing is completed by running the code for various environments and shielding materials with various energy grids to ensure stability of the newly implemented method.

A spectral hybridizable discontinuous Galerkin method for elastic-acoustic wave propagation

NASA Astrophysics Data System (ADS)

Terrana, S.; Vilotte, J. P.; Guillot, L.

2018-04-01

We introduce a time-domain, high-order in space, hybridizable discontinuous Galerkin (DG) spectral element method (HDG-SEM) for wave equations in coupled elastic-acoustic media. The method is based on a first-order hyperbolic velocity-strain formulation of the wave equations written in conservative form. This method follows the HDG approach by introducing a hybrid unknown, which is the approximation of the velocity on the elements boundaries, as the only globally (i.e. interelement) coupled degrees of freedom. In this paper, we first present a hybridized formulation of the exact Riemann solver at the element boundaries, taking into account elastic-elastic, acoustic-acoustic and elastic-acoustic interfaces. We then use this Riemann solver to derive an explicit construction of the HDG stabilization function τ for all the above-mentioned interfaces. We thus obtain an HDG scheme for coupled elastic-acoustic problems. This scheme is then discretized in space on quadrangular/hexahedral meshes using arbitrary high-order polynomial basis for both volumetric and hybrid fields, using an approach similar to the spectral element methods. This leads to a semi-discrete system of algebraic differential equations (ADEs), which thanks to the structure of the global conservativity condition can be reformulated easily as a classical system of first-order ordinary differential equations in time, allowing the use of classical explicit or implicit time integration schemes. When an explicit time scheme is used, the HDG method can be seen as a reformulation of a DG with upwind fluxes. The introduction of the velocity hybrid unknown leads to relatively simple computations at the element boundaries which, in turn, makes the HDG approach competitive with the DG-upwind methods. Extensive numerical results are provided to illustrate and assess the accuracy and convergence properties of this HDG-SEM. The approximate velocity is shown to converge with the optimal order of k + 1 in the L2-norm, when element polynomials of order k are used, and to exhibit the classical spectral convergence of SEM. Additional inexpensive local post-processing in both the elastic and the acoustic case allow to achieve higher convergence orders. The HDG scheme provides a natural framework for coupling classical, continuous Galerkin SEM with HDG-SEM in the same simulation, and it is shown numerically in this paper. As such, the proposed HDG-SEM can combine the efficiency of the continuous SEM with the flexibility of the HDG approaches. Finally, more complex numerical results, inspired from real geophysical applications, are presented to illustrate the capabilities of the method for wave propagation in heterogeneous elastic-acoustic media with complex geometries.

Universality and Thouless energy in the supersymmetric Sachdev-Ye-Kitaev model

NASA Astrophysics Data System (ADS)

García-García, Antonio M.; Jia, Yiyang; Verbaarschot, Jacobus J. M.

2018-05-01

We investigate the supersymmetric Sachdev-Ye-Kitaev (SYK) model, N Majorana fermions with infinite range interactions in 0 +1 dimensions. We have found that, close to the ground state E ≈0 , discrete symmetries alter qualitatively the spectral properties with respect to the non-supersymmetric SYK model. The average spectral density at finite N , which we compute analytically and numerically, grows exponentially with N for E ≈0 . However the chiral condensate, which is normalized with respect the total number of eigenvalues, vanishes in the thermodynamic limit. Slightly above E ≈0 , the spectral density grows exponentially with the energy. Deep in the quantum regime, corresponding to the first O (N ) eigenvalues, the average spectral density is universal and well described by random matrix ensembles with chiral and superconducting discrete symmetries. The dynamics for E ≈0 is investigated by level fluctuations. Also in this case we find excellent agreement with the prediction of chiral and superconducting random matrix ensembles for eigenvalue separations smaller than the Thouless energy, which seems to scale linearly with N . Deviations beyond the Thouless energy, which describes how ergodicity is approached, are universally characterized by a quadratic growth of the number variance. In the time domain, we have found analytically that the spectral form factor g (t ), obtained from the connected two-level correlation function of the unfolded spectrum, decays as 1 /t2 for times shorter but comparable to the Thouless time with g (0 ) related to the coefficient of the quadratic growth of the number variance. Our results provide further support that quantum black holes are ergodic and therefore can be classified by random matrix theory.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Naughton, M.J.; Bourke, W.; Browning, G.L.

The convergence of spectral model numerical solutions of the global shallow-water equations is examined as a function of the time step and the spectral truncation. The contributions to the errors due to the spatial and temporal discretizations are separately identified and compared. Numerical convergence experiments are performed with the inviscid equations from smooth (Rossby-Haurwitz wave) and observed (R45 atmospheric analysis) initial conditions, and also with the diffusive shallow-water equations. Results are compared with the forced inviscid shallow-water equations case studied by Browning et al. Reduction of the time discretization error by the removal of fast waves from the solution usingmore » initialization is shown. The effects of forcing and diffusion on the convergence are discussed. Time truncation errors are found to dominate when a feature is large scale and well resolved; spatial truncation errors dominate for small-scale features and also for large scale after the small scales have affected them. Possible implications of these results for global atmospheric modeling are discussed. 31 refs., 14 figs., 4 tabs.« less

Discrete-to-continuous transition in quantum phase estimation

NASA Astrophysics Data System (ADS)

Rządkowski, Wojciech; Demkowicz-Dobrzański, Rafał

2017-09-01

We analyze the problem of quantum phase estimation in which the set of allowed phases forms a discrete N -element subset of the whole [0 ,2 π ] interval, φn=2 π n /N , n =0 ,⋯,N -1 , and study the discrete-to-continuous transition N →∞ for various cost functions as well as the mutual information. We also analyze the relation between the problems of phase discrimination and estimation by considering a step cost function of a given width σ around the true estimated value. We show that in general a direct application of the theory of covariant measurements for a discrete subgroup of the U(1 ) group leads to suboptimal strategies due to an implicit requirement of estimating only the phases that appear in the prior distribution. We develop the theory of subcovariant measurements to remedy this situation and demonstrate truly optimal estimation strategies when performing a transition from discrete to continuous phase estimation.

On the wall-normal velocity of the compressible boundary-layer equations

NASA Technical Reports Server (NTRS)

Pruett, C. David

1991-01-01

Numerical methods for the compressible boundary-layer equations are facilitated by transformation from the physical (x,y) plane to a computational (xi,eta) plane in which the evolution of the flow is 'slow' in the time-like xi direction. The commonly used Levy-Lees transformation results in a computationally well-behaved problem for a wide class of non-similar boundary-layer flows, but it complicates interpretation of the solution in physical space. Specifically, the transformation is inherently nonlinear, and the physical wall-normal velocity is transformed out of the problem and is not readily recovered. In light of recent research which shows mean-flow non-parallelism to significantly influence the stability of high-speed compressible flows, the contribution of the wall-normal velocity in the analysis of stability should not be routinely neglected. Conventional methods extract the wall-normal velocity in physical space from the continuity equation, using finite-difference techniques and interpolation procedures. The present spectrally-accurate method extracts the wall-normal velocity directly from the transformation itself, without interpolation, leaving the continuity equation free as a check on the quality of the solution. The present method for recovering wall-normal velocity, when used in conjunction with a highly-accurate spectral collocation method for solving the compressible boundary-layer equations, results in a discrete solution which is extraordinarily smooth and accurate, and which satisfies the continuity equation nearly to machine precision. These qualities make the method well suited to the computation of the non-parallel mean flows needed by spatial direct numerical simulations (DNS) and parabolized stability equation (PSE) approaches to the analysis of stability.

On the Computational Complexity of Stochastic Scheduling Problems,

DTIC Science & Technology

1981-09-01

Survey": 1979, Ann. Discrete Math . 5, pp. 287-326. i I (.4) Karp, R.M., "Reducibility Among Combinatorial Problems": 1972, R.E. Miller and J.W...Weighted Completion Time Subject to Precedence Constraints": 1978, Ann. Discrete Math . 2, pp. 75-90. (8) Lawler, E.L. and J.W. Moore, "A Functional

Prompting Children to Reason Proportionally: Processing Discrete Units as Continuous Amounts

ERIC Educational Resources Information Center

Boyer, Ty W.; Levine, Susan C.

2015-01-01

Recent studies reveal that children can solve proportional reasoning problems presented with continuous amounts that enable intuitive strategies by around 6 years of age but have difficulties with problems presented with discrete units that tend to elicit explicit count-and-match strategies until at least 10 years of age. The current study tests…

Potential effects of the introduction of the discrete address beacon system data link on air/ground information transfer problems

NASA Technical Reports Server (NTRS)

Grayson, R. L.

1981-01-01

This study of Aviation Safety Reporting System reports suggests that benefits should accure from implementation of discrete address beacon system data link. The phase enhanced terminal information system service is expected to provide better terminal information than present systems by improving currency and accuracy. In the exchange of air traffic control messages, discrete address insures that only the intended recipient receives and acts on a specific message. Visual displays and printer copy of messages should mitigate many of the reported problems associated with voice communications. The problems that remain unaffected include error in addressing the intended recipient and messages whose content is wrong but are otherwise correct as to format and reasonableness.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Larsen, E.W.

A class of Projected Discrete-Ordinates (PDO) methods is described for obtaining iterative solutions of discrete-ordinates problems with convergence rates comparable to those observed using Diffusion Synthetic Acceleration (DSA). The spatially discretized PDO solutions are generally not equal to the DSA solutions, but unlike DSA, which requires great care in the use of spatial discretizations to preserve stability, the PDO solutions remain stable and rapidly convergent with essentially arbitrary spatial discretizations. Numerical results are presented which illustrate the rapid convergence and the accuracy of solutions obtained using PDO methods with commonplace differencing methods.

Recursive multibody dynamics and discrete-time optimal control

NASA Technical Reports Server (NTRS)

Deleuterio, G. M. T.; Damaren, C. J.

1989-01-01

A recursive algorithm is developed for the solution of the simulation dynamics problem for a chain of rigid bodies. Arbitrary joint constraints are permitted, that is, joints may allow translational and/or rotational degrees of freedom. The recursive procedure is shown to be identical to that encountered in a discrete-time optimal control problem. For each relevant quantity in the multibody dynamics problem, there exists an analog in the context of optimal control. The performance index that is minimized in the control problem is identified as Gibbs' function for the chain of bodies.

Calculation and experimental validation of spectral properties of microsize grains surrounded by nanoparticles.

PubMed

Yu, Haitong; Liu, Dong; Duan, Yuanyuan; Wang, Xiaodong

2014-04-07

Opacified aerogels are particulate thermal insulating materials in which micrometric opacifier mineral grains are surrounded by silica aerogel nanoparticles. A geometric model was developed to characterize the spectral properties of such microsize grains surrounded by much smaller particles. The model represents the material's microstructure with the spherical opacifier's spectral properties calculated using the multi-sphere T-matrix (MSTM) algorithm. The results are validated by comparing the measured reflectance of an opacified aerogel slab against the value predicted using the discrete ordinate method (DOM) based on calculated optical properties. The results suggest that the large particles embedded in the nanoparticle matrices show different scattering and absorption properties from the single scattering condition and that the MSTM and DOM algorithms are both useful for calculating the spectral and radiative properties of this particulate system.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Khrennikov, Andrei; Volovich, Yaroslav

We analyze dynamical consequences of a conjecture that there exists a fundamental (indivisible) quant of time. In particular we study the problem of discrete energy levels of hydrogen atom. We are able to reconstruct potential which in discrete time formalism leads to energy levels of unperturbed hydrogen atom. We also consider linear energy levels of quantum harmonic oscillator and show how they are produced in the discrete time formalism. More generally, we show that in discrete time formalism finite motion in central potential leads to discrete energy spectrum, the property which is common for quantum mechanical theory. Thus deterministic (butmore » discrete time{exclamation_point}) dynamics is compatible with discrete energy levels.« less

Salvus: A flexible open-source package for waveform modelling and inversion from laboratory to global scales

NASA Astrophysics Data System (ADS)

Afanasiev, M.; Boehm, C.; van Driel, M.; Krischer, L.; May, D.; Rietmann, M.; Fichtner, A.

2016-12-01

Recent years have been witness to the application of waveform inversion to new and exciting domains, ranging from non-destructive testing to global seismology. Often, each new application brings with it novel wave propagation physics, spatial and temporal discretizations, and models of variable complexity. Adapting existing software to these novel applications often requires a significant investment of time, and acts as a barrier to progress. To combat these problems we introduce Salvus, a software package designed to solve large-scale full-waveform inverse problems, with a focus on both flexibility and performance. Based on a high order finite (spectral) element discretization, we have built Salvus to work on unstructured quad/hex meshes in both 2 or 3 dimensions, with support for P1-P3 bases on triangles and tetrahedra. A diverse (and expanding) collection of wave propagation physics are supported (i.e. coupled solid-fluid). With a focus on the inverse problem, functionality is provided to ease integration with internal and external optimization libraries. Additionally, a python-based meshing package is included to simplify the generation and manipulation of regional to global scale Earth models (quad/hex), with interfaces available to external mesh generators for complex engineering-scale applications (quad/hex/tri/tet). Finally, to ensure that the code remains accurate and maintainable, we build upon software libraries such as PETSc and Eigen, and follow modern software design and testing protocols. Salvus bridges the gap between research and production codes with a design based on C++ mixins and Python wrappers that separates the physical equations from the numerical core. This allows domain scientists to add new equations using a high-level interface, without having to worry about optimized implementation details. Our goal in this presentation is to introduce the code, show several examples across the scales, and discuss some of the extensible design points.

Solution of elastic-plastic stress analysis problems by the p-version of the finite element method

NASA Technical Reports Server (NTRS)

Szabo, Barna A.; Actis, Ricardo L.; Holzer, Stefan M.

1993-01-01

The solution of small strain elastic-plastic stress analysis problems by the p-version of the finite element method is discussed. The formulation is based on the deformation theory of plasticity and the displacement method. Practical realization of controlling discretization errors for elastic-plastic problems is the main focus. Numerical examples which include comparisons between the deformation and incremental theories of plasticity under tight control of discretization errors are presented.

Investigation of dispersion-relation-preserving scheme and spectral analysis methods for acoustic waves

NASA Technical Reports Server (NTRS)

Vanel, Florence O.; Baysal, Oktay

1995-01-01

Important characteristics of the aeroacoustic wave propagation are mostly encoded in their dispersion relations. Hence, a computational aeroacoustic (CAA) algorithm, which reasonably preserves these relations, was investigated. It was derived using an optimization procedure to ensure, that the numerical derivatives preserved the wave number and angular frequency of the differential terms in the linearized, 2-D Euler equations. Then, simulations were performed to validate the scheme and a compatible set of discretized boundary conditions. The computational results were found to agree favorably with the exact solutions. The boundary conditions were transparent to the outgoing waves, except when the disturbance source was close to a boundary. The time-domain data generated by such CAA solutions were often intractable until their spectra was analyzed. Therefore, the relative merits of three different methods were included in the study. For simple, periodic waves, the periodogram method produced better estimates of the steep-sloped spectra than the Blackman-Tukey method. Also, for this problem, the Hanning window was more effective when used with the weighted-overlapped-segment-averaging and Blackman-Tukey methods gave better results than the periodogram method. Finally, it was demonstrated that the representation of time domain-data was significantly dependent on the particular spectral analysis method employed.

Library Search Prefilters for Vehicle Manufacturers to Assist in the Forensic Examination of Automotive Paints.

PubMed

Lavine, Barry K; White, Collin G; Ding, Tao

2018-03-01

Pattern recognition techniques have been applied to the infrared (IR) spectral libraries of the Paint Data Query (PDQ) database to differentiate between nonidentical but similar IR spectra of automotive paints. To tackle the problem of library searching, search prefilters were developed to identify the vehicle make from IR spectra of the clear coat, surfacer-primer, and e-coat layers. To develop these search prefilters with the appropriate degree of accuracy, IR spectra from the PDQ database were preprocessed using the discrete wavelet transform to enhance subtle but significant features in the IR spectral data. Wavelet coefficients characteristic of vehicle make were identified using a genetic algorithm for pattern recognition and feature selection. Search prefilters to identify automotive manufacturer through IR spectra obtained from a paint chip recovered at a crime scene were developed using 1596 original manufacturer's paint systems spanning six makes (General Motors, Chrysler, Ford, Honda, Nissan, and Toyota) within a limited production year range (2000-2006). Search prefilters for vehicle manufacturer that were developed as part of this study were successfully validated using IR spectra obtained directly from the PDQ database. Information obtained from these search prefilters can serve to quantify the discrimination power of original automotive paint encountered in casework and further efforts to succinctly communicate trace evidential significance to the courts.

Portable laser synthesizer for high-speed multi-dimensional spectroscopy

DOEpatents

Demos, Stavros G [Livermore, CA; Shverdin, Miroslav Y [Sunnyvale, CA; Shirk, Michael D [Brentwood, CA

2012-05-29

Portable, field-deployable laser synthesizer devices designed for multi-dimensional spectrometry and time-resolved and/or hyperspectral imaging include a coherent light source which simultaneously produces a very broad, energetic, discrete spectrum spanning through or within the ultraviolet, visible, and near infrared wavelengths. The light output is spectrally resolved and each wavelength is delayed with respect to each other. A probe enables light delivery to a target. For multidimensional spectroscopy applications, the probe can collect the resulting emission and deliver this radiation to a time gated spectrometer for temporal and spectral analysis.

Multispectral sensing of citrus young tree decline

NASA Technical Reports Server (NTRS)

Edwards, G. J.; Ducharme, E. P.; Schehl, T.

1975-01-01

Computer processing of MSS data to identify and map citrus trees affected by young tree decline is analyzed. The data were obtained at 1500-feet altitude in six discrete spectral bands covering regions from 0.53 to 1.3 millimicrons as well as from instrumental ground truths of tree crowns. Measurable spectral reflectance intensity differences are observed in the leaves of healthy and diseased trees, especially at wavelengths of 500 to 600 nm and 700 to 800 nm. The overall accuracy of the method is found to be 89%.

Protein local structure alignment under the discrete Fréchet distance.

PubMed

Zhu, Binhai

2007-12-01

Protein structure alignment is a fundamental problem in computational and structural biology. While there has been lots of experimental/heuristic methods and empirical results, very few results are known regarding the algorithmic/complexity aspects of the problem, especially on protein local structure alignment. A well-known measure to characterize the similarity of two polygonal chains is the famous Fréchet distance, and with the application of protein-related research, a related discrete Fréchet distance has been used recently. In this paper, following the recent work of Jiang et al. we investigate the protein local structural alignment problem using bounded discrete Fréchet distance. Given m proteins (or protein backbones, which are 3D polygonal chains), each of length O(n), our main results are summarized as follows: * If the number of proteins, m, is not part of the input, then the problem is NP-complete; moreover, under bounded discrete Fréchet distance it is NP-hard to approximate the maximum size common local structure within a factor of n(1-epsilon). These results hold both when all the proteins are static and when translation/rotation are allowed. * If the number of proteins, m, is a constant, then there is a polynomial time solution for the problem.

Fourth-order convergence of a compact scheme for the one-dimensional biharmonic equation

NASA Astrophysics Data System (ADS)

Fishelov, D.; Ben-Artzi, M.; Croisille, J.-P.

2012-09-01

The convergence of a fourth-order compact scheme to the one-dimensional biharmonic problem is established in the case of general Dirichlet boundary conditions. The compact scheme invokes value of the unknown function as well as Pade approximations of its first-order derivative. Using the Pade approximation allows us to approximate the first-order derivative within fourth-order accuracy. However, although the truncation error of the discrete biharmonic scheme is of fourth-order at interior point, the truncation error drops to first-order at near-boundary points. Nonetheless, we prove that the scheme retains its fourth-order (optimal) accuracy. This is done by a careful inspection of the matrix elements of the discrete biharmonic operator. A number of numerical examples corroborate this effect. We also present a study of the eigenvalue problem uxxxx = νu. We compute and display the eigenvalues and the eigenfunctions related to the continuous and the discrete problems. By the positivity of the eigenvalues, one can deduce the stability of of the related time-dependent problem ut = -uxxxx. In addition, we study the eigenvalue problem uxxxx = νuxx. This is related to the stability of the linear time-dependent equation uxxt = νuxxxx. Its continuous and discrete eigenvalues and eigenfunction (or eigenvectors) are computed and displayed graphically.

Undecidability of the spectral gap.

PubMed

Cubitt, Toby S; Perez-Garcia, David; Wolf, Michael M

2015-12-10

The spectral gap--the energy difference between the ground state and first excited state of a system--is central to quantum many-body physics. Many challenging open problems, such as the Haldane conjecture, the question of the existence of gapped topological spin liquid phases, and the Yang-Mills gap conjecture, concern spectral gaps. These and other problems are particular cases of the general spectral gap problem: given the Hamiltonian of a quantum many-body system, is it gapped or gapless? Here we prove that this is an undecidable problem. Specifically, we construct families of quantum spin systems on a two-dimensional lattice with translationally invariant, nearest-neighbour interactions, for which the spectral gap problem is undecidable. This result extends to undecidability of other low-energy properties, such as the existence of algebraically decaying ground-state correlations. The proof combines Hamiltonian complexity techniques with aperiodic tilings, to construct a Hamiltonian whose ground state encodes the evolution of a quantum phase-estimation algorithm followed by a universal Turing machine. The spectral gap depends on the outcome of the corresponding 'halting problem'. Our result implies that there exists no algorithm to determine whether an arbitrary model is gapped or gapless, and that there exist models for which the presence or absence of a spectral gap is independent of the axioms of mathematics.

Non-Hermitian engineering of single mode two dimensional laser arrays

PubMed Central

Teimourpour, Mohammad H.; Ge, Li; Christodoulides, Demetrios N.; El-Ganainy, Ramy

2016-01-01

A new scheme for building two dimensional laser arrays that operate in the single supermode regime is proposed. This is done by introducing an optical coupling between the laser array and lossy pseudo-isospectral chains of photonic resonators. The spectrum of this discrete reservoir is tailored to suppress all the supermodes of the main array except the fundamental one. This spectral engineering is facilitated by employing the Householder transformation in conjunction with discrete supersymmetry. The proposed scheme is general and can in principle be used in different platforms such as VCSEL arrays and photonic crystal laser arrays. PMID:27698355

A mathematical model of the structure and evolution of small-scale discrete auroral arcs

NASA Technical Reports Server (NTRS)

Seyler, Charles E.

1990-01-01

A three-dimensional fluid model for the structure and evolution of small-scale discrete auroral arcs originating from Alfven waves is developed and used to study the nonlinear macroscopic plasma dynamics of these auroral arcs. The results of simulations show that stationary auroral arcs can be unstable to a collisionless tearing mode which may be responsible for the observed transverse structuring in the form of folds and curls. At late times, the plasma becomes turbulent having transverse electric field power spectra that tend toward a universal k exp -5/3 spectral form.

A POSTERIORI ERROR ANALYSIS OF TWO STAGE COMPUTATION METHODS WITH APPLICATION TO EFFICIENT DISCRETIZATION AND THE PARAREAL ALGORITHM.

PubMed

Chaudhry, Jehanzeb Hameed; Estep, Don; Tavener, Simon; Carey, Varis; Sandelin, Jeff

2016-01-01

We consider numerical methods for initial value problems that employ a two stage approach consisting of solution on a relatively coarse discretization followed by solution on a relatively fine discretization. Examples include adaptive error control, parallel-in-time solution schemes, and efficient solution of adjoint problems for computing a posteriori error estimates. We describe a general formulation of two stage computations then perform a general a posteriori error analysis based on computable residuals and solution of an adjoint problem. The analysis accommodates various variations in the two stage computation and in formulation of the adjoint problems. We apply the analysis to compute "dual-weighted" a posteriori error estimates, to develop novel algorithms for efficient solution that take into account cancellation of error, and to the Parareal Algorithm. We test the various results using several numerical examples.

Numerical Evaluation of P-Multigrid Method for the Solution of Discontinuous Galerkin Discretizations of Diffusive Equations

NASA Technical Reports Server (NTRS)

Atkins, H. L.; Helenbrook, B. T.

2005-01-01

This paper describes numerical experiments with P-multigrid to corroborate analysis, validate the present implementation, and to examine issues that arise in the implementations of the various combinations of relaxation schemes, discretizations and P-multigrid methods. The two approaches to implement P-multigrid presented here are equivalent for most high-order discretization methods such as spectral element, SUPG, and discontinuous Galerkin applied to advection; however it is discovered that the approach that mimics the common geometric multigrid implementation is less robust, and frequently unstable when applied to discontinuous Galerkin discretizations of di usion. Gauss-Seidel relaxation converges 40% faster than block Jacobi, as predicted by analysis; however, the implementation of Gauss-Seidel is considerably more expensive that one would expect because gradients in most neighboring elements must be updated. A compromise quasi Gauss-Seidel relaxation method that evaluates the gradient in each element twice per iteration converges at rates similar to those predicted for true Gauss-Seidel.

sEMG feature evaluation for identification of elbow angle resolution in graded arm movement.

PubMed

Castro, Maria Claudia F; Colombini, Esther L; Aquino, Plinio T; Arjunan, Sridhar P; Kumar, Dinesh K

2014-11-25

Automatic and accurate identification of elbow angle from surface electromyogram (sEMG) is essential for myoelectric controlled upper limb exoskeleton systems. This requires appropriate selection of sEMG features, and identifying the limitations of such a system.This study has demonstrated that it is possible to identify three discrete positions of the elbow; full extension, right angle, and mid-way point, with window size of only 200 milliseconds. It was seen that while most features were suitable for this purpose, Power Spectral Density Averages (PSD-Av) performed best. The system correctly classified the sEMG against the elbow angle for 100% cases when only two discrete positions (full extension and elbow at right angle) were considered, while correct classification was 89% when there were three discrete positions. However, sEMG was unable to accurately determine the elbow position when five discrete angles were considered. It was also observed that there was no difference for extension or flexion phases.

CAM-SE: A scalable spectral element dynamical core for the Community Atmosphere Model.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dennis, John; Edwards, Jim; Evans, Kate J

2012-01-01

The Community Atmosphere Model (CAM) version 5 includes a spectral element dynamical core option from NCAR's High-Order Method Modeling Environment. It is a continuous Galerkin spectral finite element method designed for fully unstructured quadrilateral meshes. The current configurations in CAM are based on the cubed-sphere grid. The main motivation for including a spectral element dynamical core is to improve the scalability of CAM by allowing quasi-uniform grids for the sphere that do not require polar filters. In addition, the approach provides other state-of-the-art capabilities such as improved conservation properties. Spectral elements are used for the horizontal discretization, while most othermore » aspects of the dynamical core are a hybrid of well tested techniques from CAM's finite volume and global spectral dynamical core options. Here we first give a overview of the spectral element dynamical core as used in CAM. We then give scalability and performance results from CAM running with three different dynamical core options within the Community Earth System Model, using a pre-industrial time-slice configuration. We focus on high resolution simulations of 1/4 degree, 1/8 degree, and T340 spectral truncation.« less

Discretization and Numerical Solution of a Plane Problem in the Mechanics of Interfacial Cracks

NASA Astrophysics Data System (ADS)

Khoroshun, L. P.

2017-01-01

The Fourier transform is used to reduce the linear plane problem of the tension of a body with an interfacial crack to a system of dual equations for the transformed stresses and, then, to a system of integro-differential equations for the difference of displacements of the crack faces. After discretization, this latter system transforms into a system of algebraic equations for displacements of the crack faces. The effect of the bielastic constant and the number of discretization points on the half-length of the crack faces and the distribution of stresses at the interface is studied

New discretization and solution techniques for incompressible viscous flow problems

NASA Technical Reports Server (NTRS)

Gunzburger, M. D.; Nicolaides, R. A.; Liu, C. H.

1983-01-01

This paper considers several topics arising in the finite element solution of the incompressible Navier-Stokes equations. Specifically, the question of choosing finite element velocity/pressure spaces is addressed, particularly from the viewpoint of achieving stable discretizations leading to convergent pressure approximations. Following this, the role of artificial viscosity in viscous flow calculations is studied, emphasizing recent work by several researchers for the anisotropic case. The last section treats the problem of solving the nonlinear systems of equations which arise from the discretization. Time marching methods and classical iterative techniques, as well as some recent modifications are mentioned.

The Information Content of Discrete Functions and Their Application in Genetic Data Analysis.

PubMed

Sakhanenko, Nikita A; Kunert-Graf, James; Galas, David J

2017-12-01

The complex of central problems in data analysis consists of three components: (1) detecting the dependence of variables using quantitative measures, (2) defining the significance of these dependence measures, and (3) inferring the functional relationships among dependent variables. We have argued previously that an information theory approach allows separation of the detection problem from the inference of functional form problem. We approach here the third component of inferring functional forms based on information encoded in the functions. We present here a direct method for classifying the functional forms of discrete functions of three variables represented in data sets. Discrete variables are frequently encountered in data analysis, both as the result of inherently categorical variables and from the binning of continuous numerical variables into discrete alphabets of values. The fundamental question of how much information is contained in a given function is answered for these discrete functions, and their surprisingly complex relationships are illustrated. The all-important effect of noise on the inference of function classes is found to be highly heterogeneous and reveals some unexpected patterns. We apply this classification approach to an important area of biological data analysis-that of inference of genetic interactions. Genetic analysis provides a rich source of real and complex biological data analysis problems, and our general methods provide an analytical basis and tools for characterizing genetic problems and for analyzing genetic data. We illustrate the functional description and the classes of a number of common genetic interaction modes and also show how different modes vary widely in their sensitivity to noise.

Discrete-time infinity control problem with measurement feedback

NASA Technical Reports Server (NTRS)

Stoorvogel, A. A.; Saberi, A.; Chen, B. M.

1992-01-01

The paper is concerned with the discrete-time H(sub infinity) control problem with measurement feedback. The authors extend previous results by having weaker assumptions on the system parameters. The authors also show explicitly the structure of H(sub infinity) controllers. Finally, they show that it is in certain cases possible, without loss of performance, to reduce the dynamical order of the controllers.

A Neural Dynamic Model Generates Descriptions of Object-Oriented Actions.

PubMed

Richter, Mathis; Lins, Jonas; Schöner, Gregor

2017-01-01

Describing actions entails that relations between objects are discovered. A pervasively neural account of this process requires that fundamental problems are solved: the neural pointer problem, the binding problem, and the problem of generating discrete processing steps from time-continuous neural processes. We present a prototypical solution to these problems in a neural dynamic model that comprises dynamic neural fields holding representations close to sensorimotor surfaces as well as dynamic neural nodes holding discrete, language-like representations. Making the connection between these two types of representations enables the model to describe actions as well as to perceptually ground movement phrases-all based on real visual input. We demonstrate how the dynamic neural processes autonomously generate the processing steps required to describe or ground object-oriented actions. By solving the fundamental problems of neural pointing, binding, and emergent discrete processing, the model may be a first but critical step toward a systematic neural processing account of higher cognition. Copyright © 2017 The Authors. Topics in Cognitive Science published by Wiley Periodicals, Inc. on behalf of Cognitive Science Society.

Direct Discrete Method for Neutronic Calculations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Vosoughi, Naser; Akbar Salehi, Ali; Shahriari, Majid

The objective of this paper is to introduce a new direct method for neutronic calculations. This method which is named Direct Discrete Method, is simpler than the neutron Transport equation and also more compatible with physical meaning of problems. This method is based on physic of problem and with meshing of the desired geometry, writing the balance equation for each mesh intervals and with notice to the conjunction between these mesh intervals, produce the final discrete equations series without production of neutron transport differential equation and mandatory passing from differential equation bridge. We have produced neutron discrete equations for amore » cylindrical shape with two boundary conditions in one group energy. The correction of the results from this method are tested with MCNP-4B code execution. (authors)« less

Stabilisation of discrete-time polynomial fuzzy systems via a polynomial lyapunov approach

NASA Astrophysics Data System (ADS)

Nasiri, Alireza; Nguang, Sing Kiong; Swain, Akshya; Almakhles, Dhafer

2018-02-01

This paper deals with the problem of designing a controller for a class of discrete-time nonlinear systems which is represented by discrete-time polynomial fuzzy model. Most of the existing control design methods for discrete-time fuzzy polynomial systems cannot guarantee their Lyapunov function to be a radially unbounded polynomial function, hence the global stability cannot be assured. The proposed control design in this paper guarantees a radially unbounded polynomial Lyapunov functions which ensures global stability. In the proposed design, state feedback structure is considered and non-convexity problem is solved by incorporating an integrator into the controller. Sufficient conditions of stability are derived in terms of polynomial matrix inequalities which are solved via SOSTOOLS in MATLAB. A numerical example is presented to illustrate the effectiveness of the proposed controller.

The Integration of Continuous and Discrete Latent Variable Models: Potential Problems and Promising Opportunities

ERIC Educational Resources Information Center

Bauer, Daniel J.; Curran, Patrick J.

2004-01-01

Structural equation mixture modeling (SEMM) integrates continuous and discrete latent variable models. Drawing on prior research on the relationships between continuous and discrete latent variable models, the authors identify 3 conditions that may lead to the estimation of spurious latent classes in SEMM: misspecification of the structural model,…

Finite Mathematics and Discrete Mathematics: Is There a Difference?

ERIC Educational Resources Information Center

Johnson, Marvin L.

Discrete mathematics and finite mathematics differ in a number of ways. First, finite mathematics has a longer history and is therefore more stable in terms of course content. Finite mathematics courses emphasize certain particular mathematical tools which are useful in solving the problems of business and the social sciences. Discrete mathematics…

Discontinuous Finite Element Quasidiffusion Methods

DOE PAGES

Anistratov, Dmitriy Yurievich; Warsa, James S.

2018-05-21

Here in this paper, two-level methods for solving transport problems in one-dimensional slab geometry based on the quasi-diffusion (QD) method are developed. A linear discontinuous finite element method (LDFEM) is derived for the spatial discretization of the low-order QD (LOQD) equations. It involves special interface conditions at the cell edges based on the idea of QD boundary conditions (BCs). We consider different kinds of QD BCs to formulate the necessary cell-interface conditions. We develop two-level methods with independent discretization of the high-order transport equation and LOQD equations, where the transport equation is discretized using the method of characteristics and themore » LDFEM is applied to the LOQD equations. We also formulate closures that lead to the discretization consistent with a LDFEM discretization of the transport equation. The proposed methods are studied by means of test problems formulated with the method of manufactured solutions. Numerical experiments are presented demonstrating the performance of the proposed methods. Lastly, we also show that the method with independent discretization has the asymptotic diffusion limit.« less

Discontinuous Finite Element Quasidiffusion Methods

DOE Office of Scientific and Technical Information (OSTI.GOV)

Anistratov, Dmitriy Yurievich; Warsa, James S.

Here in this paper, two-level methods for solving transport problems in one-dimensional slab geometry based on the quasi-diffusion (QD) method are developed. A linear discontinuous finite element method (LDFEM) is derived for the spatial discretization of the low-order QD (LOQD) equations. It involves special interface conditions at the cell edges based on the idea of QD boundary conditions (BCs). We consider different kinds of QD BCs to formulate the necessary cell-interface conditions. We develop two-level methods with independent discretization of the high-order transport equation and LOQD equations, where the transport equation is discretized using the method of characteristics and themore » LDFEM is applied to the LOQD equations. We also formulate closures that lead to the discretization consistent with a LDFEM discretization of the transport equation. The proposed methods are studied by means of test problems formulated with the method of manufactured solutions. Numerical experiments are presented demonstrating the performance of the proposed methods. Lastly, we also show that the method with independent discretization has the asymptotic diffusion limit.« less

Solutions of large-scale electromagnetics problems involving dielectric objects with the parallel multilevel fast multipole algorithm.

PubMed

Ergül, Özgür

2011-11-01

Fast and accurate solutions of large-scale electromagnetics problems involving homogeneous dielectric objects are considered. Problems are formulated with the electric and magnetic current combined-field integral equation and discretized with the Rao-Wilton-Glisson functions. Solutions are performed iteratively by using the multilevel fast multipole algorithm (MLFMA). For the solution of large-scale problems discretized with millions of unknowns, MLFMA is parallelized on distributed-memory architectures using a rigorous technique, namely, the hierarchical partitioning strategy. Efficiency and accuracy of the developed implementation are demonstrated on very large problems involving as many as 100 million unknowns.

Dynamic discrete tomography

NASA Astrophysics Data System (ADS)

Alpers, Andreas; Gritzmann, Peter

2018-03-01

We consider the problem of reconstructing the paths of a set of points over time, where, at each of a finite set of moments in time the current positions of points in space are only accessible through some small number of their x-rays. This particular particle tracking problem, with applications, e.g. in plasma physics, is the basic problem in dynamic discrete tomography. We introduce and analyze various different algorithmic models. In particular, we determine the computational complexity of the problem (and various of its relatives) and derive algorithms that can be used in practice. As a byproduct we provide new results on constrained variants of min-cost flow and matching problems.

Optimal control of LQR for discrete time-varying systems with input delays

NASA Astrophysics Data System (ADS)

Yin, Yue-Zhu; Yang, Zhong-Lian; Yin, Zhi-Xiang; Xu, Feng

2018-04-01

In this work, we consider the optimal control problem of linear quadratic regulation for discrete time-variant systems with single input and multiple input delays. An innovative and simple method to derive the optimal controller is given. The studied problem is first equivalently converted into a problem subject to a constraint condition. Last, with the established duality, the problem is transformed into a static mathematical optimisation problem without input delays. The optimal control input solution to minimise performance index function is derived by solving this optimisation problem with two methods. A numerical simulation example is carried out and its results show that our two approaches are both feasible and very effective.

Difference equation state approximations for nonlinear hereditary control problems

NASA Technical Reports Server (NTRS)

Rosen, I. G.

1982-01-01

Discrete approximation schemes for the solution of nonlinear hereditary control problems are constructed. The methods involve approximation by a sequence of optimal control problems in which the original infinite dimensional state equation has been approximated by a finite dimensional discrete difference equation. Convergence of the state approximations is argued using linear semigroup theory and is then used to demonstrate that solutions to the approximating optimal control problems in some sense approximate solutions to the original control problem. Two schemes, one based upon piecewise constant approximation, and the other involving spline functions are discussed. Numerical results are presented, analyzed and used to compare the schemes to other available approximation methods for the solution of hereditary control problems.

On the control canonical structure of a class of scalar input systems

NASA Technical Reports Server (NTRS)

Teglas, R.

1983-01-01

A discrete finite dimensional system, nonharmonic Fourier series and controllability, reduction to canonical form, and spectral synthesis are considered. The extent to which the eigenvalue associated with a controllable pair of a certain type may be modified via continuous linear state feedback is demonstrated.

Local spectral properties of reflectionless Jacobi, CMV, and Schrödinger operators

NASA Astrophysics Data System (ADS)

Gesztesy, Fritz; Zinchenko, Maxim

We prove that Jacobi, CMV, and Schrödinger operators, which are reflectionless on a homogeneous set E (in the sense of Carleson), under the assumption of a Blaschke-type condition on their discrete spectra accumulating at E, have purely absolutely continuous spectrum on E.

Finite elements of nonlinear continua.

NASA Technical Reports Server (NTRS)

Oden, J. T.

1972-01-01

The finite element method is extended to a broad class of practical nonlinear problems, treating both theory and applications from a general and unifying point of view. The thermomechanical principles of continuous media and the properties of the finite element method are outlined, and are brought together to produce discrete physical models of nonlinear continua. The mathematical properties of the models are analyzed, and the numerical solution of the equations governing the discrete models is examined. The application of the models to nonlinear problems in finite elasticity, viscoelasticity, heat conduction, and thermoviscoelasticity is discussed. Other specific topics include the topological properties of finite element models, applications to linear and nonlinear boundary value problems, convergence, continuum thermodynamics, finite elasticity, solutions to nonlinear partial differential equations, and discrete models of the nonlinear thermomechanical behavior of dissipative media.

Time domain simulation of the response of geometrically nonlinear panels subjected to random loading

NASA Technical Reports Server (NTRS)

Moyer, E. Thomas, Jr.

1988-01-01

The response of composite panels subjected to random pressure loads large enough to cause geometrically nonlinear responses is studied. A time domain simulation is employed to solve the equations of motion. An adaptive time stepping algorithm is employed to minimize intermittent transients. A modified algorithm for the prediction of response spectral density is presented which predicts smooth spectral peaks for discrete time histories. Results are presented for a number of input pressure levels and damping coefficients. Response distributions are calculated and compared with the analytical solution of the Fokker-Planck equations. RMS response is reported as a function of input pressure level and damping coefficient. Spectral densities are calculated for a number of examples.

Improved discrete swarm intelligence algorithms for endmember extraction from hyperspectral remote sensing images

NASA Astrophysics Data System (ADS)

Su, Yuanchao; Sun, Xu; Gao, Lianru; Li, Jun; Zhang, Bing

2016-10-01

Endmember extraction is a key step in hyperspectral unmixing. A new endmember extraction framework is proposed for hyperspectral endmember extraction. The proposed approach is based on the swarm intelligence (SI) algorithm, where discretization is used to solve the SI algorithm because pixels in a hyperspectral image are naturally defined within a discrete space. Moreover, a "distance" factor is introduced into the objective function to limit the endmember numbers which is generally limited in real scenarios, while traditional SI algorithms likely produce superabundant spectral signatures, which generally belong to the same classes. Three endmember extraction methods are proposed based on the artificial bee colony, ant colony optimization, and particle swarm optimization algorithms. Experiments with both simulated and real hyperspectral images indicate that the proposed framework can improve the accuracy of endmember extraction.

A statistical study on the occurrence of discrete frequencies in the high velocity solar wind and in the magnetosphere

NASA Astrophysics Data System (ADS)

Di Matteo, Simone; Villante, Umberto

2016-04-01

The possible occurrence of oscillations at discrete frequencies in the solar wind and their possible correspondence with magnetospheric field oscillations represent an interesting aspect of the solar wind/magnetopheric research. We analyze a large set of high velocity streams following interplanetary shocks in order to ascertain the possible occurrence of preferential sets of discrete frequencies in the oscillations of the solar wind pressure in such structures. We evaluate, for each event, the power spectrum of the dynamic pressure by means of two methods (Welch and multitaper windowing) and accept the common spectral peaks that also pass a harmonic F-test at the 95% confidence level. We compare these frequencies with those detected at geosynchronous orbit in the magnetospheric field components soon after the manifestation of the corresponding Sudden Impulses.

Discrete particle swarm optimization to solve multi-objective limited-wait hybrid flow shop scheduling problem

NASA Astrophysics Data System (ADS)

Santosa, B.; Siswanto, N.; Fiqihesa

2018-04-01

This paper proposes a discrete Particle Swam Optimization (PSO) to solve limited-wait hybrid flowshop scheduing problem with multi objectives. Flow shop schedulimg represents the condition when several machines are arranged in series and each job must be processed at each machine with same sequence. The objective functions are minimizing completion time (makespan), total tardiness time, and total machine idle time. Flow shop scheduling model always grows to cope with the real production system accurately. Since flow shop scheduling is a NP-Hard problem then the most suitable method to solve is metaheuristics. One of metaheuristics algorithm is Particle Swarm Optimization (PSO), an algorithm which is based on the behavior of a swarm. Originally, PSO was intended to solve continuous optimization problems. Since flow shop scheduling is a discrete optimization problem, then, we need to modify PSO to fit the problem. The modification is done by using probability transition matrix mechanism. While to handle multi objectives problem, we use Pareto Optimal (MPSO). The results of MPSO is better than the PSO because the MPSO solution set produced higher probability to find the optimal solution. Besides the MPSO solution set is closer to the optimal solution

[Development of New Mathematical Methodology in Air Traffic Control for the Analysis of Hybrid Systems

NASA Technical Reports Server (NTRS)

Hermann, Robert

1997-01-01

The aim of this research is to develop new mathematical methodology for the analysis of hybrid systems of the type involved in Air Traffic Control (ATC) problems. Two directions of investigation were initiated. The first used the methodology of nonlinear generalized functions, whose mathematical foundations were initiated by Colombeau and developed further by Oberguggenberger; it has been extended to apply to ordinary differential. Systems of the type encountered in control in joint work with the PI and M. Oberguggenberger. This involved a 'mixture' of 'continuous' and 'discrete' methodology. ATC clearly involves mixtures of two sorts of mathematical problems: (1) The 'continuous' dynamics of a standard control type described by ordinary differential equations (ODE) of the form: {dx/dt = f(x, u)} and (2) the discrete lattice dynamics involved of cellular automata. Most of the CA literature involves a discretization of a partial differential equation system of the type encountered in physics problems (e.g. fluid and gas problems). Both of these directions requires much thinking and new development of mathematical fundamentals before they may be utilized in the ATC work. Rather than consider CA as 'discretization' of PDE systems, I believe that the ATC applications will require a completely different and new mathematical methodology, a sort of discrete analogue of jet bundles and/or the sheaf-theoretic techniques to topologists. Here too, I have begun work on virtually 'virgin' mathematical ground (at least from an 'applied' point of view) which will require considerable preliminary work.

Problems with heterogeneous and non-isotropic media or distorted grids

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hyman, J.; Shashkov, M.; Steinberg, S.

1996-08-01

This paper defines discretizations of the divergence and flux operators that produce symmetric, positive-definite, and accurate approximations to steady-state diffusion problems. Because discontinuous material properties and highly distorted grids are allowed, the flux operator, rather than the gradient, is used as a fundamental operator to be discretized. Resulting finite-difference scheme is similar to those obtained from the mixed finite-element method.

Stochastic Adaptive Estimation and Control.

DTIC Science & Technology

1994-10-26

Marcus, "Language Stability and Stabilizability of Discrete Event Dynamical Systems ," SIAM Journal on Control and Optimization, 31, September 1993...in the hierarchical control of flexible manufacturing systems ; in this problem, the model involves a hybrid process in continuous time whose state is...of the average cost control problem for discrete- time Markov processes. Our exposition covers from finite to Borel state and action spaces and

Adjoint-Based Methodology for Time-Dependent Optimization

NASA Technical Reports Server (NTRS)

Yamaleev, N. K.; Diskin, B.; Nielsen, E. J.

2008-01-01

This paper presents a discrete adjoint method for a broad class of time-dependent optimization problems. The time-dependent adjoint equations are derived in terms of the discrete residual of an arbitrary finite volume scheme which approximates unsteady conservation law equations. Although only the 2-D unsteady Euler equations are considered in the present analysis, this time-dependent adjoint method is applicable to the 3-D unsteady Reynolds-averaged Navier-Stokes equations with minor modifications. The discrete adjoint operators involving the derivatives of the discrete residual and the cost functional with respect to the flow variables are computed using a complex-variable approach, which provides discrete consistency and drastically reduces the implementation and debugging cycle. The implementation of the time-dependent adjoint method is validated by comparing the sensitivity derivative with that obtained by forward mode differentiation. Our numerical results show that O(10) optimization iterations of the steepest descent method are needed to reduce the objective functional by 3-6 orders of magnitude for test problems considered.

Discrete Structure-Point Testing: Problems and Alternatives. TESL Reporter, Vol. 9, No. 4.

ERIC Educational Resources Information Center

Aitken, Kenneth G.

This paper presents some reasons for reconsidering the use of discrete structure-point tests of language proficiency, and suggests an alternative basis for designing proficiency tests. Discrete point tests are one of the primary tools of the audio-lingual method of teaching a foreign language and are based on certain assumptions, including the…

Conservative discretization of the Landau collision integral

DOE PAGES

Hirvijoki, E.; Adams, M. F.

2017-03-28

Here we describe a density, momentum-, and energy-conserving discretization of the nonlinear Landau collision integral. The method is suitable for both the finite-element and discontinuous Galerkin methods and does not require structured meshes. The conservation laws for the discretization are proven algebraically and demonstrated numerically for an axially symmetric nonlinear relaxation problem using a finite-element implementation.

Applications of wavelet-based compression to multidimensional Earth science data

NASA Technical Reports Server (NTRS)

Bradley, Jonathan N.; Brislawn, Christopher M.

1993-01-01

A data compression algorithm involving vector quantization (VQ) and the discrete wavelet transform (DWT) is applied to two different types of multidimensional digital earth-science data. The algorithms (WVQ) is optimized for each particular application through an optimization procedure that assigns VQ parameters to the wavelet transform subbands subject to constraints on compression ratio and encoding complexity. Preliminary results of compressing global ocean model data generated on a Thinking Machines CM-200 supercomputer are presented. The WVQ scheme is used in both a predictive and nonpredictive mode. Parameters generated by the optimization algorithm are reported, as are signal-to-noise (SNR) measurements of actual quantized data. The problem of extrapolating hydrodynamic variables across the continental landmasses in order to compute the DWT on a rectangular grid is discussed. Results are also presented for compressing Landsat TM 7-band data using the WVQ scheme. The formulation of the optimization problem is presented along with SNR measurements of actual quantized data. Postprocessing applications are considered in which the seven spectral bands are clustered into 256 clusters using a k-means algorithm and analyzed using the Los Alamos multispectral data analysis program, SPECTRUM, both before and after being compressed using the WVQ program.

A homogenization-based quasi-discrete method for the fracture of heterogeneous materials

NASA Astrophysics Data System (ADS)

Berke, P. Z.; Peerlings, R. H. J.; Massart, T. J.; Geers, M. G. D.

2014-05-01

The understanding and the prediction of the failure behaviour of materials with pronounced microstructural effects is of crucial importance. This paper presents a novel computational methodology for the handling of fracture on the basis of the microscale behaviour. The basic principles presented here allow the incorporation of an adaptive discretization scheme of the structure as a function of the evolution of strain localization in the underlying microstructure. The proposed quasi-discrete methodology bridges two scales: the scale of the material microstructure, modelled with a continuum type description; and the structural scale, where a discrete description of the material is adopted. The damaging material at the structural scale is divided into unit volumes, called cells, which are represented as a discrete network of points. The scale transition is inspired by computational homogenization techniques; however it does not rely on classical averaging theorems. The structural discrete equilibrium problem is formulated in terms of the underlying fine scale computations. Particular boundary conditions are developed on the scale of the material microstructure to address damage localization problems. The performance of this quasi-discrete method with the enhanced boundary conditions is assessed using different computational test cases. The predictions of the quasi-discrete scheme agree well with reference solutions obtained through direct numerical simulations, both in terms of crack patterns and load versus displacement responses.

Directive sources in acoustic discrete-time domain simulations based on directivity diagrams.

PubMed

Escolano, José; López, José J; Pueo, Basilio

2007-06-01

Discrete-time domain methods provide a simple and flexible way to solve initial boundary value problems. With regard to the sources in such methods, only monopoles or dipoles can be considered. However, in many problems such as room acoustics, the radiation of realistic sources is directional-dependent and their directivity patterns have a clear influence on the total sound field. In this letter, a method to synthesize the directivity of sources is proposed, especially in cases where the knowledge is only based on discrete values of the directivity diagram. Some examples have been carried out in order to show the behavior and accuracy of the proposed method.

Control of discrete time systems based on recurrent Super-Twisting-like algorithm.

PubMed

Salgado, I; Kamal, S; Bandyopadhyay, B; Chairez, I; Fridman, L

2016-09-01

Most of the research in sliding mode theory has been carried out to in continuous time to solve the estimation and control problems. However, in discrete time, the results in high order sliding modes have been less developed. In this paper, a discrete time super-twisting-like algorithm (DSTA) was proposed to solve the problems of control and state estimation. The stability proof was developed in terms of the discrete time Lyapunov approach and the linear matrix inequalities theory. The system trajectories were ultimately bounded inside a small region dependent on the sampling period. Simulation results tested the DSTA. The DSTA was applied as a controller for a Furuta pendulum and for a DC motor supplied by a DSTA signal differentiator. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

Enabling the extended compact genetic algorithm for real-parameter optimization by using adaptive discretization.

PubMed

Chen, Ying-ping; Chen, Chao-Hong

2010-01-01

An adaptive discretization method, called split-on-demand (SoD), enables estimation of distribution algorithms (EDAs) for discrete variables to solve continuous optimization problems. SoD randomly splits a continuous interval if the number of search points within the interval exceeds a threshold, which is decreased at every iteration. After the split operation, the nonempty intervals are assigned integer codes, and the search points are discretized accordingly. As an example of using SoD with EDAs, the integration of SoD and the extended compact genetic algorithm (ECGA) is presented and numerically examined. In this integration, we adopt a local search mechanism as an optional component of our back end optimization engine. As a result, the proposed framework can be considered as a memetic algorithm, and SoD can potentially be applied to other memetic algorithms. The numerical experiments consist of two parts: (1) a set of benchmark functions on which ECGA with SoD and ECGA with two well-known discretization methods: the fixed-height histogram (FHH) and the fixed-width histogram (FWH) are compared; (2) a real-world application, the economic dispatch problem, on which ECGA with SoD is compared to other methods. The experimental results indicate that SoD is a better discretization method to work with ECGA. Moreover, ECGA with SoD works quite well on the economic dispatch problem and delivers solutions better than the best known results obtained by other methods in existence.

Partial differential equations constrained combinatorial optimization on an adiabatic quantum computer

NASA Astrophysics Data System (ADS)

Chandra, Rishabh

Partial differential equation-constrained combinatorial optimization (PDECCO) problems are a mixture of continuous and discrete optimization problems. PDECCO problems have discrete controls, but since the partial differential equations (PDE) are continuous, the optimization space is continuous as well. Such problems have several applications, such as gas/water network optimization, traffic optimization, micro-chip cooling optimization, etc. Currently, no efficient classical algorithm which guarantees a global minimum for PDECCO problems exists. A new mapping has been developed that transforms PDECCO problem, which only have linear PDEs as constraints, into quadratic unconstrained binary optimization (QUBO) problems that can be solved using an adiabatic quantum optimizer (AQO). The mapping is efficient, it scales polynomially with the size of the PDECCO problem, requires only one PDE solve to form the QUBO problem, and if the QUBO problem is solved correctly and efficiently on an AQO, guarantees a global optimal solution for the original PDECCO problem.

Difference equation state approximations for nonlinear hereditary control problems

NASA Technical Reports Server (NTRS)

Rosen, I. G.

1984-01-01

Discrete approximation schemes for the solution of nonlinear hereditary control problems are constructed. The methods involve approximation by a sequence of optimal control problems in which the original infinite dimensional state equation has been approximated by a finite dimensional discrete difference equation. Convergence of the state approximations is argued using linear semigroup theory and is then used to demonstrate that solutions to the approximating optimal control problems in some sense approximate solutions to the original control problem. Two schemes, one based upon piecewise constant approximation, and the other involving spline functions are discussed. Numerical results are presented, analyzed and used to compare the schemes to other available approximation methods for the solution of hereditary control problems. Previously announced in STAR as N83-33589

Element Verification and Comparison in Sierra/Solid Mechanics Problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ohashi, Yuki; Roth, William

2016-05-01

The goal of this project was to study the effects of element selection on the Sierra/SM solutions to five common solid mechanics problems. A total of nine element formulations were used for each problem. The models were run multiple times with varying spatial and temporal discretization in order to ensure convergence. The first four problems have been compared to analytical solutions, and all numerical results were found to be sufficiently accurate. The penetration problem was found to have a high mesh dependence in terms of element type, mesh discretization, and meshing scheme. Also, the time to solution is shown formore » each problem in order to facilitate element selection when computer resources are limited.« less

Phase Retrieval from Modulus Using Homeomorphic Signal Processing and the Complex Cepstrum: An Algorithm for Lightning Protection Systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Clark, G A

2004-06-08

In general, the Phase Retrieval from Modulus problem is very difficult. In this report, we solve the difficult, but somewhat more tractable case in which we constrain the solution to a minimum phase reconstruction. We exploit the real-and imaginary part sufficiency properties of the Fourier and Hilbert Transforms of causal sequences to develop an algorithm for reconstructing spectral phase given only spectral modulus. The algorithm uses homeomorphic signal processing methods with the complex cepstrum. The formal problem of interest is: Given measurements of only the modulus {vert_bar}H(k){vert_bar} (no phase) of the Discrete Fourier Transform (DFT) of a real, finite-length, stable,more » causal time domain signal h(n), compute a minimum phase reconstruction {cflx h}(n) of the signal. Then compute the phase of {cflx h}(n) using a DFT, and exploit the result as an estimate of the phase of h(n). The development of the algorithm is quite involved, but the final algorithm and its implementation are very simple. This work was motivated by a Phase Retrieval from Modulus Problem that arose in LLNL Defense Sciences Engineering Division (DSED) projects in lightning protection for buildings. The measurements are limited to modulus-only spectra from a spectrum analyzer. However, it is desired to perform system identification on the building to compute impulse responses and transfer functions that describe the amount of lightning energy that will be transferred from the outside of the building to the inside. This calculation requires knowledge of the entire signals (both modulus and phase). The algorithm and software described in this report are proposed as an approach to phase retrieval that can be used for programmatic needs. This report presents a brief tutorial description of the mathematical problem and the derivation of the phase retrieval algorithm. The efficacy of the theory is demonstrated using simulated signals that meet the assumptions of the algorithm. We see that for the noiseless case, the reconstructions are extremely accurate. When moderate to heavy simulated white Gaussian noise was added, the algorithm performance remained reasonably robust, especially in the low frequency part of the spectrum, which is the part of most interest for lightning protection. Limitations of the algorithm include the following: (1) It does not account for noise in the given spectral modulus. Fortunately, the lightning protection signals of interest generally have a reasonably high signal-to-noise ratio (SNR). (2) The DFT length N must be even and larger than the length of the nonzero part of the measured signals. These constraints are simple to meet in practice. (3) Regardless of the properties of the actual signal h(n), the phase retrieval results are constrained to have the minimum phase property. In most problems of practical interest, these assumptions are very reasonable and probably valid. They are reasonable assumptions for Lightning Protection applications. Proposed future work includes (a) Evaluating the efficacy of the algorithm with real Lightning Protection signals from programmatic applications, (b) Performing a more rigorous analysis of noise effects, (c) Using the algorithm along with advanced system identification algorithms to estimate impulse responses and transfer functions, (d) Developing algorithms to deal with measured partial (truncated) spectral moduli, and (e) R & D of phase retrieval algorithms that specifically deal with general (not necessarily minimum phase) signals, and noisy spectral moduli.« less

General structure of fermion two-point function and its spectral representation in a hot magnetized medium

NASA Astrophysics Data System (ADS)

Das, Aritra; Bandyopadhyay, Aritra; Roy, Pradip K.; Mustafa, Munshi G.

2018-02-01

We have systematically constructed the general structure of the fermion self-energy and the effective quark propagator in the presence of a nontrivial background such as a hot magnetized medium. This is applicable to both QED and QCD. The hard thermal loop approximation has been used for the heat bath. We have also examined transformation properties of the effective fermion propagator under some of the discrete symmetries of the system. Using the effective fermion propagator we have analyzed the fermion dispersion spectra in a hot magnetized medium along with the spinor for each fermion mode obtained by solving the modified Dirac equation. The fermion spectra is found to reflect the discrete symmetries of the two-point functions. We note that for a chirally symmetric theory the degenerate left- and right-handed chiral modes in vacuum or in a heat bath get separated and become asymmetric in the presence of a magnetic field without disturbing the chiral invariance. The obtained general structure of the two-point functions is verified by computing the three-point function, which agrees with the existing results in one-loop order. Finally, we have computed explicitly the spectral representation of the two-point functions which would be very important to study the spectral properties of the hot magnetized medium corresponding to QED and QCD with background magnetic field.

First-Order Hyperbolic System Method for Time-Dependent Advection-Diffusion Problems

NASA Technical Reports Server (NTRS)

Mazaheri, Alireza; Nishikawa, Hiroaki

2014-01-01

A time-dependent extension of the first-order hyperbolic system method for advection-diffusion problems is introduced. Diffusive/viscous terms are written and discretized as a hyperbolic system, which recovers the original equation in the steady state. The resulting scheme offers advantages over traditional schemes: a dramatic simplification in the discretization, high-order accuracy in the solution gradients, and orders-of-magnitude convergence acceleration. The hyperbolic advection-diffusion system is discretized by the second-order upwind residual-distribution scheme in a unified manner, and the system of implicit-residual-equations is solved by Newton's method over every physical time step. The numerical results are presented for linear and nonlinear advection-diffusion problems, demonstrating solutions and gradients produced to the same order of accuracy, with rapid convergence over each physical time step, typically less than five Newton iterations.

Effect of Spectrally Varying Albedo of Vegetation Surfaces on Shortwave Radiation Fluxes and Aerosol Direct Radiative Forcing

NASA Technical Reports Server (NTRS)

Zhu, L.; Martins, J. V.; Yu, H.

2012-01-01

This study develops an algorithm for representing detailed spectral features of vegetation albedo based on Moderate Resolution Imaging Spectrometer (MODIS) observations at 7 discrete channels, referred to as the MODIS Enhanced Vegetation Albedo (MEVA) algorithm. The MEVA algorithm empirically fills spectral gaps around the vegetation red edge near 0.7 micrometers and vegetation water absorption features at 1.48 and 1.92 micrometers which cannot be adequately captured by the MODIS 7 channels. We then assess the effects of applying MEVA in comparison to four other traditional approaches to calculate solar fluxes and aerosol direct radiative forcing (DRF) at the top of atmosphere (TOA) based on the MODIS discrete reflectance bands. By comparing the DRF results obtained through the MEVA method with the results obtained through the other four traditional approaches, we show that filling the spectral gap of the MODIS measurements around 0.7 micrometers based on the general spectral behavior of healthy green vegetation leads to significant improvement in the instantaneous aerosol DRF at TOA (up to 3.02Wm(exp -2) difference or 48% fraction of the aerosol DRF, .6.28Wm(exp -2), calculated for high spectral resolution surface reflectance from 0.3 to 2.5 micrometers for deciduous vegetation surface). The corrections of the spectral gaps in the vegetation spectrum in the near infrared, again missed by the MODIS reflectances, also contributes to improving TOA DRF calculations but to a much lower extent (less than 0.27Wm(exp -2), or about 4% of the instantaneous DRF). Compared to traditional approaches, MEVA also improves the accuracy of the outgoing solar flux between 0.3 to 2.5 micrometers at TOA by over 60Wm(exp -2) (for aspen 3 surface) and aerosol DRF by over 10Wm(exp -2) (for dry grass). Specifically, for Amazon vegetation types, MEVA can improve the accuracy of daily averaged aerosol radiative forcing in the spectral range of 0.3 to 2.5 micrometers at equator at the equinox by 3.7Wm(exp -2). These improvements indicate that MEVA can contribute to regional climate studies over vegetated areas and can help to improve remote sensing-based studies of climate processes and climate change.

Discrete Breathers in One-Dimensional Diatomic Granular Crystals

NASA Astrophysics Data System (ADS)

Boechler, N.; Theocharis, G.; Job, S.; Kevrekidis, P. G.; Porter, Mason A.; Daraio, C.

2010-06-01

We report the experimental observation of modulational instability and discrete breathers in a one-dimensional diatomic granular crystal composed of compressed elastic beads that interact via Hertzian contact. We first characterize their effective linear spectrum both theoretically and experimentally. We then illustrate theoretically and numerically the modulational instability of the lower edge of the optical band. This leads to the dynamical formation of long-lived breather structures, whose families of solutions we compute throughout the linear spectral gap. Finally, we experimentally observe the manifestation of the modulational instability and the resulting generation of localized breathing modes with quantitative characteristics that agree with our numerical results.

Spectral method for a kinetic swarming model

DOE PAGES

Gamba, Irene M.; Haack, Jeffrey R.; Motsch, Sebastien

2015-04-28

Here we present the first numerical method for a kinetic description of the Vicsek swarming model. The kinetic model poses a unique challenge, as there is a distribution dependent collision invariant to satisfy when computing the interaction term. We use a spectral representation linked with a discrete constrained optimization to compute these interactions. To test the numerical scheme we investigate the kinetic model at different scales and compare the solution with the microscopic and macroscopic descriptions of the Vicsek model. Lastly, we observe that the kinetic model captures key features such as vortex formation and traveling waves.

Label swapper device for spectral amplitude coded optical packet networks monolithically integrated on InP.

PubMed

Muñoz, P; García-Olcina, R; Habib, C; Chen, L R; Leijtens, X J M; de Vries, T; Robbins, D; Capmany, J

2011-07-04

In this paper the design, fabrication and experimental characterization of an spectral amplitude coded (SAC) optical label swapper monolithically integrated on Indium Phosphide (InP) is presented. The device has a footprint of 4.8x1.5 mm2 and is able to perform label swapping operations required in SAC at a speed of 155 Mbps. The device was manufactured in InP using a multiple purpose generic integration scheme. Compared to previous SAC label swapper demonstrations, using discrete component assembly, this label swapper chip operates two order of magnitudes faster.

Spectral and scattering theory for Schrödinger operators on perturbed topological crystals

NASA Astrophysics Data System (ADS)

Parra, D.; Richard, S.

In this paper, we investigate the spectral and the scattering theory of Schrödinger operators acting on perturbed periodic discrete graphs. The perturbations considered are of two types: either a multiplication operator by a short-range or a long-range function, or a short-range type modification of the measure defined on the vertices and on the edges of the graph. Mourre theory is used for describing the nature of the spectrum of the underlying operators. For short-range perturbations, existence and asymptotic completeness of local wave operators are also proved.

Quantum walks with an anisotropic coin I: spectral theory

NASA Astrophysics Data System (ADS)

Richard, S.; Suzuki, A.; Tiedra de Aldecoa, R.

2018-02-01

We perform the spectral analysis of the evolution operator U of quantum walks with an anisotropic coin, which include one-defect models, two-phase quantum walks, and topological phase quantum walks as special cases. In particular, we determine the essential spectrum of U, we show the existence of locally U-smooth operators, we prove the discreteness of the eigenvalues of U outside the thresholds, and we prove the absence of singular continuous spectrum for U. Our analysis is based on new commutator methods for unitary operators in a two-Hilbert spaces setting, which are of independent interest.

On the computational aspects of comminution in discrete element method

NASA Astrophysics Data System (ADS)

Chaudry, Mohsin Ali; Wriggers, Peter

2018-04-01

In this paper, computational aspects of crushing/comminution of granular materials are addressed. For crushing, maximum tensile stress-based criterion is used. Crushing model in discrete element method (DEM) is prone to problems of mass conservation and reduction in critical time step. The first problem is addressed by using an iterative scheme which, depending on geometric voids, recovers mass of a particle. In addition, a global-local framework for DEM problem is proposed which tends to alleviate the local unstable motion of particles and increases the computational efficiency.

Distributed consensus for discrete-time heterogeneous multi-agent systems

NASA Astrophysics Data System (ADS)

Zhao, Huanyu; Fei, Shumin

2018-06-01

This paper studies the consensus problem for a class of discrete-time heterogeneous multi-agent systems. Two kinds of consensus algorithms will be considered. The heterogeneous multi-agent systems considered are converted into equivalent error systems by a model transformation. Then we analyse the consensus problem of the original systems by analysing the stability problem of the error systems. Some sufficient conditions for consensus of heterogeneous multi-agent systems are obtained by applying algebraic graph theory and matrix theory. Simulation examples are presented to show the usefulness of the results.

Discrete decoding based ultrafast multidimensional nuclear magnetic resonance spectroscopy

NASA Astrophysics Data System (ADS)

Wei, Zhiliang; Lin, Liangjie; Ye, Qimiao; Li, Jing; Cai, Shuhui; Chen, Zhong

2015-07-01

The three-dimensional (3D) nuclear magnetic resonance (NMR) spectroscopy constitutes an important and powerful tool in analyzing chemical and biological systems. However, the abundant 3D information arrives at the expense of long acquisition times lasting hours or even days. Therefore, there has been a continuous interest in developing techniques to accelerate recordings of 3D NMR spectra, among which the ultrafast spatiotemporal encoding technique supplies impressive acquisition speed by compressing a multidimensional spectrum in a single scan. However, it tends to suffer from tradeoffs among spectral widths in different dimensions, which deteriorates in cases of NMR spectroscopy with more dimensions. In this study, the discrete decoding is proposed to liberate the ultrafast technique from tradeoffs among spectral widths in different dimensions by focusing decoding on signal-bearing sites. For verifying its feasibility and effectiveness, we utilized the method to generate two different types of 3D spectra. The proposed method is also applicable to cases with more than three dimensions, which, based on the experimental results, may widen applications of the ultrafast technique.

A study of 2-20 KeV X-rays from the Cygnus region

NASA Technical Reports Server (NTRS)

Bleach, R. D.

1972-01-01

Two rocket-borne proportional counters, each with 650 sq c, met area and 1.8 x 7.1 deg FWHM rectangular mechanical collimation, surveyed the Cygnus region in the 2 to 20 keV energy range on two occasions. X-ray spectral data gathered on 21 September 1970 from discrete sources in Cygnus are presented. The data from Cyg X-1, Cyg X-2, and Cyg X-3 have sufficient statistical significance to indicate mutually exclusive spectral forms for the three. Upper limits are presented for X-ray intensities above 2 keV for Cyg X-4 and Cyg X-5 (Cygnus loop). A search was made on 9 August 1971 for a diffuse component of X-rays 1.5 keV associated with an interarm region of the galaxy at galactic longitudes in the vicinity of 60 degrees. A statistically significant excess associated with a narrow disk component was detected. Several possible emission models are discussed, with the most likely candidate being a population of unresolvable low luminosity discrete sources.

Real-time detection of organic contamination events in water distribution systems by principal components analysis of ultraviolet spectral data.

PubMed

Zhang, Jian; Hou, Dibo; Wang, Ke; Huang, Pingjie; Zhang, Guangxin; Loáiciga, Hugo

2017-05-01

The detection of organic contaminants in water distribution systems is essential to protect public health from potential harmful compounds resulting from accidental spills or intentional releases. Existing methods for detecting organic contaminants are based on quantitative analyses such as chemical testing and gas/liquid chromatography, which are time- and reagent-consuming and involve costly maintenance. This study proposes a novel procedure based on discrete wavelet transform and principal component analysis for detecting organic contamination events from ultraviolet spectral data. Firstly, the spectrum of each observation is transformed using discrete wavelet with a coiflet mother wavelet to capture the abrupt change along the wavelength. Principal component analysis is then employed to approximate the spectra based on capture and fusion features. The significant value of Hotelling's T 2 statistics is calculated and used to detect outliers. An alarm of contamination event is triggered by sequential Bayesian analysis when the outliers appear continuously in several observations. The effectiveness of the proposed procedure is tested on-line using a pilot-scale setup and experimental data.

Natural Environment Characterization Using Hybrid Tomographic Aproaches

NASA Astrophysics Data System (ADS)

Huang, Yue; Ferro-Famil, Laurent; Reigber, Andreas

2011-03-01

SAR tomography (SARTOM) is the extension of conventional two-dimensional SAR imaging principle to three dimensions [1]. A real 3D imaging of a scene is achieved by the formation of an additional synthetic aperture in elevation and the coherent combination of images acquired from several parallel flight tracks. This imaging technique allows a direct localization of multiple scattering contributions in a same resolution cell, leading to a refined analysis of volume structures, like forests or dense urban areas. In order to improve the vertical resolution with respect to classical Fourier-based methods, High-Resolution (HR) approaches are used in this paper to perform SAR tomography. Both nonparametric spectral estimators, like Beamforming and Capon and parametric ones, like MUSIC, Maximum Likelihood, are applied to real data sets and compared in terms of scatterer location accuracy and resolution. It is known that nonparametric approaches are in general more robust to focusing artefacts, whereas parametric approaches are characterized by a better vertical resolution. It has been shown [2], [3] that the performance of these spectral analysis approaches is conditioned by the nature of the scattering response of the observed objects. In the scenario of hybrid environments where objects with a deterministic response are embedded in a speckle affected environment, the parameter estimation for this type of scatterers becomes a problem of mixed-spectrum estimation. The impenetrable medium like the ground or object, possesses an isolated localized phase center in the vertical direction, leading to a discrete (line) spectrum. This type of scatterers can be considered as 'h-localized', named 'Isolated Scatterers' (IS). Whereas natural environments consist of a large number of elementary scatterers successively distributed in the vertical direction. This type of scatterers can be described as 'h-distributed' scatterers and characterized by a continuous spectrum. Therefore, the usual spectral estimators may reach some limitations due to their lack of adaptation to both the statistical features of the backscattered information and the type of spectrum of the considered media. In order to overcome this problem, a tomographic focusing approach based on hybrid spectral estimators is introduced and extended to the polarimetric case. It contains two parallel procedures: one is to detect and localize isolated scatterers and the other one is to characterize the natural environment by estimating the heights of the ground and the tree top. These two decoupled procedures permit to more precisely characterize the scenario of hybrid environments.

High order spectral volume and spectral difference methods on unstructured grids

NASA Astrophysics Data System (ADS)

Kannan, Ravishekar

The spectral volume (SV) and the spectral difference (SD) methods were developed by Wang and Liu and their collaborators for conservation laws on unstructured grids. They were introduced to achieve high-order accuracy in an efficient manner. Recently, these methods were extended to three-dimensional systems and to the Navier Stokes equations. The simplicity and robustness of these methods have made them competitive against other higher order methods such as the discontinuous Galerkin and residual distribution methods. Although explicit TVD Runge-Kutta schemes for the temporal advancement are easy to implement, they suffer from small time step limited by the Courant-Friedrichs-Lewy (CFL) condition. When the polynomial order is high or when the grid is stretched due to complex geometries or boundary layers, the convergence rate of explicit schemes slows down rapidly. Solution strategies to remedy this problem include implicit methods and multigrid methods. A novel implicit lower-upper symmetric Gauss-Seidel (LU-SGS) relaxation method is employed as an iterative smoother. It is compared to the explicit TVD Runge-Kutta smoothers. For some p-multigrid calculations, combining implicit and explicit smoothers for different p-levels is also studied. The multigrid method considered is nonlinear and uses Full Approximation Scheme (FAS). An overall speed-up factor of up to 150 is obtained using a three-level p-multigrid LU-SGS approach in comparison with the single level explicit method for the Euler equations for the 3rd order SD method. A study of viscous flux formulations was carried out for the SV method. Three formulations were used to discretize the viscous fluxes: local discontinuous Galerkin (LDG), a penalty method and the 2nd method of Bassi and Rebay. Fourier analysis revealed some interesting advantages for the penalty method. These were implemented in the Navier Stokes solver. An implicit and p-multigrid method was also implemented for the above. An overall speed-up factor of up to 1500 is obtained using a three-level p-multigrid LU-SGS approach in comparison with the single level explicit method for the Navier-Stokes equations. The SV method was also extended to turbulent flows. The RANS based SA model was used to close the Reynolds stresses. The numerical results are very promising and indicate that the approaches have great potentials for 3D flow problems.

Mapping of uncertainty relations between continuous and discrete time

NASA Astrophysics Data System (ADS)

Chiuchiú, Davide; Pigolotti, Simone

2018-03-01

Lower bounds on fluctuations of thermodynamic currents depend on the nature of time, discrete or continuous. To understand the physical reason, we compare current fluctuations in discrete-time Markov chains and continuous-time master equations. We prove that current fluctuations in the master equations are always more likely, due to random timings of transitions. This comparison leads to a mapping of the moments of a current between discrete and continuous time. We exploit this mapping to obtain uncertainty bounds. Our results reduce the quests for uncertainty bounds in discrete and continuous time to a single problem.

Mapping of uncertainty relations between continuous and discrete time.

PubMed

Chiuchiù, Davide; Pigolotti, Simone

2018-03-01

Lower bounds on fluctuations of thermodynamic currents depend on the nature of time, discrete or continuous. To understand the physical reason, we compare current fluctuations in discrete-time Markov chains and continuous-time master equations. We prove that current fluctuations in the master equations are always more likely, due to random timings of transitions. This comparison leads to a mapping of the moments of a current between discrete and continuous time. We exploit this mapping to obtain uncertainty bounds. Our results reduce the quests for uncertainty bounds in discrete and continuous time to a single problem.

Optimal resolution in maximum entropy image reconstruction from projections with multigrid acceleration

NASA Technical Reports Server (NTRS)

Limber, Mark A.; Manteuffel, Thomas A.; Mccormick, Stephen F.; Sholl, David S.

1993-01-01

We consider the problem of image reconstruction from a finite number of projections over the space L(sup 1)(Omega), where Omega is a compact subset of the set of Real numbers (exp 2). We prove that, given a discretization of the projection space, the function that generates the correct projection data and maximizes the Boltzmann-Shannon entropy is piecewise constant on a certain discretization of Omega, which we call the 'optimal grid'. It is on this grid that one obtains the maximum resolution given the problem setup. The size of this grid grows very quickly as the number of projections and number of cells per projection grow, indicating fast computational methods are essential to make its use feasible. We use a Fenchel duality formulation of the problem to keep the number of variables small while still using the optimal discretization, and propose a multilevel scheme to improve convergence of a simple cyclic maximization scheme applied to the dual problem.

An efficient numerical method for the solution of the problem of elasticity for 3D-homogeneous elastic medium with cracks and inclusions

NASA Astrophysics Data System (ADS)

Kanaun, S.; Markov, A.

2017-06-01

An efficient numerical method for solution of static problems of elasticity for an infinite homogeneous medium containing inhomogeneities (cracks and inclusions) is developed. Finite number of heterogeneous inclusions and planar parallel cracks of arbitrary shapes is considered. The problem is reduced to a system of surface integral equations for crack opening vectors and volume integral equations for stress tensors inside the inclusions. For the numerical solution of these equations, a class of Gaussian approximating functions is used. The method based on these functions is mesh free. For such functions, the elements of the matrix of the discretized system are combinations of explicit analytical functions and five standard 1D-integrals that can be tabulated. Thus, the numerical integration is excluded from the construction of the matrix of the discretized problem. For regular node grids, the matrix of the discretized system has Toeplitz's properties, and Fast Fourier Transform technique can be used for calculation matrix-vector products of such matrices.

A discontinuous Galerkin method for nonlinear parabolic equations and gradient flow problems with interaction potentials

NASA Astrophysics Data System (ADS)

Sun, Zheng; Carrillo, José A.; Shu, Chi-Wang

2018-01-01

We consider a class of time-dependent second order partial differential equations governed by a decaying entropy. The solution usually corresponds to a density distribution, hence positivity (non-negativity) is expected. This class of problems covers important cases such as Fokker-Planck type equations and aggregation models, which have been studied intensively in the past decades. In this paper, we design a high order discontinuous Galerkin method for such problems. If the interaction potential is not involved, or the interaction is defined by a smooth kernel, our semi-discrete scheme admits an entropy inequality on the discrete level. Furthermore, by applying the positivity-preserving limiter, our fully discretized scheme produces non-negative solutions for all cases under a time step constraint. Our method also applies to two dimensional problems on Cartesian meshes. Numerical examples are given to confirm the high order accuracy for smooth test cases and to demonstrate the effectiveness for preserving long time asymptotics.

On Efficient Deployment of Wireless Sensors for Coverage and Connectivity in Constrained 3D Space.

PubMed

Wu, Chase Q; Wang, Li

2017-10-10

Sensor networks have been used in a rapidly increasing number of applications in many fields. This work generalizes a sensor deployment problem to place a minimum set of wireless sensors at candidate locations in constrained 3D space to k -cover a given set of target objects. By exhausting the combinations of discreteness/continuousness constraints on either sensor locations or target objects, we formulate four classes of sensor deployment problems in 3D space: deploy sensors at Discrete/Continuous Locations (D/CL) to cover Discrete/Continuous Targets (D/CT). We begin with the design of an approximate algorithm for DLDT and then reduce DLCT, CLDT, and CLCT to DLDT by discretizing continuous sensor locations or target objects into a set of divisions without sacrificing sensing precision. Furthermore, we consider a connected version of each problem where the deployed sensors must form a connected network, and design an approximation algorithm to minimize the number of deployed sensors with connectivity guarantee. For performance comparison, we design and implement an optimal solution and a genetic algorithm (GA)-based approach. Extensive simulation results show that the proposed deployment algorithms consistently outperform the GA-based heuristic and achieve a close-to-optimal performance in small-scale problem instances and a significantly superior overall performance than the theoretical upper bound.

Discretization chaos - Feedback control and transition to chaos

NASA Technical Reports Server (NTRS)

Grantham, Walter J.; Athalye, Amit M.

1990-01-01

Problems in the design of feedback controllers for chaotic dynamical systems are considered theoretically, focusing on two cases where chaos arises only when a nonchaotic continuous-time system is discretized into a simpler discrete-time systems (exponential discretization and pseudo-Euler integration applied to Lotka-Volterra competition and prey-predator systems). Numerical simulation results are presented in extensive graphs and discussed in detail. It is concluded that care must be taken in applying standard dynamical-systems methods to control systems that may be discontinuous or nondifferentiable.

Variable Weight Fractional Collisions for Multiple Species Mixtures

DTIC Science & Technology

2017-08-28

DISTRIBUTION A: APPROVED FOR PUBLIC RELEASE; DISTRIBUTION UNLIMITED; PA #17517 6 / 21 VARIABLE WEIGHTS FOR DYNAMIC RANGE Continuum to Discrete ...Representation: Many Particles →̃ Continuous Distribution Discretized VDF Yields Vlasov But Collision Integral Still a Problem Particle Methods VDF to Delta...Function Set Collisions between Discrete Velocities But Poorly Resolved Tail (Tail Critical to Inelastic Collisions) Variable Weights Permit Extra DOF in

Aircraft Engine Noise Scattering - A Discontinuous Spectral Element Approach

NASA Technical Reports Server (NTRS)

Stanescu, D.; Hussaini, M. Y.; Farassat, F.

2002-01-01

The paper presents a time-domain method for computation of sound radiation from aircraft engine sources to the far-field. The effects of nonuniform flow around the aircraft and scattering of sound by fuselage and wings are accounted for in the formulation. Our approach is based on the discretization of the inviscid flow equations through a collocation form of the Discontinuous Galerkin spectral element method. An isoparametric representation of the underlying geometry is used in order to take full advantage of the spectral accuracy of the method. Largescale computations are made possible by a parallel implementation based on message passing. Results obtained for radiation from an axisymmetric nacelle alone are compared with those obtained when the same nacelle is installed in a generic con.guration, with and without a wing.

Time delay estimation using new spectral and adaptive filtering methods with applications to underwater target detection

NASA Astrophysics Data System (ADS)

Hasan, Mohammed A.

1997-11-01

In this dissertation, we present several novel approaches for detection and identification of targets of arbitrary shapes from the acoustic backscattered data and using the incident waveform. This problem is formulated as time- delay estimation and sinusoidal frequency estimation problems which both have applications in many other important areas in signal processing. Solving time-delay estimation problem allows the identification of the specular components in the backscattered signal from elastic and non-elastic targets. Thus, accurate estimation of these time delays would help in determining the existence of certain clues for detecting targets. Several new methods for solving these two problems in the time, frequency and wavelet domains are developed. In the time domain, a new block fast transversal filter (BFTF) is proposed for a fast implementation of the least squares (LS) method. This BFTF algorithm is derived by using data-related constrained block-LS cost function to guarantee global optimality. The new soft-constrained algorithm provides an efficient way of transferring weight information between blocks of data and thus it is computationally very efficient compared with other LS- based schemes. Additionally, the tracking ability of the algorithm can be controlled by varying the block length and/or a soft constrained parameter. The effectiveness of this algorithm is tested on several underwater acoustic backscattered data for elastic targets and non-elastic (cement chunk) objects. In the frequency domain, the time-delay estimation problem is converted to a sinusoidal frequency estimation problem by using the discrete Fourier transform. Then, the lagged sample covariance matrices of the resulting signal are computed and studied in terms of their eigen- structure. These matrices are shown to be robust and effective in extracting bases for the signal and noise subspaces. New MUSIC and matrix pencil-based methods are derived these subspaces. The effectiveness of the method is demonstrated on the problem of detection of multiple specular components in the acoustic backscattered data. Finally, a method for the estimation of time delays using wavelet decomposition is derived. The sub-band adaptive filtering uses discrete wavelet transform for multi- resolution or sub-band decomposition. Joint time delay estimation for identifying multi-specular components and subsequent adaptive filtering processes are performed on the signal in each sub-band. This would provide multiple 'look' of the signal at different resolution scale which results in more accurate estimates for delays associated with the specular components. Simulation results on the simulated and real shallow water data are provided which show the promise of this new scheme for target detection in a heavy cluttered environment.

Numerical method for computing Maass cusp forms on triply punctured two-sphere

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chan, K. T.; Kamari, H. M.; Zainuddin, H.

2014-03-05

A quantum mechanical system on a punctured surface modeled on hyperbolic space has always been an important subject of research in mathematics and physics. This corresponding quantum system is governed by the Schrödinger equation whose solutions are the Maass waveforms. Spectral studies on these Maass waveforms are known to contain both continuous and discrete eigenvalues. The discrete eigenfunctions are usually called the Maass Cusp Forms (MCF) where their discrete eigenvalues are not known analytically. We introduce a numerical method based on Hejhal and Then algorithm using GridMathematica for computing MCF on a punctured surface with three cusps namely the triplymore » punctured two-sphere. We also report on a pullback algorithm for the punctured surface and a point locater algorithm to facilitate the complete pullback which are essential parts of the main algorithm.« less

Discrete symmetries in the heterotic-string landscape

NASA Astrophysics Data System (ADS)

Athanasopoulos, P.

2015-07-01

We describe a new type of discrete symmetry that relates heterotic-string models. It is based on the spectral flow operator which normally acts within a general N = (2, 2) model and we use this operator to construct a map between N = (2, 0) models. The landscape of N = (2, 0) models is of particular interest among all heterotic-string models for two important reasons: Firstly, N =1 spacetime SUSY requires (2, 0) superconformal invariance and secondly, models with the well motivated by the Standard Model SO(10) unification structure are of this type. This idea was inspired by a new discrete symmetry in the space of fermionic ℤ2 × ℤ2 heterotic-string models that exchanges the spinors and vectors of the SO(10) GUT group, dubbed spinor-vector duality. We will describe how to generalize this to arbitrary internal rational Conformal Field Theories.

Discrete solitons and vortices in anisotropic hexagonal and honeycomb lattices

DOE PAGES

Hoq, Q. E.; Kevrekidis, P. G.; Bishop, A. R.

2016-01-14

We consider the self-focusing discrete nonlinear Schrödinger equation on hexagonal and honeycomb lattice geometries. Our emphasis is on the study of the effects of anisotropy, motivated by the tunability afforded in recent optical and atomic physics experiments. We find that multi-soliton and discrete vortex states undergo destabilizing bifurcations as the relevant anisotropy control parameter is varied. Furthermore, we quantify these bifurcations by means of explicit analytical calculations of the solutions, as well as of their spectral linearization eigenvalues. Finally, we corroborate the relevant stability picture through direct numerical computations. In the latter, we observe the prototypical manifestation of these instabilitiesmore » to be the spontaneous rearrangement of the solution, for larger values of the coupling, into localized waveforms typically centered over fewer sites than the original unstable structure. In weak coupling, the instability appears to result in a robust breathing of the relevant waveforms.« less

Discrete solitons and vortices in anisotropic hexagonal and honeycomb lattices

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hoq, Q. E.; Kevrekidis, P. G.; Bishop, A. R.

We consider the self-focusing discrete nonlinear Schrödinger equation on hexagonal and honeycomb lattice geometries. Our emphasis is on the study of the effects of anisotropy, motivated by the tunability afforded in recent optical and atomic physics experiments. We find that multi-soliton and discrete vortex states undergo destabilizing bifurcations as the relevant anisotropy control parameter is varied. Furthermore, we quantify these bifurcations by means of explicit analytical calculations of the solutions, as well as of their spectral linearization eigenvalues. Finally, we corroborate the relevant stability picture through direct numerical computations. In the latter, we observe the prototypical manifestation of these instabilitiesmore » to be the spontaneous rearrangement of the solution, for larger values of the coupling, into localized waveforms typically centered over fewer sites than the original unstable structure. In weak coupling, the instability appears to result in a robust breathing of the relevant waveforms.« less

ARMA models for earthquake ground motions. Seismic safety margins research program

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chang, M. K.; Kwiatkowski, J. W.; Nau, R. F.

1981-02-01

Four major California earthquake records were analyzed by use of a class of discrete linear time-domain processes commonly referred to as ARMA (Autoregressive/Moving-Average) models. It was possible to analyze these different earthquakes, identify the order of the appropriate ARMA model(s), estimate parameters, and test the residuals generated by these models. It was also possible to show the connections, similarities, and differences between the traditional continuous models (with parameter estimates based on spectral analyses) and the discrete models with parameters estimated by various maximum-likelihood techniques applied to digitized acceleration data in the time domain. The methodology proposed is suitable for simulatingmore » earthquake ground motions in the time domain, and appears to be easily adapted to serve as inputs for nonlinear discrete time models of structural motions. 60 references, 19 figures, 9 tables.« less

Gaussian quadrature and lattice discretization of the Fermi-Dirac distribution for graphene.

PubMed

Oettinger, D; Mendoza, M; Herrmann, H J

2013-07-01

We construct a lattice kinetic scheme to study electronic flow in graphene. For this purpose, we first derive a basis of orthogonal polynomials, using as the weight function the ultrarelativistic Fermi-Dirac distribution at rest. Later, we use these polynomials to expand the respective distribution in a moving frame, for both cases, undoped and doped graphene. In order to discretize the Boltzmann equation and make feasible the numerical implementation, we reduce the number of discrete points in momentum space to 18 by applying a Gaussian quadrature, finding that the family of representative wave (2+1)-vectors, which satisfies the quadrature, reconstructs a honeycomb lattice. The procedure and discrete model are validated by solving the Riemann problem, finding excellent agreement with other numerical models. In addition, we have extended the Riemann problem to the case of different dopings, finding that by increasing the chemical potential the electronic fluid behaves as if it increases its effective viscosity.

Vertical discretization with finite elements for a global hydrostatic model on the cubed sphere

NASA Astrophysics Data System (ADS)

Yi, Tae-Hyeong; Park, Ja-Rin

2017-06-01

A formulation of Galerkin finite element with basis-spline functions on a hybrid sigma-pressure coordinate is presented to discretize the vertical terms of global Eulerian hydrostatic equations employed in a numerical weather prediction system, which is horizontally discretized with high-order spectral elements on a cubed sphere grid. This replaces the vertical discretization of conventional central finite difference that is first-order accurate in non-uniform grids and causes numerical instability in advection-dominant flows. Therefore, a model remains in the framework of Galerkin finite elements for both the horizontal and vertical spatial terms. The basis-spline functions, obtained from the de-Boor algorithm, are employed to derive both the vertical derivative and integral operators, since Eulerian advection terms are involved. These operators are used to discretize the vertical terms of the prognostic and diagnostic equations. To verify the vertical discretization schemes and compare their performance, various two- and three-dimensional idealized cases and a hindcast case with full physics are performed in terms of accuracy and stability. It was shown that the vertical finite element with the cubic basis-spline function is more accurate and stable than that of the vertical finite difference, as indicated by faster residual convergence, fewer statistical errors, and reduction in computational mode. This leads to the general conclusion that the overall performance of a global hydrostatic model might be significantly improved with the vertical finite element.

Discrete Dipole Approximation Models of Crystalline Forsterite: Applications to Cometary Crystalline Silicates

NASA Astrophysics Data System (ADS)

Lindsay, Sean; Wooden, D. H.; Woodward, C. E.; Harker, D. E.; Kelley, M. S.; Murphy, J. R.

2012-10-01

In cometary comae, the crystalline silicate forsterite (Mg2SiO4) is the dominant crystalline component. Within the 8 - 40 micron spectral range, the crystal shape has been demonstrated to have a measurable effect on the crystalline features’ shape and peak wavelength locations. We present discrete dipole approximation (DDA) absorption efficiencies for a variety of forsterite grain shapes to demonstrate: a) that the 10, 11, 19, 23, and 33.5 micron resonances are sensitive to grain shape; b) spectral trends are associated with variations in crystallographic axial ratios; and c) that groups of similar grain shapes (shape classes) have distinct spectral features. These computations are performed using DDSCAT v7.0 run on the NASA Advanced Supercomputing (NAS) facility Pleiades. We generate synthetic spectral energy distribution (SED) fits to the Infrared Space Observatory (ISO) SWS spectra for the coma of comet C/1995 O1 (Hale-Bopp) at a heliocentric distance of 2.8 AU. Hale-Bopp is best fit by equant grain shapes whereas rounded grain shapes fit significantly poorer than crystals with sharp edges with well-defined faces. Moreover, crystals that are not significantly elongated along a crystallographic axis fit better. By comparison with Kobatake et al. (2008) condensation experiments and Takigawa et al. (2009) evaporation experiments, our analyses suggest that the forsterite crystals in the coma of Hale-Bopp predominantly are high temperature condensates. The laboratory experiments show that grain shape and grain formation temperature, and hence disk environment, are causally linked. Specifically, the Kobatake et al. (2008) condensation experiment reveals three shape classes associated with temperature: 1) ‘Bulky’ grains (1300 K < T < 1700 K), 2) ‘Platy’ grains (1000 K < T < 1300 K), and 3) columnar/needle grains (T < 1000 K). We construct DDA grain shape analogs to these shape classes to connect grain shapes to distinguishable spectral signatures and crystal formation environments.

Computing approximate solutions of the protein structure determination problem using global constraints on discrete crystal lattices.

PubMed

Dal Palù, Alessandro; Dovier, Agostino; Pontelli, Enrico

2010-01-01

Crystal lattices are discrete models of the three-dimensional space that have been effectively employed to facilitate the task of determining proteins' natural conformation. This paper investigates alternative global constraints that can be introduced in a constraint solver over discrete crystal lattices. The objective is to enhance the efficiency of lattice solvers in dealing with the construction of approximate solutions of the protein structure determination problem. Some of them (e.g., self-avoiding-walk) have been explicitly or implicitly already used in previous approaches, while others (e.g., the density constraint) are new. The intrinsic complexities of all of them are studied and preliminary experimental results are discussed.

3D Discrete element approach to the problem on abutment pressure in a gently dipping coal seam

NASA Astrophysics Data System (ADS)

Klishin, S. V.; Revuzhenko, A. F.

2017-09-01

Using the discrete element method, the authors have carried out 3D implementation of the problem on strength loss in surrounding rock mass in the vicinity of a production heading and on abutment pressure in a gently dripping coal seam. The calculation of forces at the contacts between particles accounts for friction, rolling resistance and viscosity. Between discrete particles modeling coal seam, surrounding rock mass and broken rocks, an elastic connecting element is introduced to allow simulating coherent materials. The paper presents the kinematic patterns of rock mass deformation, stresses in particles and the graph of the abutment pressure behavior in the coal seam.

Continuous Measurements and Quantitative Constraints: Challenge Problems for Discrete Modeling Techniques

NASA Technical Reports Server (NTRS)

Goodrich, Charles H.; Kurien, James; Clancy, Daniel (Technical Monitor)

2001-01-01

We present some diagnosis and control problems that are difficult to solve with discrete or purely qualitative techniques. We analyze the nature of the problems, classify them and explain why they are frequently encountered in systems with closed loop control. This paper illustrates the problem with several examples drawn from industrial and aerospace applications and presents detailed information on one important application: In-Situ Resource Utilization (ISRU) on Mars. The model for an ISRU plant is analyzed showing where qualitative techniques are inadequate to identify certain failure modes and to maintain control of the system in degraded environments. We show why the solution to the problem will result in significantly more robust and reliable control systems. Finally, we illustrate requirements for a solution to the problem by means of examples.

Discrete-time neural network for fast solving large linear L1 estimation problems and its application to image restoration.

PubMed

Xia, Youshen; Sun, Changyin; Zheng, Wei Xing

2012-05-01

There is growing interest in solving linear L1 estimation problems for sparsity of the solution and robustness against non-Gaussian noise. This paper proposes a discrete-time neural network which can calculate large linear L1 estimation problems fast. The proposed neural network has a fixed computational step length and is proved to be globally convergent to an optimal solution. Then, the proposed neural network is efficiently applied to image restoration. Numerical results show that the proposed neural network is not only efficient in solving degenerate problems resulting from the nonunique solutions of the linear L1 estimation problems but also needs much less computational time than the related algorithms in solving both linear L1 estimation and image restoration problems.

Vectorization and parallelization of the finite strip method for dynamic Mindlin plate problems

NASA Technical Reports Server (NTRS)

Chen, Hsin-Chu; He, Ai-Fang

1993-01-01

The finite strip method is a semi-analytical finite element process which allows for a discrete analysis of certain types of physical problems by discretizing the domain of the problem into finite strips. This method decomposes a single large problem into m smaller independent subproblems when m harmonic functions are employed, thus yielding natural parallelism at a very high level. In this paper we address vectorization and parallelization strategies for the dynamic analysis of simply-supported Mindlin plate bending problems and show how to prevent potential conflicts in memory access during the assemblage process. The vector and parallel implementations of this method and the performance results of a test problem under scalar, vector, and vector-concurrent execution modes on the Alliant FX/80 are also presented.

Field Dislocation Mechanics for heterogeneous elastic materials: A numerical spectral approach

DOE Office of Scientific and Technical Information (OSTI.GOV)

Djaka, Komlan Senam; Villani, Aurelien; Taupin, Vincent

Spectral methods using Fast Fourier Transform (FFT) algorithms have recently seen a surge in interest in the mechanics of materials community. The present work addresses the critical question of determining accurate local mechanical fields using FFT methods without artificial fluctuations arising from materials and defects induced discontinuities. Precisely, this work introduces a numerical approach based on intrinsic discrete Fourier transforms for the simultaneous treatment of material discontinuities arising from the presence of dislocations and from elastic stiffness heterogeneities. To this end, the elasto-static equations of the field dislocation mechanics theory for periodic heterogeneous materials are numerically solved with FFT inmore » the case of dislocations in proximity of inclusions of varying stiffness. An optimal intrinsic discrete Fourier transform method is sought based on two distinct schemes. A centered finite difference scheme for differential rules are used for numerically solving the Poisson-type equation in the Fourier space, while centered finite differences on a rotated grid is chosen for the computation of the modified Fourier–Green’s operator associated with the Lippmann–Schwinger-type equation. By comparing different methods with analytical solutions for an edge dislocation in a composite material, it is found that the present spectral method is accurate, devoid of any numerical oscillation, and efficient even for an infinite phase elastic contrast like a hole embedded in a matrix containing a dislocation. The present FFT method is then used to simulate physical cases such as the elastic fields of dislocation dipoles located near the matrix/inclusion interface in a 2D composite material and the ones due to dislocation loop distributions surrounding cubic inclusions in 3D composite material. In these configurations, the spectral method allows investigating accurately the elastic interactions and image stresses due to dislocation fields in the presence of elastic inhomogeneities.« less

Field Dislocation Mechanics for heterogeneous elastic materials: A numerical spectral approach

DOE PAGES

Djaka, Komlan Senam; Villani, Aurelien; Taupin, Vincent; ...

2017-03-01

Spectral methods using Fast Fourier Transform (FFT) algorithms have recently seen a surge in interest in the mechanics of materials community. The present work addresses the critical question of determining accurate local mechanical fields using FFT methods without artificial fluctuations arising from materials and defects induced discontinuities. Precisely, this work introduces a numerical approach based on intrinsic discrete Fourier transforms for the simultaneous treatment of material discontinuities arising from the presence of dislocations and from elastic stiffness heterogeneities. To this end, the elasto-static equations of the field dislocation mechanics theory for periodic heterogeneous materials are numerically solved with FFT inmore » the case of dislocations in proximity of inclusions of varying stiffness. An optimal intrinsic discrete Fourier transform method is sought based on two distinct schemes. A centered finite difference scheme for differential rules are used for numerically solving the Poisson-type equation in the Fourier space, while centered finite differences on a rotated grid is chosen for the computation of the modified Fourier–Green’s operator associated with the Lippmann–Schwinger-type equation. By comparing different methods with analytical solutions for an edge dislocation in a composite material, it is found that the present spectral method is accurate, devoid of any numerical oscillation, and efficient even for an infinite phase elastic contrast like a hole embedded in a matrix containing a dislocation. The present FFT method is then used to simulate physical cases such as the elastic fields of dislocation dipoles located near the matrix/inclusion interface in a 2D composite material and the ones due to dislocation loop distributions surrounding cubic inclusions in 3D composite material. In these configurations, the spectral method allows investigating accurately the elastic interactions and image stresses due to dislocation fields in the presence of elastic inhomogeneities.« less

An efficient implementation of a high-order filter for a cubed-sphere spectral element model

NASA Astrophysics Data System (ADS)

Kang, Hyun-Gyu; Cheong, Hyeong-Bin

2017-03-01

A parallel-scalable, isotropic, scale-selective spatial filter was developed for the cubed-sphere spectral element model on the sphere. The filter equation is a high-order elliptic (Helmholtz) equation based on the spherical Laplacian operator, which is transformed into cubed-sphere local coordinates. The Laplacian operator is discretized on the computational domain, i.e., on each cell, by the spectral element method with Gauss-Lobatto Lagrange interpolating polynomials (GLLIPs) as the orthogonal basis functions. On the global domain, the discrete filter equation yielded a linear system represented by a highly sparse matrix. The density of this matrix increases quadratically (linearly) with the order of GLLIP (order of the filter), and the linear system is solved in only O (Ng) operations, where Ng is the total number of grid points. The solution, obtained by a row reduction method, demonstrated the typical accuracy and convergence rate of the cubed-sphere spectral element method. To achieve computational efficiency on parallel computers, the linear system was treated by an inverse matrix method (a sparse matrix-vector multiplication). The density of the inverse matrix was lowered to only a few times of the original sparse matrix without degrading the accuracy of the solution. For better computational efficiency, a local-domain high-order filter was introduced: The filter equation is applied to multiple cells, and then the central cell was only used to reconstruct the filtered field. The parallel efficiency of applying the inverse matrix method to the global- and local-domain filter was evaluated by the scalability on a distributed-memory parallel computer. The scale-selective performance of the filter was demonstrated on Earth topography. The usefulness of the filter as a hyper-viscosity for the vorticity equation was also demonstrated.

3D anisotropic modeling and identification for airborne EM systems based on the spectral-element method

NASA Astrophysics Data System (ADS)

Huang, Xin; Yin, Chang-Chun; Cao, Xiao-Yue; Liu, Yun-He; Zhang, Bo; Cai, Jing

2017-09-01

The airborne electromagnetic (AEM) method has a high sampling rate and survey flexibility. However, traditional numerical modeling approaches must use high-resolution physical grids to guarantee modeling accuracy, especially for complex geological structures such as anisotropic earth. This can lead to huge computational costs. To solve this problem, we propose a spectral-element (SE) method for 3D AEM anisotropic modeling, which combines the advantages of spectral and finite-element methods. Thus, the SE method has accuracy as high as that of the spectral method and the ability to model complex geology inherited from the finite-element method. The SE method can improve the modeling accuracy within discrete grids and reduce the dependence of modeling results on the grids. This helps achieve high-accuracy anisotropic AEM modeling. We first introduced a rotating tensor of anisotropic conductivity to Maxwell's equations and described the electrical field via SE basis functions based on GLL interpolation polynomials. We used the Galerkin weighted residual method to establish the linear equation system for the SE method, and we took a vertical magnetic dipole as the transmission source for our AEM modeling. We then applied fourth-order SE calculations with coarse physical grids to check the accuracy of our modeling results against a 1D semi-analytical solution for an anisotropic half-space model and verified the high accuracy of the SE. Moreover, we conducted AEM modeling for different anisotropic 3D abnormal bodies using two physical grid scales and three orders of SE to obtain the convergence conditions for different anisotropic abnormal bodies. Finally, we studied the identification of anisotropy for single anisotropic abnormal bodies, anisotropic surrounding rock, and single anisotropic abnormal body embedded in an anisotropic surrounding rock. This approach will play a key role in the inversion and interpretation of AEM data collected in regions with anisotropic geology.

A Deep Penetration Problem Calculation Using AETIUS:An Easy Modeling Discrete Ordinates Transport Code UsIng Unstructured Tetrahedral Mesh, Shared Memory Parallel

NASA Astrophysics Data System (ADS)

KIM, Jong Woon; LEE, Young-Ouk

2017-09-01

As computing power gets better and better, computer codes that use a deterministic method seem to be less useful than those using the Monte Carlo method. In addition, users do not like to think about space, angles, and energy discretization for deterministic codes. However, a deterministic method is still powerful in that we can obtain a solution of the flux throughout the problem, particularly as when particles can barely penetrate, such as in a deep penetration problem with small detection volumes. Recently, a new state-of-the-art discrete-ordinates code, ATTILA, was developed and has been widely used in several applications. ATTILA provides the capabilities to solve geometrically complex 3-D transport problems by using an unstructured tetrahedral mesh. Since 2009, we have been developing our own code by benchmarking ATTILA. AETIUS is a discrete ordinates code that uses an unstructured tetrahedral mesh such as ATTILA. For pre- and post- processing, Gmsh is used to generate an unstructured tetrahedral mesh by importing a CAD file (*.step) and visualizing the calculation results of AETIUS. Using a CAD tool, the geometry can be modeled very easily. In this paper, we describe a brief overview of AETIUS and provide numerical results from both AETIUS and a Monte Carlo code, MCNP5, in a deep penetration problem with small detection volumes. The results demonstrate the effectiveness and efficiency of AETIUS for such calculations.

Topology and layout optimization of discrete and continuum structures

NASA Technical Reports Server (NTRS)

Bendsoe, Martin P.; Kikuchi, Noboru

1993-01-01

The basic features of the ground structure method for truss structure an continuum problems are described. Problems with a large number of potential structural elements are considered using the compliance of the structure as the objective function. The design problem is the minimization of compliance for a given structural weight, and the design variables for truss problems are the cross-sectional areas of the individual truss members, while for continuum problems they are the variable densities of material in each of the elements of the FEM discretization. It is shown how homogenization theory can be applied to provide a relation between material density and the effective material properties of a periodic medium with a known microstructure of material and voids.

High-performance parallel analysis of coupled problems for aircraft propulsion

NASA Technical Reports Server (NTRS)

Felippa, C. A.; Farhat, C.; Lanteri, S.; Gumaste, U.; Ronaghi, M.

1994-01-01

Applications are described of high-performance parallel, computation for the analysis of complete jet engines, considering its multi-discipline coupled problem. The coupled problem involves interaction of structures with gas dynamics, heat conduction and heat transfer in aircraft engines. The methodology issues addressed include: consistent discrete formulation of coupled problems with emphasis on coupling phenomena; effect of partitioning strategies, augmentation and temporal solution procedures; sensitivity of response to problem parameters; and methods for interfacing multiscale discretizations in different single fields. The computer implementation issues addressed include: parallel treatment of coupled systems; domain decomposition and mesh partitioning strategies; data representation in object-oriented form and mapping to hardware driven representation, and tradeoff studies between partitioning schemes and fully coupled treatment.

Discrete Regularization for Calibration of Geologic Facies Against Dynamic Flow Data

NASA Astrophysics Data System (ADS)

Khaninezhad, Mohammad-Reza; Golmohammadi, Azarang; Jafarpour, Behnam

2018-04-01

Subsurface flow model calibration involves many more unknowns than measurements, leading to ill-posed problems with nonunique solutions. To alleviate nonuniqueness, the problem is regularized by constraining the solution space using prior knowledge. In certain sedimentary environments, such as fluvial systems, the contrast in hydraulic properties of different facies types tends to dominate the flow and transport behavior, making the effect of within facies heterogeneity less significant. Hence, flow model calibration in those formations reduces to delineating the spatial structure and connectivity of different lithofacies types and their boundaries. A major difficulty in calibrating such models is honoring the discrete, or piecewise constant, nature of facies distribution. The problem becomes more challenging when complex spatial connectivity patterns with higher-order statistics are involved. This paper introduces a novel formulation for calibration of complex geologic facies by imposing appropriate constraints to recover plausible solutions that honor the spatial connectivity and discreteness of facies models. To incorporate prior connectivity patterns, plausible geologic features are learned from available training models. This is achieved by learning spatial patterns from training data, e.g., k-SVD sparse learning or the traditional Principal Component Analysis. Discrete regularization is introduced as a penalty functions to impose solution discreteness while minimizing the mismatch between observed and predicted data. An efficient gradient-based alternating directions algorithm is combined with variable splitting to minimize the resulting regularized nonlinear least squares objective function. Numerical results show that imposing learned facies connectivity and discreteness as regularization functions leads to geologically consistent solutions that improve facies calibration quality.

Crown-level tree species classification from AISA hyperspectral imagery using an innovative pixel-weighting approach

NASA Astrophysics Data System (ADS)

Liu, Haijian; Wu, Changshan

2018-06-01

Crown-level tree species classification is a challenging task due to the spectral similarity among different tree species. Shadow, underlying objects, and other materials within a crown may decrease the purity of extracted crown spectra and further reduce classification accuracy. To address this problem, an innovative pixel-weighting approach was developed for tree species classification at the crown level. The method utilized high density discrete LiDAR data for individual tree delineation and Airborne Imaging Spectrometer for Applications (AISA) hyperspectral imagery for pure crown-scale spectra extraction. Specifically, three steps were included: 1) individual tree identification using LiDAR data, 2) pixel-weighted representative crown spectra calculation using hyperspectral imagery, with which pixel-based illuminated-leaf fractions estimated using a linear spectral mixture analysis (LSMA) were employed as weighted factors, and 3) representative spectra based tree species classification was performed through applying a support vector machine (SVM) approach. Analysis of results suggests that the developed pixel-weighting approach (OA = 82.12%, Kc = 0.74) performed better than treetop-based (OA = 70.86%, Kc = 0.58) and pixel-majority methods (OA = 72.26, Kc = 0.62) in terms of classification accuracy. McNemar tests indicated the differences in accuracy between pixel-weighting and treetop-based approaches as well as that between pixel-weighting and pixel-majority approaches were statistically significant.

Uncertainty propagation in orbital mechanics via tensor decomposition

NASA Astrophysics Data System (ADS)

Sun, Yifei; Kumar, Mrinal

2016-03-01

Uncertainty forecasting in orbital mechanics is an essential but difficult task, primarily because the underlying Fokker-Planck equation (FPE) is defined on a relatively high dimensional (6-D) state-space and is driven by the nonlinear perturbed Keplerian dynamics. In addition, an enormously large solution domain is required for numerical solution of this FPE (e.g. encompassing the entire orbit in the x-y-z subspace), of which the state probability density function (pdf) occupies a tiny fraction at any given time. This coupling of large size, high dimensionality and nonlinearity makes for a formidable computational task, and has caused the FPE for orbital uncertainty propagation to remain an unsolved problem. To the best of the authors' knowledge, this paper presents the first successful direct solution of the FPE for perturbed Keplerian mechanics. To tackle the dimensionality issue, the time-varying state pdf is approximated in the CANDECOMP/PARAFAC decomposition tensor form where all the six spatial dimensions as well as the time dimension are separated from one other. The pdf approximation for all times is obtained simultaneously via the alternating least squares algorithm. Chebyshev spectral differentiation is employed for discretization on account of its spectral ("super-fast") convergence rate. To facilitate the tensor decomposition and control the solution domain size, system dynamics is expressed using spherical coordinates in a noninertial reference frame. Numerical results obtained on a regular personal computer are compared with Monte Carlo simulations.

Solution of electromagnetic scattering and radiation problems using a spectral domain approach - A review

NASA Technical Reports Server (NTRS)

Mittra, R.; Ko, W. L.; Rahmat-Samii, Y.

1979-01-01

This paper presents a brief review of some recent developments on the use of the spectral-domain approach for deriving high-frequency solutions to electromagnetics scattering and radiation problems. The spectral approach is not only useful for interpreting the well-known Keller formulas based on the geometrical theory of diffraction (GTD), it can also be employed for verifying the accuracy of GTD and other asymptotic solutions and systematically improving the results when such improvements are needed. The problem of plane wave diffraction by a finite screen or a strip is presented as an example of the application of the spectral-domain approach.

An Algorithm for the Mixed Transportation Network Design Problem

PubMed Central

Liu, Xinyu; Chen, Qun

2016-01-01

This paper proposes an optimization algorithm, the dimension-down iterative algorithm (DDIA), for solving a mixed transportation network design problem (MNDP), which is generally expressed as a mathematical programming with equilibrium constraint (MPEC). The upper level of the MNDP aims to optimize the network performance via both the expansion of the existing links and the addition of new candidate links, whereas the lower level is a traditional Wardrop user equilibrium (UE) problem. The idea of the proposed solution algorithm (DDIA) is to reduce the dimensions of the problem. A group of variables (discrete/continuous) is fixed to optimize another group of variables (continuous/discrete) alternately; then, the problem is transformed into solving a series of CNDPs (continuous network design problems) and DNDPs (discrete network design problems) repeatedly until the problem converges to the optimal solution. The advantage of the proposed algorithm is that its solution process is very simple and easy to apply. Numerical examples show that for the MNDP without budget constraint, the optimal solution can be found within a few iterations with DDIA. For the MNDP with budget constraint, however, the result depends on the selection of initial values, which leads to different optimal solutions (i.e., different local optimal solutions). Some thoughts are given on how to derive meaningful initial values, such as by considering the budgets of new and reconstruction projects separately. PMID:27626803

An excitation wavelength-scanning spectral imaging system for preclinical imaging

NASA Astrophysics Data System (ADS)

Leavesley, Silas; Jiang, Yanan; Patsekin, Valery; Rajwa, Bartek; Robinson, J. Paul

2008-02-01

Small-animal fluorescence imaging is a rapidly growing field, driven by applications in cancer detection and pharmaceutical therapies. However, the practical use of this imaging technology is limited by image-quality issues related to autofluorescence background from animal tissues, as well as attenuation of the fluorescence signal due to scatter and absorption. To combat these problems, spectral imaging and analysis techniques are being employed to separate the fluorescence signal from background autofluorescence. To date, these technologies have focused on detecting the fluorescence emission spectrum at a fixed excitation wavelength. We present an alternative to this technique, an imaging spectrometer that detects the fluorescence excitation spectrum at a fixed emission wavelength. The advantages of this approach include increased available information for discrimination of fluorescent dyes, decreased optical radiation dose to the animal, and ability to scan a continuous wavelength range instead of discrete wavelength sampling. This excitation-scanning imager utilizes an acousto-optic tunable filter (AOTF), with supporting optics, to scan the excitation spectrum. Advanced image acquisition and analysis software has also been developed for classification and unmixing of the spectral image sets. Filtering has been implemented in a single-pass configuration with a bandwidth (full width at half maximum) of 16nm at 550nm central diffracted wavelength. We have characterized AOTF filtering over a wide range of incident light angles, much wider than has been previously reported in the literature, and we show how changes in incident light angle can be used to attenuate AOTF side lobes and alter bandwidth. A new parameter, in-band to out-of-band ratio, was defined to assess the quality of the filtered excitation light. Additional parameters were measured to allow objective characterization of the AOTF and the imager as a whole. This is necessary for comparing the excitation-scanning imager to other spectral and fluorescence imaging technologies. The effectiveness of the hyperspectral imager was tested by imaging and analysis of mice with injected fluorescent dyes. Finally, a discussion of the optimization of spectral fluorescence imagers is given, relating the effects of filter quality on fluorescence images collected and the analysis outcome.

A data driven control method for structure vibration suppression

NASA Astrophysics Data System (ADS)

Xie, Yangmin; Wang, Chao; Shi, Hang; Shi, Junwei

2018-02-01

High radio-frequency space applications have motivated continuous research on vibration suppression of large space structures both in academia and industry. This paper introduces a novel data driven control method to suppress vibrations of flexible structures and experimentally validates the suppression performance. Unlike model-based control approaches, the data driven control method designs a controller directly from the input-output test data of the structure, without requiring parametric dynamics and hence free of system modeling. It utilizes the discrete frequency response via spectral analysis technique and formulates a non-convex optimization problem to obtain optimized controller parameters with a predefined controller structure. Such approach is then experimentally applied on an end-driving flexible beam-mass structure. The experiment results show that the presented method can achieve competitive disturbance rejections compared to a model-based mixed sensitivity controller under the same design criterion but with much less orders and design efforts, demonstrating the proposed data driven control is an effective approach for vibration suppression of flexible structures.

A Robust Image Watermarking in the Joint Time-Frequency Domain

NASA Astrophysics Data System (ADS)

Öztürk, Mahmut; Akan, Aydın; Çekiç, Yalçın

2010-12-01

With the rapid development of computers and internet applications, copyright protection of multimedia data has become an important problem. Watermarking techniques are proposed as a solution to copyright protection of digital media files. In this paper, a new, robust, and high-capacity watermarking method that is based on spatiofrequency (SF) representation is presented. We use the discrete evolutionary transform (DET) calculated by the Gabor expansion to represent an image in the joint SF domain. The watermark is embedded onto selected coefficients in the joint SF domain. Hence, by combining the advantages of spatial and spectral domain watermarking methods, a robust, invisible, secure, and high-capacity watermarking method is presented. A correlation-based detector is also proposed to detect and extract any possible watermarks on an image. The proposed watermarking method was tested on some commonly used test images under different signal processing attacks like additive noise, Wiener and Median filtering, JPEG compression, rotation, and cropping. Simulation results show that our method is robust against all of the attacks.

Stochastic Spectral Descent for Discrete Graphical Models

DOE PAGES

Carlson, David; Hsieh, Ya-Ping; Collins, Edo; ...

2015-12-14

Interest in deep probabilistic graphical models has in-creased in recent years, due to their state-of-the-art performance on many machine learning applications. Such models are typically trained with the stochastic gradient method, which can take a significant number of iterations to converge. Since the computational cost of gradient estimation is prohibitive even for modestly sized models, training becomes slow and practically usable models are kept small. In this paper we propose a new, largely tuning-free algorithm to address this problem. Our approach derives novel majorization bounds based on the Schatten- norm. Intriguingly, the minimizers of these bounds can be interpreted asmore » gradient methods in a non-Euclidean space. We thus propose using a stochastic gradient method in non-Euclidean space. We both provide simple conditions under which our algorithm is guaranteed to converge, and demonstrate empirically that our algorithm leads to dramatically faster training and improved predictive ability compared to stochastic gradient descent for both directed and undirected graphical models.« less

Numerical approximation for the infinite-dimensional discrete-time optimal linear-quadratic regulator problem

NASA Technical Reports Server (NTRS)

Gibson, J. S.; Rosen, I. G.

1986-01-01

An abstract approximation framework is developed for the finite and infinite time horizon discrete-time linear-quadratic regulator problem for systems whose state dynamics are described by a linear semigroup of operators on an infinite dimensional Hilbert space. The schemes included the framework yield finite dimensional approximations to the linear state feedback gains which determine the optimal control law. Convergence arguments are given. Examples involving hereditary and parabolic systems and the vibration of a flexible beam are considered. Spline-based finite element schemes for these classes of problems, together with numerical results, are presented and discussed.

Spectrally-Invariant Approximation Within Atmospheric Radiative Transfer

NASA Technical Reports Server (NTRS)

Marshak, A.; Knyazikhin, Y.; Chiu, J. C.; Wiscombe, W. J.

2011-01-01

Certain algebraic combinations of single scattering albedo and solar radiation reflected from, or transmitted through, vegetation canopies do not vary with wavelength. These "spectrally invariant relationships" are the consequence of wavelength independence of the extinction coefficient and scattering phase function in vegetation. In general, this wavelength independence does not hold in the atmosphere, but in clouddominated atmospheres the total extinction and total scattering phase function vary only weakly with wavelength. This paper identifies the atmospheric conditions under which the spectrally invariant approximation can accurately describe the extinction. and scattering properties of cloudy atmospheres. The validity of the assumptions and the accuracy of the approximation are tested with ID radiative transfer calculations using publicly available radiative transfer models: Discrete Ordinate Radiative Transfer (DISORT) and Santa Barbara DISORT Atmospheric Radiative Transfer (SBDART). It is shown for cloudy atmospheres with cloud optical depth above 3, and for spectral intervals that exclude strong water vapor absorption, that the spectrally invariant relationships found in vegetation canopy radiative transfer are valid to better than 5%. The physics behind this phenomenon, its mathematical basis, and possible applications to remote sensing and climate are discussed.

Analysis of hyperspectral fluorescence images for poultry skin tumor inspection

NASA Astrophysics Data System (ADS)

Kong, Seong G.; Chen, Yud-Ren; Kim, Intaek; Kim, Moon S.

2004-02-01

We present a hyperspectral fluorescence imaging system with a fuzzy inference scheme for detecting skin tumors on poultry carcasses. Hyperspectral images reveal spatial and spectral information useful for finding pathological lesions or contaminants on agricultural products. Skin tumors are not obvious because the visual signature appears as a shape distortion rather than a discoloration. Fluorescence imaging allows the visualization of poultry skin tumors more easily than reflectance. The hyperspectral image samples obtained for this poultry tumor inspection contain 65 spectral bands of fluorescence in the visible region of the spectrum at wavelengths ranging from 425 to 711 nm. The large amount of hyperspectral image data is compressed by use of a discrete wavelet transform in the spatial domain. Principal-component analysis provides an effective compressed representation of the spectral signal of each pixel in the spectral domain. A small number of significant features are extracted from two major spectral peaks of relative fluorescence intensity that have been identified as meaningful spectral bands for detecting tumors. A fuzzy inference scheme that uses a small number of fuzzy rules and Gaussian membership functions successfully detects skin tumors on poultry carcasses. Spatial-filtering techniques are used to significantly reduce false positives.

The existence of semiregular solutions to elliptic spectral problems with discontinuous nonlinearities

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pavlenko, V N; Potapov, D K

2015-09-30

This paper is concerned with the existence of semiregular solutions to the Dirichlet problem for an equation of elliptic type with discontinuous nonlinearity and when the differential operator is not assumed to be formally self-adjoint. Theorems on the existence of semiregular (positive and negative) solutions for the problem under consideration are given, and a principle of upper and lower solutions giving the existence of semiregular solutions is established. For positive values of the spectral parameter, elliptic spectral problems with discontinuous nonlinearities are shown to have nontrivial semiregular (positive and negative) solutions. Bibliography: 32 titles.

Discrete return lidar-based prediction of leaf area index in two conifer forests

Treesearch

Jennifer L. R. Jensen; Karen S. Humes; Lee A. Vierling; Andrew T. Hudak

2008-01-01

Leaf area index (LAI) is a key forest structural characteristic that serves as a primary control for exchanges of mass and energy within a vegetated ecosystem. Most previous attempts to estimate LAI from remotely sensed data have relied on empirical relationships between field-measured observations and various spectral vegetation indices (SVIs) derived from optical...

Localization on Quantum Graphs with Random Vertex Couplings

NASA Astrophysics Data System (ADS)

Klopp, Frédéric; Pankrashkin, Konstantin

2008-05-01

We consider Schrödinger operators on a class of periodic quantum graphs with randomly distributed Kirchhoff coupling constants at all vertices. We obtain necessary conditions for localization on quantum graphs in terms of finite volume criteria for some energy-dependent discrete Hamiltonians. These conditions hold in the strong disorder limit and at the spectral edges.

Discrete is it enough? The revival of Piola-Hencky keynotes to analyze three-dimensional Elastica

NASA Astrophysics Data System (ADS)

Turco, Emilio

2018-04-01

Complex problems such as those concerning the mechanics of materials can be confronted only by considering numerical simulations. Analytical methods are useful to build guidelines or reference solutions but, for general cases of technical interest, they have to be solved numerically, especially in the case of large displacements and deformations. Probably continuous models arose for producing inspiring examples and stemmed from homogenization techniques. These techniques allowed for the solution of some paradigmatic examples but, in general, always require a discretization method for solving problems dictated by the applications. Therefore, and also by taking into account that computing powers are nowadays more largely available and cheap, the question arises: why not using directly a discrete model for 3D beams? In other words, it could be interesting to formulate a discrete model without using an intermediate continuum one, as this last, at the end, has to be discretized in any case. These simple considerations immediately evoke some very basic models developed many years ago when the computing powers were practically inexistent but the problem of finding simple solutions to beam deformation problem was already an emerging one. Actually, in recent years, the keynotes of Hencky and Piola attracted a renewed attention [see, one for all, the work (Turco et al. in Zeitschrift für Angewandte Mathematik und Physik 67(4):1-28, 2016)]: generalizing their results, in the present paper, a novel directly discrete three-dimensional beam model is presented and discussed, in the framework of geometrically nonlinear analysis. Using a stepwise algorithm based essentially on Newton's method to compute the extrapolations and on the Riks' arc-length method to perform the corrections, we could obtain some numerical simulations showing the computational effectiveness of presented model: Indeed, it presents a convenient balance between accuracy and computational cost.

Simulation Model for Scenario Optimization of the Ready-Mix Concrete Delivery Problem

NASA Astrophysics Data System (ADS)

Galić, Mario; Kraus, Ivan

2016-12-01

This paper introduces a discrete simulation model for solving routing and network material flow problems in construction projects. Before the description of the model a detailed literature review is provided. The model is verified using a case study of solving the ready-mix concrete network flow and routing problem in metropolitan area in Croatia. Within this study real-time input parameters were taken into account. Simulation model is structured in Enterprise Dynamics simulation software and Microsoft Excel linked with Google Maps. The model is dynamic, easily managed and adjustable, but also provides good estimation for minimization of costs and realization time in solving discrete routing and material network flow problems.

Discrete-time entropy formulation of optimal and adaptive control problems

NASA Technical Reports Server (NTRS)

Tsai, Yweting A.; Casiello, Francisco A.; Loparo, Kenneth A.

1992-01-01

The discrete-time version of the entropy formulation of optimal control of problems developed by G. N. Saridis (1988) is discussed. Given a dynamical system, the uncertainty in the selection of the control is characterized by the probability distribution (density) function which maximizes the total entropy. The equivalence between the optimal control problem and the optimal entropy problem is established, and the total entropy is decomposed into a term associated with the certainty equivalent control law, the entropy of estimation, and the so-called equivocation of the active transmission of information from the controller to the estimator. This provides a useful framework for studying the certainty equivalent and adaptive control laws.

Spectral analysis of two-signed microarray expression data.

PubMed

Higham, Desmond J; Kalna, Gabriela; Vass, J Keith

2007-06-01

We give a simple and informative derivation of a spectral algorithm for clustering and reordering complementary DNA microarray expression data. Here, expression levels of a set of genes are recorded simultaneously across a number of samples, with a positive weight reflecting up-regulation and a negative weight reflecting down-regulation. We give theoretical support for the algorithm based on a biologically justified hypothesis about the structure of the data, and illustrate its use on public domain data in the context of unsupervised tumour classification. The algorithm is derived by considering a discrete optimization problem and then relaxing to the continuous realm. We prove that in the case where the data have an inherent 'checkerboard' sign pattern, the algorithm will automatically reveal that pattern. Further, our derivation shows that the algorithm may be regarded as imposing a random graph model on the expression levels and then clustering from a maximum likelihood perspective. This indicates that the output will be tolerant to perturbations and will reveal 'near-checkerboard' patterns when these are present in the data. It is interesting to note that the checkerboard structure is revealed by the first (dominant) singular vectors--previous work on spectral methods has focussed on the case of nonnegative edge weights, where only the second and higher singular vectors are relevant. We illustrate the algorithm on real and synthetic data, and then use it in a tumour classification context on three different cancer data sets. Our results show that respecting the two-signed nature of the data (thereby distinguishing between up-regulation and down-regulation) reveals structures that cannot be gleaned from the absolute value data (where up- and down-regulation are both regarded as 'changes').

TH-AB-BRA-09: Stability Analysis of a Novel Dose Calculation Algorithm for MRI Guided Radiotherapy

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zelyak, O; Fallone, B; Cross Cancer Institute, Edmonton, AB

2016-06-15

Purpose: To determine the iterative deterministic solution stability of the Linear Boltzmann Transport Equation (LBTE) in the presence of magnetic fields. Methods: The LBTE with magnetic fields under investigation is derived using a discrete ordinates approach. The stability analysis is performed using analytical and numerical methods. Analytically, the spectral Fourier analysis is used to obtain the convergence rate of the source iteration procedures based on finding the largest eigenvalue of the iterative operator. This eigenvalue is a function of relevant physical parameters, such as magnetic field strength and material properties, and provides essential information about the domain of applicability requiredmore » for clinically optimal parameter selection and maximum speed of convergence. The analytical results are reinforced by numerical simulations performed using the same discrete ordinates method in angle, and a discontinuous finite element spatial approach. Results: The spectral radius for the source iteration technique of the time independent transport equation with isotropic and anisotropic scattering centers inside infinite 3D medium is equal to the ratio of differential and total cross sections. The result is confirmed numerically by solving LBTE and is in full agreement with previously published results. The addition of magnetic field reveals that the convergence becomes dependent on the strength of magnetic field, the energy group discretization, and the order of anisotropic expansion. Conclusion: The source iteration technique for solving the LBTE with magnetic fields with the discrete ordinates method leads to divergent solutions in the limiting cases of small energy discretizations and high magnetic field strengths. Future investigations into non-stationary Krylov subspace techniques as an iterative solver will be performed as this has been shown to produce greater stability than source iteration. Furthermore, a stability analysis of a discontinuous finite element space-angle approach (which has been shown to provide the greatest stability) will also be investigated. Dr. B Gino Fallone is a co-founder and CEO of MagnetTx Oncology Solutions (under discussions to license Alberta bi-planar linac MR for commercialization)« less

Discrete Particle Swarm Optimization Routing Protocol for Wireless Sensor Networks with Multiple Mobile Sinks.

PubMed

Yang, Jin; Liu, Fagui; Cao, Jianneng; Wang, Liangming

2016-07-14

Mobile sinks can achieve load-balancing and energy-consumption balancing across the wireless sensor networks (WSNs). However, the frequent change of the paths between source nodes and the sinks caused by sink mobility introduces significant overhead in terms of energy and packet delays. To enhance network performance of WSNs with mobile sinks (MWSNs), we present an efficient routing strategy, which is formulated as an optimization problem and employs the particle swarm optimization algorithm (PSO) to build the optimal routing paths. However, the conventional PSO is insufficient to solve discrete routing optimization problems. Therefore, a novel greedy discrete particle swarm optimization with memory (GMDPSO) is put forward to address this problem. In the GMDPSO, particle's position and velocity of traditional PSO are redefined under discrete MWSNs scenario. Particle updating rule is also reconsidered based on the subnetwork topology of MWSNs. Besides, by improving the greedy forwarding routing, a greedy search strategy is designed to drive particles to find a better position quickly. Furthermore, searching history is memorized to accelerate convergence. Simulation results demonstrate that our new protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption.

Methods for spectral image analysis by exploiting spatial simplicity

DOEpatents

Keenan, Michael R.

2010-05-25

Several full-spectrum imaging techniques have been introduced in recent years that promise to provide rapid and comprehensive chemical characterization of complex samples. One of the remaining obstacles to adopting these techniques for routine use is the difficulty of reducing the vast quantities of raw spectral data to meaningful chemical information. Multivariate factor analysis techniques, such as Principal Component Analysis and Alternating Least Squares-based Multivariate Curve Resolution, have proven effective for extracting the essential chemical information from high dimensional spectral image data sets into a limited number of components that describe the spectral characteristics and spatial distributions of the chemical species comprising the sample. There are many cases, however, in which those constraints are not effective and where alternative approaches may provide new analytical insights. For many cases of practical importance, imaged samples are "simple" in the sense that they consist of relatively discrete chemical phases. That is, at any given location, only one or a few of the chemical species comprising the entire sample have non-zero concentrations. The methods of spectral image analysis of the present invention exploit this simplicity in the spatial domain to make the resulting factor models more realistic. Therefore, more physically accurate and interpretable spectral and abundance components can be extracted from spectral images that have spatially simple structure.

Methods for spectral image analysis by exploiting spatial simplicity

DOEpatents

Keenan, Michael R.

2010-11-23

Several full-spectrum imaging techniques have been introduced in recent years that promise to provide rapid and comprehensive chemical characterization of complex samples. One of the remaining obstacles to adopting these techniques for routine use is the difficulty of reducing the vast quantities of raw spectral data to meaningful chemical information. Multivariate factor analysis techniques, such as Principal Component Analysis and Alternating Least Squares-based Multivariate Curve Resolution, have proven effective for extracting the essential chemical information from high dimensional spectral image data sets into a limited number of components that describe the spectral characteristics and spatial distributions of the chemical species comprising the sample. There are many cases, however, in which those constraints are not effective and where alternative approaches may provide new analytical insights. For many cases of practical importance, imaged samples are "simple" in the sense that they consist of relatively discrete chemical phases. That is, at any given location, only one or a few of the chemical species comprising the entire sample have non-zero concentrations. The methods of spectral image analysis of the present invention exploit this simplicity in the spatial domain to make the resulting factor models more realistic. Therefore, more physically accurate and interpretable spectral and abundance components can be extracted from spectral images that have spatially simple structure.

Geometrical calibration of an AOTF hyper-spectral imaging system

NASA Astrophysics Data System (ADS)

Špiclin, Žiga; Katrašnik, Jaka; Bürmen, Miran; Pernuš, Franjo; Likar, Boštjan

2010-02-01

Optical aberrations present an important problem in optical measurements. Geometrical calibration of an imaging system is therefore of the utmost importance for achieving accurate optical measurements. In hyper-spectral imaging systems, the problem of optical aberrations is even more pronounced because optical aberrations are wavelength dependent. Geometrical calibration must therefore be performed over the entire spectral range of the hyper-spectral imaging system, which is usually far greater than that of the visible light spectrum. This problem is especially adverse in AOTF (Acousto- Optic Tunable Filter) hyper-spectral imaging systems, as the diffraction of light in AOTF filters is dependent on both wavelength and angle of incidence. Geometrical calibration of hyper-spectral imaging system was performed by stable caliber of known dimensions, which was imaged at different wavelengths over the entire spectral range. The acquired images were then automatically registered to the caliber model by both parametric and nonparametric transformation based on B-splines and by minimizing normalized correlation coefficient. The calibration method was tested on an AOTF hyper-spectral imaging system in the near infrared spectral range. The results indicated substantial wavelength dependent optical aberration that is especially pronounced in the spectral range closer to the infrared part of the spectrum. The calibration method was able to accurately characterize the aberrations and produce transformations for efficient sub-pixel geometrical calibration over the entire spectral range, finally yielding better spatial resolution of hyperspectral imaging system.

An adjoint view on flux consistency and strong wall boundary conditions to the Navier–Stokes equations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Stück, Arthur, E-mail: arthur.stueck@dlr.de

2015-11-15

Inconsistent discrete expressions in the boundary treatment of Navier–Stokes solvers and in the definition of force objective functionals can lead to discrete-adjoint boundary treatments that are not a valid representation of the boundary conditions to the corresponding adjoint partial differential equations. The underlying problem is studied for an elementary 1D advection–diffusion problem first using a node-centred finite-volume discretisation. The defect of the boundary operators in the inconsistently defined discrete-adjoint problem leads to oscillations and becomes evident with the additional insight of the continuous-adjoint approach. A homogenisation of the discretisations for the primal boundary treatment and the force objective functional yieldsmore » second-order functional accuracy and eliminates the defect in the discrete-adjoint boundary treatment. Subsequently, the issue is studied for aerodynamic Reynolds-averaged Navier–Stokes problems in conjunction with a standard finite-volume discretisation on median-dual grids and a strong implementation of noslip walls, found in many unstructured general-purpose flow solvers. Going out from a base-line discretisation of force objective functionals which is independent of the boundary treatment in the flow solver, two improved flux-consistent schemes are presented; based on either body wall-defined or farfield-defined control-volumes they resolve the dual inconsistency. The behaviour of the schemes is investigated on a sequence of grids in 2D and 3D.« less

Dynamical Localization for Discrete and Continuous Random Schrödinger Operators

NASA Astrophysics Data System (ADS)

Germinet, F.; De Bièvre, S.

We show for a large class of random Schrödinger operators Ho on and on that dynamical localization holds, i.e. that, with probability one, for a suitable energy interval I and for q a positive real, Here ψ is a function of sufficiently rapid decrease, and PI(Ho) is the spectral projector of Ho corresponding to the interval I. The result is obtained through the control of the decay of the eigenfunctions of Ho and covers, in the discrete case, the Anderson tight-binding model with Bernoulli potential (dimension ν = 1) or singular potential (ν > 1), and in the continuous case Anderson as well as random Landau Hamiltonians.

A FFT-based formulation for discrete dislocation dynamics in heterogeneous media

NASA Astrophysics Data System (ADS)

Bertin, N.; Capolungo, L.

2018-02-01

In this paper, an extension of the DDD-FFT approach presented in [1] is developed for heterogeneous elasticity. For such a purpose, an iterative spectral formulation in which convolutions are calculated in the Fourier space is developed to solve for the mechanical state associated with the discrete eigenstrain-based microstructural representation. With this, the heterogeneous DDD-FFT approach is capable of treating anisotropic and heterogeneous elasticity in a computationally efficient manner. In addition, a GPU implementation is presented to allow for further acceleration. As a first example, the approach is used to investigate the interaction between dislocations and second-phase particles, thereby demonstrating its ability to inherently incorporate image forces arising from elastic inhomogeneities.

Online frequency estimation with applications to engine and generator sets

NASA Astrophysics Data System (ADS)

Manngård, Mikael; Böling, Jari M.

2017-07-01

Frequency and spectral analysis based on the discrete Fourier transform is a fundamental task in signal processing and machine diagnostics. This paper aims at presenting computationally efficient methods for real-time estimation of stationary and time-varying frequency components in signals. A brief survey of the sliding time window discrete Fourier transform and Goertzel filter is presented, and two filter banks consisting of: (i) sliding time window Goertzel filters (ii) infinite impulse response narrow bandpass filters are proposed for estimating instantaneous frequencies. The proposed methods show excellent results on both simulation studies and on a case study using angular speed data measurements of the crankshaft of a marine diesel engine-generator set.

Comprehensive Benchmark Suite for Simulation of Particle Laden Flows Using the Discrete Element Method with Performance Profiles from the Multiphase Flow with Interface eXchanges (MFiX) Code

DOE Office of Scientific and Technical Information (OSTI.GOV)

Liu, Peiyuan; Brown, Timothy; Fullmer, William D.

Five benchmark problems are developed and simulated with the computational fluid dynamics and discrete element model code MFiX. The benchmark problems span dilute and dense regimes, consider statistically homogeneous and inhomogeneous (both clusters and bubbles) particle concentrations and a range of particle and fluid dynamic computational loads. Several variations of the benchmark problems are also discussed to extend the computational phase space to cover granular (particles only), bidisperse and heat transfer cases. A weak scaling analysis is performed for each benchmark problem and, in most cases, the scalability of the code appears reasonable up to approx. 103 cores. Profiling ofmore » the benchmark problems indicate that the most substantial computational time is being spent on particle-particle force calculations, drag force calculations and interpolating between discrete particle and continuum fields. Hardware performance analysis was also carried out showing significant Level 2 cache miss ratios and a rather low degree of vectorization. These results are intended to serve as a baseline for future developments to the code as well as a preliminary indicator of where to best focus performance optimizations.« less

Denoising embolic Doppler ultrasound signals using Dual Tree Complex Discrete Wavelet Transform.

PubMed

Serbes, Gorkem; Aydin, Nizamettin

2010-01-01

Early and accurate detection of asymptomatic emboli is important for monitoring of preventive therapy in stroke-prone patients. One of the problems in detection of emboli is the identification of an embolic signal caused by very small emboli. The amplitude of the embolic signal may be so small that advanced processing methods are required to distinguish these signals from Doppler signals arising from red blood cells. In this study instead of conventional discrete wavelet transform, the Dual Tree Complex Discrete Wavelet Transform was used for denoising embolic signals. Performances of both approaches were compared. Unlike the conventional discrete wavelet transform discrete complex wavelet transform is a shift invariant transform with limited redundancy. Results demonstrate that the Dual Tree Complex Discrete Wavelet Transform based denoising outperforms conventional discrete wavelet denoising. Approximately 8 dB improvement is obtained by using the Dual Tree Complex Discrete Wavelet Transform compared to the improvement provided by the conventional Discrete Wavelet Transform (less than 5 dB).

Peridynamics with LAMMPS : a user guide.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lehoucq, Richard B.; Silling, Stewart Andrew; Plimpton, Steven James

2008-01-01

Peridynamics is a nonlocal formulation of continuum mechanics. The discrete peridynamic model has the same computational structure as a molecular dynamic model. This document details the implementation of a discrete peridynamic model within the LAMMPS molecular dynamic code. This document provides a brief overview of the peridynamic model of a continuum, then discusses how the peridynamic model is discretized, and overviews the LAMMPS implementation. A nontrivial example problem is also included.

Convex relaxations of spectral sparsity for robust super-resolution and line spectrum estimation

NASA Astrophysics Data System (ADS)

Chi, Yuejie

2017-08-01

We consider recovering the amplitudes and locations of spikes in a point source signal from its low-pass spectrum that may suffer from missing data and arbitrary outliers. We first review and provide a unified view of several recently proposed convex relaxations that characterize and capitalize the spectral sparsity of the point source signal without discretization under the framework of atomic norms. Next we propose a new algorithm when the spikes are known a priori to be positive, motivated by applications such as neural spike sorting and fluorescence microscopy imaging. Numerical experiments are provided to demonstrate the effectiveness of the proposed approach.

Numerical integration techniques for curved-element discretizations of molecule-solvent interfaces.

PubMed

Bardhan, Jaydeep P; Altman, Michael D; Willis, David J; Lippow, Shaun M; Tidor, Bruce; White, Jacob K

2007-07-07

Surface formulations of biophysical modeling problems offer attractive theoretical and computational properties. Numerical simulations based on these formulations usually begin with discretization of the surface under consideration; often, the surface is curved, possessing complicated structure and possibly singularities. Numerical simulations commonly are based on approximate, rather than exact, discretizations of these surfaces. To assess the strength of the dependence of simulation accuracy on the fidelity of surface representation, here methods were developed to model several important surface formulations using exact surface discretizations. Following and refining Zauhar's work [J. Comput.-Aided Mol. Des. 9, 149 (1995)], two classes of curved elements were defined that can exactly discretize the van der Waals, solvent-accessible, and solvent-excluded (molecular) surfaces. Numerical integration techniques are presented that can accurately evaluate nonsingular and singular integrals over these curved surfaces. After validating the exactness of the surface discretizations and demonstrating the correctness of the presented integration methods, a set of calculations are presented that compare the accuracy of approximate, planar-triangle-based discretizations and exact, curved-element-based simulations of surface-generalized-Born (sGB), surface-continuum van der Waals (scvdW), and boundary-element method (BEM) electrostatics problems. Results demonstrate that continuum electrostatic calculations with BEM using curved elements, piecewise-constant basis functions, and centroid collocation are nearly ten times more accurate than planar-triangle BEM for basis sets of comparable size. The sGB and scvdW calculations give exceptional accuracy even for the coarsest obtainable discretized surfaces. The extra accuracy is attributed to the exact representation of the solute-solvent interface; in contrast, commonly used planar-triangle discretizations can only offer improved approximations with increasing discretization and associated increases in computational resources. The results clearly demonstrate that the methods for approximate integration on an exact geometry are far more accurate than exact integration on an approximate geometry. A MATLAB implementation of the presented integration methods and sample data files containing curved-element discretizations of several small molecules are available online as supplemental material.

Spectral simplicity of apparent complexity. II. Exact complexities and complexity spectra

NASA Astrophysics Data System (ADS)

Riechers, Paul M.; Crutchfield, James P.

2018-03-01

The meromorphic functional calculus developed in Part I overcomes the nondiagonalizability of linear operators that arises often in the temporal evolution of complex systems and is generic to the metadynamics of predicting their behavior. Using the resulting spectral decomposition, we derive closed-form expressions for correlation functions, finite-length Shannon entropy-rate approximates, asymptotic entropy rate, excess entropy, transient information, transient and asymptotic state uncertainties, and synchronization information of stochastic processes generated by finite-state hidden Markov models. This introduces analytical tractability to investigating information processing in discrete-event stochastic processes, symbolic dynamics, and chaotic dynamical systems. Comparisons reveal mathematical similarities between complexity measures originally thought to capture distinct informational and computational properties. We also introduce a new kind of spectral analysis via coronal spectrograms and the frequency-dependent spectra of past-future mutual information. We analyze a number of examples to illustrate the methods, emphasizing processes with multivariate dependencies beyond pairwise correlation. This includes spectral decomposition calculations for one representative example in full detail.

A hyperspectral imaging system for the evaluation of the human iris spectral reflectance

NASA Astrophysics Data System (ADS)

Di Cecilia, Luca; Marazzi, Francesco; Rovati, Luigi

2017-02-01

According to previous studies, the measurement of the human iris pigmentation can be exploited to detect certain eye pathological conditions in their early stage. In this paper, we propose an instrument and a method to perform hyperspectral quantitative measurements of the iris spectral reflectance. The system is based on a simple imaging setup, which includes a monochrome camera mounted on a standard ophthalmic microscope movement controller, a monochromator, and a flashing LED-based slit lamp. To assure quantitative measurements, the system is properly calibrated against a NIST reflectance standard. Iris reflectance images can be obtained in the spectral range 495-795 nm with a resolution of 25 nm. Each image consists of 1280 x 1024 pixels having a spatial resolution of 18 μm. Reflectance spectra can be calculated both from discrete areas of the iris and as the average of the whole iris surface. Preliminary results suggest that hyperspectral imaging of the iris can provide much more morphological and spectral information with respect to conventional qualitative colorimetric methods.

Connes distance function on fuzzy sphere and the connection between geometry and statistics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Devi, Yendrembam Chaoba, E-mail: chaoba@bose.res.in; Chakraborty, Biswajit, E-mail: biswajit@bose.res.in; Prajapat, Shivraj, E-mail: shraprajapat@gmail.com

An algorithm to compute Connes spectral distance, adaptable to the Hilbert-Schmidt operatorial formulation of non-commutative quantum mechanics, was developed earlier by introducing the appropriate spectral triple and used to compute infinitesimal distances in the Moyal plane, revealing a deep connection between geometry and statistics. In this paper, using the same algorithm, the Connes spectral distance has been calculated in the Hilbert-Schmidt operatorial formulation for the fuzzy sphere whose spatial coordinates satisfy the su(2) algebra. This has been computed for both the discrete and the Perelemov’s SU(2) coherent state. Here also, we get a connection between geometry and statistics which ismore » shown by computing the infinitesimal distance between mixed states on the quantum Hilbert space of a particular fuzzy sphere, indexed by n ∈ ℤ/2.« less

The use of LANDSAT imagery in relation to air survey imagery for terrain analysis in northwest Queensland, Australia, volume 1

NASA Technical Reports Server (NTRS)

Cole, M. M.; Owen-Jones, E. S. (Principal Investigator)

1977-01-01

The author has identified the following significant results. Distinctive spectral signatures discriminated areas underlain by distinctive lithological/stratigraphical units where bedrock either outcrops or is relatively near to surface in the Lady Annie-Mt. Gordon fault zone, the Mary Kathleen, and Dugald River-Naraku areas. Spectral signatures associated with discrete plant communities distinguished different types of superficial deposits over the Cloncurry Plains. Distinctive spectral signatures also revealed the presence and nature of concealed bedrock beneath cover of residuum and superficial deposits where this is relatively thin in the Cloncurry Plains. Major faults were clearly displayed in areas of outcropping and near surface bedrock. Sets of lineaments with preferred orientations were identified in the Lady Annie and Dugald River areas. Known base metal deposits occur along these features.

A well-posed optimal spectral element approximation for the Stokes problem

NASA Technical Reports Server (NTRS)

Maday, Y.; Patera, A. T.; Ronquist, E. M.

1987-01-01

A method is proposed for the spectral element simulation of incompressible flow. This method constitutes in a well-posed optimal approximation of the steady Stokes problem with no spurious modes in the pressure. The resulting method is analyzed, and numerical results are presented for a model problem.

Resolution of coi-dominant phytoplankton species in a eutrophiclake using synchrotron-based Fourier transform infraredspectroscopy

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dean, A.P.; Martin, Michael C.; Sigee, D.C.

2006-10-09

Synchrotron-based Fourier-transform infrared (FTIR)microspectroscopy was used to distinguish micropopulations of thecodominant algae Microcystis aeruginosa (Cyanophyceae) and Ceratiumhirundinella (Dinophyceae) in mixed phytoplankton samples taken from thewater column of a stratified eutrophic lake (Rostherne Mere, UK). FTIRspectra of the two algae showed a closely similar sequence of 10 bandsover the wave-number range 4000-900 cm-1. These were assigned to a rangeof vibrationally active chemical groups using published band assignmentsand on the basis of correlation and factor analysis. In both algae,intracellular concentrations of macromolecular components (determined asband intensity) varied considerably within the same population,indicating substantial intraspecific heterogeneity. Interspecificdifferences were separately analysed in relation tomore » discrete bands and bymultivariate analysis of the entire spectral region 1750-900 cm-1. Interms of discrete bands, comparison of individual intensities (normalisedto amide 1) demonstrated significant (99 percent probability level)differences in relation to six bands between the two algal species. Keyinterspecific differences were also noted in relation to the positions ofbands 2, 10 (carbohydrate) and 7 (protein) and in the 3-D plots derivedby principal component analysis (PCA) of the sequence of bandintensities. PCA of entire spectral regions showed clear resolutionofspecies in the PCA plot, with indication of separation on the basis ofprotein (region 1700-1500 cm1) and carbohydrate (region 1150-900 cm1)composition in the loading plot. Hierarchical cluster analysis (Wardalgorithm) of entire spectral regions also showed clear discrimination ofthe two species within the resulting dendrogram.« less

A discrete artificial bee colony algorithm incorporating differential evolution for the flow-shop scheduling problem with blocking

NASA Astrophysics Data System (ADS)

Han, Yu-Yan; Gong, Dunwei; Sun, Xiaoyan

2015-07-01

A flow-shop scheduling problem with blocking has important applications in a variety of industrial systems but is underrepresented in the research literature. In this study, a novel discrete artificial bee colony (ABC) algorithm is presented to solve the above scheduling problem with a makespan criterion by incorporating the ABC with differential evolution (DE). The proposed algorithm (DE-ABC) contains three key operators. One is related to the employed bee operator (i.e. adopting mutation and crossover operators of discrete DE to generate solutions with good quality); the second is concerned with the onlooker bee operator, which modifies the selected solutions using insert or swap operators based on the self-adaptive strategy; and the last is for the local search, that is, the insert-neighbourhood-based local search with a small probability is adopted to improve the algorithm's capability in exploitation. The performance of the proposed DE-ABC algorithm is empirically evaluated by applying it to well-known benchmark problems. The experimental results show that the proposed algorithm is superior to the compared algorithms in minimizing the makespan criterion.

[Review of digital ground object spectral library].

PubMed

Zhou, Xiao-Hu; Zhou, Ding-Wu

2009-06-01

A higher spectral resolution is the main direction of developing remote sensing technology, and it is quite important to set up the digital ground object reflectance spectral database library, one of fundamental research fields in remote sensing application. Remote sensing application has been increasingly relying on ground object spectral characteristics, and quantitative analysis has been developed to a new stage. The present article summarized and systematically introduced the research status quo and development trend of digital ground object reflectance spectral libraries at home and in the world in recent years. Introducing the spectral libraries has been established, including desertification spectral database library, plants spectral database library, geological spectral database library, soil spectral database library, minerals spectral database library, cloud spectral database library, snow spectral database library, the atmosphere spectral database library, rocks spectral database library, water spectral database library, meteorites spectral database library, moon rock spectral database library, and man-made materials spectral database library, mixture spectral database library, volatile compounds spectral database library, and liquids spectral database library. In the process of establishing spectral database libraries, there have been some problems, such as the lack of uniform national spectral database standard and uniform standards for the ground object features as well as the comparability between different databases. In addition, data sharing mechanism can not be carried out, etc. This article also put forward some suggestions on those problems.

An Interactive Tool for Discrete Phase Analysis in Two-Phase Flows

NASA Technical Reports Server (NTRS)

Dejong, Frederik J.; Thoren, Stephen J.

1993-01-01

Under a NASA MSFC SBIR Phase 1 effort an interactive software package has been developed for the analysis of discrete (particulate) phase dynamics in two-phase flows in which the discrete phase does not significantly affect the continuous phase. This package contains a Graphical User Interface (based on the X Window system and the Motif tool kit) coupled to a particle tracing program, which allows the user to interactively set up and run a case for which a continuous phase grid and flow field are available. The software has been applied to a solid rocket motor problem, to demonstrate its ease of use and its suitability for problems of engineering interest, and has been delivered to NASA Marshall Space Flight Center.

Dual methods and approximation concepts in structural synthesis

NASA Technical Reports Server (NTRS)

Fleury, C.; Schmit, L. A., Jr.

1980-01-01

Approximation concepts and dual method algorithms are combined to create a method for minimum weight design of structural systems. Approximation concepts convert the basic mathematical programming statement of the structural synthesis problem into a sequence of explicit primal problems of separable form. These problems are solved by constructing explicit dual functions, which are maximized subject to nonnegativity constraints on the dual variables. It is shown that the joining together of approximation concepts and dual methods can be viewed as a generalized optimality criteria approach. The dual method is successfully extended to deal with pure discrete and mixed continuous-discrete design variable problems. The power of the method presented is illustrated with numerical results for example problems, including a metallic swept wing and a thin delta wing with fiber composite skins.

A fully Sinc-Galerkin method for Euler-Bernoulli beam models

NASA Technical Reports Server (NTRS)

Smith, R. C.; Bowers, K. L.; Lund, J.

1990-01-01

A fully Sinc-Galerkin method in both space and time is presented for fourth-order time-dependent partial differential equations with fixed and cantilever boundary conditions. The Sinc discretizations for the second-order temporal problem and the fourth-order spatial problems are presented. Alternate formulations for variable parameter fourth-order problems are given which prove to be especially useful when applying the forward techniques to parameter recovery problems. The discrete system which corresponds to the time-dependent partial differential equations of interest are then formulated. Computational issues are discussed and a robust and efficient algorithm for solving the resulting matrix system is outlined. Numerical results which highlight the method are given for problems with both analytic and singular solutions as well as fixed and cantilever boundary conditions.

Variationally consistent discretization schemes and numerical algorithms for contact problems

NASA Astrophysics Data System (ADS)

Wohlmuth, Barbara

We consider variationally consistent discretization schemes for mechanical contact problems. Most of the results can also be applied to other variational inequalities, such as those for phase transition problems in porous media, for plasticity or for option pricing applications from finance. The starting point is to weakly incorporate the constraint into the setting and to reformulate the inequality in the displacement in terms of a saddle-point problem. Here, the Lagrange multiplier represents the surface forces, and the constraints are restricted to the boundary of the simulation domain. Having a uniform inf-sup bound, one can then establish optimal low-order a priori convergence rates for the discretization error in the primal and dual variables. In addition to the abstract framework of linear saddle-point theory, complementarity terms have to be taken into account. The resulting inequality system is solved by rewriting it equivalently by means of the non-linear complementarity function as a system of equations. Although it is not differentiable in the classical sense, semi-smooth Newton methods, yielding super-linear convergence rates, can be applied and easily implemented in terms of a primal-dual active set strategy. Quite often the solution of contact problems has a low regularity, and the efficiency of the approach can be improved by using adaptive refinement techniques. Different standard types, such as residual- and equilibrated-based a posteriori error estimators, can be designed based on the interpretation of the dual variable as Neumann boundary condition. For the fully dynamic setting it is of interest to apply energy-preserving time-integration schemes. However, the differential algebraic character of the system can result in high oscillations if standard methods are applied. A possible remedy is to modify the fully discretized system by a local redistribution of the mass. Numerical results in two and three dimensions illustrate the wide range of possible applications and show the performance of the space discretization scheme, non-linear solver, adaptive refinement process and time integration.

Spectral methods for partial differential equations

NASA Technical Reports Server (NTRS)

Hussaini, M. Y.; Streett, C. L.; Zang, T. A.

1983-01-01

Origins of spectral methods, especially their relation to the Method of Weighted Residuals, are surveyed. Basic Fourier, Chebyshev, and Legendre spectral concepts are reviewed, and demonstrated through application to simple model problems. Both collocation and tau methods are considered. These techniques are then applied to a number of difficult, nonlinear problems of hyperbolic, parabolic, elliptic, and mixed type. Fluid dynamical applications are emphasized.

Recent applications of spectral methods in fluid dynamics

NASA Technical Reports Server (NTRS)

Zang, T. A.; Hussaini, M. Y.

1985-01-01

Origins of spectral methods, especially their relation to the method of weighted residuals, are surveyed. Basic Fourier and Chebyshev spectral concepts are reviewed and demonstrated through application to simple model problems. Both collocation and tau methods are considered. These techniques are then applied to a number of difficult, nonlinear problems of hyperbolic, parabolic, elliptic and mixzed type. Fluid dynamical applications are emphasized.

Using Directional Diffusion Coefficients for Nonlinear Diffusion Acceleration of the First Order SN Equations in Near-Void Regions

DOE Office of Scientific and Technical Information (OSTI.GOV)

Schunert, Sebastian; Hammer, Hans; Lou, Jijie

2016-11-01

The common definition of the diffusion coeffcient as the inverse of three times the transport cross section is not compat- ible with voids. Morel introduced a non-local tensor diffusion coeffcient that remains finite in voids[1]. It can be obtained by solving an auxiliary transport problem without scattering or fission. Larsen and Trahan successfully applied this diffusion coeffcient for enhancing the accuracy of diffusion solutions of very high temperature reactor (VHTR) problems that feature large, optically thin channels in the z-direction [2]. It is demonstrated that a significant reduction of error can be achieved in particular in the optically thin region.more » Along the same line of thought, non-local diffusion tensors are applied modeling the TREAT reactor confirming the findings of Larsen and Trahan [3]. Previous work of the authors have introduced a flexible Nonlinear-Diffusion Acceleration (NDA) method for the first order S N equations discretized with the discontinuous finite element method (DFEM), [4], [5], [6]. This NDA method uses a scalar diffusion coeffcient in the low-order system that is obtained as the flux weighted average of the inverse transport cross section. Hence, it su?ers from very large and potentially unbounded diffusion coeffcients in the low order problem. However, it was noted that the choice of the diffusion coeffcient does not influence consistency of the method at convergence and hence the di?usion coeffcient is essentially a free parameter. The choice of the di?usion coeffcient does, however, affect the convergence behavior of the nonlinear di?usion iterations. Within this work we use Morel’s non-local di?usion coef- ficient in the aforementioned NDA formulation in lieu of the flux weighted inverse of three times the transport cross section. The goal of this paper is to demonstrate that significant en- hancement of the spectral properties of NDA can be achieved in near void regions. For testing the spectral properties of the NDA with non-local diffusion coeffcients, the periodical horizontal interface problem is used [7]. This problem consists of alternating stripes of optically thin and thick materials both of which feature scattering ratios close to unity.« less

Filtering of Discrete-Time Switched Neural Networks Ensuring Exponential Dissipative and $l_{2}$ - $l_{\\infty }$ Performances.

PubMed

Choi, Hyun Duck; Ahn, Choon Ki; Karimi, Hamid Reza; Lim, Myo Taeg

2017-10-01

This paper studies delay-dependent exponential dissipative and l 2 - l ∞ filtering problems for discrete-time switched neural networks (DSNNs) including time-delayed states. By introducing a novel discrete-time inequality, which is a discrete-time version of the continuous-time Wirtinger-type inequality, we establish new sets of linear matrix inequality (LMI) criteria such that discrete-time filtering error systems are exponentially stable with guaranteed performances in the exponential dissipative and l 2 - l ∞ senses. The design of the desired exponential dissipative and l 2 - l ∞ filters for DSNNs can be achieved by solving the proposed sets of LMI conditions. Via numerical simulation results, we show the validity of the desired discrete-time filter design approach.

A Two-Timescale Discretization Scheme for Collocation

NASA Technical Reports Server (NTRS)

Desai, Prasun; Conway, Bruce A.

2004-01-01

The development of a two-timescale discretization scheme for collocation is presented. This scheme allows a larger discretization to be utilized for smoothly varying state variables and a second finer discretization to be utilized for state variables having higher frequency dynamics. As such. the discretization scheme can be tailored to the dynamics of the particular state variables. In so doing. the size of the overall Nonlinear Programming (NLP) problem can be reduced significantly. Two two-timescale discretization architecture schemes are described. Comparison of results between the two-timescale method and conventional collocation show very good agreement. Differences of less than 0.5 percent are observed. Consequently. a significant reduction (by two-thirds) in the number of NLP parameters and iterations required for convergence can be achieved without sacrificing solution accuracy.

From Discrete Space-Time to Minkowski Space: Basic Mechanisms, Methods and Perspectives

NASA Astrophysics Data System (ADS)

Finster, Felix

This survey article reviews recent results on fermion systems in discrete space-time and corresponding systems in Minkowski space. After a basic introduction to the discrete setting, we explain a mechanism of spontaneous symmetry breaking which leads to the emergence of a discrete causal structure. As methods to study the transition between discrete space-time and Minkowski space, we describe a lattice model for a static and isotropic space-time, outline the analysis of regularization tails of vacuum Dirac sea configurations, and introduce a Lorentz invariant action for the masses of the Dirac seas. We mention the method of the continuum limit, which allows to analyze interacting systems. Open problems are discussed.

The Information Content of Discrete Functions and Their Application in Genetic Data Analysis

DOE PAGES

Sakhanenko, Nikita A.; Kunert-Graf, James; Galas, David J.

2017-10-13

The complex of central problems in data analysis consists of three components: (1) detecting the dependence of variables using quantitative measures, (2) defining the significance of these dependence measures, and (3) inferring the functional relationships among dependent variables. We have argued previously that an information theory approach allows separation of the detection problem from the inference of functional form problem. We approach here the third component of inferring functional forms based on information encoded in the functions. Here, we present here a direct method for classifying the functional forms of discrete functions of three variables represented in data sets. Discretemore » variables are frequently encountered in data analysis, both as the result of inherently categorical variables and from the binning of continuous numerical variables into discrete alphabets of values. The fundamental question of how much information is contained in a given function is answered for these discrete functions, and their surprisingly complex relationships are illustrated. The all-important effect of noise on the inference of function classes is found to be highly heterogeneous and reveals some unexpected patterns. We apply this classification approach to an important area of biological data analysis—that of inference of genetic interactions. Genetic analysis provides a rich source of real and complex biological data analysis problems, and our general methods provide an analytical basis and tools for characterizing genetic problems and for analyzing genetic data. Finally, we illustrate the functional description and the classes of a number of common genetic interaction modes and also show how different modes vary widely in their sensitivity to noise.« less

The Information Content of Discrete Functions and Their Application in Genetic Data Analysis

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sakhanenko, Nikita A.; Kunert-Graf, James; Galas, David J.

The complex of central problems in data analysis consists of three components: (1) detecting the dependence of variables using quantitative measures, (2) defining the significance of these dependence measures, and (3) inferring the functional relationships among dependent variables. We have argued previously that an information theory approach allows separation of the detection problem from the inference of functional form problem. We approach here the third component of inferring functional forms based on information encoded in the functions. Here, we present here a direct method for classifying the functional forms of discrete functions of three variables represented in data sets. Discretemore » variables are frequently encountered in data analysis, both as the result of inherently categorical variables and from the binning of continuous numerical variables into discrete alphabets of values. The fundamental question of how much information is contained in a given function is answered for these discrete functions, and their surprisingly complex relationships are illustrated. The all-important effect of noise on the inference of function classes is found to be highly heterogeneous and reveals some unexpected patterns. We apply this classification approach to an important area of biological data analysis—that of inference of genetic interactions. Genetic analysis provides a rich source of real and complex biological data analysis problems, and our general methods provide an analytical basis and tools for characterizing genetic problems and for analyzing genetic data. Finally, we illustrate the functional description and the classes of a number of common genetic interaction modes and also show how different modes vary widely in their sensitivity to noise.« less

Genetic-evolution-based optimization methods for engineering design

NASA Technical Reports Server (NTRS)

Rao, S. S.; Pan, T. S.; Dhingra, A. K.; Venkayya, V. B.; Kumar, V.

1990-01-01

This paper presents the applicability of a biological model, based on genetic evolution, for engineering design optimization. Algorithms embodying the ideas of reproduction, crossover, and mutation are developed and applied to solve different types of structural optimization problems. Both continuous and discrete variable optimization problems are solved. A two-bay truss for maximum fundamental frequency is considered to demonstrate the continuous variable case. The selection of locations of actuators in an actively controlled structure, for minimum energy dissipation, is considered to illustrate the discrete variable case.

Parameter estimation problems for distributed systems using a multigrid method

NASA Technical Reports Server (NTRS)

Ta'asan, Shlomo; Dutt, Pravir

1990-01-01

The problem of estimating spatially varying coefficients of partial differential equations is considered from observation of the solution and of the right hand side of the equation. It is assumed that the observations are distributed in the domain and that enough observations are given. A method of discretization and an efficient multigrid method for solving the resulting discrete systems are described. Numerical results are presented for estimation of coefficients in an elliptic and a parabolic partial differential equation.

On multigrid solution of the implicit equations of hydrodynamics. Experiments for the compressible Euler equations in general coordinates

NASA Astrophysics Data System (ADS)

Kifonidis, K.; Müller, E.

2012-08-01

Aims: We describe and study a family of new multigrid iterative solvers for the multidimensional, implicitly discretized equations of hydrodynamics. Schemes of this class are free of the Courant-Friedrichs-Lewy condition. They are intended for simulations in which widely differing wave propagation timescales are present. A preferred solver in this class is identified. Applications to some simple stiff test problems that are governed by the compressible Euler equations, are presented to evaluate the convergence behavior, and the stability properties of this solver. Algorithmic areas are determined where further work is required to make the method sufficiently efficient and robust for future application to difficult astrophysical flow problems. Methods: The basic equations are formulated and discretized on non-orthogonal, structured curvilinear meshes. Roe's approximate Riemann solver and a second-order accurate reconstruction scheme are used for spatial discretization. Implicit Runge-Kutta (ESDIRK) schemes are employed for temporal discretization. The resulting discrete equations are solved with a full-coarsening, non-linear multigrid method. Smoothing is performed with multistage-implicit smoothers. These are applied here to the time-dependent equations by means of dual time stepping. Results: For steady-state problems, our results show that the efficiency of the present approach is comparable to the best implicit solvers for conservative discretizations of the compressible Euler equations that can be found in the literature. The use of red-black as opposed to symmetric Gauss-Seidel iteration in the multistage-smoother is found to have only a minor impact on multigrid convergence. This should enable scalable parallelization without having to seriously compromise the method's algorithmic efficiency. For time-dependent test problems, our results reveal that the multigrid convergence rate degrades with increasing Courant numbers (i.e. time step sizes). Beyond a Courant number of nine thousand, even complete multigrid breakdown is observed. Local Fourier analysis indicates that the degradation of the convergence rate is associated with the coarse-grid correction algorithm. An implicit scheme for the Euler equations that makes use of the present method was, nevertheless, able to outperform a standard explicit scheme on a time-dependent problem with a Courant number of order 1000. Conclusions: For steady-state problems, the described approach enables the construction of parallelizable, efficient, and robust implicit hydrodynamics solvers. The applicability of the method to time-dependent problems is presently restricted to cases with moderately high Courant numbers. This is due to an insufficient coarse-grid correction of the employed multigrid algorithm for large time steps. Further research will be required to help us to understand and overcome the observed multigrid convergence difficulties for time-dependent problems.

On the Maximum-Weight Clique Problem.

DTIC Science & Technology

1985-06-01

hypergeometric distribution", Discrete Math . 25, 285-287 .* CHVATAL, V. (1983), Linear Programming, W.H. Freeman, New York/San Francisco. COOK, S.A. (1971...Annals Discrete Math . 21, 325-356 GROTSCHEL, M., L. LOVASZ, and A. SCHRIJVER ((1984b), "Relaxations of Vertex Packing", Preprint No. 35...de Grenoble. See also N. Sbihi, "Algorithme de recherche d’un stable de cardinalite maximum dans un graphe sans etoile", Discrete Math . 19 (1980), 53

Discrete mathematical model of wave diffraction on pre-fractal impedance strips. TM mode case

NASA Astrophysics Data System (ADS)

Nesvit, K. V.

2013-10-01

In this paper a transverse magnetic (TM) wave diffraction problem on pre-fractal impedance strips is considered. The overall aim of this work is to develop a discrete mathematical model of the boundary integral equations (IEs) with the help of special quadrature formulas with the nodes in the zeros of Chebyshev polynomials and to perform a numerical experiments with the help of an efficient discrete singularities method (DSM).

Optimal generalized multistep integration formulae for real-time digital simulation

NASA Technical Reports Server (NTRS)

Moerder, D. D.; Halyo, N.

1985-01-01

The problem of discretizing a dynamical system for real-time digital simulation is considered. Treating the system and its simulation as stochastic processes leads to a statistical characterization of simulator fidelity. A plant discretization procedure based on an efficient matrix generalization of explicit linear multistep discrete integration formulae is introduced, which minimizes a weighted sum of the mean squared steady-state and transient error between the system and simulator outputs.

Design of a blade stiffened composite panel by a genetic algorithm

NASA Technical Reports Server (NTRS)

Nagendra, S.; Haftka, R. T.; Gurdal, Z.

1993-01-01

Genetic algorithms (GAs) readily handle discrete problems, and can be made to generate many optima, as is presently illustrated for the case of design for minimum-weight stiffened panels with buckling constraints. The GA discrete design procedure proved superior to extant alternatives for both stiffened panels with cutouts and without cutouts. High computational costs are, however, associated with this discrete design approach at the current level of its development.

Chebyshev polynomials in the spectral Tau method and applications to Eigenvalue problems

NASA Technical Reports Server (NTRS)

Johnson, Duane

1996-01-01

Chebyshev Spectral methods have received much attention recently as a technique for the rapid solution of ordinary differential equations. This technique also works well for solving linear eigenvalue problems. Specific detail is given to the properties and algebra of chebyshev polynomials; the use of chebyshev polynomials in spectral methods; and the recurrence relationships that are developed. These formula and equations are then applied to several examples which are worked out in detail. The appendix contains an example FORTRAN program used in solving an eigenvalue problem.

Demosaicking for full motion video 9-band SWIR sensor

NASA Astrophysics Data System (ADS)

Kanaev, Andrey V.; Rawhouser, Marjorie; Kutteruf, Mary R.; Yetzbacher, Michael K.; DePrenger, Michael J.; Novak, Kyle M.; Miller, Corey A.; Miller, Christopher W.

2014-05-01

Short wave infrared (SWIR) spectral imaging systems are vital for Intelligence, Surveillance, and Reconnaissance (ISR) applications because of their abilities to autonomously detect targets and classify materials. Typically the spectral imagers are incapable of providing Full Motion Video (FMV) because of their reliance on line scanning. We enable FMV capability for a SWIR multi-spectral camera by creating a repeating pattern of 3x3 spectral filters on a staring focal plane array (FPA). In this paper we present the imagery from an FMV SWIR camera with nine discrete bands and discuss image processing algorithms necessary for its operation. The main task of image processing in this case is demosaicking of the spectral bands i.e. reconstructing full spectral images with original FPA resolution from spatially subsampled and incomplete spectral data acquired with the choice of filter array pattern. To the best of author's knowledge, the demosaicking algorithms for nine or more equally sampled bands have not been reported before. Moreover all existing algorithms developed for demosaicking visible color filter arrays with less than nine colors assume either certain relationship between the visible colors, which are not valid for SWIR imaging, or presence of one color band with higher sampling rate compared to the rest of the bands, which does not conform to our spectral filter pattern. We will discuss and present results for two novel approaches to demosaicking: interpolation using multi-band edge information and application of multi-frame super-resolution to a single frame resolution enhancement of multi-spectral spatially multiplexed images.

The nonconforming virtual element method for eigenvalue problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gardini, Francesca; Manzini, Gianmarco; Vacca, Giuseppe

We analyse the nonconforming Virtual Element Method (VEM) for the approximation of elliptic eigenvalue problems. The nonconforming VEM allow to treat in the same formulation the two- and three-dimensional case.We present two possible formulations of the discrete problem, derived respectively by the nonstabilized and stabilized approximation of the L 2-inner product, and we study the convergence properties of the corresponding discrete eigenvalue problems. The proposed schemes provide a correct approximation of the spectrum and we prove optimal-order error estimates for the eigenfunctions and the usual double order of convergence of the eigenvalues. Finally we show a large set of numericalmore » tests supporting the theoretical results, including a comparison with the conforming Virtual Element choice.« less

A computational study of the discretization error in the solution of the Spencer-Lewis equation by doubling applied to the upwind finite-difference approximation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Nelson, P.; Seth, D.L.; Ray, A.K.

A detailed and systematic study of the nature of the discretization error associated with the upwind finite-difference method is presented. A basic model problem has been identified and based upon the results for this problem, a basic hypothesis regarding the accuracy of the computational solution of the Spencer-Lewis equation is formulated. The basic hypothesis is then tested under various systematic single complexifications of the basic model problem. The results of these tests provide the framework of the refined hypothesis presented in the concluding comments. 27 refs., 3 figs., 14 tabs.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jones, J E; Vassilevski, P S; Woodward, C S

This paper provides extensions of an element agglomeration AMG method to nonlinear elliptic problems discretized by the finite element method on general unstructured meshes. The method constructs coarse discretization spaces and corresponding coarse nonlinear operators as well as their Jacobians. We introduce both standard (fairly quasi-uniformly coarsened) and non-standard (coarsened away) coarse meshes and respective finite element spaces. We use both kind of spaces in FAS type coarse subspace correction (or Schwarz) algorithms. Their performance is illustrated on a number of model problems. The coarsened away spaces seem to perform better than the standard spaces for problems with nonlinearities inmore » the principal part of the elliptic operator.« less

Solitons of shallow-water models from energy-dependent spectral problems

NASA Astrophysics Data System (ADS)

Haberlin, Jack; Lyons, Tony

2018-01-01

The current work investigates the soliton solutions of the Kaup-Boussinesq equation using the inverse scattering transform method. We outline the construction of the Riemann-Hilbert problem for a pair of energy-dependent spectral problems for the system, which we then use to construct the solution of this hydrodynamic system.

In Praise of Numerical Computation

NASA Astrophysics Data System (ADS)

Yap, Chee K.

Theoretical Computer Science has developed an almost exclusively discrete/algebraic persona. We have effectively shut ourselves off from half of the world of computing: a host of problems in Computational Science & Engineering (CS&E) are defined on the continuum, and, for them, the discrete viewpoint is inadequate. The computational techniques in such problems are well-known to numerical analysis and applied mathematics, but are rarely discussed in theoretical algorithms: iteration, subdivision and approximation. By various case studies, I will indicate how our discrete/algebraic view of computing has many shortcomings in CS&E. We want embrace the continuous/analytic view, but in a new synthesis with the discrete/algebraic view. I will suggest a pathway, by way of an exact numerical model of computation, that allows us to incorporate iteration and approximation into our algorithms’ design. Some recent results give a peek into how this view of algorithmic development might look like, and its distinctive form suggests the name “numerical computational geometry” for such activities.

Discontinuous finite element method for vector radiative transfer

NASA Astrophysics Data System (ADS)

Wang, Cun-Hai; Yi, Hong-Liang; Tan, He-Ping

2017-03-01

The discontinuous finite element method (DFEM) is applied to solve the vector radiative transfer in participating media. The derivation in a discrete form of the vector radiation governing equations is presented, in which the angular space is discretized by the discrete-ordinates approach with a local refined modification, and the spatial domain is discretized into finite non-overlapped discontinuous elements. The elements in the whole solution domain are connected by modelling the boundary numerical flux between adjacent elements, which makes the DFEM numerically stable for solving radiative transfer equations. Several various problems of vector radiative transfer are tested to verify the performance of the developed DFEM, including vector radiative transfer in a one-dimensional parallel slab containing a Mie/Rayleigh/strong forward scattering medium and a two-dimensional square medium. The fact that DFEM results agree very well with the benchmark solutions in published references shows that the developed DFEM in this paper is accurate and effective for solving vector radiative transfer problems.

A mimetic finite difference method for the Stokes problem with elected edge bubbles

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lipnikov, K; Berirao, L

2009-01-01

A new mimetic finite difference method for the Stokes problem is proposed and analyzed. The unstable P{sub 1}-P{sub 0} discretization is stabilized by adding a small number of bubble functions to selected mesh edges. A simple strategy for selecting such edges is proposed and verified with numerical experiments. The discretizations schemes for Stokes and Navier-Stokes equations must satisfy the celebrated inf-sup (or the LBB) stability condition. The stability condition implies a balance between discrete spaces for velocity and pressure. In finite elements, this balance is frequently achieved by adding bubble functions to the velocity space. The goal of this articlemore » is to show that the stabilizing edge bubble functions can be added only to a small set of mesh edges. This results in a smaller algebraic system and potentially in a faster calculations. We employ the mimetic finite difference (MFD) discretization technique that works for general polyhedral meshes and can accomodate non-uniform distribution of stabilizing bubbles.« less

Weighted interior penalty discretization of fully nonlinear and weakly dispersive free surface shallow water flows

NASA Astrophysics Data System (ADS)

Di Pietro, Daniele A.; Marche, Fabien

2018-02-01

In this paper, we further investigate the use of a fully discontinuous Finite Element discrete formulation for the study of shallow water free surface flows in the fully nonlinear and weakly dispersive flow regime. We consider a decoupling strategy in which we approximate the solutions of the classical shallow water equations supplemented with a source term globally accounting for the non-hydrostatic effects. This source term can be computed through the resolution of elliptic second-order linear sub-problems, which only involve second order partial derivatives in space. We then introduce an associated Symmetric Weighted Internal Penalty discrete bilinear form, allowing to deal with the discontinuous nature of the elliptic problem's coefficients in a stable and consistent way. Similar discrete formulations are also introduced for several recent optimized fully nonlinear and weakly dispersive models. These formulations are validated again several benchmarks involving h-convergence, p-convergence and comparisons with experimental data, showing optimal convergence properties.

Spectral monodromy of non-self-adjoint operators

NASA Astrophysics Data System (ADS)

Phan, Quang Sang

2014-01-01

In the present paper, we build a combinatorial invariant, called the "spectral monodromy" from the spectrum of a single (non-self-adjoint) h-pseudodifferential operator with two degrees of freedom in the semi-classical limit. Our inspiration comes from the quantum monodromy defined for the joint spectrum of an integrable system of n commuting self-adjoint h-pseudodifferential operators, given by S. Vu Ngoc ["Quantum monodromy in integrable systems," Commun. Math. Phys. 203(2), 465-479 (1999)]. The first simple case that we treat in this work is a normal operator. In this case, the discrete spectrum can be identified with the joint spectrum of an integrable quantum system. The second more complex case we propose is a small perturbation of a self-adjoint operator with a classical integrability property. We show that the discrete spectrum (in a small band around the real axis) also has a combinatorial monodromy. The main difficulty in this case is that we do not know the description of the spectrum everywhere, but only in a Cantor type set. In addition, we also show that the corresponding monodromy can be identified with the classical monodromy, defined by J. Duistermaat ["On global action-angle coordinates," Commun. Pure Appl. Math. 33(6), 687-706 (1980)].

An analysis of spectral envelope-reduction via quadratic assignment problems

NASA Technical Reports Server (NTRS)

George, Alan; Pothen, Alex

1994-01-01

A new spectral algorithm for reordering a sparse symmetric matrix to reduce its envelope size was described. The ordering is computed by associating a Laplacian matrix with the given matrix and then sorting the components of a specified eigenvector of the Laplacian. In this paper, we provide an analysis of the spectral envelope reduction algorithm. We described related 1- and 2-sum problems; the former is related to the envelope size, while the latter is related to an upper bound on the work involved in an envelope Cholesky factorization scheme. We formulate the latter two problems as quadratic assignment problems, and then study the 2-sum problem in more detail. We obtain lower bounds on the 2-sum by considering a projected quadratic assignment problem, and then show that finding a permutation matrix closest to an orthogonal matrix attaining one of the lower bounds justifies the spectral envelope reduction algorithm. The lower bound on the 2-sum is seen to be tight for reasonably 'uniform' finite element meshes. We also obtain asymptotically tight lower bounds for the envelope size for certain classes of meshes.

Wavelet transforms with discrete-time continuous-dilation wavelets

NASA Astrophysics Data System (ADS)

Zhao, Wei; Rao, Raghuveer M.

1999-03-01

Wavelet constructions and transforms have been confined principally to the continuous-time domain. Even the discrete wavelet transform implemented through multirate filter banks is based on continuous-time wavelet functions that provide orthogonal or biorthogonal decompositions. This paper provides a novel wavelet transform construction based on the definition of discrete-time wavelets that can undergo continuous parameter dilations. The result is a transformation that has the advantage of discrete-time or digital implementation while circumventing the problem of inadequate scaling resolution seen with conventional dyadic or M-channel constructions. Examples of constructing such wavelets are presented.

Uniform high order spectral methods for one and two dimensional Euler equations

NASA Technical Reports Server (NTRS)

Cai, Wei; Shu, Chi-Wang

1991-01-01

Uniform high order spectral methods to solve multi-dimensional Euler equations for gas dynamics are discussed. Uniform high order spectral approximations with spectral accuracy in smooth regions of solutions are constructed by introducing the idea of the Essentially Non-Oscillatory (ENO) polynomial interpolations into the spectral methods. The authors present numerical results for the inviscid Burgers' equation, and for the one dimensional Euler equations including the interactions between a shock wave and density disturbance, Sod's and Lax's shock tube problems, and the blast wave problem. The interaction between a Mach 3 two dimensional shock wave and a rotating vortex is simulated.

The Physical Mechanism for Retinal Discrete Dark Noise: Thermal Activation or Cellular Ultraweak Photon Emission?

PubMed

Salari, Vahid; Scholkmann, Felix; Bokkon, Istvan; Shahbazi, Farhad; Tuszynski, Jack

2016-01-01

For several decades the physical mechanism underlying discrete dark noise of photoreceptors in the eye has remained highly controversial and poorly understood. It is known that the Arrhenius equation, which is based on the Boltzmann distribution for thermal activation, can model only a part (e.g. half of the activation energy) of the retinal dark noise experimentally observed for vertebrate rod and cone pigments. Using the Hinshelwood distribution instead of the Boltzmann distribution in the Arrhenius equation has been proposed as a solution to the problem. Here, we show that the using the Hinshelwood distribution does not solve the problem completely. As the discrete components of noise are indistinguishable in shape and duration from those produced by real photon induced photo-isomerization, the retinal discrete dark noise is most likely due to 'internal photons' inside cells and not due to thermal activation of visual pigments. Indeed, all living cells exhibit spontaneous ultraweak photon emission (UPE), mainly in the optical wavelength range, i.e., 350-700 nm. We show here that the retinal discrete dark noise has a similar rate as UPE and therefore dark noise is most likely due to spontaneous cellular UPE and not due to thermal activation.

Adaptive NN controller design for a class of nonlinear MIMO discrete-time systems.

PubMed

Liu, Yan-Jun; Tang, Li; Tong, Shaocheng; Chen, C L Philip

2015-05-01

An adaptive neural network tracking control is studied for a class of multiple-input multiple-output (MIMO) nonlinear systems. The studied systems are in discrete-time form and the discretized dead-zone inputs are considered. In addition, the studied MIMO systems are composed of N subsystems, and each subsystem contains unknown functions and external disturbance. Due to the complicated framework of the discrete-time systems, the existence of the dead zone and the noncausal problem in discrete-time, it brings about difficulties for controlling such a class of systems. To overcome the noncausal problem, by defining the coordinate transformations, the studied systems are transformed into a special form, which is suitable for the backstepping design. The radial basis functions NNs are utilized to approximate the unknown functions of the systems. The adaptation laws and the controllers are designed based on the transformed systems. By using the Lyapunov method, it is proved that the closed-loop system is stable in the sense that the semiglobally uniformly ultimately bounded of all the signals and the tracking errors converge to a bounded compact set. The simulation examples and the comparisons with previous approaches are provided to illustrate the effectiveness of the proposed control algorithm.

A Legendre tau-spectral method for solving time-fractional heat equation with nonlocal conditions.

PubMed

Bhrawy, A H; Alghamdi, M A

2014-01-01

We develop the tau-spectral method to solve the time-fractional heat equation (T-FHE) with nonlocal condition. In order to achieve highly accurate solution of this problem, the operational matrix of fractional integration (described in the Riemann-Liouville sense) for shifted Legendre polynomials is investigated in conjunction with tau-spectral scheme and the Legendre operational polynomials are used as the base function. The main advantage in using the presented scheme is that it converts the T-FHE with nonlocal condition to a system of algebraic equations that simplifies the problem. For demonstrating the validity and applicability of the developed spectral scheme, two numerical examples are presented. The logarithmic graphs of the maximum absolute errors is presented to achieve the exponential convergence of the proposed method. Comparing between our spectral method and other methods ensures that our method is more accurate than those solved similar problem.

A Legendre tau-Spectral Method for Solving Time-Fractional Heat Equation with Nonlocal Conditions

PubMed Central

Bhrawy, A. H.; Alghamdi, M. A.

2014-01-01

We develop the tau-spectral method to solve the time-fractional heat equation (T-FHE) with nonlocal condition. In order to achieve highly accurate solution of this problem, the operational matrix of fractional integration (described in the Riemann-Liouville sense) for shifted Legendre polynomials is investigated in conjunction with tau-spectral scheme and the Legendre operational polynomials are used as the base function. The main advantage in using the presented scheme is that it converts the T-FHE with nonlocal condition to a system of algebraic equations that simplifies the problem. For demonstrating the validity and applicability of the developed spectral scheme, two numerical examples are presented. The logarithmic graphs of the maximum absolute errors is presented to achieve the exponential convergence of the proposed method. Comparing between our spectral method and other methods ensures that our method is more accurate than those solved similar problem. PMID:25057507

Quantitative Multispectral Analysis Of Discrete Subcellular Particles By Digital Imaging Fluorescence Microscopy (DIFM)

NASA Astrophysics Data System (ADS)

Dorey, C. K.; Ebenstein, David B.

1988-10-01

Subcellular localization of multiple biochemical markers is readily achieved through their characteristic autofluorescence or through use of appropriately labelled antibodies. Recent development of specific probes has permitted elegant studies in calcium and pH in living cells. However, each of these methods measured fluorescence at one wavelength; precise quantitation of multiple fluorophores at individual sites within a cell has not been possible. Using DIFM, we have achieved spectral analysis of discrete subcellular particles 1-2 gm in diameter. The fluorescence emission is broken into narrow bands by an interference monochromator and visualized through the combined use of a silicon intensified target (SIT) camera, a microcomputer based framegrabber with 8 bit resolution, and a color video monitor. Image acquisition, processing, analysis and display are under software control. The digitized image can be corrected for the spectral distortions induced by the wavelength dependent sensitivity of the camera, and the displayed image can be enhanced or presented in pseudocolor to facilitate discrimination of variation in pixel intensity of individual particles. For rapid comparison of the fluorophore composition of granules, a ratio image is produced by dividing the image captured at one wavelength by that captured at another. In the resultant ratio image, a granule which has a fluorophore composition different from the majority is selectively colored. This powerful system has been utilized to obtain spectra of endogenous autofluorescent compounds in discrete cellular organelles of human retinal pigment epithelium, and to measure immunohistochemically labelled components of the extracellular matrix associated with the human optic nerve.

Perfect discretization of reparametrization invariant path integrals

NASA Astrophysics Data System (ADS)

Bahr, Benjamin; Dittrich, Bianca; Steinhaus, Sebastian

2011-05-01

To obtain a well-defined path integral one often employs discretizations. In the case of gravity and reparametrization-invariant systems, the latter of which we consider here as a toy example, discretizations generically break diffeomorphism and reparametrization symmetry, respectively. This has severe implications, as these symmetries determine the dynamics of the corresponding system. Indeed we will show that a discretized path integral with reparametrization-invariance is necessarily also discretization independent and therefore uniquely determined by the corresponding continuum quantum mechanical propagator. We use this insight to develop an iterative method for constructing such a discretized path integral, akin to a Wilsonian RG flow. This allows us to address the problem of discretization ambiguities and of an anomaly-free path integral measure for such systems. The latter is needed to obtain a path integral, that can act as a projector onto the physical states, satisfying the quantum constraints. We will comment on implications for discrete quantum gravity models, such as spin foams.

Robust preview control for a class of uncertain discrete-time systems with time-varying delay.

PubMed

Li, Li; Liao, Fucheng

2018-02-01

This paper proposes a concept of robust preview tracking control for uncertain discrete-time systems with time-varying delay. Firstly, a model transformation is employed for an uncertain discrete system with time-varying delay. Then, the auxiliary variables related to the system state and input are introduced to derive an augmented error system that includes future information on the reference signal. This leads to the tracking problem being transformed into a regulator problem. Finally, for the augmented error system, a sufficient condition of asymptotic stability is derived and the preview controller design method is proposed based on the scaled small gain theorem and linear matrix inequality (LMI) technique. The method proposed in this paper not only solves the difficulty problem of applying the difference operator to the time-varying matrices but also simplifies the structure of the augmented error system. The numerical simulation example also illustrates the effectiveness of the results presented in the paper. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

Preconditioned conjugate residual methods for the solution of spectral equations

NASA Technical Reports Server (NTRS)

Wong, Y. S.; Zang, T. A.; Hussaini, M. Y.

1986-01-01

Conjugate residual methods for the solution of spectral equations are described. An inexact finite-difference operator is introduced as a preconditioner in the iterative procedures. Application of these techniques is limited to problems for which the symmetric part of the coefficient matrix is positive definite. Although the spectral equation is a very ill-conditioned and full matrix problem, the computational effort of the present iterative methods for solving such a system is comparable to that for the sparse matrix equations obtained from the application of either finite-difference or finite-element methods to the same problems. Numerical experiments are shown for a self-adjoint elliptic partial differential equation with Dirichlet boundary conditions, and comparison with other solution procedures for spectral equations is presented.

The solution of non-linear hyperbolic equation systems by the finite element method

NASA Technical Reports Server (NTRS)

Loehner, R.; Morgan, K.; Zienkiewicz, O. C.

1984-01-01

A finite-element method for the solution of nonlinear hyperbolic systems of equations, such as those encountered in non-self-adjoint problems of transient phenomena in convection-diffusion or in the mixed representation of wave problems, is developed and demonstrated. The problem is rewritten in moving coordinates and reinterpolated to the original mesh by a Taylor expansion prior to a standard Galerkin spatial discretization, and it is shown that this procedure is equivalent to the time-discretization approach of Donea (1984). Numerical results for sample problems are presented graphically, including such shallow-water problems as the breaking of a dam, the shoaling of a wave, and the outflow of a river; compressible flows such as the isothermal flow in a nozzle and the Riemann shock-tube problem; and the two-dimensional scalar-advection, nonlinear-shallow-water, and Euler equations.

A new hybrid numerical scheme for simulating fault ruptures with near-fault bulk inhomogeneities

NASA Astrophysics Data System (ADS)

Hajarolasvadi, S.; Elbanna, A. E.

2017-12-01

The Finite Difference (FD) and Boundary Integral (BI) Method have been extensively used to model spontaneously propagating shear cracks, which can serve as a useful idealization of natural earthquakes. While FD suffers from artificial dispersion and numerical dissipation and has a large computational cost as it requires the discretization of the whole volume of interest, it can be applied to a wider range of problems including ones with bulk nonlinearities and heterogeneities. On the other hand, in the BI method, the numerical consideration is confined to the crack path only, with the elastodynamic response of the bulk expressed in terms of integral relations between displacement discontinuities and tractions along the crack. Therefore, this method - its spectral boundary integral (SBI) formulation in particular - is much faster and more computationally efficient than other bulk methods such as FD. However, its application is restricted to linear elastic bulk and planar faults. This work proposes a novel hybrid numerical scheme that combines FD and the SBI to enable treating fault zone nonlinearities and heterogeneities with unprecedented resolution and in a more computationally efficient way. The main idea of the method is to enclose the inhomgeneities in a virtual strip that is introduced for computational purposes only. This strip is then discretized using a volume-based numerical method, chosen here to be the finite difference method while the virtual boundaries of the strip are handled using the SBI formulation that represents the two elastic half spaces outside the strip. Modeling the elastodynamic response in these two halfspaces needs to be carried out by an Independent Spectral Formulation before joining them to the strip with the appropriate boundary conditions. Dirichlet and Neumann boundary conditions are imposed on the strip and the two half-spaces, respectively, at each time step to propagate the solution forward. We demonstrate the validity of the approach using two examples for dynamic rupture propagation: one in the presence of a low velocity layer and the other in which off-fault plasticity is permitted. This approach is more computationally efficient than pure FD and expands the range of applications of SBI beyond the current state of the art.

Spectral analysis of a two-species competition model: Determining the effects of extreme conditions on the color of noise generated from simulated time series

NASA Astrophysics Data System (ADS)

Golinski, M. R.

2006-07-01

Ecologists have observed that environmental noise affects population variance in the logistic equation for one-species growth. Interactions between deterministic and stochastic dynamics in a one-dimensional system result in increased variance in species population density over time. Since natural populations do not live in isolation, the present paper simulates a discrete-time two-species competition model with environmental noise to determine the type of colored population noise generated by extreme conditions in the long-term population dynamics of competing populations. Discrete Fourier analysis is applied to the simulation results and the calculated Hurst exponent ( H) is used to determine how the color of population noise for the two species corresponds to extreme conditions in population dynamics. To interpret the biological meaning of the color of noise generated by the two-species model, the paper determines the color of noise generated by three reference models: (1) A two-dimensional discrete-time white noise model (0⩽ H<1/2); (2) A two-dimensional fractional Brownian motion model (H=1/2); and (3) A two-dimensional discrete-time model with noise for unbounded growth of two uncoupled species (1/2< H⩽1).

It's Deja Vu All over Again: Using Multiple-Spell Discrete-Time Survival Analysis.

ERIC Educational Resources Information Center

Willett, John B.; Singer, Judith D.

1995-01-01

The multiple-spell discrete-time survival analysis method is introduced and illustrated using longitudinal data on exit from and reentry into the teaching profession. The method is applicable to many educational problems involving the sequential occurrence of disparate events or episodes. (SLD)

Pricing European option with transaction costs under the fractional long memory stochastic volatility model

NASA Astrophysics Data System (ADS)

Wang, Xiao-Tian; Wu, Min; Zhou, Ze-Min; Jing, Wei-Shu

2012-02-01

This paper deals with the problem of discrete time option pricing using the fractional long memory stochastic volatility model with transaction costs. Through the 'anchoring and adjustment' argument in a discrete time setting, a European call option pricing formula is obtained.

Discrete quantum dot like emitters in monolayer MoSe{sub 2}: Spatial mapping, magneto-optics, and charge tuning

DOE Office of Scientific and Technical Information (OSTI.GOV)

Branny, Artur; Kumar, Santosh; Gerardot, Brian D., E-mail: b.d.gerardot@hw.ac.uk

Transition metal dichalcogenide monolayers such as MoSe{sub 2}, MoS{sub 2}, and WSe{sub 2} are direct bandgap semiconductors with original optoelectronic and spin-valley properties. Here we report on spectrally sharp, spatially localized emission in monolayer MoSe{sub 2}. We find this quantum dot-like emission in samples exfoliated onto gold substrates and also suspended flakes. Spatial mapping shows a correlation between the location of emitters and the existence of wrinkles (strained regions) in the flake. We tune the emission properties in magnetic and electric fields applied perpendicular to the monolayer plane. We extract an exciton g-factor of the discrete emitters close to −4,more » as for 2D excitons in this material. In a charge tunable sample, we record discrete jumps on the meV scale as charges are added to the emitter when changing the applied voltage.« less

Spectral phase measurement of a Fano resonance using tunable attosecond pulses

PubMed Central

Kotur, M.; Guénot, D.; Jiménez-Galán, Á; Kroon, D.; Larsen, E. W.; Louisy, M.; Bengtsson, S.; Miranda, M.; Mauritsson, J.; Arnold, C. L.; Canton, S. E.; Gisselbrecht, M.; Carette, T.; Dahlström, J. M.; Lindroth, E.; Maquet, A.; Argenti, L.; Martín, F.; L'Huillier, A.

2016-01-01

Electron dynamics induced by resonant absorption of light is of fundamental importance in nature and has been the subject of countless studies in many scientific areas. Above the ionization threshold of atomic or molecular systems, the presence of discrete states leads to autoionization, which is an interference between two quantum paths: direct ionization and excitation of the discrete state coupled to the continuum. Traditionally studied with synchrotron radiation, the probability for autoionization exhibits a universal Fano intensity profile as a function of excitation energy. However, without additional phase information, the full temporal dynamics cannot be recovered. Here we use tunable attosecond pulses combined with weak infrared radiation in an interferometric setup to measure not only the intensity but also the phase variation of the photoionization amplitude across an autoionization resonance in argon. The phase variation can be used as a fingerprint of the interactions between the discrete state and the ionization continua, indicating a new route towards monitoring electron correlations in time. PMID:26887682

Introducing Discrete Frequency Infrared Technology for High-Throughput Biofluid Screening

NASA Astrophysics Data System (ADS)

Hughes, Caryn; Clemens, Graeme; Bird, Benjamin; Dawson, Timothy; Ashton, Katherine M.; Jenkinson, Michael D.; Brodbelt, Andrew; Weida, Miles; Fotheringham, Edeline; Barre, Matthew; Rowlette, Jeremy; Baker, Matthew J.

2016-02-01

Accurate early diagnosis is critical to patient survival, management and quality of life. Biofluids are key to early diagnosis due to their ease of collection and intimate involvement in human function. Large-scale mid-IR imaging of dried fluid deposits offers a high-throughput molecular analysis paradigm for the biomedical laboratory. The exciting advent of tuneable quantum cascade lasers allows for the collection of discrete frequency infrared data enabling clinically relevant timescales. By scanning targeted frequencies spectral quality, reproducibility and diagnostic potential can be maintained while significantly reducing acquisition time and processing requirements, sampling 16 serum spots with 0.6, 5.1 and 15% relative standard deviation (RSD) for 199, 14 and 9 discrete frequencies respectively. We use this reproducible methodology to show proof of concept rapid diagnostics; 40 unique dried liquid biopsies from brain, breast, lung and skin cancer patients were classified in 2.4 cumulative seconds against 10 non-cancer controls with accuracies of up to 90%.

A modified symplectic PRK scheme for seismic wave modeling

NASA Astrophysics Data System (ADS)

Liu, Shaolin; Yang, Dinghui; Ma, Jian

2017-02-01

A new scheme for the temporal discretization of the seismic wave equation is constructed based on symplectic geometric theory and a modified strategy. The ordinary differential equation in terms of time, which is obtained after spatial discretization via the spectral-element method, is transformed into a Hamiltonian system. A symplectic partitioned Runge-Kutta (PRK) scheme is used to solve the Hamiltonian system. A term related to the multiplication of the spatial discretization operator with the seismic wave velocity vector is added into the symplectic PRK scheme to create a modified symplectic PRK scheme. The symplectic coefficients of the new scheme are determined via Taylor series expansion. The positive coefficients of the scheme indicate that its long-term computational capability is more powerful than that of conventional symplectic schemes. An exhaustive theoretical analysis reveals that the new scheme is highly stable and has low numerical dispersion. The results of three numerical experiments demonstrate the high efficiency of this method for seismic wave modeling.

Clairvoyant fusion: a new methodology for designing robust detection algorithms

NASA Astrophysics Data System (ADS)

Schaum, Alan

2016-10-01

Many realistic detection problems cannot be solved with simple statistical tests for known alternative probability models. Uncontrollable environmental conditions, imperfect sensors, and other uncertainties transform simple detection problems with likelihood ratio solutions into composite hypothesis (CH) testing problems. Recently many multi- and hyperspectral sensing CH problems have been addressed with a new approach. Clairvoyant fusion (CF) integrates the optimal detectors ("clairvoyants") associated with every unspecified value of the parameters appearing in a detection model. For problems with discrete parameter values, logical rules emerge for combining the decisions of the associated clairvoyants. For many problems with continuous parameters, analytic methods of CF have been found that produce closed-form solutions-or approximations for intractable problems. Here the principals of CF are reviewed and mathematical insights are described that have proven useful in the derivation of solutions. It is also shown how a second-stage fusion procedure can be used to create theoretically superior detection algorithms for ALL discrete parameter problems.

High-Order Methods for Incompressible Fluid Flow

NASA Astrophysics Data System (ADS)

Deville, M. O.; Fischer, P. F.; Mund, E. H.

2002-08-01

High-order numerical methods provide an efficient approach to simulating many physical problems. This book considers the range of mathematical, engineering, and computer science topics that form the foundation of high-order numerical methods for the simulation of incompressible fluid flows in complex domains. Introductory chapters present high-order spatial and temporal discretizations for one-dimensional problems. These are extended to multiple space dimensions with a detailed discussion of tensor-product forms, multi-domain methods, and preconditioners for iterative solution techniques. Numerous discretizations of the steady and unsteady Stokes and Navier-Stokes equations are presented, with particular sttention given to enforcement of imcompressibility. Advanced discretizations. implementation issues, and parallel and vector performance are considered in the closing sections. Numerous examples are provided throughout to illustrate the capabilities of high-order methods in actual applications.

Higher-Order Compact Schemes for Numerical Simulation of Incompressible Flows

NASA Technical Reports Server (NTRS)

Wilson, Robert V.; Demuren, Ayodeji O.; Carpenter, Mark

1998-01-01

A higher order accurate numerical procedure has been developed for solving incompressible Navier-Stokes equations for 2D or 3D fluid flow problems. It is based on low-storage Runge-Kutta schemes for temporal discretization and fourth and sixth order compact finite-difference schemes for spatial discretization. The particular difficulty of satisfying the divergence-free velocity field required in incompressible fluid flow is resolved by solving a Poisson equation for pressure. It is demonstrated that for consistent global accuracy, it is necessary to employ the same order of accuracy in the discretization of the Poisson equation. Special care is also required to achieve the formal temporal accuracy of the Runge-Kutta schemes. The accuracy of the present procedure is demonstrated by application to several pertinent benchmark problems.

Nonlinear Control and Discrete Event Systems

NASA Technical Reports Server (NTRS)

Meyer, George; Null, Cynthia H. (Technical Monitor)

1995-01-01

As the operation of large systems becomes ever more dependent on extensive automation, the need for an effective solution to the problem of design and validation of the underlying software becomes more critical. Large systems possesses much detailed structure, typically hierarchical, and they are hybrid. Information processing at the top of the hierarchy is by means of formal logic and sentences; on the bottom it is by means of simple scalar differential equations and functions of time; and in the middle it is by an interacting mix of nonlinear multi-axis differential equations and automata, and functions of time and discrete events. The lecture will address the overall problem as it relates to flight vehicle management, describe the middle level, and offer a design approach that is based on Differential Geometry and Discrete Event Dynamic Systems Theory.

Weak Galerkin finite element methods for Darcy flow: Anisotropy and heterogeneity

NASA Astrophysics Data System (ADS)

Lin, Guang; Liu, Jiangguo; Mu, Lin; Ye, Xiu

2014-11-01

This paper presents a family of weak Galerkin finite element methods (WGFEMs) for Darcy flow computation. The WGFEMs are new numerical methods that rely on the novel concept of discrete weak gradients. The WGFEMs solve for pressure unknowns both in element interiors and on the mesh skeleton. The numerical velocity is then obtained from the discrete weak gradient of the numerical pressure. The new methods are quite different than many existing numerical methods in that they are locally conservative by design, the resulting discrete linear systems are symmetric and positive-definite, and there is no need for tuning problem-dependent penalty factors. We test the WGFEMs on benchmark problems to demonstrate the strong potential of these new methods in handling strong anisotropy and heterogeneity in Darcy flow.

A LAGRANGIAN GAUSS-NEWTON-KRYLOV SOLVER FOR MASS- AND INTENSITY-PRESERVING DIFFEOMORPHIC IMAGE REGISTRATION.

PubMed

Mang, Andreas; Ruthotto, Lars

2017-01-01

We present an efficient solver for diffeomorphic image registration problems in the framework of Large Deformations Diffeomorphic Metric Mappings (LDDMM). We use an optimal control formulation, in which the velocity field of a hyperbolic PDE needs to be found such that the distance between the final state of the system (the transformed/transported template image) and the observation (the reference image) is minimized. Our solver supports both stationary and non-stationary (i.e., transient or time-dependent) velocity fields. As transformation models, we consider both the transport equation (assuming intensities are preserved during the deformation) and the continuity equation (assuming mass-preservation). We consider the reduced form of the optimal control problem and solve the resulting unconstrained optimization problem using a discretize-then-optimize approach. A key contribution is the elimination of the PDE constraint using a Lagrangian hyperbolic PDE solver. Lagrangian methods rely on the concept of characteristic curves. We approximate these curves using a fourth-order Runge-Kutta method. We also present an efficient algorithm for computing the derivatives of the final state of the system with respect to the velocity field. This allows us to use fast Gauss-Newton based methods. We present quickly converging iterative linear solvers using spectral preconditioners that render the overall optimization efficient and scalable. Our method is embedded into the image registration framework FAIR and, thus, supports the most commonly used similarity measures and regularization functionals. We demonstrate the potential of our new approach using several synthetic and real world test problems with up to 14.7 million degrees of freedom.

Numerical simulation of electrophoresis separation processes

NASA Technical Reports Server (NTRS)

Ganjoo, D. K.; Tezduyar, T. E.

1986-01-01

A new Petrov-Galerkin finite element formulation has been proposed for transient convection-diffusion problems. Most Petrov-Galerkin formulations take into account the spatial discretization, and the weighting functions so developed give satisfactory solutions for steady state problems. Though these schemes can be used for transient problems, there is scope for improvement. The schemes proposed here, which consider temporal as well as spatial discretization, provide improved solutions. Electrophoresis, which involves the motion of charged entities under the influence of an applied electric field, is governed by equations similiar to those encountered in fluid flow problems, i.e., transient convection-diffusion equations. Test problems are solved in electrophoresis and fluid flow. The results obtained are satisfactory. It is also expected that these schemes, suitably adapted, will improve the numerical solutions of the compressible Euler and the Navier-Stokes equations.

A Numerical Investigation of the Extinction of Low Strain Rate Diffusion Flames by an Agent in Microgravity

NASA Technical Reports Server (NTRS)

Puri, Ishwar K.

2004-01-01

Our goal has been to investigate the influence of both dilution and radiation on the extinction process of nonpremixed flames at low strain rates. Simulations have been performed by using a counterflow code and three radiation models have been included in it, namely, the optically thin, the narrowband, and discrete ordinate models. The counterflow flame code OPPDIFF was modified to account for heat transfer losses by radiation from the hot gases. The discrete ordinate method (DOM) approximation was first suggested by Chandrasekhar for solving problems in interstellar atmospheres. Carlson and Lathrop developed the method for solving multi-dimensional problem in neutron transport. Only recently has the method received attention in the field of heat transfer. Due to the applicability of the discrete ordinate method for thermal radiation problems involving flames, the narrowband code RADCAL was modified to calculate the radiative properties of the gases. A non-premixed counterflow flame was simulated with the discrete ordinate method for radiative emissions. In comparison with two other models, it was found that the heat losses were comparable with the optically thin and simple narrowband model. The optically thin model had the highest heat losses followed by the DOM model and the narrow-band model.

Discrete Particle Swarm Optimization Routing Protocol for Wireless Sensor Networks with Multiple Mobile Sinks

PubMed Central

Yang, Jin; Liu, Fagui; Cao, Jianneng; Wang, Liangming

2016-01-01

Mobile sinks can achieve load-balancing and energy-consumption balancing across the wireless sensor networks (WSNs). However, the frequent change of the paths between source nodes and the sinks caused by sink mobility introduces significant overhead in terms of energy and packet delays. To enhance network performance of WSNs with mobile sinks (MWSNs), we present an efficient routing strategy, which is formulated as an optimization problem and employs the particle swarm optimization algorithm (PSO) to build the optimal routing paths. However, the conventional PSO is insufficient to solve discrete routing optimization problems. Therefore, a novel greedy discrete particle swarm optimization with memory (GMDPSO) is put forward to address this problem. In the GMDPSO, particle’s position and velocity of traditional PSO are redefined under discrete MWSNs scenario. Particle updating rule is also reconsidered based on the subnetwork topology of MWSNs. Besides, by improving the greedy forwarding routing, a greedy search strategy is designed to drive particles to find a better position quickly. Furthermore, searching history is memorized to accelerate convergence. Simulation results demonstrate that our new protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption. PMID:27428971

A Discretization Algorithm for Meteorological Data and its Parallelization Based on Hadoop

NASA Astrophysics Data System (ADS)

Liu, Chao; Jin, Wen; Yu, Yuting; Qiu, Taorong; Bai, Xiaoming; Zou, Shuilong

2017-10-01

In view of the large amount of meteorological observation data, the property is more and the attribute values are continuous values, the correlation between the elements is the need for the application of meteorological data, this paper is devoted to solving the problem of how to better discretize large meteorological data to more effectively dig out the hidden knowledge in meteorological data and research on the improvement of discretization algorithm for large scale data, in order to achieve data in the large meteorological data discretization for the follow-up to better provide knowledge to provide protection, a discretization algorithm based on information entropy and inconsistency of meteorological attributes is proposed and the algorithm is parallelized under Hadoop platform. Finally, the comparison test validates the effectiveness of the proposed algorithm for discretization in the area of meteorological large data.

Constrained signal reconstruction from wavelet transform coefficients

DOE Office of Scientific and Technical Information (OSTI.GOV)

Brislawn, C.M.

1991-12-31

A new method is introduced for reconstructing a signal from an incomplete sampling of its Discrete Wavelet Transform (DWT). The algorithm yields a minimum-norm estimate satisfying a priori upper and lower bounds on the signal. The method is based on a finite-dimensional representation theory for minimum-norm estimates of bounded signals developed by R.E. Cole. Cole`s work has its origins in earlier techniques of maximum-entropy spectral estimation due to Lang and McClellan, which were adapted by Steinhardt, Goodrich and Roberts for minimum-norm spectral estimation. Cole`s extension of their work provides a representation for minimum-norm estimates of a class of generalized transformsmore » in terms of general correlation data (not just DFT`s of autocorrelation lags, as in spectral estimation). One virtue of this great generality is that it includes the inverse DWT. 20 refs.« less

Spectral Monte Carlo simulation of collimated solar irradiation transfer in a water-filled prismatic louver.

PubMed

Cai, Yaomin; Guo, Zhixiong

2018-04-20

The Monte Carlo model was developed to simulate the collimated solar irradiation transfer and energy harvest in a hollow louver made of silica glass and filled with water. The full solar spectrum from the air mass 1.5 database was adopted and divided into various discrete bands for spectral calculations. The band-averaged spectral properties for the silica glass and water were obtained. Ray tracing was employed to find the solar energy harvested by the louver. Computational efficiency and accuracy were examined through intensive comparisons of different band partition approaches, various photon numbers, and element divisions. The influence of irradiation direction on the solar energy harvest efficiency was scrutinized. It was found that within a 15° polar angle of incidence, the harvested solar energy in the louver was high, and the total absorption efficiency reached 61.2% under normal incidence for the current louver geometry.

Factorizing the factorization - a spectral-element solver for elliptic equations with linear operation count

NASA Astrophysics Data System (ADS)

Huismann, Immo; Stiller, Jörg; Fröhlich, Jochen

2017-10-01

The paper proposes a novel factorization technique for static condensation of a spectral-element discretization matrix that yields a linear operation count of just 13N multiplications for the residual evaluation, where N is the total number of unknowns. In comparison to previous work it saves a factor larger than 3 and outpaces unfactored variants for all polynomial degrees. Using the new technique as a building block for a preconditioned conjugate gradient method yields linear scaling of the runtime with N which is demonstrated for polynomial degrees from 2 to 32. This makes the spectral-element method cost effective even for low polynomial degrees. Moreover, the dependence of the iterative solution on the element aspect ratio is addressed, showing only a slight increase in the number of iterations for aspect ratios up to 128. Hence, the solver is very robust for practical applications.

Preliminary Analysis of the Performance of the Landsat 8/OLI Land Surface Reflectance Product

NASA Technical Reports Server (NTRS)

Vermote, Eric; Justice, Chris; Claverie, Martin; Franch, Belen

2016-01-01

The surface reflectance, i.e., satellite derived top of atmosphere (TOA) reflectance corrected for the temporally, spatially and spectrally varying scattering and absorbing effects of atmospheric gases and aerosols, is needed to monitor the land surface reliably. For this reason, the surface reflectance, and not TOA reflectance, is used to generate the greater majority of global land products, for example, from the Moderate Resolution Imaging Spectroradiometer (MODIS) and Visible Infrared Imaging Radiometer Suite (VIIRS) sensors. Even if atmospheric effects are minimized by sensor design, atmospheric effects are still challenging to correct. In particular, the strong impact of aerosols in the visible and near infrared spectral range can be difficult to correct, because they can be highly discrete in space and time (e.g., smoke plumes) and because of the complex scattering and absorbing properties of aerosols that vary spectrally and with aerosol size, shape, chemistry and density.

Spectrum-to-Spectrum Searching Using a Proteome-wide Spectral Library*

PubMed Central

Yen, Chia-Yu; Houel, Stephane; Ahn, Natalie G.; Old, William M.

2011-01-01

The unambiguous assignment of tandem mass spectra (MS/MS) to peptide sequences remains a key unsolved problem in proteomics. Spectral library search strategies have emerged as a promising alternative for peptide identification, in which MS/MS spectra are directly compared against a reference library of confidently assigned spectra. Two problems relate to library size. First, reference spectral libraries are limited to rediscovery of previously identified peptides and are not applicable to new peptides, because of their incomplete coverage of the human proteome. Second, problems arise when searching a spectral library the size of the entire human proteome. We observed that traditional dot product scoring methods do not scale well with spectral library size, showing reduction in sensitivity when library size is increased. We show that this problem can be addressed by optimizing scoring metrics for spectrum-to-spectrum searches with large spectral libraries. MS/MS spectra for the 1.3 million predicted tryptic peptides in the human proteome are simulated using a kinetic fragmentation model (MassAnalyzer version2.1) to create a proteome-wide simulated spectral library. Searches of the simulated library increase MS/MS assignments by 24% compared with Mascot, when using probabilistic and rank based scoring methods. The proteome-wide coverage of the simulated library leads to 11% increase in unique peptide assignments, compared with parallel searches of a reference spectral library. Further improvement is attained when reference spectra and simulated spectra are combined into a hybrid spectral library, yielding 52% increased MS/MS assignments compared with Mascot searches. Our study demonstrates the advantages of using probabilistic and rank based scores to improve performance of spectrum-to-spectrum search strategies. PMID:21532008

Exactly solvable random graph ensemble with extensively many short cycles

NASA Astrophysics Data System (ADS)

Aguirre López, Fabián; Barucca, Paolo; Fekom, Mathilde; Coolen, Anthony C. C.

2018-02-01

We introduce and analyse ensembles of 2-regular random graphs with a tuneable distribution of short cycles. The phenomenology of these graphs depends critically on the scaling of the ensembles’ control parameters relative to the number of nodes. A phase diagram is presented, showing a second order phase transition from a connected to a disconnected phase. We study both the canonical formulation, where the size is large but fixed, and the grand canonical formulation, where the size is sampled from a discrete distribution, and show their equivalence in the thermodynamical limit. We also compute analytically the spectral density, which consists of a discrete set of isolated eigenvalues, representing short cycles, and a continuous part, representing cycles of diverging size.

Acquisition and visualization techniques for narrow spectral color imaging.

PubMed

Neumann, László; García, Rafael; Basa, János; Hegedüs, Ramón

2013-06-01

This paper introduces a new approach in narrow-band imaging (NBI). Existing NBI techniques generate images by selecting discrete bands over the full visible spectrum or an even wider spectral range. In contrast, here we perform the sampling with filters covering a tight spectral window. This image acquisition method, named narrow spectral imaging, can be particularly useful when optical information is only available within a narrow spectral window, such as in the case of deep-water transmittance, which constitutes the principal motivation of this work. In this study we demonstrate the potential of the proposed photographic technique on nonunderwater scenes recorded under controlled conditions. To this end three multilayer narrow bandpass filters were employed, which transmit at 440, 456, and 470 nm bluish wavelengths, respectively. Since the differences among the images captured in such a narrow spectral window can be extremely small, both image acquisition and visualization require a novel approach. First, high-bit-depth images were acquired with multilayer narrow-band filters either placed in front of the illumination or mounted on the camera lens. Second, a color-mapping method is proposed, using which the input data can be transformed onto the entire display color gamut with a continuous and perceptually nearly uniform mapping, while ensuring optimally high information content for human perception.

Separation of arteries and veins in the cerebral cortex using physiological oscillations by optical imaging of intrinsic signal

NASA Astrophysics Data System (ADS)

Hu, Dewen; Wang, Yucheng; Liu, Yadong; Li, Ming; Liu, Fayi

2010-05-01

An automated method is presented for artery-vein separation in cerebral cortical images recorded with optical imaging of the intrinsic signal. The vessel-type separation method is based on the fact that the spectral distribution of intrinsic physiological oscillations varies from arterial regions to venous regions. In arterial regions, the spectral power is higher in the heartbeat frequency (HF), whereas in venous regions, the spectral power is higher in the respiration frequency (RF). The separation method was begun by extracting the vascular network and its centerline. Then the spectra of the optical intrinsic signals were estimated by the multitaper method. A standard F-test was performed on each discrete frequency point to test the statistical significance at the given level. Four periodic physiological oscillations were examined: HF, RF, and two other eigenfrequencies termed F1 and F2. The separation of arteries and veins was implemented with the fuzzy c-means clustering method and the region-growing approach by utilizing the spectral amplitudes and power-ratio values of the four eigenfrequencies on the vasculature. Subsequently, independent spectral distributions in the arteries, veins, and capillary bed were estimated for comparison, which showed that the spectral distributions of the intrinsic signals were very distinct between the arterial and venous regions.

Separation of arteries and veins in the cerebral cortex using physiological oscillations by optical imaging of intrinsic signal.

PubMed

Hu, Dewen; Wang, Yucheng; Liu, Yadong; Li, Ming; Liu, Fayi

2010-01-01

An automated method is presented for artery-vein separation in cerebral cortical images recorded with optical imaging of the intrinsic signal. The vessel-type separation method is based on the fact that the spectral distribution of intrinsic physiological oscillations varies from arterial regions to venous regions. In arterial regions, the spectral power is higher in the heartbeat frequency (HF), whereas in venous regions, the spectral power is higher in the respiration frequency (RF). The separation method was begun by extracting the vascular network and its centerline. Then the spectra of the optical intrinsic signals were estimated by the multitaper method. A standard F-test was performed on each discrete frequency point to test the statistical significance at the given level. Four periodic physiological oscillations were examined: HF, RF, and two other eigenfrequencies termed F1 and F2. The separation of arteries and veins was implemented with the fuzzy c-means clustering method and the region-growing approach by utilizing the spectral amplitudes and power-ratio values of the four eigenfrequencies on the vasculature. Subsequently, independent spectral distributions in the arteries, veins, and capillary bed were estimated for comparison, which showed that the spectral distributions of the intrinsic signals were very distinct between the arterial and venous regions.

Identification of spectral phenotypes in age-related macular degeneration patients

NASA Astrophysics Data System (ADS)

Davis, Bert; Russell, Steven; Abramoff, Michael; Nemeth, Sheila C.; Barriga, E. Simon; Soliz, Peter

2007-02-01

The purpose of this study is to show that there exists a spectral characteristic that differentiates normal macular tissue from various types of genetic-based macular diseases. This paper demonstrates statistically that hyperspectral images of macular and other retinal tissue can be used to spectrally differentiate different forms of age-related macular degeneration. A hyperspectral fundus imaging device has been developed and tested for the purpose of collecting hyperspectral images of the human retina. A methodology based on partial least squares and ANOVA has been applied to determine the hyperspectral representation of individual spectral characteristics of retinal features. Each discrete tissue type in the retina has an identifiable spectral shape or signature which, when combined with spatial context, aids in detection of pathological features. Variations in the amount and distribution of various ocular pigments or the inclusion of additional biochemical substances will allow detection of pathological conditions prior to traditional histological presentation. Fundus imaging cameras are ubiquitous and are one of the most common imaging modalities used in documenting a patient's retinal state for diagnosis, e.g. remotely, or for monitoring the progression of an ocular disease. The added diagnostic information obtained with only a minor retro-fit of a specialized spectral camera will lead to new diagnostic information to the clinical ophthalmologist or eye-care specialist.

A discrete model for geometrically nonlinear transverse free constrained vibrations of beams with various end conditions

NASA Astrophysics Data System (ADS)

Rahmouni, A.; Beidouri, Z.; Benamar, R.

2013-09-01

The purpose of the present paper was the development of a physically discrete model for geometrically nonlinear free transverse constrained vibrations of beams, which may replace, if sufficient degrees of freedom are used, the previously developed continuous nonlinear beam constrained vibration models. The discrete model proposed is an N-Degrees of Freedom (N-dof) system made of N masses placed at the ends of solid bars connected by torsional springs, presenting the beam flexural rigidity. The large transverse displacements of the bar ends induce a variation in their lengths giving rise to axial forces modelled by longitudinal springs. The calculations made allowed application of the semi-analytical model developed previously for nonlinear structural vibration involving three tensors, namely the mass tensor mij, the linear rigidity tensor kij and the nonlinearity tensor bijkl. By application of Hamilton's principle and spectral analysis, the nonlinear vibration problem is reduced to a nonlinear algebraic system, examined for increasing numbers of dof. The results obtained by the physically discrete model showed a good agreement and a quick convergence to the equivalent continuous beam model, for various fixed boundary conditions, for both the linear frequencies and the nonlinear backbone curves, and also for the corresponding mode shapes. The model, validated here for the simply supported and clamped ends, may be used in further works to present the flexural linear and nonlinear constrained vibrations of beams with various types of discontinuities in the mass or in the elasticity distributions. The development of an adequate discrete model including the effect of the axial strains induced by large displacement amplitudes, which is predominant in geometrically nonlinear transverse constrained vibrations of beams [1]. The investigation of the results such a discrete model may lead to in the case of nonlinear free vibrations. The development of the analogy between the previously developed models of geometrically nonlinear vibrations of Euler-Bernoulli continuous beams, and multidof system models made of N masses placed at the end of elastic bars connected by linear spiral springs, presenting the beam flexural rigidity. The validation of the new model via the analysis of the convergence conditions of the nonlinear frequencies obtained by the N-dof system, when N increases, and those obtained in previous works using a continuous description of the beam. In addition to the above points, the models developed in the present work, may constitute, in our opinion, a good illustration, from the didactic point of view, of the origin of the geometrical nonlinearity induced by large transverse vibration amplitudes of constrained continuous beams, which may appear as a Pythagorean Theorem effect. The first step of the work presented here was the formulation of the problem of nonlinear vibrations of the discrete system shown in Fig. 1 in terms of the semi-analytical method, denoted as SAA, developed in the early 90's by Benamar and coauthors [3], and discussed for example in [6,7]. This method has been applied successfully to various types of geometrically nonlinear problems of structural dynamics [1-3,6-8,10-12] and the objective here was to use it in order to develop a flexible discrete nonlinear model which may be useful for presenting in further works geometrically nonlinear vibrations of real beams with discontinuities in the mass, the section, or the stiffness distributions. The purpose in the present work was restricted to developing and validating the model, via comparison of the obtained dependence of the resonance frequencies of such a system on the amplitude of vibration, with the results obtained previously by continuous beams nonlinear models. In the SAA method, the dynamic system under consideration is described by the mass matrix [M], the rigidity matrix [K], and the nonlinear rigidity matrix [B], which depends on the amplitude of vibration, and involves a fourth-order nonlinearity tensor bijkl. Details are given below, corresponding to the definition of the tensors mentioned above. The analogy between the classical continuous Euler-Bernoulli model of beams and the present discrete model is developed, leading to the expressions for the equivalent spiral and axial stiffness, in terms of the continuous beam geometrical and mechanical characteristics. Some numerical results are also given, showing the amplitude dependence of the frequencies on the amplitude of vibration, and compared to the backbone curves obtained previously by the continuous nonlinear classical beam theory, presented for example in [3,5,8,15-22]. A convergence study is performed by increasing the number of masses and bars, showing a good convergence to the theoretical values of continuous beams.