Identities of almost Stable Group Representations

NASA Astrophysics Data System (ADS)

Vovsi, S. M.; Khung Shon, Nguen

1988-02-01

It is proved that almost stable group representations over a field have a finite basis of identities. Moreover, a variety generated by an arbitrary almost stable representation is Specht and all of its subvarieties have a finite uniformly bounded basis rank. In particular, the identities of an arbitrary representation of a finite group are finitely based.Bibliography: 17 titles.

Memory Efficient Ranking.

ERIC Educational Resources Information Center

Moffat, Alistair; And Others

1994-01-01

Describes an approximate document ranking process that uses a compact array of in-memory, low-precision approximations for document length. Combined with another rule for reducing the memory required by partial similarity accumulators, the approximation heuristic allows the ranking of large document collections using less than one byte of memory…

A Family of Finite-Dimensional Representations of Generalized Double Affine Hecke Algebras of Higher Rank

NASA Astrophysics Data System (ADS)

Fu, Yuchen; Shelley-Abrahamson, Seth

2016-06-01

We give explicit constructions of some finite-dimensional representations of generalized double affine Hecke algebras (GDAHA) of higher rank using R-matrices for U_q(sl_N). Our construction is motivated by an analogous construction of Silvia Montarani in the rational case. Using the Drinfeld-Kohno theorem for Knizhnik-Zamolodchikov differential equations, we prove that the explicit representations we produce correspond to Montarani's representations under a monodromy functor introduced by Etingof, Gan, and Oblomkov.

Rank-based permutation approaches for non-parametric factorial designs.

PubMed

Umlauft, Maria; Konietschke, Frank; Pauly, Markus

2017-11-01

Inference methods for null hypotheses formulated in terms of distribution functions in general non-parametric factorial designs are studied. The methods can be applied to continuous, ordinal or even ordered categorical data in a unified way, and are based only on ranks. In this set-up Wald-type statistics and ANOVA-type statistics are the current state of the art. The first method is asymptotically exact but a rather liberal statistical testing procedure for small to moderate sample size, while the latter is only an approximation which does not possess the correct asymptotic α level under the null. To bridge these gaps, a novel permutation approach is proposed which can be seen as a flexible generalization of the Kruskal-Wallis test to all kinds of factorial designs with independent observations. It is proven that the permutation principle is asymptotically correct while keeping its finite exactness property when data are exchangeable. The results of extensive simulation studies foster these theoretical findings. A real data set exemplifies its applicability. © 2017 The British Psychological Society.

Existence and stability, and discrete BB and rank conditions, for general mixed-hybrid finite elements in elasticity

NASA Technical Reports Server (NTRS)

Xue, W.-M.; Atluri, S. N.

1985-01-01

In this paper, all possible forms of mixed-hybrid finite element methods that are based on multi-field variational principles are examined as to the conditions for existence, stability, and uniqueness of their solutions. The reasons as to why certain 'simplified hybrid-mixed methods' in general, and the so-called 'simplified hybrid-displacement method' in particular (based on the so-called simplified variational principles), become unstable, are discussed. A comprehensive discussion of the 'discrete' BB-conditions, and the rank conditions, of the matrices arising in mixed-hybrid methods, is given. Some recent studies aimed at the assurance of such rank conditions, and the related problem of the avoidance of spurious kinematic modes, are presented.

Reconstruction of interatomic vectors by principle component analysis of nuclear magnetic resonance data in multiple alignments

NASA Astrophysics Data System (ADS)

Hus, Jean-Christophe; Bruschweiler, Rafael

2002-07-01

A general method is presented for the reconstruction of interatomic vector orientations from nuclear magnetic resonance (NMR) spectroscopic data of tensor interactions of rank 2, such as dipolar coupling and chemical shielding anisotropy interactions, in solids and partially aligned liquid-state systems. The method, called PRIMA, is based on a principal component analysis of the covariance matrix of the NMR parameters collected for multiple alignments. The five nonzero eigenvalues and their eigenvectors efficiently allow the approximate reconstruction of the vector orientations of the underlying interactions. The method is demonstrated for an isotropic distribution of sample orientations as well as for finite sets of orientations and internuclear vectors encountered in protein systems.

Hall viscosity of a chiral two-orbital superconductor at finite temperatures

NASA Astrophysics Data System (ADS)

Yazdani-Hamid, Meghdad; Shahzamanian, Mohammad Ali

2018-06-01

The Hall viscosity known as the anti-symmetric part of the viscosity fourth-rank tensor. Such dissipationless response which appears for systems with broken time reversal symmetry. We calculate this non-dissipative quantity for a chiral two-orbital superconductor placed in a viscoelastic magnetic field using the linear response theory and apply our calculations to the putative multiband chiral superconductor Sr2RuO4. The chirality origin of a multiband superconductor arises from the interorbital coupling of the superconducting state. This feature leads to the robustness of the Hall viscosity against temperature and impurity effects. We study the temperature effect on the Hall viscosity at the one-loop approximation.

Efficient l1 -norm-based low-rank matrix approximations for large-scale problems using alternating rectified gradient method.

PubMed

Kim, Eunwoo; Lee, Minsik; Choi, Chong-Ho; Kwak, Nojun; Oh, Songhwai

2015-02-01

Low-rank matrix approximation plays an important role in the area of computer vision and image processing. Most of the conventional low-rank matrix approximation methods are based on the l2 -norm (Frobenius norm) with principal component analysis (PCA) being the most popular among them. However, this can give a poor approximation for data contaminated by outliers (including missing data), because the l2 -norm exaggerates the negative effect of outliers. Recently, to overcome this problem, various methods based on the l1 -norm, such as robust PCA methods, have been proposed for low-rank matrix approximation. Despite the robustness of the methods, they require heavy computational effort and substantial memory for high-dimensional data, which is impractical for real-world problems. In this paper, we propose two efficient low-rank factorization methods based on the l1 -norm that find proper projection and coefficient matrices using the alternating rectified gradient method. The proposed methods are applied to a number of low-rank matrix approximation problems to demonstrate their efficiency and robustness. The experimental results show that our proposals are efficient in both execution time and reconstruction performance unlike other state-of-the-art methods.

The Relation of Finite Element and Finite Difference Methods

NASA Technical Reports Server (NTRS)

Vinokur, M.

1976-01-01

Finite element and finite difference methods are examined in order to bring out their relationship. It is shown that both methods use two types of discrete representations of continuous functions. They differ in that finite difference methods emphasize the discretization of independent variable, while finite element methods emphasize the discretization of dependent variable (referred to as functional approximations). An important point is that finite element methods use global piecewise functional approximations, while finite difference methods normally use local functional approximations. A general conclusion is that finite element methods are best designed to handle complex boundaries, while finite difference methods are superior for complex equations. It is also shown that finite volume difference methods possess many of the advantages attributed to finite element methods.

High-dimensional statistical inference: From vector to matrix

NASA Astrophysics Data System (ADS)

Zhang, Anru

Statistical inference for sparse signals or low-rank matrices in high-dimensional settings is of significant interest in a range of contemporary applications. It has attracted significant recent attention in many fields including statistics, applied mathematics and electrical engineering. In this thesis, we consider several problems in including sparse signal recovery (compressed sensing under restricted isometry) and low-rank matrix recovery (matrix recovery via rank-one projections and structured matrix completion). The first part of the thesis discusses compressed sensing and affine rank minimization in both noiseless and noisy cases and establishes sharp restricted isometry conditions for sparse signal and low-rank matrix recovery. The analysis relies on a key technical tool which represents points in a polytope by convex combinations of sparse vectors. The technique is elementary while leads to sharp results. It is shown that, in compressed sensing, delta kA < 1/3, deltak A+ thetak,kA < 1, or deltatkA < √( t - 1)/t for any given constant t ≥ 4/3 guarantee the exact recovery of all k sparse signals in the noiseless case through the constrained ℓ1 minimization, and similarly in affine rank minimization delta rM < 1/3, deltar M + thetar, rM < 1, or deltatrM< √( t - 1)/t ensure the exact reconstruction of all matrices with rank at most r in the noiseless case via the constrained nuclear norm minimization. Moreover, for any epsilon > 0, delta kA < 1/3 + epsilon, deltak A + thetak,kA < 1 + epsilon, or deltatkA< √(t - 1) / t + epsilon are not sufficient to guarantee the exact recovery of all k-sparse signals for large k. Similar result also holds for matrix recovery. In addition, the conditions delta kA<1/3, deltak A+ thetak,kA<1, delta tkA < √(t - 1)/t and deltarM<1/3, delta rM+ thetar,rM<1, delta trM< √(t - 1)/ t are also shown to be sufficient respectively for stable recovery of approximately sparse signals and low-rank matrices in the noisy case. For the second part of the thesis, we introduce a rank-one projection model for low-rank matrix recovery and propose a constrained nuclear norm minimization method for stable recovery of low-rank matrices in the noisy case. The procedure is adaptive to the rank and robust against small perturbations. Both upper and lower bounds for the estimation accuracy under the Frobenius norm loss are obtained. The proposed estimator is shown to be rate-optimal under certain conditions. The estimator is easy to implement via convex programming and performs well numerically. The techniques and main results developed in the chapter also have implications to other related statistical problems. An application to estimation of spiked covariance matrices from one-dimensional random projections is considered. The results demonstrate that it is still possible to accurately estimate the covariance matrix of a high-dimensional distribution based only on one-dimensional projections. For the third part of the thesis, we consider another setting of low-rank matrix completion. Current literature on matrix completion focuses primarily on independent sampling models under which the individual observed entries are sampled independently. Motivated by applications in genomic data integration, we propose a new framework of structured matrix completion (SMC) to treat structured missingness by design. Specifically, our proposed method aims at efficient matrix recovery when a subset of the rows and columns of an approximately low-rank matrix are observed. We provide theoretical justification for the proposed SMC method and derive lower bound for the estimation errors, which together establish the optimal rate of recovery over certain classes of approximately low-rank matrices. Simulation studies show that the method performs well in finite sample under a variety of configurations. The method is applied to integrate several ovarian cancer genomic studies with different extent of genomic measurements, which enables us to construct more accurate prediction rules for ovarian cancer survival.

Approximation theory for LQG (Linear-Quadratic-Gaussian) optimal control of flexible structures

NASA Technical Reports Server (NTRS)

Gibson, J. S.; Adamian, A.

1988-01-01

An approximation theory is presented for the LQG (Linear-Quadratic-Gaussian) optimal control problem for flexible structures whose distributed models have bounded input and output operators. The main purpose of the theory is to guide the design of finite dimensional compensators that approximate closely the optimal compensator. The optimal LQG problem separates into an optimal linear-quadratic regulator problem and an optimal state estimation problem. The solution of the former problem lies in the solution to an infinite dimensional Riccati operator equation. The approximation scheme approximates the infinite dimensional LQG problem with a sequence of finite dimensional LQG problems defined for a sequence of finite dimensional, usually finite element or modal, approximations of the distributed model of the structure. Two Riccati matrix equations determine the solution to each approximating problem. The finite dimensional equations for numerical approximation are developed, including formulas for converting matrix control and estimator gains to their functional representation to allow comparison of gains based on different orders of approximation. Convergence of the approximating control and estimator gains and of the corresponding finite dimensional compensators is studied. Also, convergence and stability of the closed-loop systems produced with the finite dimensional compensators are discussed. The convergence theory is based on the convergence of the solutions of the finite dimensional Riccati equations to the solutions of the infinite dimensional Riccati equations. A numerical example with a flexible beam, a rotating rigid body, and a lumped mass is given.

Automated facial recognition and candidate list rank change of computer generated facial approximations generated with multiple eye orb positions.

PubMed

Parks, Connie L; Monson, Keith L

2016-09-01

Expanding on research previously reported by the authors, this study further examines the recognizability of ReFace facial approximations generated with the following eye orb positions: (i) centrally within the bony eye socket, (ii) 1.0mm superior and 2.0mm lateral relative to center, and (iii) 1.0mm superior and 2.5mm lateral relative to center. Overall, 81% of the test subjects' approximation ranks improved with the use of either of the two supero-lateral eye orbs. Highly significant performance differences (p<0.01) were observed between the approximations with centrally positioned eye orbs (i) and approximations with the eye orbs placed in the supero-laterally positions (ii and iii). Noteworthy was the observation that in all cases when the best rank for an approximation was obtained with the eye orbs in position (iii), the second best rank was achieved with the eye orbs in position (ii). A similar pattern was also observed when the best rank was obtained with the eye orbs in position (ii), with 60% of the second best ranks observed in position (iii). It is argued, therefore, that an approximation constructed with the eye orbs placed in either of the two supero-lateral positions may be more effective and operationally informative than centrally positioned orbs. Copyright © 2016. Published by Elsevier Ireland Ltd.

On conforming mixed finite element methods for incompressible viscous flow problems

NASA Technical Reports Server (NTRS)

Gunzburger, M. D; Nicolaides, R. A.; Peterson, J. S.

1982-01-01

The application of conforming mixed finite element methods to obtain approximate solutions of linearized Navier-Stokes equations is examined. Attention is given to the convergence rates of various finite element approximations of the pressure and the velocity field. The optimality of the convergence rates are addressed in terms of comparisons of the approximation convergence to a smooth solution in relation to the best approximation available for the finite element space used. Consideration is also devoted to techniques for efficient use of a Gaussian elimination algorithm to obtain a solution to a system of linear algebraic equations derived by finite element discretizations of linear partial differential equations.

Estimating Independent Locally Shifted Random Utility Models for Ranking Data

ERIC Educational Resources Information Center

Lam, Kar Yin; Koning, Alex J.; Franses, Philip Hans

2011-01-01

We consider the estimation of probabilistic ranking models in the context of conjoint experiments. By using approximate rather than exact ranking probabilities, we avoided the computation of high-dimensional integrals. We extended the approximation technique proposed by Henery (1981) in the context of the Thurstone-Mosteller-Daniels model to any…

Convergence Rates of Finite Difference Stochastic Approximation Algorithms

DTIC Science & Technology

2016-06-01

dfferences as gradient approximations. It is shown that the convergence of these algorithms can be accelerated by controlling the implementation of the...descent algorithm, under various updating schemes using finite dfferences as gradient approximations. It is shown that the convergence of these...the Kiefer-Wolfowitz algorithm and the mirror descent algorithm, under various updating schemes using finite differences as gradient approximations. It

Two-parametric {\\delta'} -interactions: approximation by Schrödinger operators with localized rank-two perturbations

NASA Astrophysics Data System (ADS)

Golovaty, Yuriy

2018-06-01

We construct a norm resolvent approximation to the family of point interactions , by Schrödinger operators with localized rank-two perturbations coupled with short range potentials. In particular, a new approximation to the -interactions is obtained.

The exact probability distribution of the rank product statistics for replicated experiments.

PubMed

Eisinga, Rob; Breitling, Rainer; Heskes, Tom

2013-03-18

The rank product method is a widely accepted technique for detecting differentially regulated genes in replicated microarray experiments. To approximate the sampling distribution of the rank product statistic, the original publication proposed a permutation approach, whereas recently an alternative approximation based on the continuous gamma distribution was suggested. However, both approximations are imperfect for estimating small tail probabilities. In this paper we relate the rank product statistic to number theory and provide a derivation of its exact probability distribution and the true tail probabilities. Copyright © 2013 Federation of European Biochemical Societies. Published by Elsevier B.V. All rights reserved.

ɛ-connectedness, finite approximations, shape theory and coarse graining in hyperspaces

NASA Astrophysics Data System (ADS)

Alonso-Morón, Manuel; Cuchillo-Ibanez, Eduardo; Luzón, Ana

2008-12-01

We use upper semifinite hyperspaces of compacta to describe ε-connectedness and to compute homology from finite approximations. We find a new connection between ε-connectedness and the so-called Shape Theory. We construct a geodesically complete R-tree, by means of ε-components at different resolutions, whose behavior at infinite captures the topological structure of the space of components of a given compact metric space. We also construct inverse sequences of finite spaces using internal finite approximations of compact metric spaces. These sequences can be converted into inverse sequences of polyhedra and simplicial maps by means of what we call the Alexandroff-McCord correspondence. This correspondence allows us to relate upper semifinite hyperspaces of finite approximation with the Vietoris-Rips complexes of such approximations at different resolutions. Two motivating examples are included in the introduction. We propose this procedure as a different mathematical foundation for problems on data analysis. This process is intrinsically related to the methodology of shape theory. This paper reinforces Robins’s idea of using methods from shape theory to compute homology from finite approximations.

Exact p-values for pairwise comparison of Friedman rank sums, with application to comparing classifiers.

PubMed

Eisinga, Rob; Heskes, Tom; Pelzer, Ben; Te Grotenhuis, Manfred

2017-01-25

The Friedman rank sum test is a widely-used nonparametric method in computational biology. In addition to examining the overall null hypothesis of no significant difference among any of the rank sums, it is typically of interest to conduct pairwise comparison tests. Current approaches to such tests rely on large-sample approximations, due to the numerical complexity of computing the exact distribution. These approximate methods lead to inaccurate estimates in the tail of the distribution, which is most relevant for p-value calculation. We propose an efficient, combinatorial exact approach for calculating the probability mass distribution of the rank sum difference statistic for pairwise comparison of Friedman rank sums, and compare exact results with recommended asymptotic approximations. Whereas the chi-squared approximation performs inferiorly to exact computation overall, others, particularly the normal, perform well, except for the extreme tail. Hence exact calculation offers an improvement when small p-values occur following multiple testing correction. Exact inference also enhances the identification of significant differences whenever the observed values are close to the approximate critical value. We illustrate the proposed method in the context of biological machine learning, were Friedman rank sum difference tests are commonly used for the comparison of classifiers over multiple datasets. We provide a computationally fast method to determine the exact p-value of the absolute rank sum difference of a pair of Friedman rank sums, making asymptotic tests obsolete. Calculation of exact p-values is easy to implement in statistical software and the implementation in R is provided in one of the Additional files and is also available at http://www.ru.nl/publish/pages/726696/friedmanrsd.zip .

Rank-dependent deactivation in network evolution.

PubMed

Xu, Xin-Jian; Zhou, Ming-Chen

2009-12-01

A rank-dependent deactivation mechanism is introduced to network evolution. The growth dynamics of the network is based on a finite memory of individuals, which is implemented by deactivating one site at each time step. The model shows striking features of a wide range of real-world networks: power-law degree distribution, high clustering coefficient, and disassortative degree correlation.

Stable finite element approximations of two-phase flow with soluble surfactant

NASA Astrophysics Data System (ADS)

Barrett, John W.; Garcke, Harald; Nürnberg, Robert

2015-09-01

A parametric finite element approximation of incompressible two-phase flow with soluble surfactants is presented. The Navier-Stokes equations are coupled to bulk and surfaces PDEs for the surfactant concentrations. At the interface adsorption, desorption and stress balances involving curvature effects and Marangoni forces have to be considered. A parametric finite element approximation for the advection of the interface, which maintains good mesh properties, is coupled to the evolving surface finite element method, which is used to discretize the surface PDE for the interface surfactant concentration. The resulting system is solved together with standard finite element approximations of the Navier-Stokes equations and of the bulk parabolic PDE for the surfactant concentration. Semidiscrete and fully discrete approximations are analyzed with respect to stability, conservation and existence/uniqueness issues. The approach is validated for simple test cases and for complex scenarios, including colliding drops in a shear flow, which are computed in two and three space dimensions.

Finite-dimensional approximation for optimal fixed-order compensation of distributed parameter systems

NASA Technical Reports Server (NTRS)

Bernstein, Dennis S.; Rosen, I. G.

1988-01-01

In controlling distributed parameter systems it is often desirable to obtain low-order, finite-dimensional controllers in order to minimize real-time computational requirements. Standard approaches to this problem employ model/controller reduction techniques in conjunction with LQG theory. In this paper we consider the finite-dimensional approximation of the infinite-dimensional Bernstein/Hyland optimal projection theory. This approach yields fixed-finite-order controllers which are optimal with respect to high-order, approximating, finite-dimensional plant models. The technique is illustrated by computing a sequence of first-order controllers for one-dimensional, single-input/single-output, parabolic (heat/diffusion) and hereditary systems using spline-based, Ritz-Galerkin, finite element approximation. Numerical studies indicate convergence of the feedback gains with less than 2 percent performance degradation over full-order LQG controllers for the parabolic system and 10 percent degradation for the hereditary system.

Expanding the landscape of $$ \\mathcal{N} $$ = 2 rank 1 SCFTs

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

Argyres, Philip C.; Lotito, Matteo; Lu, Yongchao

Here, we refine our previous proposal [1-3] for systematically classifying 4d rank-1 N = 2 SCFTs by constructing their possible Coulomb branch geometries. Four new recently discussed rank-1 theories [4, 5], including novel N = 3 SCFTs, sit beautifully in our refined classification framework. By arguing for the consistency of their RG flows we can make a strong case for the existence of at least four additional rank-1 SCFTs, nearly doubling the number of known rank-1 SCFTs. The refinement consists of relaxing the assumption that the flavor symmetries of the SCFTs have no discrete factors. This results in an enlargedmore » (but finite) set of possible rank-1 SCFTs. Their existence can be further constrained using consistency of their central charges and RG flows.« less

Expanding the landscape of $$ \\mathcal{N} $$ = 2 rank 1 SCFTs

DOE PAGES

Argyres, Philip C.; Lotito, Matteo; Lu, Yongchao; ...

2016-05-16

Here, we refine our previous proposal [1-3] for systematically classifying 4d rank-1 N = 2 SCFTs by constructing their possible Coulomb branch geometries. Four new recently discussed rank-1 theories [4, 5], including novel N = 3 SCFTs, sit beautifully in our refined classification framework. By arguing for the consistency of their RG flows we can make a strong case for the existence of at least four additional rank-1 SCFTs, nearly doubling the number of known rank-1 SCFTs. The refinement consists of relaxing the assumption that the flavor symmetries of the SCFTs have no discrete factors. This results in an enlargedmore » (but finite) set of possible rank-1 SCFTs. Their existence can be further constrained using consistency of their central charges and RG flows.« less

A comparison of finite element and analytic models of acoustic scattering from rough poroelastic interfaces.

PubMed

Bonomo, Anthony L; Isakson, Marcia J; Chotiros, Nicholas P

2015-04-01

The finite element method is used to model acoustic scattering from rough poroelastic surfaces. Both monostatic and bistatic scattering strengths are calculated and compared with three analytic models: Perturbation theory, the Kirchhoff approximation, and the small-slope approximation. It is found that the small-slope approximation is in very close agreement with the finite element results for all cases studied and that perturbation theory and the Kirchhoff approximation can be considered valid in those instances where their predictions match those given by the small-slope approximation.

Functional Data Approximation on Bounded Domains using Polygonal Finite Elements.

PubMed

Cao, Juan; Xiao, Yanyang; Chen, Zhonggui; Wang, Wenping; Bajaj, Chandrajit

2018-07-01

We construct and analyze piecewise approximations of functional data on arbitrary 2D bounded domains using generalized barycentric finite elements, and particularly quadratic serendipity elements for planar polygons. We compare approximation qualities (precision/convergence) of these partition-of-unity finite elements through numerical experiments, using Wachspress coordinates, natural neighbor coordinates, Poisson coordinates, mean value coordinates, and quadratic serendipity bases over polygonal meshes on the domain. For a convex n -sided polygon, the quadratic serendipity elements have 2 n basis functions, associated in a Lagrange-like fashion to each vertex and each edge midpoint, rather than the usual n ( n + 1)/2 basis functions to achieve quadratic convergence. Two greedy algorithms are proposed to generate Voronoi meshes for adaptive functional/scattered data approximations. Experimental results show space/accuracy advantages for these quadratic serendipity finite elements on polygonal domains versus traditional finite elements over simplicial meshes. Polygonal meshes and parameter coefficients of the quadratic serendipity finite elements obtained by our greedy algorithms can be further refined using an L 2 -optimization to improve the piecewise functional approximation. We conduct several experiments to demonstrate the efficacy of our algorithm for modeling features/discontinuities in functional data/image approximation.

On approximately symmetric informationally complete positive operator-valued measures and related systems of quantum states

NASA Astrophysics Data System (ADS)

Klappenecker, Andreas; Rötteler, Martin; Shparlinski, Igor E.; Winterhof, Arne

2005-08-01

We address the problem of constructing positive operator-valued measures (POVMs) in finite dimension n consisting of n2 operators of rank one which have an inner product close to uniform. This is motivated by the related question of constructing symmetric informationally complete POVMs (SIC-POVMs) for which the inner products are perfectly uniform. However, SIC-POVMs are notoriously hard to construct and, despite some success of constructing them numerically, there is no analytic construction known. We present two constructions of approximate versions of SIC-POVMs, where a small deviation from uniformity of the inner products is allowed. The first construction is based on selecting vectors from a maximal collection of mutually unbiased bases and works whenever the dimension of the system is a prime power. The second construction is based on perturbing the matrix elements of a subset of mutually unbiased bases. Moreover, we construct vector systems in Cn which are almost orthogonal and which might turn out to be useful for quantum computation. Our constructions are based on results of analytic number theory.

A fast algorithm for determining bounds and accurate approximate p-values of the rank product statistic for replicate experiments.

PubMed

Heskes, Tom; Eisinga, Rob; Breitling, Rainer

2014-11-21

The rank product method is a powerful statistical technique for identifying differentially expressed molecules in replicated experiments. A critical issue in molecule selection is accurate calculation of the p-value of the rank product statistic to adequately address multiple testing. Both exact calculation and permutation and gamma approximations have been proposed to determine molecule-level significance. These current approaches have serious drawbacks as they are either computationally burdensome or provide inaccurate estimates in the tail of the p-value distribution. We derive strict lower and upper bounds to the exact p-value along with an accurate approximation that can be used to assess the significance of the rank product statistic in a computationally fast manner. The bounds and the proposed approximation are shown to provide far better accuracy over existing approximate methods in determining tail probabilities, with the slightly conservative upper bound protecting against false positives. We illustrate the proposed method in the context of a recently published analysis on transcriptomic profiling performed in blood. We provide a method to determine upper bounds and accurate approximate p-values of the rank product statistic. The proposed algorithm provides an order of magnitude increase in throughput as compared with current approaches and offers the opportunity to explore new application domains with even larger multiple testing issue. The R code is published in one of the Additional files and is available at http://www.ru.nl/publish/pages/726696/rankprodbounds.zip .

Second order accurate finite difference approximations for the transonic small disturbance equation and the full potential equation

NASA Technical Reports Server (NTRS)

Mostrel, M. M.

1988-01-01

New shock-capturing finite difference approximations for solving two scalar conservation law nonlinear partial differential equations describing inviscid, isentropic, compressible flows of aerodynamics at transonic speeds are presented. A global linear stability theorem is applied to these schemes in order to derive a necessary and sufficient condition for the finite element method. A technique is proposed to render the described approximations total variation-stable by applying the flux limiters to the nonlinear terms of the difference equation dimension by dimension. An entropy theorem applying to the approximations is proved, and an implicit, forward Euler-type time discretization of the approximation is presented. Results of some numerical experiments using the approximations are reported.

Error analysis of finite difference schemes applied to hyperbolic initial boundary value problems

NASA Technical Reports Server (NTRS)

Skollermo, G.

1979-01-01

Finite difference methods for the numerical solution of mixed initial boundary value problems for hyperbolic equations are studied. The reported investigation has the objective to develop a technique for the total error analysis of a finite difference scheme, taking into account initial approximations, boundary conditions, and interior approximation. Attention is given to the Cauchy problem and the initial approximation, the homogeneous problem in an infinite strip with inhomogeneous boundary data, the reflection of errors in the boundaries, and two different boundary approximations for the leapfrog scheme with a fourth order accurate difference operator in space.

The singularity structure of scale-invariant rank-2 Coulomb branches

NASA Astrophysics Data System (ADS)

Argyres, Philip C.; Long, Cody; Martone, Mario

2018-05-01

We compute the spectrum of scaling dimensions of Coulomb branch operators in 4d rank-2 N=2 superconformal field theories. Only a finite rational set of scaling dimensions is allowed. It is determined by using information about the global topology of the locus of metric singularities on the Coulomb branch, the special Kähler geometry near those singularities, and electric-magnetic duality monodromies along orbits of the U(1) R symmetry. A set of novel topological and geometric results are developed which promise to be useful for the study and classification of Coulomb branch geometries at all ranks.

A Constant-Factor Approximation Algorithm for the Link Building Problem

NASA Astrophysics Data System (ADS)

Olsen, Martin; Viglas, Anastasios; Zvedeniouk, Ilia

In this work we consider the problem of maximizing the PageRank of a given target node in a graph by adding k new links. We consider the case that the new links must point to the given target node (backlinks). Previous work [7] shows that this problem has no fully polynomial time approximation schemes unless P = NP. We present a polynomial time algorithm yielding a PageRank value within a constant factor from the optimal. We also consider the naive algorithm where we choose backlinks from nodes with high PageRank values compared to the outdegree and show that the naive algorithm performs much worse on certain graphs compared to the constant factor approximation scheme.

Approximate Approaches to the One-Dimensional Finite Potential Well

ERIC Educational Resources Information Center

Singh, Shilpi; Pathak, Praveen; Singh, Vijay A.

2011-01-01

The one-dimensional finite well is a textbook problem. We propose approximate approaches to obtain the energy levels of the well. The finite well is also encountered in semiconductor heterostructures where the carrier mass inside the well (m[subscript i]) is taken to be distinct from mass outside (m[subscript o]). A relevant parameter is the mass…

A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization

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

Rouet, François-Henry; Li, Xiaoye S.; Ghysels, Pieter

In this paper, we present a distributed-memory library for computations with dense structured matrices. A matrix is considered structured if its off-diagonal blocks can be approximated by a rank-deficient matrix with low numerical rank. Here, we use Hierarchically Semi-Separable (HSS) representations. Such matrices appear in many applications, for example, finite-element methods, boundary element methods, and so on. Exploiting this structure allows for fast solution of linear systems and/or fast computation of matrix-vector products, which are the two main building blocks of matrix computations. The compression algorithm that we use, that computes the HSS form of an input dense matrix, reliesmore » on randomized sampling with a novel adaptive sampling mechanism. We discuss the parallelization of this algorithm and also present the parallelization of structured matrix-vector product, structured factorization, and solution routines. The efficiency of the approach is demonstrated on large problems from different academic and industrial applications, on up to 8,000 cores. Finally, this work is part of a more global effort, the STRUctured Matrices PACKage (STRUMPACK) software package for computations with sparse and dense structured matrices. Hence, although useful on their own right, the routines also represent a step in the direction of a distributed-memory sparse solver.« less

A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization

DOE PAGES

Rouet, François-Henry; Li, Xiaoye S.; Ghysels, Pieter; ...

2016-06-30

In this paper, we present a distributed-memory library for computations with dense structured matrices. A matrix is considered structured if its off-diagonal blocks can be approximated by a rank-deficient matrix with low numerical rank. Here, we use Hierarchically Semi-Separable (HSS) representations. Such matrices appear in many applications, for example, finite-element methods, boundary element methods, and so on. Exploiting this structure allows for fast solution of linear systems and/or fast computation of matrix-vector products, which are the two main building blocks of matrix computations. The compression algorithm that we use, that computes the HSS form of an input dense matrix, reliesmore » on randomized sampling with a novel adaptive sampling mechanism. We discuss the parallelization of this algorithm and also present the parallelization of structured matrix-vector product, structured factorization, and solution routines. The efficiency of the approach is demonstrated on large problems from different academic and industrial applications, on up to 8,000 cores. Finally, this work is part of a more global effort, the STRUctured Matrices PACKage (STRUMPACK) software package for computations with sparse and dense structured matrices. Hence, although useful on their own right, the routines also represent a step in the direction of a distributed-memory sparse solver.« less

Finite-dimensional linear approximations of solutions to general irregular nonlinear operator equations and equations with quadratic operators

NASA Astrophysics Data System (ADS)

Kokurin, M. Yu.

2010-11-01

A general scheme for improving approximate solutions to irregular nonlinear operator equations in Hilbert spaces is proposed and analyzed in the presence of errors. A modification of this scheme designed for equations with quadratic operators is also examined. The technique of universal linear approximations of irregular equations is combined with the projection onto finite-dimensional subspaces of a special form. It is shown that, for finite-dimensional quadratic problems, the proposed scheme provides information about the global geometric properties of the intersections of quadrics.

Higher and lowest order mixed finite element approximation of subsurface flow problems with solutions of low regularity

NASA Astrophysics Data System (ADS)

Bause, Markus

2008-02-01

In this work we study mixed finite element approximations of Richards' equation for simulating variably saturated subsurface flow and simultaneous reactive solute transport. Whereas higher order schemes have proved their ability to approximate reliably reactive solute transport (cf., e.g. [Bause M, Knabner P. Numerical simulation of contaminant biodegradation by higher order methods and adaptive time stepping. Comput Visual Sci 7;2004:61-78]), the Raviart- Thomas mixed finite element method ( RT0) with a first order accurate flux approximation is popular for computing the underlying water flow field (cf. [Bause M, Knabner P. Computation of variably saturated subsurface flow by adaptive mixed hybrid finite element methods. Adv Water Resour 27;2004:565-581, Farthing MW, Kees CE, Miller CT. Mixed finite element methods and higher order temporal approximations for variably saturated groundwater flow. Adv Water Resour 26;2003:373-394, Starke G. Least-squares mixed finite element solution of variably saturated subsurface flow problems. SIAM J Sci Comput 21;2000:1869-1885, Younes A, Mosé R, Ackerer P, Chavent G. A new formulation of the mixed finite element method for solving elliptic and parabolic PDE with triangular elements. J Comp Phys 149;1999:148-167, Woodward CS, Dawson CN. Analysis of expanded mixed finite element methods for a nonlinear parabolic equation modeling flow into variably saturated porous media. SIAM J Numer Anal 37;2000:701-724]). This combination might be non-optimal. Higher order techniques could increase the accuracy of the flow field calculation and thereby improve the prediction of the solute transport. Here, we analyse the application of the Brezzi- Douglas- Marini element ( BDM1) with a second order accurate flux approximation to elliptic, parabolic and degenerate problems whose solutions lack the regularity that is assumed in optimal order error analyses. For the flow field calculation a superiority of the BDM1 approach to the RT0 one is observed, which however is less significant for the accompanying solute transport.

Optimization of the two-sample rank Neyman-Pearson detector

NASA Astrophysics Data System (ADS)

Akimov, P. S.; Barashkov, V. M.

1984-10-01

The development of optimal algorithms concerned with rank considerations in the case of finite sample sizes involves considerable mathematical difficulties. The present investigation provides results related to the design and the analysis of an optimal rank detector based on a utilization of the Neyman-Pearson criteria. The detection of a signal in the presence of background noise is considered, taking into account n observations (readings) x1, x2, ... xn in the experimental communications channel. The computation of the value of the rank of an observation is calculated on the basis of relations between x and the variable y, representing interference. Attention is given to conditions in the absence of a signal, the probability of the detection of an arriving signal, details regarding the utilization of the Neyman-Pearson criteria, the scheme of an optimal rank, multichannel, incoherent detector, and an analysis of the detector.

The Distribution of the Sum of Signed Ranks

ERIC Educational Resources Information Center

Albright, Brian

2012-01-01

We describe the calculation of the distribution of the sum of signed ranks and develop an exact recursive algorithm for the distribution as well as an approximation of the distribution using the normal. The results have applications to the non-parametric Wilcoxon signed-rank test.

Ranked solutions to a class of combinatorial optimizations - with applications in mass spectrometry based peptide sequencing

NASA Astrophysics Data System (ADS)

Doerr, Timothy; Alves, Gelio; Yu, Yi-Kuo

2006-03-01

Typical combinatorial optimizations are NP-hard; however, for a particular class of cost functions the corresponding combinatorial optimizations can be solved in polynomial time. This suggests a way to efficiently find approximate solutions - - find a transformation that makes the cost function as similar as possible to that of the solvable class. After keeping many high-ranking solutions using the approximate cost function, one may then re-assess these solutions with the full cost function to find the best approximate solution. Under this approach, it is important to be able to assess the quality of the solutions obtained, e.g., by finding the true ranking of kth best approximate solution when all possible solutions are considered exhaustively. To tackle this statistical issue, we provide a systematic method starting with a scaling function generated from the fininte number of high- ranking solutions followed by a convergent iterative mapping. This method, useful in a variant of the directed paths in random media problem proposed here, can also provide a statistical significance assessment for one of the most important proteomic tasks - - peptide sequencing using tandem mass spectrometry data.

Finite mixture modeling for vehicle crash data with application to hotspot identification.

PubMed

Park, Byung-Jung; Lord, Dominique; Lee, Chungwon

2014-10-01

The application of finite mixture regression models has recently gained an interest from highway safety researchers because of its considerable potential for addressing unobserved heterogeneity. Finite mixture models assume that the observations of a sample arise from two or more unobserved components with unknown proportions. Both fixed and varying weight parameter models have been shown to be useful for explaining the heterogeneity and the nature of the dispersion in crash data. Given the superior performance of the finite mixture model, this study, using observed and simulated data, investigated the relative performance of the finite mixture model and the traditional negative binomial (NB) model in terms of hotspot identification. For the observed data, rural multilane segment crash data for divided highways in California and Texas were used. The results showed that the difference measured by the percentage deviation in ranking orders was relatively small for this dataset. Nevertheless, the ranking results from the finite mixture model were considered more reliable than the NB model because of the better model specification. This finding was also supported by the simulation study which produced a high number of false positives and negatives when a mis-specified model was used for hotspot identification. Regarding an optimal threshold value for identifying hotspots, another simulation analysis indicated that there is a discrepancy between false discovery (increasing) and false negative rates (decreasing). Since the costs associated with false positives and false negatives are different, it is suggested that the selected optimal threshold value should be decided by considering the trade-offs between these two costs so that unnecessary expenses are minimized. Copyright © 2014 Elsevier Ltd. All rights reserved.

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.

Polynomial meta-models with canonical low-rank approximations: Numerical insights and comparison to sparse polynomial chaos expansions

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

Konakli, Katerina, E-mail: konakli@ibk.baug.ethz.ch; Sudret, Bruno

2016-09-15

The growing need for uncertainty analysis of complex computational models has led to an expanding use of meta-models across engineering and sciences. The efficiency of meta-modeling techniques relies on their ability to provide statistically-equivalent analytical representations based on relatively few evaluations of the original model. Polynomial chaos expansions (PCE) have proven a powerful tool for developing meta-models in a wide range of applications; the key idea thereof is to expand the model response onto a basis made of multivariate polynomials obtained as tensor products of appropriate univariate polynomials. The classical PCE approach nevertheless faces the “curse of dimensionality”, namely themore » exponential increase of the basis size with increasing input dimension. To address this limitation, the sparse PCE technique has been proposed, in which the expansion is carried out on only a few relevant basis terms that are automatically selected by a suitable algorithm. An alternative for developing meta-models with polynomial functions in high-dimensional problems is offered by the newly emerged low-rank approximations (LRA) approach. By exploiting the tensor–product structure of the multivariate basis, LRA can provide polynomial representations in highly compressed formats. Through extensive numerical investigations, we herein first shed light on issues relating to the construction of canonical LRA with a particular greedy algorithm involving a sequential updating of the polynomial coefficients along separate dimensions. Specifically, we examine the selection of optimal rank, stopping criteria in the updating of the polynomial coefficients and error estimation. In the sequel, we confront canonical LRA to sparse PCE in structural-mechanics and heat-conduction applications based on finite-element solutions. Canonical LRA exhibit smaller errors than sparse PCE in cases when the number of available model evaluations is small with respect to the input dimension, a situation that is often encountered in real-life problems. By introducing the conditional generalization error, we further demonstrate that canonical LRA tend to outperform sparse PCE in the prediction of extreme model responses, which is critical in reliability analysis.« less

An Eigenvalue Analysis of finite-difference approximations for hyperbolic IBVPs

NASA Technical Reports Server (NTRS)

Warming, Robert F.; Beam, Richard M.

1989-01-01

The eigenvalue spectrum associated with a linear finite-difference approximation plays a crucial role in the stability analysis and in the actual computational performance of the discrete approximation. The eigenvalue spectrum associated with the Lax-Wendroff scheme applied to a model hyperbolic equation was investigated. For an initial-boundary-value problem (IBVP) on a finite domain, the eigenvalue or normal mode analysis is analytically intractable. A study of auxiliary problems (Dirichlet and quarter-plane) leads to asymptotic estimates of the eigenvalue spectrum and to an identification of individual modes as either benign or unstable. The asymptotic analysis establishes an intuitive as well as quantitative connection between the algebraic tests in the theory of Gustafsson, Kreiss, and Sundstrom and Lax-Richtmyer L(sub 2) stability on a finite domain.

Technique for evaluation of the strong potential Born approximation for electron capture

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

Sil, N.C.; McGuire, J.H.

1985-04-01

A technique is presented for evaluating differential cross sections in the strong potential Born (SPB) approximation. Our final expression is expressed as a finite sum of one-dimensional integrals, expressible as a finite sum of derivatives of hypergeometric functions.

Approximate controllability of a system of parabolic equations with delay

NASA Astrophysics Data System (ADS)

Carrasco, Alexander; Leiva, Hugo

2008-09-01

In this paper we give necessary and sufficient conditions for the approximate controllability of the following system of parabolic equations with delay: where [Omega] is a bounded domain in , D is an n×n nondiagonal matrix whose eigenvalues are semi-simple with nonnegative real part, the control and B[set membership, variant]L(U,Z) with , . The standard notation zt(x) defines a function from [-[tau],0] to (with x fixed) by zt(x)(s)=z(t+s,x), -[tau][less-than-or-equals, slant]s[less-than-or-equals, slant]0. Here [tau][greater-or-equal, slanted]0 is the maximum delay, which is supposed to be finite. We assume that the operator is linear and bounded, and [phi]0[set membership, variant]Z, [phi][set membership, variant]L2([-[tau],0];Z). To this end: First, we reformulate this system into a standard first-order delay equation. Secondly, the semigroup associated with the first-order delay equation on an appropriate product space is expressed as a series of strongly continuous semigroups and orthogonal projections related with the eigenvalues of the Laplacian operator (); this representation allows us to reduce the controllability of this partial differential equation with delay to a family of ordinary delay equations. Finally, we use the well-known result on the rank condition for the approximate controllability of delay system to derive our main result.

Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners

DOE PAGES

Li, Ruipeng; Saad, Yousef

2017-08-01

This study presents a parallel preconditioning method for distributed sparse linear systems, based on an approximate inverse of the original matrix, that adopts a general framework of distributed sparse matrices and exploits domain decomposition (DD) and low-rank corrections. The DD approach decouples the matrix and, once inverted, a low-rank approximation is applied by exploiting the Sherman--Morrison--Woodbury formula, which yields two variants of the preconditioning methods. The low-rank expansion is computed by the Lanczos procedure with reorthogonalizations. Numerical experiments indicate that, when combined with Krylov subspace accelerators, this preconditioner can be efficient and robust for solving symmetric sparse linear systems. Comparisonsmore » with pARMS, a DD-based parallel incomplete LU (ILU) preconditioning method, are presented for solving Poisson's equation and linear elasticity problems.« less

Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners

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

Li, Ruipeng; Saad, Yousef

This study presents a parallel preconditioning method for distributed sparse linear systems, based on an approximate inverse of the original matrix, that adopts a general framework of distributed sparse matrices and exploits domain decomposition (DD) and low-rank corrections. The DD approach decouples the matrix and, once inverted, a low-rank approximation is applied by exploiting the Sherman--Morrison--Woodbury formula, which yields two variants of the preconditioning methods. The low-rank expansion is computed by the Lanczos procedure with reorthogonalizations. Numerical experiments indicate that, when combined with Krylov subspace accelerators, this preconditioner can be efficient and robust for solving symmetric sparse linear systems. Comparisonsmore » with pARMS, a DD-based parallel incomplete LU (ILU) preconditioning method, are presented for solving Poisson's equation and linear elasticity problems.« less

On the dynamics of approximating schemes for dissipative nonlinear equations

NASA Technical Reports Server (NTRS)

Jones, Donald A.

1993-01-01

Since one can rarely write down the analytical solutions to nonlinear dissipative partial differential equations (PDE's), it is important to understand whether, and in what sense, the behavior of approximating schemes to these equations reflects the true dynamics of the original equations. Further, because standard error estimates between approximations of the true solutions coming from spectral methods - finite difference or finite element schemes, for example - and the exact solutions grow exponentially in time, this analysis provides little value in understanding the infinite time behavior of a given approximating scheme. The notion of the global attractor has been useful in quantifying the infinite time behavior of dissipative PDEs, such as the Navier-Stokes equations. Loosely speaking, the global attractor is all that remains of a sufficiently large bounded set in phase space mapped infinitely forward in time under the evolution of the PDE. Though the attractor has been shown to have some nice properties - it is compact, connected, and finite dimensional, for example - it is in general quite complicated. Nevertheless, the global attractor gives a way to understand how the infinite time behavior of approximating schemes such as the ones coming from a finite difference, finite element, or spectral method relates to that of the original PDE. Indeed, one can often show that such approximations also have a global attractor. We therefore only need to understand how the structure of the attractor for the PDE behaves under approximation. This is by no means a trivial task. Several interesting results have been obtained in this direction. However, we will not go into the details. We mention here that approximations generally lose information about the system no matter how accurate they are. There are examples that show certain parts of the attractor may be lost by arbitrary small perturbations of the original equations.

Fast iterative solution of the Bethe-Salpeter eigenvalue problem using low-rank and QTT tensor approximation

NASA Astrophysics Data System (ADS)

Benner, Peter; Dolgov, Sergey; Khoromskaia, Venera; Khoromskij, Boris N.

2017-04-01

In this paper, we propose and study two approaches to approximate the solution of the Bethe-Salpeter equation (BSE) by using structured iterative eigenvalue solvers. Both approaches are based on the reduced basis method and low-rank factorizations of the generating matrices. We also propose to represent the static screen interaction part in the BSE matrix by a small active sub-block, with a size balancing the storage for rank-structured representations of other matrix blocks. We demonstrate by various numerical tests that the combination of the diagonal plus low-rank plus reduced-block approximation exhibits higher precision with low numerical cost, providing as well a distinct two-sided error estimate for the smallest eigenvalues of the Bethe-Salpeter operator. The complexity is reduced to O (Nb2) in the size of the atomic orbitals basis set, Nb, instead of the practically intractable O (Nb6) scaling for the direct diagonalization. In the second approach, we apply the quantized-TT (QTT) tensor representation to both, the long eigenvectors and the column vectors in the rank-structured BSE matrix blocks, and combine this with the ALS-type iteration in block QTT format. The QTT-rank of the matrix entities possesses almost the same magnitude as the number of occupied orbitals in the molecular systems, No

The Cantor-Bendixson Rank of Certain Bridgeland-Smith Stability Conditions

NASA Astrophysics Data System (ADS)

Aulicino, David

2018-01-01

We provide a novel proof that the set of directions that admit a saddle connection on a meromorphic quadratic differential with at least one pole of order at least two is closed, which generalizes a result of Bridgeland and Smith, and Gaiotto, Moore, and Neitzke. Secondly, we show that this set has finite Cantor-Bendixson rank and give a tight bound. Finally, we present a family of surfaces realizing all possible Cantor-Bendixson ranks. The techniques in the proof of this result exclusively concern Abelian differentials on Riemann surfaces, also known as translation surfaces. The concept of a "slit translation surface" is introduced as the primary tool for studying meromorphic quadratic differentials with higher order poles.

Validity of Other-Gender-Normed Scales on the Kuder Occupational Interest Survey.

ERIC Educational Resources Information Center

Zytowski, Donald G.; Laing, Joan

1978-01-01

Investigated the relationship between KOIS twin scales normed separately on males and females for occupations and college majors. Rankings on own- and other-gender-normed scales correlated highly. The scales were approximately equal in predictive validity. Rankings on other-gender-normed scales provided an accurate estimate of expected rankings on…

Rank Weighting in Multiattribute Utility Decision Making: Avoiding the Pitfalls of Equal Weights.

DTIC Science & Technology

1979-09-01

set change are discussed in relation to the conditions of Wainer’s (Wainer, 1976) ’ equal weights theorem’ and the resulting sensitivity to weighting of...as equal weights. Rank weighting of importance dimensions demonstrate marked improvement of approximation as reflected in both Pearson and rank order

On the existence and stability conditions for mixed-hybrid finite element solutions based on Reissner's variational principle

NASA Technical Reports Server (NTRS)

Karlovitz, L. A.; Atluri, S. N.; Xue, W.-M.

1985-01-01

The extensions of Reissner's two-field (stress and displacement) principle to the cases wherein the displacement field is discontinuous and/or the stress field results in unreciprocated tractions, at a finite number of surfaces ('interelement boundaries') in a domain (as, for instance, when the domain is discretized into finite elements), is considered. The conditions for the existence, uniqueness, and stability of mixed-hybrid finite element solutions based on such discontinuous fields, are summarized. The reduction of these global conditions to local ('element') level, and the attendant conditions on the ranks of element matrices, are discussed. Two examples of stable, invariant, least-order elements - a four-node square planar element and an eight-node cubic element - are discussed in detail.

Advances in the p and h-p Versions of the Finite Element Method. A survey

DTIC Science & Technology

1988-01-01

p versions is the code PROBE which was developed by NOETIC Technologies, St. Louis, MO [49] [60]. PROBE solves two dimensional problems of linear...p and h-p versions of the finite element method was studied in detail from various point of view. We will mention here some essential illustrative...49] PROBE - Sample Problems. Series of reports, Noetic Technologies, St. Louis, MO 63117. [50] Rank, E., Babu’ka, I., An expert system for the

Computational Aspects of Sensitivity Calculations in Linear Transient Structural Analysis. Ph.D. Thesis

NASA Technical Reports Server (NTRS)

Greene, William H.

1989-01-01

A study has been performed focusing on the calculation of sensitivities of displacements, velocities, accelerations, and stresses in linear, structural, transient response problems. One significant goal was to develop and evaluate sensitivity calculation techniques suitable for large-order finite element analyses. Accordingly, approximation vectors such as vibration mode shapes are used to reduce the dimensionality of the finite element model. Much of the research focused on the accuracy of both response quantities and sensitivities as a function of number of vectors used. Two types of sensitivity calculation techniques were developed and evaluated. The first type of technique is an overall finite difference method where the analysis is repeated for perturbed designs. The second type of technique is termed semianalytical because it involves direct, analytical differentiation of the equations of motion with finite difference approximation of the coefficient matrices. To be computationally practical in large-order problems, the overall finite difference methods must use the approximation vectors from the original design in the analyses of the perturbed models.

Dual Dynamically Orthogonal approximation of incompressible Navier Stokes equations with random boundary conditions

NASA Astrophysics Data System (ADS)

Musharbash, Eleonora; Nobile, Fabio

2018-02-01

In this paper we propose a method for the strong imposition of random Dirichlet boundary conditions in the Dynamical Low Rank (DLR) approximation of parabolic PDEs and, in particular, incompressible Navier Stokes equations. We show that the DLR variational principle can be set in the constrained manifold of all S rank random fields with a prescribed value on the boundary, expressed in low rank format, with rank smaller then S. We characterize the tangent space to the constrained manifold by means of a Dual Dynamically Orthogonal (Dual DO) formulation, in which the stochastic modes are kept orthonormal and the deterministic modes satisfy suitable boundary conditions, consistent with the original problem. The Dual DO formulation is also convenient to include the incompressibility constraint, when dealing with incompressible Navier Stokes equations. We show the performance of the proposed Dual DO approximation on two numerical test cases: the classical benchmark of a laminar flow around a cylinder with random inflow velocity, and a biomedical application for simulating blood flow in realistic carotid artery reconstructed from MRI data with random inflow conditions coming from Doppler measurements.

Tensor numerical methods in quantum chemistry: from Hartree-Fock to excitation energies.

PubMed

Khoromskaia, Venera; Khoromskij, Boris N

2015-12-21

We resume the recent successes of the grid-based tensor numerical methods and discuss their prospects in real-space electronic structure calculations. These methods, based on the low-rank representation of the multidimensional functions and integral operators, first appeared as an accurate tensor calculus for the 3D Hartree potential using 1D complexity operations, and have evolved to entirely grid-based tensor-structured 3D Hartree-Fock eigenvalue solver. It benefits from tensor calculation of the core Hamiltonian and two-electron integrals (TEI) in O(n log n) complexity using the rank-structured approximation of basis functions, electron densities and convolution integral operators all represented on 3D n × n × n Cartesian grids. The algorithm for calculating TEI tensor in a form of the Cholesky decomposition is based on multiple factorizations using algebraic 1D "density fitting" scheme, which yield an almost irreducible number of product basis functions involved in the 3D convolution integrals, depending on a threshold ε > 0. The basis functions are not restricted to separable Gaussians, since the analytical integration is substituted by high-precision tensor-structured numerical quadratures. The tensor approaches to post-Hartree-Fock calculations for the MP2 energy correction and for the Bethe-Salpeter excitation energies, based on using low-rank factorizations and the reduced basis method, were recently introduced. Another direction is towards the tensor-based Hartree-Fock numerical scheme for finite lattices, where one of the numerical challenges is the summation of electrostatic potentials of a large number of nuclei. The 3D grid-based tensor method for calculation of a potential sum on a L × L × L lattice manifests the linear in L computational work, O(L), instead of the usual O(L(3) log L) scaling by the Ewald-type approaches.

A Numerical Approximation Framework for the Stochastic Linear Quadratic Regulator on Hilbert Spaces

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

Levajković, Tijana, E-mail: tijana.levajkovic@uibk.ac.at, E-mail: t.levajkovic@sf.bg.ac.rs; Mena, Hermann, E-mail: hermann.mena@uibk.ac.at; Tuffaha, Amjad, E-mail: atufaha@aus.edu

We present an approximation framework for computing the solution of the stochastic linear quadratic control problem on Hilbert spaces. We focus on the finite horizon case and the related differential Riccati equations (DREs). Our approximation framework is concerned with the so-called “singular estimate control systems” (Lasiecka in Optimal control problems and Riccati equations for systems with unbounded controls and partially analytic generators: applications to boundary and point control problems, 2004) which model certain coupled systems of parabolic/hyperbolic mixed partial differential equations with boundary or point control. We prove that the solutions of the approximate finite-dimensional DREs converge to the solutionmore » of the infinite-dimensional DRE. In addition, we prove that the optimal state and control of the approximate finite-dimensional problem converge to the optimal state and control of the corresponding infinite-dimensional problem.« less

Biometric correspondence between reface computerized facial approximations and CT-derived ground truth skin surface models objectively examined using an automated facial recognition system.

PubMed

Parks, Connie L; Monson, Keith L

2018-05-01

This study employed an automated facial recognition system as a means of objectively evaluating biometric correspondence between a ReFace facial approximation and the computed tomography (CT) derived ground truth skin surface of the same individual. High rates of biometric correspondence were observed, irrespective of rank class (R k ) or demographic cohort examined. Overall, 48% of the test subjects' ReFace approximation probes (n=96) were matched to his or her corresponding ground truth skin surface image at R 1 , a rank indicating a high degree of biometric correspondence and a potential positive identification. Identification rates improved with each successively broader rank class (R 10 =85%, R 25 =96%, and R 50 =99%), with 100% identification by R 57 . A sharp increase (39% mean increase) in identification rates was observed between R 1 and R 10 across most rank classes and demographic cohorts. In contrast, significantly lower (p<0.01) increases in identification rates were observed between R 10 and R 25 (8% mean increase) and R 25 and R 50 (3% mean increase). No significant (p>0.05) performance differences were observed across demographic cohorts or CT scan protocols. Performance measures observed in this research suggest that ReFace approximations are biometrically similar to the actual faces of the approximated individuals and, therefore, may have potential operational utility in contexts in which computerized approximations are utilized as probes in automated facial recognition systems. Copyright © 2018. Published by Elsevier B.V.

Scalable Nonparametric Low-Rank Kernel Learning Using Block Coordinate Descent.

PubMed

Hu, En-Liang; Kwok, James T

2015-09-01

Nonparametric kernel learning (NPKL) is a flexible approach to learn the kernel matrix directly without assuming any parametric form. It can be naturally formulated as a semidefinite program (SDP), which, however, is not very scalable. To address this problem, we propose the combined use of low-rank approximation and block coordinate descent (BCD). Low-rank approximation avoids the expensive positive semidefinite constraint in the SDP by replacing the kernel matrix variable with V(T)V, where V is a low-rank matrix. The resultant nonlinear optimization problem is then solved by BCD, which optimizes each column of V sequentially. It can be shown that the proposed algorithm has nice convergence properties and low computational complexities. Experiments on a number of real-world data sets show that the proposed algorithm outperforms state-of-the-art NPKL solvers.

Error analysis and correction of discrete solutions from finite element codes

NASA Technical Reports Server (NTRS)

Thurston, G. A.; Stein, P. A.; Knight, N. F., Jr.; Reissner, J. E.

1984-01-01

Many structures are an assembly of individual shell components. Therefore, results for stresses and deflections from finite element solutions for each shell component should agree with the equations of shell theory. This paper examines the problem of applying shell theory to the error analysis and the correction of finite element results. The general approach to error analysis and correction is discussed first. Relaxation methods are suggested as one approach to correcting finite element results for all or parts of shell structures. Next, the problem of error analysis of plate structures is examined in more detail. The method of successive approximations is adapted to take discrete finite element solutions and to generate continuous approximate solutions for postbuckled plates. Preliminary numerical results are included.

A block iterative finite element algorithm for numerical solution of the steady-state, compressible Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Cooke, C. H.

1976-01-01

An iterative method for numerically solving the time independent Navier-Stokes equations for viscous compressible flows is presented. The method is based upon partial application of the Gauss-Seidel principle in block form to the systems of nonlinear algebraic equations which arise in construction of finite element (Galerkin) models approximating solutions of fluid dynamic problems. The C deg-cubic element on triangles is employed for function approximation. Computational results for a free shear flow at Re = 1,000 indicate significant achievement of economy in iterative convergence rate over finite element and finite difference models which employ the customary time dependent equations and asymptotic time marching procedure to steady solution. Numerical results are in excellent agreement with those obtained for the same test problem employing time marching finite element and finite difference solution techniques.

The constraint method: A new finite element technique. [applied to static and dynamic loads on plates

NASA Technical Reports Server (NTRS)

Tsai, C.; Szabo, B. A.

1973-01-01

An approch to the finite element method which utilizes families of conforming finite elements based on complete polynomials is presented. Finite element approximations based on this method converge with respect to progressively reduced element sizes as well as with respect to progressively increasing orders of approximation. Numerical results of static and dynamic applications of plates are presented to demonstrate the efficiency of the method. Comparisons are made with plate elements in NASTRAN and the high-precision plate element developed by Cowper and his co-workers. Some considerations are given to implementation of the constraint method into general purpose computer programs such as NASTRAN.

Finite element approximation of an optimal control problem for the von Karman equations

NASA Technical Reports Server (NTRS)

Hou, L. Steven; Turner, James C.

1994-01-01

This paper is concerned with optimal control problems for the von Karman equations with distributed controls. We first show that optimal solutions exist. We then show that Lagrange multipliers may be used to enforce the constraints and derive an optimality system from which optimal states and controls may be deduced. Finally we define finite element approximations of solutions for the optimality system and derive error estimates for the approximations.

POSTPROCESSING MIXED FINITE ELEMENT METHODS FOR SOLVING CAHN-HILLIARD EQUATION: METHODS AND ERROR ANALYSIS

PubMed Central

Wang, Wansheng; Chen, Long; Zhou, Jie

2015-01-01

A postprocessing technique for mixed finite element methods for the Cahn-Hilliard equation is developed and analyzed. Once the mixed finite element approximations have been computed at a fixed time on the coarser mesh, the approximations are postprocessed by solving two decoupled Poisson equations in an enriched finite element space (either on a finer grid or a higher-order space) for which many fast Poisson solvers can be applied. The nonlinear iteration is only applied to a much smaller size problem and the computational cost using Newton and direct solvers is negligible compared with the cost of the linear problem. The analysis presented here shows that this technique remains the optimal rate of convergence for both the concentration and the chemical potential approximations. The corresponding error estimate obtained in our paper, especially the negative norm error estimates, are non-trivial and different with the existing results in the literatures. PMID:27110063

Finite Element A Posteriori Error Estimation for Heat Conduction. Degree awarded by George Washington Univ.

NASA Technical Reports Server (NTRS)

Lang, Christapher G.; Bey, Kim S. (Technical Monitor)

2002-01-01

This research investigates residual-based a posteriori error estimates for finite element approximations of heat conduction in single-layer and multi-layered materials. The finite element approximation, based upon hierarchical modelling combined with p-version finite elements, is described with specific application to a two-dimensional, steady state, heat-conduction problem. Element error indicators are determined by solving an element equation for the error with the element residual as a source, and a global error estimate in the energy norm is computed by collecting the element contributions. Numerical results of the performance of the error estimate are presented by comparisons to the actual error. Two methods are discussed and compared for approximating the element boundary flux. The equilibrated flux method provides more accurate results for estimating the error than the average flux method. The error estimation is applied to multi-layered materials with a modification to the equilibrated flux method to approximate the discontinuous flux along a boundary at the material interfaces. A directional error indicator is developed which distinguishes between the hierarchical modeling error and the finite element error. Numerical results are presented for single-layered materials which show that the directional indicators accurately determine which contribution to the total error dominates.

Assignment Of Finite Elements To Parallel Processors

NASA Technical Reports Server (NTRS)

Salama, Moktar A.; Flower, Jon W.; Otto, Steve W.

1990-01-01

Elements assigned approximately optimally to subdomains. Mapping algorithm based on simulated-annealing concept used to minimize approximate time required to perform finite-element computation on hypercube computer or other network of parallel data processors. Mapping algorithm needed when shape of domain complicated or otherwise not obvious what allocation of elements to subdomains minimizes cost of computation.

Recursive Inversion By Finite-Impulse-Response Filters

NASA Technical Reports Server (NTRS)

Bach, Ralph E., Jr.; Baram, Yoram

1991-01-01

Recursive approximation gives least-squares best fit to exact response. Algorithm yields finite-impulse-response approximation of unknown single-input/single-output, causal, time-invariant, linear, real system, response of which is sequence of impulses. Applicable to such system-inversion problems as suppression of echoes and identification of target from its scatter response to incident impulse.

Computational aspects of sensitivity calculations in linear transient structural analysis. Ph.D. Thesis - Virginia Polytechnic Inst. and State Univ.

NASA Technical Reports Server (NTRS)

Greene, William H.

1990-01-01

A study was performed focusing on the calculation of sensitivities of displacements, velocities, accelerations, and stresses in linear, structural, transient response problems. One significant goal of the study was to develop and evaluate sensitivity calculation techniques suitable for large-order finite element analyses. Accordingly, approximation vectors such as vibration mode shapes are used to reduce the dimensionality of the finite element model. Much of the research focused on the accuracy of both response quantities and sensitivities as a function of number of vectors used. Two types of sensitivity calculation techniques were developed and evaluated. The first type of technique is an overall finite difference method where the analysis is repeated for perturbed designs. The second type of technique is termed semi-analytical because it involves direct, analytical differentiation of the equations of motion with finite difference approximation of the coefficient matrices. To be computationally practical in large-order problems, the overall finite difference methods must use the approximation vectors from the original design in the analyses of the perturbed models. In several cases this fixed mode approach resulted in very poor approximations of the stress sensitivities. Almost all of the original modes were required for an accurate sensitivity and for small numbers of modes, the accuracy was extremely poor. To overcome this poor accuracy, two semi-analytical techniques were developed. The first technique accounts for the change in eigenvectors through approximate eigenvector derivatives. The second technique applies the mode acceleration method of transient analysis to the sensitivity calculations. Both result in accurate values of the stress sensitivities with a small number of modes and much lower computational costs than if the vibration modes were recalculated and then used in an overall finite difference method.

Adjoints and Low-rank Covariance Representation

NASA Technical Reports Server (NTRS)

Tippett, Michael K.; Cohn, Stephen E.

2000-01-01

Quantitative measures of the uncertainty of Earth System estimates can be as important as the estimates themselves. Second moments of estimation errors are described by the covariance matrix, whose direct calculation is impractical when the number of degrees of freedom of the system state is large. Ensemble and reduced-state approaches to prediction and data assimilation replace full estimation error covariance matrices by low-rank approximations. The appropriateness of such approximations depends on the spectrum of the full error covariance matrix, whose calculation is also often impractical. Here we examine the situation where the error covariance is a linear transformation of a forcing error covariance. We use operator norms and adjoints to relate the appropriateness of low-rank representations to the conditioning of this transformation. The analysis is used to investigate low-rank representations of the steady-state response to random forcing of an idealized discrete-time dynamical system.

Low rank approximation methods for MR fingerprinting with large scale dictionaries.

PubMed

Yang, Mingrui; Ma, Dan; Jiang, Yun; Hamilton, Jesse; Seiberlich, Nicole; Griswold, Mark A; McGivney, Debra

2018-04-01

This work proposes new low rank approximation approaches with significant memory savings for large scale MR fingerprinting (MRF) problems. We introduce a compressed MRF with randomized singular value decomposition method to significantly reduce the memory requirement for calculating a low rank approximation of large sized MRF dictionaries. We further relax this requirement by exploiting the structures of MRF dictionaries in the randomized singular value decomposition space and fitting them to low-degree polynomials to generate high resolution MRF parameter maps. In vivo 1.5T and 3T brain scan data are used to validate the approaches. T 1 , T 2 , and off-resonance maps are in good agreement with that of the standard MRF approach. Moreover, the memory savings is up to 1000 times for the MRF-fast imaging with steady-state precession sequence and more than 15 times for the MRF-balanced, steady-state free precession sequence. The proposed compressed MRF with randomized singular value decomposition and dictionary fitting methods are memory efficient low rank approximation methods, which can benefit the usage of MRF in clinical settings. They also have great potentials in large scale MRF problems, such as problems considering multi-component MRF parameters or high resolution in the parameter space. Magn Reson Med 79:2392-2400, 2018. © 2017 International Society for Magnetic Resonance in Medicine. © 2017 International Society for Magnetic Resonance in Medicine.

The effectiveness of a new algorithm on a three-dimensional finite element model construction of bone trabeculae in implant biomechanics.

PubMed

Sato, Y; Teixeira, E R; Tsuga, K; Shindoi, N

1999-08-01

More validity of finite element analysis (FEA) in implant biomechanics requires element downsizing. However, excess downsizing needs computer memory and calculation time. To evaluate the effectiveness of a new algorithm established for more valid FEA model construction without downsizing, three-dimensional FEA bone trabeculae models with different element sizes (300, 150 and 75 micron) were constructed. Four algorithms of stepwise (1 to 4 ranks) assignment of Young's modulus accorded with bone volume in the individual cubic element was used and then stress distribution against vertical loading was analysed. The model with 300 micron element size, with 4 ranks of Young's moduli accorded with bone volume in each element presented similar stress distribution to the model with the 75 micron element size. These results show that the new algorithm was effective, and the use of the 300 micron element for bone trabeculae representation was proposed, without critical changes in stress values and for possible savings on computer memory and calculation time in the laboratory.

Low rank approximation method for efficient Green's function calculation of dissipative quantum transport

NASA Astrophysics Data System (ADS)

Zeng, Lang; He, Yu; Povolotskyi, Michael; Liu, XiaoYan; Klimeck, Gerhard; Kubis, Tillmann

2013-06-01

In this work, the low rank approximation concept is extended to the non-equilibrium Green's function (NEGF) method to achieve a very efficient approximated algorithm for coherent and incoherent electron transport. This new method is applied to inelastic transport in various semiconductor nanodevices. Detailed benchmarks with exact NEGF solutions show (1) a very good agreement between approximated and exact NEGF results, (2) a significant reduction of the required memory, and (3) a large reduction of the computational time (a factor of speed up as high as 150 times is observed). A non-recursive solution of the inelastic NEGF transport equations of a 1000 nm long resistor on standard hardware illustrates nicely the capability of this new method.

Finite dimensional approximation of a class of constrained nonlinear optimal control problems

NASA Technical Reports Server (NTRS)

Gunzburger, Max D.; Hou, L. S.

1994-01-01

An abstract framework for the analysis and approximation of a class of nonlinear optimal control and optimization problems is constructed. Nonlinearities occur in both the objective functional and in the constraints. The framework includes an abstract nonlinear optimization problem posed on infinite dimensional spaces, and approximate problem posed on finite dimensional spaces, together with a number of hypotheses concerning the two problems. The framework is used to show that optimal solutions exist, to show that Lagrange multipliers may be used to enforce the constraints, to derive an optimality system from which optimal states and controls may be deduced, and to derive existence results and error estimates for solutions of the approximate problem. The abstract framework and the results derived from that framework are then applied to three concrete control or optimization problems and their approximation by finite element methods. The first involves the von Karman plate equations of nonlinear elasticity, the second, the Ginzburg-Landau equations of superconductivity, and the third, the Navier-Stokes equations for incompressible, viscous flows.

On Hybrid and mixed finite element methods

NASA Technical Reports Server (NTRS)

Pian, T. H. H.

1981-01-01

Three versions of the assumed stress hybrid model in finite element methods and the corresponding variational principles for the formulation are presented. Examples of rank deficiency for stiffness matrices by the hybrid stress model are given and their corresponding kinematic deformation modes are identified. A discussion of the derivation of general semi-Loof elements for plates and shells by the hybrid stress method is given. It is shown that the equilibrium model by Fraeijs de Veubeke can be derived by the approach of the hybrid stress model as a special case of semi-Loof elements.

Methods for High-Order Multi-Scale and Stochastic Problems Analysis, Algorithms, and Applications

DTIC Science & Technology

2016-10-17

finite volume schemes, discontinuous Galerkin finite element method, and related methods, for solving computational fluid dynamics (CFD) problems and...approximation for finite element methods. (3) The development of methods of simulation and analysis for the study of large scale stochastic systems of...laws, finite element method, Bernstein-Bezier finite elements , weakly interacting particle systems, accelerated Monte Carlo, stochastic networks 16

Newton's method applied to finite-difference approximations for the steady-state compressible Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Bailey, Harry E.; Beam, Richard M.

1991-01-01

Finite-difference approximations for steady-state compressible Navier-Stokes equations, whose two spatial dimensions are written in generalized curvilinear coordinates and strong conservation-law form, are presently solved by means of Newton's method in order to obtain a lifting-airfoil flow field under subsonic and transonnic conditions. In addition to ascertaining the computational requirements of an initial guess ensuring convergence and the degree of computational efficiency obtainable via the approximate Newton method's freezing of the Jacobian matrices, attention is given to the need for auxiliary methods assessing the temporal stability of steady-state solutions. It is demonstrated that nonunique solutions of the finite-difference equations are obtainable by Newton's method in conjunction with a continuation method.

Controlling the sign problem in finite-density quantum field theory

NASA Astrophysics Data System (ADS)

Garron, Nicolas; Langfeld, Kurt

2017-07-01

Quantum field theories at finite matter densities generically possess a partition function that is exponentially suppressed with the volume compared to that of the phase quenched analog. The smallness arises from an almost uniform distribution for the phase of the fermion determinant. Large cancellations upon integration is the origin of a poor signal to noise ratio. We study three alternatives for this integration: the Gaussian approximation, the "telegraphic" approximation, and a novel expansion in terms of theory-dependent moments and universal coefficients. We have tested the methods for QCD at finite densities of heavy quarks. We find that for two of the approximations the results are extremely close—if not identical—to the full answer in the strong sign-problem regime.

Finite-Dimensional Representations for Controlled Diffusions with Delay

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

Federico, Salvatore, E-mail: salvatore.federico@unimi.it; Tankov, Peter, E-mail: tankov@math.univ-paris-diderot.fr

2015-02-15

We study stochastic delay differential equations (SDDE) where the coefficients depend on the moving averages of the state process. As a first contribution, we provide sufficient conditions under which the solution of the SDDE and a linear path functional of it admit a finite-dimensional Markovian representation. As a second contribution, we show how approximate finite-dimensional Markovian representations may be constructed when these conditions are not satisfied, and provide an estimate of the error corresponding to these approximations. These results are applied to optimal control and optimal stopping problems for stochastic systems with delay.

Rank Dynamics

NASA Astrophysics Data System (ADS)

Gershenson, Carlos

Studies of rank distributions have been popular for decades, especially since the work of Zipf. For example, if we rank words of a given language by use frequency (most used word in English is 'the', rank 1; second most common word is 'of', rank 2), the distribution can be approximated roughly with a power law. The same applies for cities (most populated city in a country ranks first), earthquakes, metabolism, the Internet, and dozens of other phenomena. We recently proposed ``rank diversity'' to measure how ranks change in time, using the Google Books Ngram dataset. Studying six languages between 1800 and 2009, we found that the rank diversity curves of languages are universal, adjusted with a sigmoid on log-normal scale. We are studying several other datasets (sports, economies, social systems, urban systems, earthquakes, artificial life). Rank diversity seems to be universal, independently of the shape of the rank distribution. I will present our work in progress towards a general description of the features of rank change in time, along with simple models which reproduce it

Iterative design of one- and two-dimensional FIR digital filters. [Finite duration Impulse Response

NASA Technical Reports Server (NTRS)

Suk, M.; Choi, K.; Algazi, V. R.

1976-01-01

The paper describes a new iterative technique for designing FIR (finite duration impulse response) digital filters using a frequency weighted least squares approximation. The technique is as easy to implement (via FFT) and as effective in two dimensions as in one dimension, and there are virtually no limitations on the class of filter frequency spectra approximated. An adaptive adjustment of the frequency weight to achieve other types of design approximation such as Chebyshev type design is discussed.

Low rank approximation in G 0W 0 calculations

DOE PAGES

Shao, MeiYue; Lin, Lin; Yang, Chao; ...

2016-06-04

The single particle energies obtained in a Kohn-Sham density functional theory (DFT) calculation are generally known to be poor approximations to electron excitation energies that are measured in tr ansport, tunneling and spectroscopic experiments such as photo-emission spectroscopy. The correction to these energies can be obtained from the poles of a single particle Green’s function derived from a many-body perturbation theory. From a computational perspective, the accuracy and efficiency of such an approach depends on how a self energy term that properly accounts for dynamic screening of electrons is approximated. The G 0W 0 approximation is a widely used techniquemore » in which the self energy is expressed as the convolution of a noninteracting Green’s function (G 0) and a screened Coulomb interaction (W 0) in the frequency domain. The computational cost associated with such a convolution is high due to the high complexity of evaluating W 0 at multiple frequencies. In this paper, we discuss how the cost of G 0W 0 calculation can be reduced by constructing a low rank approximation to the frequency dependent part of W 0 . In particular, we examine the effect of such a low rank approximation on the accuracy of the G 0W 0 approximation. We also discuss how the numerical convolution of G 0 and W 0 can be evaluated efficiently and accurately by using a contour deformation technique with an appropriate choice of the contour.« less

The Constraint Method for Solid Finite Elements.

DTIC Science & Technology

1980-09-30

9. ’Hierarchical Approximation in Finite Element Analysis", by I. Norman Katz, International Symposium on Innovative Numerical Analysis In Applied ... Engineering Science, Versailles, France, May 23-27, 1977. 10. "Efficient Generation of Hierarchal Finite Elamnts Through the Use of Precomputed Arrays

Orthogonal bases of invariants in tensor models

NASA Astrophysics Data System (ADS)

Diaz, Pablo; Rey, Soo-Jong

2018-02-01

Representation theory provides an efficient framework to count and classify invariants in tensor models of (gauge) symmetry G d = U( N 1) ⊗ · · · ⊗ U( N d ) . We show that there are two natural ways of counting invariants, one for arbitrary G d and another valid for large rank of G d . We construct basis of invariant operators based on the counting, and compute correlators of their elements. The basis associated with finite rank of G d diagonalizes two-point function. It is analogous to the restricted Schur basis used in matrix models. We comment on future directions for investigation.

Modeling and control of flexible structures

NASA Technical Reports Server (NTRS)

Gibson, J. S.; Mingori, D. L.

1988-01-01

This monograph presents integrated modeling and controller design methods for flexible structures. The controllers, or compensators, developed are optimal in the linear-quadratic-Gaussian sense. The performance objectives, sensor and actuator locations and external disturbances influence both the construction of the model and the design of the finite dimensional compensator. The modeling and controller design procedures are carried out in parallel to ensure compatibility of these two aspects of the design problem. Model reduction techniques are introduced to keep both the model order and the controller order as small as possible. A linear distributed, or infinite dimensional, model is the theoretical basis for most of the text, but finite dimensional models arising from both lumped-mass and finite element approximations also play an important role. A central purpose of the approach here is to approximate an optimal infinite dimensional controller with an implementable finite dimensional compensator. Both convergence theory and numerical approximation methods are given. Simple examples are used to illustrate the theory.

Unified control/structure design and modeling research

NASA Technical Reports Server (NTRS)

Mingori, D. L.; Gibson, J. S.; Blelloch, P. A.; Adamian, A.

1986-01-01

To demonstrate the applicability of the control theory for distributed systems to large flexible space structures, research was focused on a model of a space antenna which consists of a rigid hub, flexible ribs, and a mesh reflecting surface. The space antenna model used is discussed along with the finite element approximation of the distributed model. The basic control problem is to design an optimal or near-optimal compensator to suppress the linear vibrations and rigid-body displacements of the structure. The application of an infinite dimensional Linear Quadratic Gaussian (LQG) control theory to flexible structure is discussed. Two basic approaches for robustness enhancement were investigated: loop transfer recovery and sensitivity optimization. A third approach synthesized from elements of these two basic approaches is currently under development. The control driven finite element approximation of flexible structures is discussed. Three sets of finite element basic vectors for computing functional control gains are compared. The possibility of constructing a finite element scheme to approximate the infinite dimensional Hamiltonian system directly, instead of indirectly is discussed.

Second-order numerical solution of time-dependent, first-order hyperbolic equations

NASA Technical Reports Server (NTRS)

Shah, Patricia L.; Hardin, Jay

1995-01-01

A finite difference scheme is developed to find an approximate solution of two similar hyperbolic equations, namely a first-order plane wave and spherical wave problem. Finite difference approximations are made for both the space and time derivatives. The result is a conditionally stable equation yielding an exact solution when the Courant number is set to one.

Approximate Computing Techniques for Iterative Graph Algorithms

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

Panyala, Ajay R.; Subasi, Omer; Halappanavar, Mahantesh

Approximate computing enables processing of large-scale graphs by trading off quality for performance. Approximate computing techniques have become critical not only due to the emergence of parallel architectures but also the availability of large scale datasets enabling data-driven discovery. Using two prototypical graph algorithms, PageRank and community detection, we present several approximate computing heuristics to scale the performance with minimal loss of accuracy. We present several heuristics including loop perforation, data caching, incomplete graph coloring and synchronization, and evaluate their efficiency. We demonstrate performance improvements of up to 83% for PageRank and up to 450x for community detection, with lowmore » impact of accuracy for both the algorithms. We expect the proposed approximate techniques will enable scalable graph analytics on data of importance to several applications in science and their subsequent adoption to scale similar graph algorithms.« less

Computer-Aided Engineering of Semiconductor Integrated Circuits

DTIC Science & Technology

1979-07-01

equation using a five point finite difference approximation. Section 4.3.6 describes the numerical techniques and iterative algorithms which are used...neighbor points. This is generally referred to as a five point finite difference scheme on a rectangular grid, as described below. The finite difference ...problems in steady state have been analyzed by the finite difference method [4. 16 ] [4.17 3 or finite element method [4. 18 3, [4. 19 3 as reported last

Pion properties at finite isospin chemical potential with isospin symmetry breaking

NASA Astrophysics Data System (ADS)

Wu, Zuqing; Ping, Jialun; Zong, Hongshi

2017-12-01

Pion properties at finite temperature, finite isospin and baryon chemical potentials are investigated within the SU(2) NJL model. In the mean field approximation for quarks and random phase approximation fpr mesons, we calculate the pion mass, the decay constant and the phase diagram with different quark masses for the u quark and d quark, related to QCD corrections, for the first time. Our results show an asymmetry between μI <0 and μI >0 in the phase diagram, and different values for the charged pion mass (or decay constant) and neutral pion mass (or decay constant) at finite temperature and finite isospin chemical potential. This is caused by the effect of isospin symmetry breaking, which is from different quark masses. Supported by National Natural Science Foundation of China (11175088, 11475085, 11535005, 11690030) and the Fundamental Research Funds for the Central Universities (020414380074)

Robust subspace clustering via joint weighted Schatten-p norm and Lq norm minimization

NASA Astrophysics Data System (ADS)

Zhang, Tao; Tang, Zhenmin; Liu, Qing

2017-05-01

Low-rank representation (LRR) has been successfully applied to subspace clustering. However, the nuclear norm in the standard LRR is not optimal for approximating the rank function in many real-world applications. Meanwhile, the L21 norm in LRR also fails to characterize various noises properly. To address the above issues, we propose an improved LRR method, which achieves low rank property via the new formulation with weighted Schatten-p norm and Lq norm (WSPQ). Specifically, the nuclear norm is generalized to be the Schatten-p norm and different weights are assigned to the singular values, and thus it can approximate the rank function more accurately. In addition, Lq norm is further incorporated into WSPQ to model different noises and improve the robustness. An efficient algorithm based on the inexact augmented Lagrange multiplier method is designed for the formulated problem. Extensive experiments on face clustering and motion segmentation clearly demonstrate the superiority of the proposed WSPQ over several state-of-the-art methods.

Robust Principal Component Analysis Regularized by Truncated Nuclear Norm for Identifying Differentially Expressed Genes.

PubMed

Wang, Ya-Xuan; Gao, Ying-Lian; Liu, Jin-Xing; Kong, Xiang-Zhen; Li, Hai-Jun

2017-09-01

Identifying differentially expressed genes from the thousands of genes is a challenging task. Robust principal component analysis (RPCA) is an efficient method in the identification of differentially expressed genes. RPCA method uses nuclear norm to approximate the rank function. However, theoretical studies showed that the nuclear norm minimizes all singular values, so it may not be the best solution to approximate the rank function. The truncated nuclear norm is defined as the sum of some smaller singular values, which may achieve a better approximation of the rank function than nuclear norm. In this paper, a novel method is proposed by replacing nuclear norm of RPCA with the truncated nuclear norm, which is named robust principal component analysis regularized by truncated nuclear norm (TRPCA). The method decomposes the observation matrix of genomic data into a low-rank matrix and a sparse matrix. Because the significant genes can be considered as sparse signals, the differentially expressed genes are viewed as the sparse perturbation signals. Thus, the differentially expressed genes can be identified according to the sparse matrix. The experimental results on The Cancer Genome Atlas data illustrate that the TRPCA method outperforms other state-of-the-art methods in the identification of differentially expressed genes.

Piecewise linear approximation for hereditary control problems

NASA Technical Reports Server (NTRS)

Propst, Georg

1987-01-01

Finite dimensional approximations are presented for linear retarded functional differential equations by use of discontinuous piecewise linear functions. The approximation scheme is applied to optimal control problems when a quadratic cost integral has to be minimized subject to the controlled retarded system. It is shown that the approximate optimal feedback operators converge to the true ones both in case the cost integral ranges over a finite time interval as well as in the case it ranges over an infinite time interval. The arguments in the latter case rely on the fact that the piecewise linear approximations to stable systems are stable in a uniform sense. This feature is established using a vector-component stability criterion in the state space R(n) x L(2) and the favorable eigenvalue behavior of the piecewise linear approximations.

Exchange-correlation approximations for reduced-density-matrix-functional theory at finite temperature: Capturing magnetic phase transitions in the homogeneous electron gas

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

Baldsiefen, Tim; Cangi, Attila; Eich, F. G.

Here, we derive an intrinsically temperature-dependent approximation to the correlation grand potential for many-electron systems in thermodynamical equilibrium in the context of finite-temperature reduced-density-matrix-functional theory (FT-RDMFT). We demonstrate its accuracy by calculating the magnetic phase diagram of the homogeneous electron gas. We compare it to known limits from highly accurate quantum Monte Carlo calculations as well as to phase diagrams obtained within existing exchange-correlation approximations from density functional theory and zero-temperature RDMFT.

Exchange-correlation approximations for reduced-density-matrix-functional theory at finite temperature: Capturing magnetic phase transitions in the homogeneous electron gas

DOE PAGES

Baldsiefen, Tim; Cangi, Attila; Eich, F. G.; ...

2017-12-18

Here, we derive an intrinsically temperature-dependent approximation to the correlation grand potential for many-electron systems in thermodynamical equilibrium in the context of finite-temperature reduced-density-matrix-functional theory (FT-RDMFT). We demonstrate its accuracy by calculating the magnetic phase diagram of the homogeneous electron gas. We compare it to known limits from highly accurate quantum Monte Carlo calculations as well as to phase diagrams obtained within existing exchange-correlation approximations from density functional theory and zero-temperature RDMFT.

Lazy orbits: An optimization problem on the sphere

NASA Astrophysics Data System (ADS)

Vincze, Csaba

2018-01-01

Non-transitive subgroups of the orthogonal group play an important role in the non-Euclidean geometry. If G is a closed subgroup in the orthogonal group such that the orbit of a single Euclidean unit vector does not cover the (Euclidean) unit sphere centered at the origin then there always exists a non-Euclidean Minkowski functional such that the elements of G preserve the Minkowskian length of vectors. In other words the Minkowski geometry is an alternative of the Euclidean geometry for the subgroup G. It is rich of isometries if G is "close enough" to the orthogonal group or at least to one of its transitive subgroups. The measure of non-transitivity is related to the Hausdorff distances of the orbits under the elements of G to the Euclidean sphere. Its maximum/minimum belongs to the so-called lazy/busy orbits, i.e. they are the solutions of an optimization problem on the Euclidean sphere. The extremal distances allow us to characterize the reducible/irreducible subgroups. We also formulate an upper and a lower bound for the ratio of the extremal distances. As another application of the analytic tools we introduce the rank of a closed non-transitive group G. We shall see that if G is of maximal rank then it is finite or reducible. Since the reducible and the finite subgroups form two natural prototypes of non-transitive subgroups, the rank seems to be a fundamental notion in their characterization. Closed, non-transitive groups of rank n - 1 will be also characterized. Using the general results we classify all their possible types in lower dimensional cases n = 2 , 3 and 4. Finally we present some applications of the results to the holonomy group of a metric linear connection on a connected Riemannian manifold.

Analysis of the Hessian for Inverse Scattering Problems. Part 3. Inverse Medium Scattering of Electromagnetic Waves in Three Dimensions

DTIC Science & Technology

2012-08-01

small data noise and model error, the discrete Hessian can be approximated by a low-rank matrix. This in turn enables fast solution of an appropriately...implication of the compactness of the Hessian is that for small data noise and model error, the discrete Hessian can be approximated by a low-rank matrix. This...probability distribution is given by the inverse of the Hessian of the negative log likelihood function. For Gaussian data noise and model error, this

Numerical linear algebra in data mining

NASA Astrophysics Data System (ADS)

Eldén, Lars

Ideas and algorithms from numerical linear algebra are important in several areas of data mining. We give an overview of linear algebra methods in text mining (information retrieval), pattern recognition (classification of handwritten digits), and PageRank computations for web search engines. The emphasis is on rank reduction as a method of extracting information from a data matrix, low-rank approximation of matrices using the singular value decomposition and clustering, and on eigenvalue methods for network analysis.

Weak form of Stokes-Dirac structures and geometric discretization of port-Hamiltonian systems

NASA Astrophysics Data System (ADS)

Kotyczka, Paul; Maschke, Bernhard; Lefèvre, Laurent

2018-05-01

We present the mixed Galerkin discretization of distributed parameter port-Hamiltonian systems. On the prototypical example of hyperbolic systems of two conservation laws in arbitrary spatial dimension, we derive the main contributions: (i) A weak formulation of the underlying geometric (Stokes-Dirac) structure with a segmented boundary according to the causality of the boundary ports. (ii) The geometric approximation of the Stokes-Dirac structure by a finite-dimensional Dirac structure is realized using a mixed Galerkin approach and power-preserving linear maps, which define minimal discrete power variables. (iii) With a consistent approximation of the Hamiltonian, we obtain finite-dimensional port-Hamiltonian state space models. By the degrees of freedom in the power-preserving maps, the resulting family of structure-preserving schemes allows for trade-offs between centered approximations and upwinding. We illustrate the method on the example of Whitney finite elements on a 2D simplicial triangulation and compare the eigenvalue approximation in 1D with a related approach.

Effects of a finite outer scale on the measurement of atmospheric-turbulence statistics with a Hartmann wave-front sensor.

PubMed

Feng, Shen; Wenhan, Jiang

2002-06-10

Phase-structure and aperture-averaged slope-correlated functions with a finite outer scale are derived based on the Taylor hypothesis and a generalized spectrum, such as the von Kármán modal. The effects of the finite outer scale on measuring and determining the character of atmospheric-turbulence statistics are shown especially for an approximately 4-m class telescope and subaperture. The phase structure function and atmospheric coherent length based on the Kolmogorov model are approximations of the formalism we have derived. The analysis shows that it cannot be determined whether the deviation from the power-law parameter of Kolmogorov turbulence is caused by real variations of the spectrum or by the effect of the finite outer scale.

High-Order Entropy Stable Finite Difference Schemes for Nonlinear Conservation Laws: Finite Domains

NASA Technical Reports Server (NTRS)

Fisher, Travis C.; Carpenter, Mark H.

2013-01-01

Developing stable and robust high-order finite difference schemes requires mathematical formalism and appropriate methods of analysis. In this work, nonlinear entropy stability is used to derive provably stable high-order finite difference methods with formal boundary closures for conservation laws. Particular emphasis is placed on the entropy stability of the compressible Navier-Stokes equations. A newly derived entropy stable weighted essentially non-oscillatory finite difference method is used to simulate problems with shocks and a conservative, entropy stable, narrow-stencil finite difference approach is used to approximate viscous terms.

Affine.m—Mathematica package for computations in representation theory of finite-dimensional and affine Lie algebras

NASA Astrophysics Data System (ADS)

Nazarov, Anton

2012-11-01

In this paper we present Affine.m-a program for computations in representation theory of finite-dimensional and affine Lie algebras and describe implemented algorithms. The algorithms are based on the properties of weights and Weyl symmetry. Computation of weight multiplicities in irreducible and Verma modules, branching of representations and tensor product decomposition are the most important problems for us. These problems have numerous applications in physics and we provide some examples of these applications. The program is implemented in the popular computer algebra system Mathematica and works with finite-dimensional and affine Lie algebras. Catalogue identifier: AENA_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AENB_v1_0.html Program obtainable from: CPC Program Library, Queen’s University, Belfast, UK Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 24 844 No. of bytes in distributed program, including test data, etc.: 1 045 908 Distribution format: tar.gz Programming language: Mathematica. Computer: i386-i686, x86_64. Operating system: Linux, Windows, Mac OS, Solaris. RAM: 5-500 Mb Classification: 4.2, 5. Nature of problem: Representation theory of finite-dimensional Lie algebras has many applications in different branches of physics, including elementary particle physics, molecular physics, nuclear physics. Representations of affine Lie algebras appear in string theories and two-dimensional conformal field theory used for the description of critical phenomena in two-dimensional systems. Also Lie symmetries play a major role in a study of quantum integrable systems. Solution method: We work with weights and roots of finite-dimensional and affine Lie algebras and use Weyl symmetry extensively. Central problems which are the computations of weight multiplicities, branching and fusion coefficients are solved using one general recurrent algorithm based on generalization of Weyl character formula. We also offer alternative implementation based on the Freudenthal multiplicity formula which can be faster in some cases. Restrictions: Computational complexity grows fast with the rank of an algebra, so computations for algebras of ranks greater than 8 are not practical. Unusual features: We offer the possibility of using a traditional mathematical notation for the objects in representation theory of Lie algebras in computations if Affine.m is used in the Mathematica notebook interface. Running time: From seconds to days depending on the rank of the algebra and the complexity of the representation.

Compressed Continuous Computation v. 12/20/2016

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

Gorodetsky, Alex

2017-02-17

A library for performing numerical computation with low-rank functions. The (C3) library enables performing continuous linear and multilinear algebra with multidimensional functions. Common tasks include taking "matrix" decompositions of vector- or matrix-valued functions, approximating multidimensional functions in low-rank format, adding or multiplying functions together, integrating multidimensional functions.

Simulations of free-solution electrophoresis of polyelectrolytes with a finite Debye length using the Debye-Hückel approximation.

PubMed

Hickey, Owen A; Shendruk, Tyler N; Harden, James L; Slater, Gary W

2012-08-31

We introduce a mesoscale simulation method based on multiparticle collision dynamics (MPCD) for the electrohydrodynamics of polyelectrolytes with finite Debye lengths. By applying the Debye-Hückel approximation to assign an effective charge to MPCD particles near charged monomers, our simulations are able to reproduce the rapid rise in the electrophoretic mobility with respect to the degree of polymerization for the shortest polymer lengths followed by a small decrease for longer polymers due to charge condensation. Moreover, these simulations demonstrate the importance of a finite Debye length in accurately determining the mobility of uniformly charged polyelectrolytes and net neutral polyampholytes.

N%-Superconvergence of Finite Element Approximations in the Interior of General Meshes of Triangles

DTIC Science & Technology

1993-12-01

RODiGuEz, On the asymptotic exactness of error estimators for linear triangular finite elements, Numer. Math., 59 (1991), pp. 107-127. 27. R. DURAN ...WAHLDIN, Interior maxmum norma estimates for finite element methods, Part H, unpublished manuscript. 38. I. BABUfKA, T. STROUBOULIS, A. MATHU. AND C.S

Stability Analysis of Finite Difference Schemes for Hyperbolic Systems, and Problems in Applied and Computational Linear Algebra.

DTIC Science & Technology

FINITE DIFFERENCE THEORY, * LINEAR ALGEBRA , APPLIED MATHEMATICS, APPROXIMATION(MATHEMATICS), BOUNDARY VALUE PROBLEMS, COMPUTATIONS, HYPERBOLAS, MATHEMATICAL MODELS, NUMERICAL ANALYSIS, PARTIAL DIFFERENTIAL EQUATIONS, STABILITY.

A finite element formulation for scattering from electrically large 2-dimensional structures

NASA Technical Reports Server (NTRS)

Ross, Daniel C.; Volakis, John L.

1992-01-01

A finite element formulation is given using the scattered field approach with a fictitious material absorber to truncate the mesh. The formulation includes the use of arbitrary approximation functions so that more accurate results can be achieved without any modification to the software. Additionally, non-polynomial approximation functions can be used, including complex approximation functions. The banded system that results is solved with an efficient sparse/banded iterative scheme and as a consequence, large structures can be analyzed. Results are given for simple cases to verify the formulation and also for large, complex geometries.

Introducing a new methodology for the calculation of local philicity and multiphilic descriptor: an alternative to the finite difference approximation

NASA Astrophysics Data System (ADS)

Sánchez-Márquez, Jesús; Zorrilla, David; García, Víctor; Fernández, Manuel

2018-07-01

This work presents a new development based on the condensation scheme proposed by Chamorro and Pérez, in which new terms to correct the frozen molecular orbital approximation have been introduced (improved frontier molecular orbital approximation). The changes performed on the original development allow taking into account the orbital relaxation effects, providing equivalent results to those achieved by the finite difference approximation and leading also to a methodology with great advantages. Local reactivity indices based on this new development have been obtained for a sample set of molecules and they have been compared with those indices based on the frontier molecular orbital and finite difference approximations. A new definition based on the improved frontier molecular orbital methodology for the dual descriptor index is also shown. In addition, taking advantage of the characteristics of the definitions obtained with the new condensation scheme, the descriptor local philicity is analysed by separating the components corresponding to the frontier molecular orbital approximation and orbital relaxation effects, analysing also the local parameter multiphilic descriptor in the same way. Finally, the effect of using the basis set is studied and calculations using DFT, CI and Möller-Plesset methodologies are performed to analyse the consequence of different electronic-correlation levels.

Multiple graph regularized protein domain ranking.

PubMed

Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin

2012-11-19

Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.

Multiple graph regularized protein domain ranking

PubMed Central

2012-01-01

Background Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. Results To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. Conclusion The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. PMID:23157331

Stability and Convergence of Underintegrated Finite Element Approximations

NASA Technical Reports Server (NTRS)

Oden, J. T.

1984-01-01

The effects of underintegration on the numerical stability and convergence characteristics of certain classes of finite element approximations were analyzed. Particular attention is given to hourglassing instabilities that arise from underintegrating the stiffness matrix entries and checkerboard instabilities that arise from underintegrating constrain terms such as those arising from incompressibility conditions. A fundamental result reported here is the proof that the fully integrated stiffness is restored in some cases through a post-processing operation.

A low-dimensional analogue of holographic baryons

NASA Astrophysics Data System (ADS)

Bolognesi, Stefano; Sutcliffe, Paul

2014-04-01

Baryons in holographic QCD correspond to topological solitons in the bulk. The most prominent example is the Sakai-Sugimoto model, where the bulk soliton in the five-dimensional spacetime of AdS-type can be approximated by the flat space self-dual Yang-Mills instanton with a small size. Recently, the validity of this approximation has been verified by comparison with the numerical field theory solution. However, multi-solitons and solitons with finite density are currently beyond numerical field theory computations. Various approximations have been applied to investigate these important issues and have led to proposals for finite density configurations that include dyonic salt and baryonic popcorn. Here we introduce and investigate a low-dimensional analogue of the Sakai-Sugimoto model, in which the bulk soliton can be approximated by a flat space sigma model instanton. The bulk theory is a baby Skyrme model in a three-dimensional spacetime with negative curvature. The advantage of the lower-dimensional theory is that numerical simulations of multi-solitons and finite density solutions can be performed and compared with flat space instanton approximations. In particular, analogues of dyonic salt and baryonic popcorn configurations are found and analysed.

Methods for analysis of cracks in three-dimensional solids

NASA Technical Reports Server (NTRS)

Raju, I. S.; Newman, J. C., Jr.

1984-01-01

Various analytical and numerical methods used to evaluate the stress intensity factors for cracks in three-dimensional (3-D) solids are reviewed. Classical exact solutions and many of the approximate methods used in 3-D analyses of cracks are reviewed. The exact solutions for embedded elliptic cracks in infinite solids are discussed. The approximate methods reviewed are the finite element methods, the boundary integral equation (BIE) method, the mixed methods (superposition of analytical and finite element method, stress difference method, discretization-error method, alternating method, finite element-alternating method), and the line-spring model. The finite element method with singularity elements is the most widely used method. The BIE method only needs modeling of the surfaces of the solid and so is gaining popularity. The line-spring model appears to be the quickest way to obtain good estimates of the stress intensity factors. The finite element-alternating method appears to yield the most accurate solution at the minimum cost.

Time-independent hybrid enrichment for finite element solution of transient conduction–radiation in diffusive grey media

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

Mohamed, M. Shadi, E-mail: m.s.mohamed@durham.ac.uk; Seaid, Mohammed; Trevelyan, Jon

2013-10-15

We investigate the effectiveness of the partition-of-unity finite element method for transient conduction–radiation problems in diffusive grey media. The governing equations consist of a semi-linear transient heat equation for the temperature field and a stationary diffusion approximation to the radiation in grey media. The coupled equations are integrated in time using a semi-implicit method in the finite element framework. We show that for the considered problems, a combination of hyperbolic and exponential enrichment functions based on an approximation of the boundary layer leads to improved accuracy compared to the conventional finite element method. It is illustrated that this approach canmore » be more efficient than using h adaptivity to increase the accuracy of the finite element method near the boundary walls. The performance of the proposed partition-of-unity method is analyzed on several test examples for transient conduction–radiation problems in two space dimensions.« less

Extended Finite Element Method with Simplified Spherical Harmonics Approximation for the Forward Model of Optical Molecular Imaging

PubMed Central

Li, Wei; Yi, Huangjian; Zhang, Qitan; Chen, Duofang; Liang, Jimin

2012-01-01

An extended finite element method (XFEM) for the forward model of 3D optical molecular imaging is developed with simplified spherical harmonics approximation (SPN). In XFEM scheme of SPN equations, the signed distance function is employed to accurately represent the internal tissue boundary, and then it is used to construct the enriched basis function of the finite element scheme. Therefore, the finite element calculation can be carried out without the time-consuming internal boundary mesh generation. Moreover, the required overly fine mesh conforming to the complex tissue boundary which leads to excess time cost can be avoided. XFEM conveniences its application to tissues with complex internal structure and improves the computational efficiency. Phantom and digital mouse experiments were carried out to validate the efficiency of the proposed method. Compared with standard finite element method and classical Monte Carlo (MC) method, the validation results show the merits and potential of the XFEM for optical imaging. PMID:23227108

Extended finite element method with simplified spherical harmonics approximation for the forward model of optical molecular imaging.

PubMed

Li, Wei; Yi, Huangjian; Zhang, Qitan; Chen, Duofang; Liang, Jimin

2012-01-01

An extended finite element method (XFEM) for the forward model of 3D optical molecular imaging is developed with simplified spherical harmonics approximation (SP(N)). In XFEM scheme of SP(N) equations, the signed distance function is employed to accurately represent the internal tissue boundary, and then it is used to construct the enriched basis function of the finite element scheme. Therefore, the finite element calculation can be carried out without the time-consuming internal boundary mesh generation. Moreover, the required overly fine mesh conforming to the complex tissue boundary which leads to excess time cost can be avoided. XFEM conveniences its application to tissues with complex internal structure and improves the computational efficiency. Phantom and digital mouse experiments were carried out to validate the efficiency of the proposed method. Compared with standard finite element method and classical Monte Carlo (MC) method, the validation results show the merits and potential of the XFEM for optical imaging.

Finite element modeling of mitral leaflet tissue using a layered shell approximation

PubMed Central

Ratcliffe, Mark B.; Guccione, Julius M.

2012-01-01

The current study presents a finite element model of mitral leaflet tissue, which incorporates the anisotropic material response and approximates the layered structure. First, continuum mechanics and the theory of layered composites are used to develop an analytical representation of membrane stress in the leaflet material. This is done with an existing anisotropic constitutive law from literature. Then, the concept is implemented in a finite element (FE) model by overlapping and merging two layers of transversely isotropic membrane elements in LS-DYNA, which homogenizes the response. The FE model is then used to simulate various biaxial extension tests and out-of-plane pressure loading. Both the analytical and FE model show good agreement with experimental biaxial extension data, and show good mutual agreement. This confirms that the layered composite approximation presented in the current study is able to capture the exponential stiffening seen in both the circumferential and radial directions of mitral leaflets. PMID:22971896

Quantifying the effect of finite spectral bandwidth on extinction coefficient of species in laser absorption spectroscopy

NASA Astrophysics Data System (ADS)

Singh, Manjeet; Singh, Jaswant; Singh, Baljit; Ghanshyam, C.

2016-11-01

The aim of this study is to quantify the finite spectral bandwidth effect on laser absorption spectroscopy for a wide-band laser source. Experimental analysis reveals that the extinction coefficient of an analyte is affected by the bandwidth of the spectral source, which may result in the erroneous conclusions. An approximate mathematical model has been developed for optical intensities having Gaussian line shape, which includes the impact of source's spectral bandwidth in the equation for spectroscopic absorption. This is done by introducing a suitable first order and second order bandwidth approximation in the Beer-Lambert law equation for finite bandwidth case. The derived expressions were validated using spectroscopic analysis with higher SBW on a test sample, Rhodamine B. The concentrations calculated using proposed approximation, were in significant agreement with the true values when compared with those calculated with conventional approach.

FINITE-STATE APPROXIMATIONS TO DENUMERABLE-STATE DYNAMIC PROGRAMS,

DTIC Science & Technology

AIR FORCE OPERATIONS, LOGISTICS), (*INVENTORY CONTROL, DYNAMIC PROGRAMMING), (*DYNAMIC PROGRAMMING, APPROXIMATION(MATHEMATICS)), INVENTORY CONTROL, DECISION MAKING, STOCHASTIC PROCESSES, GAME THEORY, ALGORITHMS, CONVERGENCE

Level/rank duality and Chern-Simons-matter theories

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

Hsin, Po-Shen; Seiberg, Nathan

We discuss in detail level/rank duality in three-dimensional Chern-Simons theories and various related dualities in three-dimensional Chern-Simons-matter theories. We couple the dual Lagrangians to appropriate background fields (including gauge fields, spin c connections and the metric). The non-trivial maps between the currents and the line operators in the dual theories is accounted for by mixing of these fields. In order for the duality to be valid we must add finite counterterms depending on these background fields. This analysis allows us to resolve a number of puzzles with these dualities, to provide derivations of some of them, and to find newmore » consistency conditions and relations between them. In addition, we find new level/rank dualities of topological Chern-Simons theories and new dualities of Chern-Simons-matter theories, including new boson/boson and fermion/fermion dualities.« less

Level/rank duality and Chern-Simons-matter theories

DOE PAGES

Hsin, Po-Shen; Seiberg, Nathan

2016-09-16

We discuss in detail level/rank duality in three-dimensional Chern-Simons theories and various related dualities in three-dimensional Chern-Simons-matter theories. We couple the dual Lagrangians to appropriate background fields (including gauge fields, spin c connections and the metric). The non-trivial maps between the currents and the line operators in the dual theories is accounted for by mixing of these fields. In order for the duality to be valid we must add finite counterterms depending on these background fields. This analysis allows us to resolve a number of puzzles with these dualities, to provide derivations of some of them, and to find newmore » consistency conditions and relations between them. In addition, we find new level/rank dualities of topological Chern-Simons theories and new dualities of Chern-Simons-matter theories, including new boson/boson and fermion/fermion dualities.« less

COMPLEXITY&APPROXIMABILITY OF QUANTIFIED&STOCHASTIC CONSTRAINT SATISFACTION PROBLEMS

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

Hunt, H. B.; Marathe, M. V.; Stearns, R. E.

2001-01-01

Let D be an arbitrary (not necessarily finite) nonempty set, let C be a finite set of constant symbols denoting arbitrary elements of D, and let S and T be an arbitrary finite set of finite-arity relations on D. We denote the problem of determining the satisfiability of finite conjunctions of relations in S applied to variables (to variables and symbols in C) by SAT(S) (by SATc(S).) Here, we study simultaneously the complexity of decision, counting, maximization and approximate maximization problems, for unquantified, quantified and stochastically quantified formulas. We present simple yet general techniques to characterize simultaneously, the complexity ormore » efficient approximability of a number of versions/variants of the problems SAT(S), Q-SAT(S), S-SAT(S),MAX-Q-SAT(S) etc., for many different such D,C ,S, T. These versions/variants include decision, counting, maximization and approximate maximization problems, for unquantified, quantified and stochastically quantified formulas. Our unified approach is based on the following two basic concepts: (i) strongly-local replacements/reductions and (ii) relational/algebraic represent ability. Some of the results extend the earlier results in [Pa85,LMP99,CF+93,CF+94O]u r techniques and results reported here also provide significant steps towards obtaining dichotomy theorems, for a number of the problems above, including the problems MAX-&-SAT( S), and MAX-S-SAT(S). The discovery of such dichotomy theorems, for unquantified formulas, has received significant recent attention in the literature [CF+93,CF+94,Cr95,KSW97]« less

Screening in ionic systems: simulations for the Lebowitz length.

PubMed

Kim, Young C; Luijten, Erik; Fisher, Michael E

2005-09-30

Simulations of the Lebowitz length, xiL (T, rho), are reported for the restricted primitive model hard-core (diameter a) 1:1 electrolyte for densities rho approximately < 4rho(c) and T(c) approximately < T approximately < 40T(c). Finite-size effects are elucidated for the charge fluctuations in various subdomains that serve to evaluate xiL. On extrapolation to the bulk limit for T approximately > 10T(c) the exact low-density expansions are seen to fail badly when rho > 1/10 rho(c) (with rho(c)a3 approximately = 0.08). At higher densities xiL rises above the Debye length, xiD proportional to square root(T/rho), by 10%-30% (up to rho approximately =1.3rho(c)); the variation is portrayed fairly well by the generalized Debye-Hückel theory. On approaching criticality at fixed rho or fixed T, xiL (T, rho) remains finite with xiL(c) approximately = 0.30a approximately = 1.3xiD(c) but displays a weak entropylike singularity.

A general algorithm using finite element method for aerodynamic configurations at low speeds

NASA Technical Reports Server (NTRS)

Balasubramanian, R.

1975-01-01

A finite element algorithm for numerical simulation of two-dimensional, incompressible, viscous flows was developed. The Navier-Stokes equations are suitably modelled to facilitate direct solution for the essential flow parameters. A leap-frog time differencing and Galerkin minimization of these model equations yields the finite element algorithm. The finite elements are triangular with bicubic shape functions approximating the solution space. The finite element matrices are unsymmetrically banded to facilitate savings in storage. An unsymmetric L-U decomposition is performed on the finite element matrices to obtain the solution for the boundary value problem.

Rank-frequency distributions of Romanian words

NASA Astrophysics Data System (ADS)

Cocioceanu, Adrian; Raportaru, Carina Mihaela; Nicolin, Alexandru I.; Jakimovski, Dragan

2017-12-01

The calibration of voice biometrics solutions requires detailed analyses of spoken texts and in this context we investigate by computational means the rank-frequency distributions of Romanian words and word series to determine the most common words and word series of the language. To this end, we have constructed a corpus of approximately 2.5 million words and then determined that the rank-frequency distributions of the Romanian words, as well as series of two, and three subsequent words, obey the celebrated Zipf law.

Top-d Rank Aggregation in Web Meta-search Engine

NASA Astrophysics Data System (ADS)

Fang, Qizhi; Xiao, Han; Zhu, Shanfeng

In this paper, we consider the rank aggregation problem for information retrieval over Web making use of a kind of metric, the coherence, which considers both the normalized Kendall-τ distance and the size of overlap between two partial rankings. In general, the top-d coherence aggregation problem is defined as: given collection of partial rankings Π = {τ 1,τ 2, ⋯ , τ K }, how to find a final ranking π with specific length d, which maximizes the total coherence Φ(π,Pi)=sum_{i=1}^K Φ(π,tau_i). The corresponding complexity and algorithmic issues are discussed in this paper. Our main technical contribution is a polynomial time approximation scheme (PTAS) for a restricted top-d coherence aggregation problem.

On the Reliability of Source Time Functions Estimated Using Empirical Green's Function Methods

NASA Astrophysics Data System (ADS)

Gallegos, A. C.; Xie, J.; Suarez Salas, L.

2017-12-01

The Empirical Green's Function (EGF) method (Hartzell, 1978) has been widely used to extract source time functions (STFs). In this method, seismograms generated by collocated events with different magnitudes are deconvolved. Under a fundamental assumption that the STF of the small event is a delta function, the deconvolved Relative Source Time Function (RSTF) yields the large event's STF. While this assumption can be empirically justified by examination of differences in event size and frequency content of the seismograms, there can be a lack of rigorous justification of the assumption. In practice, a small event might have a finite duration when the RSTF is retrieved and interpreted as the large event STF with a bias. In this study, we rigorously analyze this bias using synthetic waveforms generated by convolving a realistic Green's function waveform with pairs of finite-duration triangular or parabolic STFs. The RSTFs are found using a time-domain based matrix deconvolution. We find when the STFs of smaller events are finite, the RSTFs are a series of narrow non-physical spikes. Interpreting these RSTFs as a series of high-frequency source radiations would be very misleading. The only reliable and unambiguous information we can retrieve from these RSTFs is the difference in durations and the moment ratio of the two STFs. We can apply a Tikhonov smoothing to obtain a single-pulse RSTF, but its duration is dependent on the choice of weighting, which may be subjective. We then test the Multi-Channel Deconvolution (MCD) method (Plourde & Bostock, 2017) which assumes that both STFs have finite durations to be solved for. A concern about the MCD method is that the number of unknown parameters is larger, which would tend to make the problem rank-deficient. Because the kernel matrix is dependent on the STFs to be solved for under a positivity constraint, we can only estimate the rank-deficiency with a semi-empirical approach. Based on the results so far, we find that the rank-deficiency makes it improbable to solve for both STFs. To solve for the larger STF we need to assume the shape of the small STF to be known a priori. Thus, the reliability of the estimated large STF depends on the difference between the assumed and true shapes of the small STF. We will show how the reliability varies with realistic scenarios.

Combining the modified Skyrme-like model and the local density approximation to determine the symmetry energy of nuclear matter

NASA Astrophysics Data System (ADS)

Liu, Jian; Ren, Zhongzhou; Xu, Chang

2018-07-01

Combining the modified Skyrme-like model and the local density approximation model, the slope parameter L of symmetry energy is extracted from the properties of finite nuclei with an improved iterative method. The calculations of the iterative method are performed within the framework of the spherical symmetry. By choosing 200 neutron rich nuclei on 25 isotopic chains as candidates, the slope parameter is constrained to be 50 MeV < L < 62 MeV. The validity of this method is examined by the properties of finite nuclei. Results show that reasonable descriptions on the properties of finite nuclei and nuclear matter can be obtained together.

Approximation of Optimal Infinite Dimensional Compensators for Flexible Structures

NASA Technical Reports Server (NTRS)

Gibson, J. S.; Mingori, D. L.; Adamian, A.; Jabbari, F.

1985-01-01

The infinite dimensional compensator for a large class of flexible structures, modeled as distributed systems are discussed, as well as an approximation scheme for designing finite dimensional compensators to approximate the infinite dimensional compensator. The approximation scheme is applied to develop a compensator for a space antenna model based on wrap-rib antennas being built currently. While the present model has been simplified, it retains the salient features of rigid body modes and several distributed components of different characteristics. The control and estimator gains are represented by functional gains, which provide graphical representations of the control and estimator laws. These functional gains also indicate the convergence of the finite dimensional compensators and show which modes the optimal compensator ignores.

Optimization of Turbine Engine Cycle Analysis with Analytic Derivatives

NASA Technical Reports Server (NTRS)

Hearn, Tristan; Hendricks, Eric; Chin, Jeffrey; Gray, Justin; Moore, Kenneth T.

2016-01-01

A new engine cycle analysis tool, called Pycycle, was built using the OpenMDAO framework. Pycycle provides analytic derivatives allowing for an efficient use of gradient-based optimization methods on engine cycle models, without requiring the use of finite difference derivative approximation methods. To demonstrate this, a gradient-based design optimization was performed on a turbofan engine model. Results demonstrate very favorable performance compared to an optimization of an identical model using finite-difference approximated derivatives.

NATO Advanced Study Institute Granular Nanoelectronics Held in Ciocco, Italy on 23 July-4 August 1990. Poster Abstracts

DTIC Science & Technology

1990-08-04

approximation. The equations are solved with a finite - difference approximation scheme. A particular analysis has been devoted to the choice of the initial...closely spaced M. Grundmann, and D. Bimberg, Institut far Landau levels. With increasing field, the finiteness of Festkdrperphysik der Technischen...1990). formalism for phase coherent conductance between 4 F. Stern and W. E. Howard, Phys. Rev. 163, 816 different electron reservoirs: within the

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

Helinski, Ryan

This Python package provides high-performance implementations of the functions and examples presented in "BiEntropy - The Approximate Entropy of a Finite Binary String" by Grenville J. Croll, presented at ANPA 34 in 2013. https://arxiv.org/abs/1305.0954 According to the paper, BiEntropy is "a simple algorithm which computes the approximate entropy of a finite binary string of arbitrary length" using "a weighted average of the Shannon Entropies of the string and all but the last binary derivative of the string."

General MoM Solutions for Large Arrays

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

Fasenfest, B; Capolino, F; Wilton, D R

2003-07-22

This paper focuses on a numerical procedure that addresses the difficulties of dealing with large, finite arrays while preserving the generality and robustness of full-wave methods. We present a fast method based on approximating interactions between sufficiently separated array elements via a relatively coarse interpolation of the Green's function on a uniform grid commensurate with the array's periodicity. The interaction between the basis and testing functions is reduced to a three-stage process. The first stage is a projection of standard (e.g., RWG) subdomain bases onto a set of interpolation functions that interpolate the Green's function on the array face. Thismore » projection, which is used in a matrix/vector product for each array cell in an iterative solution process, need only be carried out once for a single cell and results in a low-rank matrix. An intermediate stage matrix/vector product computation involving the uniformly sampled Green's function is of convolutional form in the lateral (transverse) directions so that a 2D FFT may be used. The final stage is a third matrix/vector product computation involving a matrix resulting from projecting testing functions onto the Green's function interpolation functions; the low-rank matrix is either identical to (using Galerkin's method) or similar to that for the bases projection. An effective MoM solution scheme is developed for large arrays using a modification of the AIM (Adaptive Integral Method) method. The method permits the analysis of arrays with arbitrary contours and nonplanar elements. Both fill and solve times within the MoM method are improved with respect to more standard MoM solvers.« less

Approximation concepts for efficient structural synthesis

NASA Technical Reports Server (NTRS)

Schmit, L. A., Jr.; Miura, H.

1976-01-01

It is shown that efficient structural synthesis capabilities can be created by using approximation concepts to mesh finite element structural analysis methods with nonlinear mathematical programming techniques. The history of the application of mathematical programming techniques to structural design optimization problems is reviewed. Several rather general approximation concepts are described along with the technical foundations of the ACCESS 1 computer program, which implements several approximation concepts. A substantial collection of structural design problems involving truss and idealized wing structures is presented. It is concluded that since the basic ideas employed in creating the ACCESS 1 program are rather general, its successful development supports the contention that the introduction of approximation concepts will lead to the emergence of a new generation of practical and efficient, large scale, structural synthesis capabilities in which finite element analysis methods and mathematical programming algorithms will play a central role.

Discrete maximum principle for the P1 - P0 weak Galerkin finite element approximations

NASA Astrophysics Data System (ADS)

Wang, Junping; Ye, Xiu; Zhai, Qilong; Zhang, Ran

2018-06-01

This paper presents two discrete maximum principles (DMP) for the numerical solution of second order elliptic equations arising from the weak Galerkin finite element method. The results are established by assuming an h-acute angle condition for the underlying finite element triangulations. The mathematical theory is based on the well-known De Giorgi technique adapted in the finite element context. Some numerical results are reported to validate the theory of DMP.

Computing Finite-Time Lyapunov Exponents with Optimally Time Dependent Reduction

NASA Astrophysics Data System (ADS)

Babaee, Hessam; Farazmand, Mohammad; Sapsis, Themis; Haller, George

2016-11-01

We present a method to compute Finite-Time Lyapunov Exponents (FTLE) of a dynamical system using Optimally Time-Dependent (OTD) reduction recently introduced by H. Babaee and T. P. Sapsis. The OTD modes are a set of finite-dimensional, time-dependent, orthonormal basis {ui (x , t) } |i=1N that capture the directions associated with transient instabilities. The evolution equation of the OTD modes is derived from a minimization principle that optimally approximates the most unstable directions over finite times. To compute the FTLE, we evolve a single OTD mode along with the nonlinear dynamics. We approximate the FTLE from the reduced system obtained from projecting the instantaneous linearized dynamics onto the OTD mode. This results in a significant reduction in the computational cost compared to conventional methods for computing FTLE. We demonstrate the efficiency of our method for double Gyre and ABC flows. ARO project 66710-EG-YIP.

Probabilistic Structural Analysis Theory Development

NASA Technical Reports Server (NTRS)

Burnside, O. H.

1985-01-01

The objective of the Probabilistic Structural Analysis Methods (PSAM) project is to develop analysis techniques and computer programs for predicting the probabilistic response of critical structural components for current and future space propulsion systems. This technology will play a central role in establishing system performance and durability. The first year's technical activity is concentrating on probabilistic finite element formulation strategy and code development. Work is also in progress to survey critical materials and space shuttle mian engine components. The probabilistic finite element computer program NESSUS (Numerical Evaluation of Stochastic Structures Under Stress) is being developed. The final probabilistic code will have, in the general case, the capability of performing nonlinear dynamic of stochastic structures. It is the goal of the approximate methods effort to increase problem solving efficiency relative to finite element methods by using energy methods to generate trial solutions which satisfy the structural boundary conditions. These approximate methods will be less computer intensive relative to the finite element approach.

A-posteriori error estimation for the finite point method with applications to compressible flow

NASA Astrophysics Data System (ADS)

Ortega, Enrique; Flores, Roberto; Oñate, Eugenio; Idelsohn, Sergio

2017-08-01

An a-posteriori error estimate with application to inviscid compressible flow problems is presented. The estimate is a surrogate measure of the discretization error, obtained from an approximation to the truncation terms of the governing equations. This approximation is calculated from the discrete nodal differential residuals using a reconstructed solution field on a modified stencil of points. Both the error estimation methodology and the flow solution scheme are implemented using the Finite Point Method, a meshless technique enabling higher-order approximations and reconstruction procedures on general unstructured discretizations. The performance of the proposed error indicator is studied and applications to adaptive grid refinement are presented.

On the sighting of unicorns: A variational approach to computing invariant sets in dynamical systems

NASA Astrophysics Data System (ADS)

Junge, Oliver; Kevrekidis, Ioannis G.

2017-06-01

We propose to compute approximations to invariant sets in dynamical systems by minimizing an appropriate distance between a suitably selected finite set of points and its image under the dynamics. We demonstrate, through computational experiments, that this approach can successfully converge to approximations of (maximal) invariant sets of arbitrary topology, dimension, and stability, such as, e.g., saddle type invariant sets with complicated dynamics. We further propose to extend this approach by adding a Lennard-Jones type potential term to the objective function, which yields more evenly distributed approximating finite point sets, and illustrate the procedure through corresponding numerical experiments.

On the sighting of unicorns: A variational approach to computing invariant sets in dynamical systems.

PubMed

Junge, Oliver; Kevrekidis, Ioannis G

2017-06-01

We propose to compute approximations to invariant sets in dynamical systems by minimizing an appropriate distance between a suitably selected finite set of points and its image under the dynamics. We demonstrate, through computational experiments, that this approach can successfully converge to approximations of (maximal) invariant sets of arbitrary topology, dimension, and stability, such as, e.g., saddle type invariant sets with complicated dynamics. We further propose to extend this approach by adding a Lennard-Jones type potential term to the objective function, which yields more evenly distributed approximating finite point sets, and illustrate the procedure through corresponding numerical experiments.

A comparative study of an ABC and an artificial absorber for truncating finite element meshes

NASA Technical Reports Server (NTRS)

Oezdemir, T.; Volakis, John L.

1993-01-01

The type of mesh termination used in the context of finite element formulations plays a major role on the efficiency and accuracy of the field solution. The performance of an absorbing boundary condition (ABC) and an artificial absorber (a new concept) for terminating the finite element mesh was evaluated. This analysis is done in connection with the problem of scattering by a finite slot array in a thick ground plane. The two approximate mesh truncation schemes are compared with the exact finite element-boundary integral (FEM-BI) method in terms of accuracy and efficiency. It is demonstrated that both approximate truncation schemes yield reasonably accurate results even when the mesh is extended only 0.3 wavelengths away from the array aperture. However, the artificial absorber termination method leads to a substantially more efficient solution. Moreover, it is shown that the FEM-BI method remains quite competitive with the FEM-artificial absorber method when the FFT is used for computing the matrix-vector products in the iterative solution algorithm. These conclusions are indeed surprising and of major importance in electromagnetic simulations based on the finite element method.

Beyond Zipf's Law: The Lavalette Rank Function and Its Properties.

PubMed

Fontanelli, Oscar; Miramontes, Pedro; Yang, Yaning; Cocho, Germinal; Li, Wentian

Although Zipf's law is widespread in natural and social data, one often encounters situations where one or both ends of the ranked data deviate from the power-law function. Previously we proposed the Beta rank function to improve the fitting of data which does not follow a perfect Zipf's law. Here we show that when the two parameters in the Beta rank function have the same value, the Lavalette rank function, the probability density function can be derived analytically. We also show both computationally and analytically that Lavalette distribution is approximately equal, though not identical, to the lognormal distribution. We illustrate the utility of Lavalette rank function in several datasets. We also address three analysis issues on the statistical testing of Lavalette fitting function, comparison between Zipf's law and lognormal distribution through Lavalette function, and comparison between lognormal distribution and Lavalette distribution.

Complexity and approximability of quantified and stochastic constraint satisfaction problems

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

Hunt, H. B.; Stearns, R. L.; Marathe, M. V.

2001-01-01

Let D be an arbitrary (not necessarily finite) nonempty set, let C be a finite set of constant symbols denoting arbitrary elements of D, and let S be an arbitrary finite set of finite-arity relations on D. We denote the problem of determining the satisfiability of finite conjunctions of relations in S applied to variables (to variables and symbols in C) by SAT(S) (by SAT{sub c}(S)). Here, we study simultaneously the complexity of and the existence of efficient approximation algorithms for a number of variants of the problems SAT(S) and SAT{sub c}(S), and for many different D, C, and S.more » These problem variants include decision and optimization problems, for formulas, quantified formulas stochastically-quantified formulas. We denote these problems by Q-SAT(S), MAX-Q-SAT(S), S-SAT(S), MAX-S-SAT(S) MAX-NSF-Q-SAT(S) and MAX-NSF-S-SAT(S). The main contribution is the development of a unified predictive theory for characterizing the the complexity of these problems. Our unified approach is based on the following basic two basic concepts: (i) strongly-local replacements/reductions and (ii) relational/algebraic representability. Let k {ge} 2. Let S be a finite set of finite-arity relations on {Sigma}{sub k} with the following condition on S: All finite arity relations on {Sigma}{sub k} can be represented as finite existentially-quantified conjunctions of relations in S applied to variables (to variables and constant symbols in C), Then we prove the following new results: (1) The problems SAT(S) and SAT{sub c}(S) are both NQL-complete and {le}{sub logn}{sup bw}-complete for NP. (2) The problems Q-SAT(S), Q-SAT{sub c}(S), are PSPACE-complete. Letting k = 2, the problem S-SAT(S) and S-SAT{sub c}(S) are PSPACE-complete. (3) {exists} {epsilon} > 0 for which approximating the problems MAX-Q-SAT(S) within {epsilon} times optimum is PSPACE-hard. Letting k =: 2, {exists} {epsilon} > 0 for which approximating the problems MAX-S-SAT(S) within {epsilon} times optimum is PSPACE-hard. (4) {forall} {epsilon} > 0 the problems MAX-NSF-Q-SAT(S) and MAX-NSF-S-SAT(S), are PSPACE-hard to approximate within a factor of n{sup {epsilon}} times optimum. These results significantly extend the earlier results by (i) Papadimitriou [Pa851] on complexity of stochastic satisfiability, (ii) Condon, Feigenbaum, Lund and Shor [CF+93, CF+94] by identifying natural classes of PSPACE-hard optimization problems with provably PSPACE-hard {epsilon}-approximation problems. Moreover, most of our results hold not just for Boolean relations: most previous results were done only in the context of Boolean domains. The results also constitute as a significant step towards obtaining a dichotomy theorems for the problems MAX-S-SAT(S) and MAX-Q-SAT(S): a research area of recent interest [CF+93, CF+94, Cr95, KSW97, LMP99].« less

Finite-temperature Gutzwiller approximation from the time-dependent variational principle

NASA Astrophysics Data System (ADS)

Lanatà, Nicola; Deng, Xiaoyu; Kotliar, Gabriel

2015-08-01

We develop an extension of the Gutzwiller approximation to finite temperatures based on the Dirac-Frenkel variational principle. Our method does not rely on any entropy inequality, and is substantially more accurate than the approaches proposed in previous works. We apply our theory to the single-band Hubbard model at different fillings, and show that our results compare quantitatively well with dynamical mean field theory in the metallic phase. We discuss potential applications of our technique within the framework of first-principle calculations.

A fast Cauchy-Riemann solver. [differential equation solution for boundary conditions by finite difference approximation

NASA Technical Reports Server (NTRS)

Ghil, M.; Balgovind, R.

1979-01-01

The inhomogeneous Cauchy-Riemann equations in a rectangle are discretized by a finite difference approximation. Several different boundary conditions are treated explicitly, leading to algorithms which have overall second-order accuracy. All boundary conditions with either u or v prescribed along a side of the rectangle can be treated by similar methods. The algorithms presented here have nearly minimal time and storage requirements and seem suitable for development into a general-purpose direct Cauchy-Riemann solver for arbitrary boundary conditions.

Arbitrary-level hanging nodes for adaptive hphp-FEM approximations in 3D

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

Pavel Kus; Pavel Solin; David Andrs

2014-11-01

In this paper we discuss constrained approximation with arbitrary-level hanging nodes in adaptive higher-order finite element methods (hphp-FEM) for three-dimensional problems. This technique enables using highly irregular meshes, and it greatly simplifies the design of adaptive algorithms as it prevents refinements from propagating recursively through the finite element mesh. The technique makes it possible to design efficient adaptive algorithms for purely hexahedral meshes. We present a detailed mathematical description of the method and illustrate it with numerical examples.

Fast and accurate matrix completion via truncated nuclear norm regularization.

PubMed

Hu, Yao; Zhang, Debing; Ye, Jieping; Li, Xuelong; He, Xiaofei

2013-09-01

Recovering a large matrix from a small subset of its entries is a challenging problem arising in many real applications, such as image inpainting and recommender systems. Many existing approaches formulate this problem as a general low-rank matrix approximation problem. Since the rank operator is nonconvex and discontinuous, most of the recent theoretical studies use the nuclear norm as a convex relaxation. One major limitation of the existing approaches based on nuclear norm minimization is that all the singular values are simultaneously minimized, and thus the rank may not be well approximated in practice. In this paper, we propose to achieve a better approximation to the rank of matrix by truncated nuclear norm, which is given by the nuclear norm subtracted by the sum of the largest few singular values. In addition, we develop a novel matrix completion algorithm by minimizing the Truncated Nuclear Norm. We further develop three efficient iterative procedures, TNNR-ADMM, TNNR-APGL, and TNNR-ADMMAP, to solve the optimization problem. TNNR-ADMM utilizes the alternating direction method of multipliers (ADMM), while TNNR-AGPL applies the accelerated proximal gradient line search method (APGL) for the final optimization. For TNNR-ADMMAP, we make use of an adaptive penalty according to a novel update rule for ADMM to achieve a faster convergence rate. Our empirical study shows encouraging results of the proposed algorithms in comparison to the state-of-the-art matrix completion algorithms on both synthetic and real visual datasets.

Inertial Manifold and Large Deviations Approach to Reduced PDE Dynamics

NASA Astrophysics Data System (ADS)

Cardin, Franco; Favretti, Marco; Lovison, Alberto

2017-09-01

In this paper a certain type of reaction-diffusion equation—similar to the Allen-Cahn equation—is the starting point for setting up a genuine thermodynamic reduction i.e. involving a finite number of parameters or collective variables of the initial system. We firstly operate a finite Lyapunov-Schmidt reduction of the cited reaction-diffusion equation when reformulated as a variational problem. In this way we gain a finite-dimensional ODE description of the initial system which preserves the gradient structure of the original one and that is exact for the static case and only approximate for the dynamic case. Our main concern is how to deal with this approximate reduced description of the initial PDE. To start with, we note that our approximate reduced ODE is similar to the approximate inertial manifold introduced by Temam and coworkers for Navier-Stokes equations. As a second approach, we take into account the uncertainty (loss of information) introduced with the above mentioned approximate reduction by considering the stochastic version of the ODE. We study this reduced stochastic system using classical tools from large deviations, viscosity solutions and weak KAM Hamilton-Jacobi theory. In the last part we suggest a possible use of a result of our approach in the comprehensive treatment non equilibrium thermodynamics given by Macroscopic Fluctuation Theory.

Revised Thomas-Fermi approximation for singular potentials

NASA Astrophysics Data System (ADS)

Dufty, James W.; Trickey, S. B.

2016-08-01

Approximations for the many-fermion free-energy density functional that include the Thomas-Fermi (TF) form for the noninteracting part lead to singular densities for singular external potentials (e.g., attractive Coulomb). This limitation of the TF approximation is addressed here by a formal map of the exact Euler equation for the density onto an equivalent TF form characterized by a modified Kohn-Sham potential. It is shown to be a "regularized" version of the Kohn-Sham potential, tempered by convolution with a finite-temperature response function. The resulting density is nonsingular, with the equilibrium properties obtained from the total free-energy functional evaluated at this density. This new representation is formally exact. Approximate expressions for the regularized potential are given to leading order in a nonlocality parameter, and the limiting behavior at high and low temperatures is described. The noninteracting part of the free energy in this approximation is the usual Thomas-Fermi functional. These results generalize and extend to finite temperatures the ground-state regularization by R. G. Parr and S. Ghosh [Proc. Natl. Acad. Sci. U.S.A. 83, 3577 (1986), 10.1073/pnas.83.11.3577] and by L. R. Pratt, G. G. Hoffman, and R. A. Harris [J. Chem. Phys. 88, 1818 (1988), 10.1063/1.454105] and formally systematize the finite-temperature regularization given by the latter authors.

A finite element analysis of viscoelastically damped sandwich plates

NASA Astrophysics Data System (ADS)

Ma, B.-A.; He, J.-F.

1992-01-01

A finite element analysis associated with an asymptotic solution method for the harmonic flexural vibration of viscoelastically damped unsymmetrical sandwich plates is given. The element formulation is based on generalization of the discrete Kirchhoff theory (DKT) element formulation. The results obtained with the first order approximation of the asymptotic solution presented here are the same as those obtained by means of the modal strain energy (MSE) method. By taking more terms of the asymptotic solution, with successive calculations and use of the Padé approximants method, accuracy can be improved. The finite element computation has been verified by comparison with an analytical exact solution for rectangular plates with simply supported edges. Results for the same plates with clamped edges are also presented.

Finite state modeling of aeroelastic systems

NASA Technical Reports Server (NTRS)

Vepa, R.

1977-01-01

A general theory of finite state modeling of aerodynamic loads on thin airfoils and lifting surfaces performing completely arbitrary, small, time-dependent motions in an airstream is developed and presented. The nature of the behavior of the unsteady airloads in the frequency domain is explained, using as raw materials any of the unsteady linearized theories that have been mechanized for simple harmonic oscillations. Each desired aerodynamic transfer function is approximated by means of an appropriate Pade approximant, that is, a rational function of finite degree polynomials in the Laplace transform variable. The modeling technique is applied to several two dimensional and three dimensional airfoils. Circular, elliptic, rectangular and tapered planforms are considered as examples. Identical functions are also obtained for control surfaces for two and three dimensional airfoils.

On mathematical modelling of aeroelastic problems with finite element method

NASA Astrophysics Data System (ADS)

Sváček, Petr

2018-06-01

This paper is interested in solution of two-dimensional aeroelastic problems. Two mathematical models are compared for a benchmark problem. First, the classical approach of linearized aerodynamical forces is described to determine the aeroelastic instability and the aeroelastic response in terms of frequency and damping coefficient. This approach is compared to the coupled fluid-structure model solved with the aid of finite element method used for approximation of the incompressible Navier-Stokes equations. The finite element approximations are coupled to the non-linear motion equations of a flexibly supported airfoil. Both methods are first compared for the case of small displacement, where the linearized approach can be well adopted. The influence of nonlinearities for the case of post-critical regime is discussed.

Modeling the Elastic and Damping Properties of the Multilayered Torsion Bar-Blade Structure of Rotors of Light Helicopters of the New Generation. 1. Finite-Element Approximation of the Torsion Bar

NASA Astrophysics Data System (ADS)

Paimushin, V. N.; Shishkin, V. M.

2015-11-01

A prismatic semiquadratic element with a nonclassical approximation of its displacements is suggested for modeling the composite and soft layers of a torsion bar and multilayered plate-rod structures. The stiffness, weight, damping, and geometric stiffness matrices of the above-mentioned element are obtained. Expressions for computing stresses in the finite element under the action of static loads and vibrations in the resonance zone are presented. Test examples confirming the validity of the element suggested are given. An example of finite element determination of the dynamic response of a multilayered torsion bar in the resonant mode is considered.

A Least-Squares-Based Weak Galerkin Finite Element Method for Second Order Elliptic Equations

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

Mu, Lin; Wang, Junping; Ye, Xiu

Here, in this article, we introduce a least-squares-based weak Galerkin finite element method for the second order elliptic equation. This new method is shown to provide very accurate numerical approximations for both the primal and the flux variables. In contrast to other existing least-squares finite element methods, this new method allows us to use discontinuous approximating functions on finite element partitions consisting of arbitrary polygon/polyhedron shapes. We also develop a Schur complement algorithm for the resulting discretization problem by eliminating all the unknowns that represent the solution information in the interior of each element. Optimal order error estimates for bothmore » the primal and the flux variables are established. An extensive set of numerical experiments are conducted to demonstrate the robustness, reliability, flexibility, and accuracy of the least-squares-based weak Galerkin finite element method. Finally, the numerical examples cover a wide range of applied problems, including singularly perturbed reaction-diffusion equations and the flow of fluid in porous media with strong anisotropy and heterogeneity.« less

A Least-Squares-Based Weak Galerkin Finite Element Method for Second Order Elliptic Equations

DOE PAGES

Mu, Lin; Wang, Junping; Ye, Xiu

2017-08-17

Here, in this article, we introduce a least-squares-based weak Galerkin finite element method for the second order elliptic equation. This new method is shown to provide very accurate numerical approximations for both the primal and the flux variables. In contrast to other existing least-squares finite element methods, this new method allows us to use discontinuous approximating functions on finite element partitions consisting of arbitrary polygon/polyhedron shapes. We also develop a Schur complement algorithm for the resulting discretization problem by eliminating all the unknowns that represent the solution information in the interior of each element. Optimal order error estimates for bothmore » the primal and the flux variables are established. An extensive set of numerical experiments are conducted to demonstrate the robustness, reliability, flexibility, and accuracy of the least-squares-based weak Galerkin finite element method. Finally, the numerical examples cover a wide range of applied problems, including singularly perturbed reaction-diffusion equations and the flow of fluid in porous media with strong anisotropy and heterogeneity.« less

An approximation theory for the identification of nonlinear distributed parameter systems

NASA Technical Reports Server (NTRS)

Banks, H. T.; Reich, Simeon; Rosen, I. G.

1988-01-01

An abstract approximation framework for the identification of nonlinear distributed parameter systems is developed. Inverse problems for nonlinear systems governed by strongly maximal monotone operators (satisfying a mild continuous dependence condition with respect to the unknown parameters to be identified) are treated. Convergence of Galerkin approximations and the corresponding solutions of finite dimensional approximating identification problems to a solution of the original finite dimensional identification problem is demonstrated using the theory of nonlinear evolution systems and a nonlinear analog of the Trotter-Kato approximation result for semigroups of bounded linear operators. The nonlinear theory developed here is shown to subsume an existing linear theory as a special case. It is also shown to be applicable to a broad class of nonlinear elliptic operators and the corresponding nonlinear parabolic partial differential equations to which they lead. An application of the theory to a quasilinear model for heat conduction or mass transfer is discussed.

Efficiency trade-offs of steady-state methods using FEM and FDM. [iterative solutions for nonlinear flow equations

NASA Technical Reports Server (NTRS)

Gartling, D. K.; Roache, P. J.

1978-01-01

The efficiency characteristics of finite element and finite difference approximations for the steady-state solution of the Navier-Stokes equations are examined. The finite element method discussed is a standard Galerkin formulation of the incompressible, steady-state Navier-Stokes equations. The finite difference formulation uses simple centered differences that are O(delta x-squared). Operation counts indicate that a rapidly converging Newton-Raphson-Kantorovitch iteration scheme is generally preferable over a Picard method. A split NOS Picard iterative algorithm for the finite difference method was most efficient.

Solutions of interval type-2 fuzzy polynomials using a new ranking method

NASA Astrophysics Data System (ADS)

Rahman, Nurhakimah Ab.; Abdullah, Lazim; Ghani, Ahmad Termimi Ab.; Ahmad, Noor'Ani

2015-10-01

A few years ago, a ranking method have been introduced in the fuzzy polynomial equations. Concept of the ranking method is proposed to find actual roots of fuzzy polynomials (if exists). Fuzzy polynomials are transformed to system of crisp polynomials, performed by using ranking method based on three parameters namely, Value, Ambiguity and Fuzziness. However, it was found that solutions based on these three parameters are quite inefficient to produce answers. Therefore in this study a new ranking method have been developed with the aim to overcome the inherent weakness. The new ranking method which have four parameters are then applied in the interval type-2 fuzzy polynomials, covering the interval type-2 of fuzzy polynomial equation, dual fuzzy polynomial equations and system of fuzzy polynomials. The efficiency of the new ranking method then numerically considered in the triangular fuzzy numbers and the trapezoidal fuzzy numbers. Finally, the approximate solutions produced from the numerical examples indicate that the new ranking method successfully produced actual roots for the interval type-2 fuzzy polynomials.

A simple finite element method for linear hyperbolic problems

DOE PAGES

Mu, Lin; Ye, Xiu

2017-09-14

Here, we introduce a simple finite element method for solving first order hyperbolic equations with easy implementation and analysis. Our new method, with a symmetric, positive definite system, is designed to use discontinuous approximations on finite element partitions consisting of arbitrary shape of polygons/polyhedra. Error estimate is established. Extensive numerical examples are tested that demonstrate the robustness and flexibility of the method.

A simple finite element method for linear hyperbolic problems

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

Mu, Lin; Ye, Xiu

Here, we introduce a simple finite element method for solving first order hyperbolic equations with easy implementation and analysis. Our new method, with a symmetric, positive definite system, is designed to use discontinuous approximations on finite element partitions consisting of arbitrary shape of polygons/polyhedra. Error estimate is established. Extensive numerical examples are tested that demonstrate the robustness and flexibility of the method.

Solution of an eigenvalue problem for the Laplace operator on a spherical surface. M.S. Thesis - Maryland Univ.

NASA Technical Reports Server (NTRS)

Walden, H.

1974-01-01

Methods for obtaining approximate solutions for the fundamental eigenvalue of the Laplace-Beltrami operator (also referred to as the membrane eigenvalue problem for the vibration equation) on the unit spherical surface are developed. Two specific types of spherical surface domains are considered: (1) the interior of a spherical triangle, i.e., the region bounded by arcs of three great circles, and (2) the exterior of a great circle arc extending for less than pi radians on the sphere (a spherical surface with a slit). In both cases, zero boundary conditions are imposed. In order to solve the resulting second-order elliptic partial differential equations in two independent variables, a finite difference approximation is derived. The symmetric (generally five-point) finite difference equations that develop are written in matrix form and then solved by the iterative method of point successive overrelaxation. Upon convergence of this iterative method, the fundamental eigenvalue is approximated by iteration utilizing the power method as applied to the finite Rayleigh quotient.

An Optimization-Based Method for Feature Ranking in Nonlinear Regression Problems.

PubMed

Bravi, Luca; Piccialli, Veronica; Sciandrone, Marco

2017-04-01

In this paper, we consider the feature ranking problem, where, given a set of training instances, the task is to associate a score with the features in order to assess their relevance. Feature ranking is a very important tool for decision support systems, and may be used as an auxiliary step of feature selection to reduce the high dimensionality of real-world data. We focus on regression problems by assuming that the process underlying the generated data can be approximated by a continuous function (for instance, a feedforward neural network). We formally state the notion of relevance of a feature by introducing a minimum zero-norm inversion problem of a neural network, which is a nonsmooth, constrained optimization problem. We employ a concave approximation of the zero-norm function, and we define a smooth, global optimization problem to be solved in order to assess the relevance of the features. We present the new feature ranking method based on the solution of instances of the global optimization problem depending on the available training data. Computational experiments on both artificial and real data sets are performed, and point out that the proposed feature ranking method is a valid alternative to existing methods in terms of effectiveness. The obtained results also show that the method is costly in terms of CPU time, and this may be a limitation in the solution of large-dimensional problems.

Exact and Monte carlo resampling procedures for the Wilcoxon-Mann-Whitney and Kruskal-Wallis tests.

PubMed

Berry, K J; Mielke, P W

2000-12-01

Exact and Monte Carlo resampling FORTRAN programs are described for the Wilcoxon-Mann-Whitney rank sum test and the Kruskal-Wallis one-way analysis of variance for ranks test. The program algorithms compensate for tied values and do not depend on asymptotic approximations for probability values, unlike most algorithms contained in PC-based statistical software packages.

Optimization Based Efficiencies in First Order Reliability Analysis

NASA Technical Reports Server (NTRS)

Peck, Jeffrey A.; Mahadevan, Sankaran

2003-01-01

This paper develops a method for updating the gradient vector of the limit state function in reliability analysis using Broyden's rank one updating technique. In problems that use commercial code as a black box, the gradient calculations are usually done using a finite difference approach, which becomes very expensive for large system models. The proposed method replaces the finite difference gradient calculations in a standard first order reliability method (FORM) with Broyden's Quasi-Newton technique. The resulting algorithm of Broyden updates within a FORM framework (BFORM) is used to run several example problems, and the results compared to standard FORM results. It is found that BFORM typically requires fewer functional evaluations that FORM to converge to the same answer.

Optimal nonlinear filtering using the finite-volume method

NASA Astrophysics Data System (ADS)

Fox, Colin; Morrison, Malcolm E. K.; Norton, Richard A.; Molteno, Timothy C. A.

2018-01-01

Optimal sequential inference, or filtering, for the state of a deterministic dynamical system requires simulation of the Frobenius-Perron operator, that can be formulated as the solution of a continuity equation. For low-dimensional, smooth systems, the finite-volume numerical method provides a solution that conserves probability and gives estimates that converge to the optimal continuous-time values, while a Courant-Friedrichs-Lewy-type condition assures that intermediate discretized solutions remain positive density functions. This method is demonstrated in an example of nonlinear filtering for the state of a simple pendulum, with comparison to results using the unscented Kalman filter, and for a case where rank-deficient observations lead to multimodal probability distributions.

Spectral Regularization Algorithms for Learning Large Incomplete Matrices.

PubMed

Mazumder, Rahul; Hastie, Trevor; Tibshirani, Robert

2010-03-01

We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we provide a simple and very efficient convex algorithm for minimizing the reconstruction error subject to a bound on the nuclear norm. Our algorithm Soft-Impute iteratively replaces the missing elements with those obtained from a soft-thresholded SVD. With warm starts this allows us to efficiently compute an entire regularization path of solutions on a grid of values of the regularization parameter. The computationally intensive part of our algorithm is in computing a low-rank SVD of a dense matrix. Exploiting the problem structure, we show that the task can be performed with a complexity linear in the matrix dimensions. Our semidefinite-programming algorithm is readily scalable to large matrices: for example it can obtain a rank-80 approximation of a 10(6) × 10(6) incomplete matrix with 10(5) observed entries in 2.5 hours, and can fit a rank 40 approximation to the full Netflix training set in 6.6 hours. Our methods show very good performance both in training and test error when compared to other competitive state-of-the art techniques.

Spectral Regularization Algorithms for Learning Large Incomplete Matrices

PubMed Central

Mazumder, Rahul; Hastie, Trevor; Tibshirani, Robert

2010-01-01

We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we provide a simple and very efficient convex algorithm for minimizing the reconstruction error subject to a bound on the nuclear norm. Our algorithm Soft-Impute iteratively replaces the missing elements with those obtained from a soft-thresholded SVD. With warm starts this allows us to efficiently compute an entire regularization path of solutions on a grid of values of the regularization parameter. The computationally intensive part of our algorithm is in computing a low-rank SVD of a dense matrix. Exploiting the problem structure, we show that the task can be performed with a complexity linear in the matrix dimensions. Our semidefinite-programming algorithm is readily scalable to large matrices: for example it can obtain a rank-80 approximation of a 106 × 106 incomplete matrix with 105 observed entries in 2.5 hours, and can fit a rank 40 approximation to the full Netflix training set in 6.6 hours. Our methods show very good performance both in training and test error when compared to other competitive state-of-the art techniques. PMID:21552465

Modified truncated randomized singular value decomposition (MTRSVD) algorithms for large scale discrete ill-posed problems with general-form regularization

NASA Astrophysics Data System (ADS)

Jia, Zhongxiao; Yang, Yanfei

2018-05-01

In this paper, we propose new randomization based algorithms for large scale linear discrete ill-posed problems with general-form regularization: subject to , where L is a regularization matrix. Our algorithms are inspired by the modified truncated singular value decomposition (MTSVD) method, which suits only for small to medium scale problems, and randomized SVD (RSVD) algorithms that generate good low rank approximations to A. We use rank-k truncated randomized SVD (TRSVD) approximations to A by truncating the rank- RSVD approximations to A, where q is an oversampling parameter. The resulting algorithms are called modified TRSVD (MTRSVD) methods. At every step, we use the LSQR algorithm to solve the resulting inner least squares problem, which is proved to become better conditioned as k increases so that LSQR converges faster. We present sharp bounds for the approximation accuracy of the RSVDs and TRSVDs for severely, moderately and mildly ill-posed problems, and substantially improve a known basic bound for TRSVD approximations. We prove how to choose the stopping tolerance for LSQR in order to guarantee that the computed and exact best regularized solutions have the same accuracy. Numerical experiments illustrate that the best regularized solutions by MTRSVD are as accurate as the ones by the truncated generalized singular value decomposition (TGSVD) algorithm, and at least as accurate as those by some existing truncated randomized generalized singular value decomposition (TRGSVD) algorithms. This work was supported in part by the National Science Foundation of China (Nos. 11771249 and 11371219).

Beyond Low Rank + Sparse: Multi-scale Low Rank Matrix Decomposition

PubMed Central

Ong, Frank; Lustig, Michael

2016-01-01

We present a natural generalization of the recent low rank + sparse matrix decomposition and consider the decomposition of matrices into components of multiple scales. Such decomposition is well motivated in practice as data matrices often exhibit local correlations in multiple scales. Concretely, we propose a multi-scale low rank modeling that represents a data matrix as a sum of block-wise low rank matrices with increasing scales of block sizes. We then consider the inverse problem of decomposing the data matrix into its multi-scale low rank components and approach the problem via a convex formulation. Theoretically, we show that under various incoherence conditions, the convex program recovers the multi-scale low rank components either exactly or approximately. Practically, we provide guidance on selecting the regularization parameters and incorporate cycle spinning to reduce blocking artifacts. Experimentally, we show that the multi-scale low rank decomposition provides a more intuitive decomposition than conventional low rank methods and demonstrate its effectiveness in four applications, including illumination normalization for face images, motion separation for surveillance videos, multi-scale modeling of the dynamic contrast enhanced magnetic resonance imaging and collaborative filtering exploiting age information. PMID:28450978

Fast Low-Rank Bayesian Matrix Completion With Hierarchical Gaussian Prior Models

NASA Astrophysics Data System (ADS)

Yang, Linxiao; Fang, Jun; Duan, Huiping; Li, Hongbin; Zeng, Bing

2018-06-01

The problem of low rank matrix completion is considered in this paper. To exploit the underlying low-rank structure of the data matrix, we propose a hierarchical Gaussian prior model, where columns of the low-rank matrix are assumed to follow a Gaussian distribution with zero mean and a common precision matrix, and a Wishart distribution is specified as a hyperprior over the precision matrix. We show that such a hierarchical Gaussian prior has the potential to encourage a low-rank solution. Based on the proposed hierarchical prior model, a variational Bayesian method is developed for matrix completion, where the generalized approximate massage passing (GAMP) technique is embedded into the variational Bayesian inference in order to circumvent cumbersome matrix inverse operations. Simulation results show that our proposed method demonstrates superiority over existing state-of-the-art matrix completion methods.

Average dynamics of a finite set of coupled phase oscillators

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

Dima, Germán C., E-mail: gdima@df.uba.ar; Mindlin, Gabriel B.

2014-06-15

We study the solutions of a dynamical system describing the average activity of an infinitely large set of driven coupled excitable units. We compared their topological organization with that reconstructed from the numerical integration of finite sets. In this way, we present a strategy to establish the pertinence of approximating the dynamics of finite sets of coupled nonlinear units by the dynamics of its infinitely large surrogate.

Average dynamics of a finite set of coupled phase oscillators

PubMed Central

Dima, Germán C.; Mindlin, Gabriel B.

2014-01-01

We study the solutions of a dynamical system describing the average activity of an infinitely large set of driven coupled excitable units. We compared their topological organization with that reconstructed from the numerical integration of finite sets. In this way, we present a strategy to establish the pertinence of approximating the dynamics of finite sets of coupled nonlinear units by the dynamics of its infinitely large surrogate. PMID:24985426

Average dynamics of a finite set of coupled phase oscillators.

PubMed

Dima, Germán C; Mindlin, Gabriel B

2014-06-01

We study the solutions of a dynamical system describing the average activity of an infinitely large set of driven coupled excitable units. We compared their topological organization with that reconstructed from the numerical integration of finite sets. In this way, we present a strategy to establish the pertinence of approximating the dynamics of finite sets of coupled nonlinear units by the dynamics of its infinitely large surrogate.

Prioritizing health technologies in a Primary Care Trust.

PubMed

Wilson, Edward; Sussex, Jon; Macleod, Christine; Fordham, Richard

2007-04-01

In the English National Health Service (NHS), Primary Care Trusts (PCTs) are responsible for commissioning health-care services on behalf of their populations. As resources are finite, decisions are required as to which services best fulfil population needs. Evidence on effectiveness varies in quality and availability. Nevertheless, decisions still have to be made. We report the development and pilot application of a multi-criteria prioritization mechanism in an English PCT, capable of accommodating a wide variety of evidence to rank six service developments. The mechanism proved valuable in assisting prioritization decisions and feedback was positive. Two community-based interventions were expected to save money in the long term and were ranked at the top of the list. Based on weighted benefit score and cost, two preventive programmes were ranked third and fourth. Finally, two National Institute for Health and Clinical Excellence (NICE)-approved interventions were ranked fifth and sixth. Sensitivity analysis revealed overlap in benefit scores for some of the interventions, representing diversity of opinion among the scoring panel. The method appears to be a practical approach to prioritization for commissioners of health care, but the pilot also revealed interesting divergences in relative priority between nationally mandated service developments and local health-care priorities.

Robust Covariate-Adjusted Log-Rank Statistics and Corresponding Sample Size Formula for Recurrent Events Data

PubMed Central

Song, Rui; Kosorok, Michael R.; Cai, Jianwen

2009-01-01

Summary Recurrent events data are frequently encountered in clinical trials. This article develops robust covariate-adjusted log-rank statistics applied to recurrent events data with arbitrary numbers of events under independent censoring and the corresponding sample size formula. The proposed log-rank tests are robust with respect to different data-generating processes and are adjusted for predictive covariates. It reduces to the Kong and Slud (1997, Biometrika 84, 847–862) setting in the case of a single event. The sample size formula is derived based on the asymptotic normality of the covariate-adjusted log-rank statistics under certain local alternatives and a working model for baseline covariates in the recurrent event data context. When the effect size is small and the baseline covariates do not contain significant information about event times, it reduces to the same form as that of Schoenfeld (1983, Biometrics 39, 499–503) for cases of a single event or independent event times within a subject. We carry out simulations to study the control of type I error and the comparison of powers between several methods in finite samples. The proposed sample size formula is illustrated using data from an rhDNase study. PMID:18162107

Scattering theory for graphs isomorphic to a regular tree at infinity

NASA Astrophysics Data System (ADS)

Colin de Verdière, Yves; Truc, Françoise

2013-06-01

We describe the spectral theory of the adjacency operator of a graph which is isomorphic to a regular tree at infinity. Using some combinatorics, we reduce the problem to a scattering problem for a finite rank perturbation of the adjacency operator on a regular tree. We develop this scattering theory using the classical recipes for Schrödinger operators in Euclidian spaces.

Computer program analyzes Buckling Of Shells Of Revolution with various wall construction, BOSOR

NASA Technical Reports Server (NTRS)

Almroth, B. O.; Bushnell, D.; Sobel, L. H.

1968-01-01

Computer program performs stability analyses for a wide class of shells without unduly restrictive approximations. The program uses numerical integration, finite difference of finite element techniques to solve with reasonable accuracy almost any buckling problem for shells exhibiting orthotropic behavior.

Weak Galerkin method for the Biot’s consolidation model

DOE PAGES

Hu, Xiaozhe; Mu, Lin; Ye, Xiu

2017-08-23

In this study, we develop a weak Galerkin (WG) finite element method for the Biot’s consolidation model in the classical displacement–pressure two-field formulation. Weak Galerkin linear finite elements are used for both displacement and pressure approximations in spatial discretizations. Backward Euler scheme is used for temporal discretization in order to obtain an implicit fully discretized scheme. We study the well-posedness of the linear system at each time step and also derive the overall optimal-order convergence of the WG formulation. Such WG scheme is designed on general shape regular polytopal meshes and provides stable and oscillation-free approximation for the pressure withoutmore » special treatment. Lastlyl, numerical experiments are presented to demonstrate the efficiency and accuracy of the proposed weak Galerkin finite element method.« less

Weak Galerkin method for the Biot’s consolidation model

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

Hu, Xiaozhe; Mu, Lin; Ye, Xiu

In this study, we develop a weak Galerkin (WG) finite element method for the Biot’s consolidation model in the classical displacement–pressure two-field formulation. Weak Galerkin linear finite elements are used for both displacement and pressure approximations in spatial discretizations. Backward Euler scheme is used for temporal discretization in order to obtain an implicit fully discretized scheme. We study the well-posedness of the linear system at each time step and also derive the overall optimal-order convergence of the WG formulation. Such WG scheme is designed on general shape regular polytopal meshes and provides stable and oscillation-free approximation for the pressure withoutmore » special treatment. Lastlyl, numerical experiments are presented to demonstrate the efficiency and accuracy of the proposed weak Galerkin finite element method.« less

Fundamental finite key limits for one-way information reconciliation in quantum key distribution

NASA Astrophysics Data System (ADS)

Tomamichel, Marco; Martinez-Mateo, Jesus; Pacher, Christoph; Elkouss, David

2017-11-01

The security of quantum key distribution protocols is guaranteed by the laws of quantum mechanics. However, a precise analysis of the security properties requires tools from both classical cryptography and information theory. Here, we employ recent results in non-asymptotic classical information theory to show that one-way information reconciliation imposes fundamental limitations on the amount of secret key that can be extracted in the finite key regime. In particular, we find that an often used approximation for the information leakage during information reconciliation is not generally valid. We propose an improved approximation that takes into account finite key effects and numerically test it against codes for two probability distributions, that we call binary-binary and binary-Gaussian, that typically appear in quantum key distribution protocols.

Protecting a quantum state from environmental noise by an incompatible finite-time measurement

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

Brasil, Carlos Alexandre; Castro, L. A. de; Napolitano, R. d. J.

We show that measurements of finite duration performed on an open two-state system can protect the initial state from a phase-noisy environment, provided the measured observable does not commute with the perturbing interaction. When the measured observable commutes with the environmental interaction, the finite-duration measurement accelerates the rate of decoherence induced by the phase noise. For the description of the measurement of an observable that is incompatible with the interaction between system and environment, we have found an approximate analytical expression, valid at zero temperature and weak coupling with the measuring device. We have tested the validity of the analyticalmore » predictions against an exact numerical approach, based on the superoperator-splitting method, that confirms the protection of the initial state of the system. When the coupling between the system and the measuring apparatus increases beyond the range of validity of the analytical approximation, the initial state is still protected by the finite-time measurement, according with the exact numerical calculations.« less

Noise elimination algorithm for modal analysis

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

Bao, X. X., E-mail: baoxingxian@upc.edu.cn; Li, C. L.; Xiong, C. B.

2015-07-27

Modal analysis is an ongoing interdisciplinary physical issue. Modal parameters estimation is applied to determine the dynamic characteristics of structures under vibration excitation. Modal analysis is more challenging for the measured vibration response signals are contaminated with noise. This study develops a mathematical algorithm of structured low rank approximation combined with the complex exponential method to estimate the modal parameters. Physical experiments using a steel cantilever beam with ten accelerometers mounted, excited by an impulse load, demonstrate that this method can significantly eliminate noise from measured signals and accurately identify the modal frequencies and damping ratios. This study provides amore » fundamental mechanism of noise elimination using structured low rank approximation in physical fields.« less

Approximate analysis of containment/deflection ring responses to engine rotor fragment impact.

NASA Technical Reports Server (NTRS)

Wu, R. W.-H.; Witmer, E. A.

1973-01-01

The transient responses of containment and/or deflection rings to impact from an engine rotor-blade fragment are analyzed. Energy and momentum considerations are employed in an approximate analysis to predict the collision-induced velocities which are imparted to the fragment and to the affected ring segment. This collision analysis is combined with the spatial finite-element representation of the ring and a temporal finite-difference solution procedure to predict the resulting large transient elastic-plastic deformations of containment/deflection rings. Some comparisons with experimental data are given.

Vibration suppression with approximate finite dimensional compensators for distributed systems: Computational methods and experimental results

NASA Technical Reports Server (NTRS)

Banks, H. T.; Smith, Ralph C.; Wang, Yun

1994-01-01

Based on a distributed parameter model for vibrations, an approximate finite dimensional dynamic compensator is designed to suppress vibrations (multiple modes with a broad band of frequencies) of a circular plate with Kelvin-Voigt damping and clamped boundary conditions. The control is realized via piezoceramic patches bonded to the plate and is calculated from information available from several pointwise observed state variables. Examples from computational studies as well as use in laboratory experiments are presented to demonstrate the effectiveness of this design.

Optimization of Turbine Engine Cycle Analysis with Analytic Derivatives

NASA Technical Reports Server (NTRS)

Hearn, Tristan; Hendricks, Eric; Chin, Jeffrey; Gray, Justin; Moore, Kenneth T.

2016-01-01

A new engine cycle analysis tool, called Pycycle, was recently built using the OpenMDAO framework. This tool uses equilibrium chemistry based thermodynamics, and provides analytic derivatives. This allows for stable and efficient use of gradient-based optimization and sensitivity analysis methods on engine cycle models, without requiring the use of finite difference derivative approximation methods. To demonstrate this, a gradient-based design optimization was performed on a multi-point turbofan engine model. Results demonstrate very favorable performance compared to an optimization of an identical model using finite-difference approximated derivatives.

Modeling dam-break flows using finite volume method on unstructured grid

USDA-ARS?s Scientific Manuscript database

Two-dimensional shallow water models based on unstructured finite volume method and approximate Riemann solvers for computing the intercell fluxes have drawn growing attention because of their robustness, high adaptivity to complicated geometry and ability to simulate flows with mixed regimes and di...

Ophthalmology Residency Match outcomes for 2011.

PubMed

Yousuf, Salman J; Jones, Leslie S

2012-03-01

To determine the match rate and predictors of matching into an ophthalmology residency. Population-based, cross-sectional study. All 746 candidates who submitted an application for the 2011 ophthalmology residency match. The Ophthalmology Residency Matching Program applicant database was reviewed to determine applicant characteristics and match outcomes. For US seniors, multivariate regression analysis was performed to determine predictors of matching. Match rate and predictors of US seniors matching. Rank lists were submitted by 622 applicants, among whom 458 (74%) matched. The match rate was higher for US seniors (83%) than for independent applicants (41%; P < 0.001). US seniors who matched were more likely to be Alpha Omega Alpha medical honor society members (odds ratio [OR], 2.94; 95% confidence interval [CI], 1.16-7.29), to attend medical schools ranked in the top 40 according to National Institutes of Health funding (OR, 2.25; CI, 1.14-4.43), and to have ranked more programs (OR, 1.44; CI, 1.29-1.60). Those ranking 6 to 10 programs had an 80% to 90% chance of matching, and those ranking more than 10 programs had a greater than 90% chance of matching. No clear benefit was observed by ranking additional programs once 11 had already been ranked. Average US Medical Licensing Examination Step 1 scores were 239 ± 14 and 223 ± 18 for applicants who were matched and unmatched, respectively; this difference was significant by univariate analysis (P < 0.001) but not by multivariate regression (P = 0.163). Ophthalmology ranks among the most competitive specialties in medicine. Those most likely to match were US seniors who maintained academic excellence beginning in their preclinical years. A finite relationship exists between ranking a greater number of programs and having a greater chance of matching. Copyright © 2012 American Academy of Ophthalmology. Published by Elsevier Inc. All rights reserved.

Genetic evidence on the origins of Indian caste populations.

PubMed

Bamshad, M; Kivisild, T; Watkins, W S; Dixon, M E; Ricker, C E; Rao, B B; Naidu, J M; Prasad, B V; Reddy, P G; Rasanayagam, A; Papiha, S S; Villems, R; Redd, A J; Hammer, M F; Nguyen, S V; Carroll, M L; Batzer, M A; Jorde, L B

2001-06-01

The origins and affinities of the approximately 1 billion people living on the subcontinent of India have long been contested. This is owing, in part, to the many different waves of immigrants that have influenced the genetic structure of India. In the most recent of these waves, Indo-European-speaking people from West Eurasia entered India from the Northwest and diffused throughout the subcontinent. They purportedly admixed with or displaced indigenous Dravidic-speaking populations. Subsequently they may have established the Hindu caste system and placed themselves primarily in castes of higher rank. To explore the impact of West Eurasians on contemporary Indian caste populations, we compared mtDNA (400 bp of hypervariable region 1 and 14 restriction site polymorphisms) and Y-chromosome (20 biallelic polymorphisms and 5 short tandem repeats) variation in approximately 265 males from eight castes of different rank to approximately 750 Africans, Asians, Europeans, and other Indians. For maternally inherited mtDNA, each caste is most similar to Asians. However, 20%-30% of Indian mtDNA haplotypes belong to West Eurasian haplogroups, and the frequency of these haplotypes is proportional to caste rank, the highest frequency of West Eurasian haplotypes being found in the upper castes. In contrast, for paternally inherited Y-chromosome variation each caste is more similar to Europeans than to Asians. Moreover, the affinity to Europeans is proportionate to caste rank, the upper castes being most similar to Europeans, particularly East Europeans. These findings are consistent with greater West Eurasian male admixture with castes of higher rank. Nevertheless, the mitochondrial genome and the Y chromosome each represents only a single haploid locus and is more susceptible to large stochastic variation, bottlenecks, and selective sweeps. Thus, to increase the power of our analysis, we assayed 40 independent, biparentally inherited autosomal loci (1 LINE-1 and 39 Alu elements) in all of the caste and continental populations (approximately 600 individuals). Analysis of these data demonstrated that the upper castes have a higher affinity to Europeans than to Asians, and the upper castes are significantly more similar to Europeans than are the lower castes. Collectively, all five datasets show a trend toward upper castes being more similar to Europeans, whereas lower castes are more similar to Asians. We conclude that Indian castes are most likely to be of proto-Asian origin with West Eurasian admixture resulting in rank-related and sex-specific differences in the genetic affinities of castes to Asians and Europeans.

Implementing a Matrix-free Analytical Jacobian to Handle Nonlinearities in Models of 3D Lithospheric Deformation

NASA Astrophysics Data System (ADS)

Kaus, B.; Popov, A.

2015-12-01

The analytical expression for the Jacobian is a key component to achieve fast and robust convergence of the nonlinear Newton-Raphson iterative solver. Accomplishing this task in practice often requires a significant algebraic effort. Therefore it is quite common to use a cheap alternative instead, for example by approximating the Jacobian with a finite difference estimation. Despite its simplicity it is a relatively fragile and unreliable technique that is sensitive to the scaling of the residual and unknowns, as well as to the perturbation parameter selection. Unfortunately no universal rule can be applied to provide both a robust scaling and a perturbation. The approach we use here is to derive the analytical Jacobian for the coupled set of momentum, mass, and energy conservation equations together with the elasto-visco-plastic rheology and a marker in cell/staggered finite difference method. The software project LaMEM (Lithosphere and Mantle Evolution Model) is primarily developed for the thermo-mechanically coupled modeling of the 3D lithospheric deformation. The code is based on a staggered grid finite difference discretization in space, and uses customized scalable solvers form PETSc library to efficiently run on the massively parallel machines (such as IBM Blue Gene/Q). Currently LaMEM relies on the Jacobian-Free Newton-Krylov (JFNK) nonlinear solver, which approximates the Jacobian-vector product using a simple finite difference formula. This approach never requires an assembled Jacobian matrix and uses only the residual computation routine. We use an approximate Jacobian (Picard) matrix to precondition the Krylov solver with the Galerkin geometric multigrid. Because of the inherent problems of the finite difference Jacobian estimation, this approach doesn't always result in stable convergence. In this work we present and discuss a matrix-free technique in which the Jacobian-vector product is replaced by analytically-derived expressions and compare results with those obtained with a finite difference approximation of the Jacobian. This project is funded by ERC Starting Grant 258830 and computer facilities were provided by Jülich supercomputer center (Germany).

Thermal and quantum fluctuations of confined Bose–Einstein condensate beyond the Bogoliubov approximation

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

Nakamura, Y., E-mail: yusuke.n@asagi.waseda.jp; Nagano Prefectural Kiso Seiho High School, Nagano 397-8571; Kawaguchi, T., E-mail: pionelish30@toki.waseda.jp

The formulation for zero mode of a Bose–Einstein condensate beyond the Bogoliubov approximation at zero temperature [Y. Nakamura et al., Phys. Rev. A 89 (2014) 013613] is extended to finite temperature. Both thermal and quantum fluctuations are considered in a manner consistent with a concept of spontaneous symmetry breakdown for a finite-size system. Therefore, we need a proper treatment of the zero mode operators, which invoke non-trivial enhancements in depletion condensate and thermodynamical quantities such as the specific heat. The enhancements are visible in the weak interaction case. Our approach reproduces the results of a homogeneous system in the Bogoliubovmore » approximation in a large particle number limit.« less

Solution of the Average-Passage Equations for the Incompressible Flow through Multiple-Blade-Row Turbomachinery

DTIC Science & Technology

1994-02-01

numerical treatment. An explicit numerical procedure based on Runqe-Kutta time stepping for cell-centered, hexahedral finite volumes is...An explicit numerical procedure based on Runge-Kutta time stepping for cell-centered, hexahedral finite volumes is outlined for the approximate...Discretization 16 3.1 Cell-Centered Finite -Volume Discretization in Space 16 3.2 Artificial Dissipation 17 3.3 Time Integration 21 3.4 Convergence

Cost Comparison of B-1B Non-Mission-Capable Drivers Using Finite Source Queueing with Spares

DTIC Science & Technology

2012-09-06

COMPARISON OF B-1B NON-MISSION-CAPABLE DRIVERS USING FINITE SOURCE QUEUEING WITH SPARES GRADUATE RESEARCH PAPER Presented to the Faculty...step into the lineup making large-number approximations unusable. Instead, a finite source queueing model including spares is incorporated...were reported as flying time accrued since last occurrence. Service time was given in both start-stop format and MX man-hours utilized. Service time was

Application of finite element approach to transonic flow problems

NASA Technical Reports Server (NTRS)

Hafez, M. M.; Murman, E. M.; Wellford, L. C., Jr.

1976-01-01

A variational finite element model for transonic small disturbance calculations is described. Different strategy is adopted in subsonic and supersonic regions, and blending elements are introduced between different regions. In the supersonic region, no upstream effect is allowed. If rectangular elements with linear shape functions are used, the model is similar to Murman's finite difference operators. Higher order shape functions, nonrectangular elements, and discontinuous approximation of shock waves are also discussed.

Nanoengineering Testbed for Nanosolar Cell and Piezoelectric Compounds

DTIC Science & Technology

2012-02-29

element mesh. The third model was a 3D finite element mesh that included complete geometric representation of Berkovich tip. This model allows for a...height of the specimen. These simulations suggest the proper specimen size to approximate a body of semi-infinite extent for a given indentation depth...tip nanoindentation model was the third and final finite element mesh created for analysis and comparison. The material model and the finite element

A modular finite-element model (MODFE) for areal and axisymmetric ground-water-flow problems, Part 2: Derivation of finite-element equations and comparisons with analytical solutions

USGS Publications Warehouse

Cooley, Richard L.

1992-01-01

MODFE, a modular finite-element model for simulating steady- or unsteady-state, area1 or axisymmetric flow of ground water in a heterogeneous anisotropic aquifer is documented in a three-part series of reports. In this report, part 2, the finite-element equations are derived by minimizing a functional of the difference between the true and approximate hydraulic head, which produces equations that are equivalent to those obtained by either classical variational or Galerkin techniques. Spatial finite elements are triangular with linear basis functions, and temporal finite elements are one dimensional with linear basis functions. Physical processes that can be represented by the model include (1) confined flow, unconfined flow (using the Dupuit approximation), or a combination of both; (2) leakage through either rigid or elastic confining units; (3) specified recharge or discharge at points, along lines, or areally; (4) flow across specified-flow, specified-head, or head-dependent boundaries; (5) decrease of aquifer thickness to zero under extreme water-table decline and increase of aquifer thickness from zero as the water table rises; and (6) head-dependent fluxes from springs, drainage wells, leakage across riverbeds or confining units combined with aquifer dewatering, and evapotranspiration. The matrix equations produced by the finite-element method are solved by the direct symmetric-Doolittle method or the iterative modified incomplete-Cholesky conjugate-gradient method. The direct method can be efficient for small- to medium-sized problems (less than about 500 nodes), and the iterative method is generally more efficient for larger-sized problems. Comparison of finite-element solutions with analytical solutions for five example problems demonstrates that the finite-element model can yield accurate solutions to ground-water flow problems.

Joint analysis of multiple high-dimensional data types using sparse matrix approximations of rank-1 with applications to ovarian and liver cancer.

PubMed

Okimoto, Gordon; Zeinalzadeh, Ashkan; Wenska, Tom; Loomis, Michael; Nation, James B; Fabre, Tiphaine; Tiirikainen, Maarit; Hernandez, Brenda; Chan, Owen; Wong, Linda; Kwee, Sandi

2016-01-01

Technological advances enable the cost-effective acquisition of Multi-Modal Data Sets (MMDS) composed of measurements for multiple, high-dimensional data types obtained from a common set of bio-samples. The joint analysis of the data matrices associated with the different data types of a MMDS should provide a more focused view of the biology underlying complex diseases such as cancer that would not be apparent from the analysis of a single data type alone. As multi-modal data rapidly accumulate in research laboratories and public databases such as The Cancer Genome Atlas (TCGA), the translation of such data into clinically actionable knowledge has been slowed by the lack of computational tools capable of analyzing MMDSs. Here, we describe the Joint Analysis of Many Matrices by ITeration (JAMMIT) algorithm that jointly analyzes the data matrices of a MMDS using sparse matrix approximations of rank-1. The JAMMIT algorithm jointly approximates an arbitrary number of data matrices by rank-1 outer-products composed of "sparse" left-singular vectors (eigen-arrays) that are unique to each matrix and a right-singular vector (eigen-signal) that is common to all the matrices. The non-zero coefficients of the eigen-arrays identify small subsets of variables for each data type (i.e., signatures) that in aggregate, or individually, best explain a dominant eigen-signal defined on the columns of the data matrices. The approximation is specified by a single "sparsity" parameter that is selected based on false discovery rate estimated by permutation testing. Multiple signals of interest in a given MDDS are sequentially detected and modeled by iterating JAMMIT on "residual" data matrices that result from a given sparse approximation. We show that JAMMIT outperforms other joint analysis algorithms in the detection of multiple signatures embedded in simulated MDDS. On real multimodal data for ovarian and liver cancer we show that JAMMIT identified multi-modal signatures that were clinically informative and enriched for cancer-related biology. Sparse matrix approximations of rank-1 provide a simple yet effective means of jointly reducing multiple, big data types to a small subset of variables that characterize important clinical and/or biological attributes of the bio-samples from which the data were acquired.

Phase-space finite elements in a least-squares solution of the transport equation

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

Drumm, C.; Fan, W.; Pautz, S.

2013-07-01

The linear Boltzmann transport equation is solved using a least-squares finite element approximation in the space, angular and energy phase-space variables. The method is applied to both neutral particle transport and also to charged particle transport in the presence of an electric field, where the angular and energy derivative terms are handled with the energy/angular finite elements approximation, in a manner analogous to the way the spatial streaming term is handled. For multi-dimensional problems, a novel approach is used for the angular finite elements: mapping the surface of a unit sphere to a two-dimensional planar region and using a meshingmore » tool to generate a mesh. In this manner, much of the spatial finite-elements machinery can be easily adapted to handle the angular variable. The energy variable and the angular variable for one-dimensional problems make use of edge/beam elements, also building upon the spatial finite elements capabilities. The methods described here can make use of either continuous or discontinuous finite elements in space, angle and/or energy, with the use of continuous finite elements resulting in a smaller problem size and the use of discontinuous finite elements resulting in more accurate solutions for certain types of problems. The work described in this paper makes use of continuous finite elements, so that the resulting linear system is symmetric positive definite and can be solved with a highly efficient parallel preconditioned conjugate gradients algorithm. The phase-space finite elements capability has been built into the Sceptre code and applied to several test problems, including a simple one-dimensional problem with an analytic solution available, a two-dimensional problem with an isolated source term, showing how the method essentially eliminates ray effects encountered with discrete ordinates, and a simple one-dimensional charged-particle transport problem in the presence of an electric field. (authors)« less

A simple low-computation-intensity model for approximating the distribution function of a sum of non-identical lognormals for financial applications

NASA Astrophysics Data System (ADS)

Messica, A.

2016-10-01

The probability distribution function of a weighted sum of non-identical lognormal random variables is required in various fields of science and engineering and specifically in finance for portfolio management as well as exotic options valuation. Unfortunately, it has no known closed form and therefore has to be approximated. Most of the approximations presented to date are complex as well as complicated for implementation. This paper presents a simple, and easy to implement, approximation method via modified moments matching and a polynomial asymptotic series expansion correction for a central limit theorem of a finite sum. The method results in an intuitively-appealing and computation-efficient approximation for a finite sum of lognormals of at least ten summands and naturally improves as the number of summands increases. The accuracy of the method is tested against the results of Monte Carlo simulationsand also compared against the standard central limit theorem andthe commonly practiced Markowitz' portfolio equations.

Design of Beneficial Wave Dynamics for Engine Life and Operability Enhancement

DTIC Science & Technology

2010-07-30

ST^(A), where S is the Dirac delta measure. Stochastic transition 9 function can be used to define two linear transfer operators called as Perron ... Frobenius and Koopman operators. Here we consider the finite dimensional approximation of the P-F operator. To do this we consider the finite

Two Propositions on the Application of Point Elasticities to Finite Price Changes.

ERIC Educational Resources Information Center

Daskin, Alan J.

1992-01-01

Considers counterintuitive propositions about using point elasticities to estimate quantity changes in response to price changes. Suggests that elasticity increases with price along a linear demand curve, but falling quantity demand offsets it. Argues that point elasticity with finite percentage change in price only approximates percentage change…

THE TWO-LEVEL MODEL AT FINITE-TEMPERATURE

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

Goodman, A.L.

1980-07-01

The finite-temperature HFB cranking equations are solved for the two-level model. The pair gap, moment of inertia and internal energy are determined as functions of spin and temperature. Thermal excitations and rotations collaborate to destroy the pair correlations. Raising the temperature eliminates the backbending effect and improves the HFB approximation.

Constrained low-rank matrix estimation: phase transitions, approximate message passing and applications

NASA Astrophysics Data System (ADS)

Lesieur, Thibault; Krzakala, Florent; Zdeborová, Lenka

2017-07-01

This article is an extended version of previous work of Lesieur et al (2015 IEEE Int. Symp. on Information Theory Proc. pp 1635-9 and 2015 53rd Annual Allerton Conf. on Communication, Control and Computing (IEEE) pp 680-7) on low-rank matrix estimation in the presence of constraints on the factors into which the matrix is factorized. Low-rank matrix factorization is one of the basic methods used in data analysis for unsupervised learning of relevant features and other types of dimensionality reduction. We present a framework to study the constrained low-rank matrix estimation for a general prior on the factors, and a general output channel through which the matrix is observed. We draw a parallel with the study of vector-spin glass models—presenting a unifying way to study a number of problems considered previously in separate statistical physics works. We present a number of applications for the problem in data analysis. We derive in detail a general form of the low-rank approximate message passing (Low-RAMP) algorithm, that is known in statistical physics as the TAP equations. We thus unify the derivation of the TAP equations for models as different as the Sherrington-Kirkpatrick model, the restricted Boltzmann machine, the Hopfield model or vector (xy, Heisenberg and other) spin glasses. The state evolution of the Low-RAMP algorithm is also derived, and is equivalent to the replica symmetric solution for the large class of vector-spin glass models. In the section devoted to result we study in detail phase diagrams and phase transitions for the Bayes-optimal inference in low-rank matrix estimation. We present a typology of phase transitions and their relation to performance of algorithms such as the Low-RAMP or commonly used spectral methods.

Development and Implementation of a Transport Method for the Transport and Reaction Simulation Engine (TaRSE) based on the Godunov-Mixed Finite Element Method

USGS Publications Warehouse

James, Andrew I.; Jawitz, James W.; Munoz-Carpena, Rafael

2009-01-01

A model to simulate transport of materials in surface water and ground water has been developed to numerically approximate solutions to the advection-dispersion equation. This model, known as the Transport and Reaction Simulation Engine (TaRSE), uses an algorithm that incorporates a time-splitting technique where the advective part of the equation is solved separately from the dispersive part. An explicit finite-volume Godunov method is used to approximate the advective part, while a mixed-finite element technique is used to approximate the dispersive part. The dispersive part uses an implicit discretization, which allows it to run stably with a larger time step than the explicit advective step. The potential exists to develop algorithms that run several advective steps, and then one dispersive step that encompasses the time interval of the advective steps. Because the dispersive step is computationally most expensive, schemes can be implemented that are more computationally efficient than non-time-split algorithms. This technique enables scientists to solve problems with high grid Peclet numbers, such as transport problems with sharp solute fronts, without spurious oscillations in the numerical approximation to the solution and with virtually no artificial diffusion.

On the theory of oscillating airfoils of finite span in subsonic compressible flow

NASA Technical Reports Server (NTRS)

Reissner, Eric

1950-01-01

The problem of oscillating lifting surface of finite span in subsonic compressible flow is reduced to an integral equation. The kernel of the integral equation is approximated by a simpler expression, on the basis of the assumption of sufficiently large aspect ratio. With this approximation the double integral occurring in the formulation of the problem is reduced to two single integrals, one of which is taken over the chord and the other over the span of the lifting surface. On the basis of this reduction the three-dimensional problem appears separated into two two-dimensional problems, one of them being effectively the problem of two-dimensional flow and the other being the problem of spanwise circulation distribution. Earlier results concerning the oscillating lifting surface of finite span in incompressible flow are contained in the present more general results.

An efficient nonlinear finite-difference approach in the computational modeling of the dynamics of a nonlinear diffusion-reaction equation in microbial ecology.

PubMed

Macías-Díaz, J E; Macías, Siegfried; Medina-Ramírez, I E

2013-12-01

In this manuscript, we present a computational model to approximate the solutions of a partial differential equation which describes the growth dynamics of microbial films. The numerical technique reported in this work is an explicit, nonlinear finite-difference methodology which is computationally implemented using Newton's method. Our scheme is compared numerically against an implicit, linear finite-difference discretization of the same partial differential equation, whose computer coding requires an implementation of the stabilized bi-conjugate gradient method. Our numerical results evince that the nonlinear approach results in a more efficient approximation to the solutions of the biofilm model considered, and demands less computer memory. Moreover, the positivity of initial profiles is preserved in the practice by the nonlinear scheme proposed. Copyright © 2013 Elsevier Ltd. All rights reserved.

The unstaggered extension to GFDL's FV3 dynamical core on the cubed-sphere

NASA Astrophysics Data System (ADS)

Chen, X.; Lin, S. J.; Harris, L.

2017-12-01

Finite-volume schemes have become popular for atmospheric transport since they provide intrinsic mass conservation to constituent species. Many CFD codes use unstaggered discretizations for finite volume methods with an approximate Riemann solver. However, this approach is inefficient for geophysical flows due to the complexity of the Riemann solver. We introduce a Low Mach number Approximate Riemann Solver (LMARS) simplified using assumptions appropriate for atmospheric flows: the wind speed is much slower than the sound speed, weak discontinuities, and locally uniform sound wave velocity. LMARS makes possible a Riemann-solver-based dynamical core comparable in computational efficiency to many current dynamical cores. We will present a 3D finite-volume dynamical core using LMARS in a cubed-sphere geometry with a vertically Lagrangian discretization. Results from standard idealized test cases will be discussed.

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.

Finite element analysis to investigate variability of MR elastography in the human thigh.

PubMed

Hollis, L; Barnhill, E; Perrins, M; Kennedy, P; Conlisk, N; Brown, C; Hoskins, P R; Pankaj, P; Roberts, N

2017-11-01

To develop finite element analysis (FEA) of magnetic resonance elastography (MRE) in the human thigh and investigate inter-individual variability of measurement of muscle mechanical properties. Segmentation was performed on MRI datasets of the human thigh from 5 individuals and FEA models consisting of 12 muscles and surrounding tissue created. The same material properties were applied to each tissue type and a previously developed transient FEA method of simulating MRE using Abaqus was performed at 4 frequencies. Synthetic noise was applied to the simulated data at various levels before inversion was performed using the Elastography Software Pipeline. Maps of material properties were created and visually assessed to determine key features. The coefficient of variation (CoV) was used to assess the variability of measurements in each individual muscle and in the groups of muscles across the subjects. Mean measurements for the set of muscles were ranked in size order and compared with the expected ranking. At noise levels of 2% the CoV in measurements of |G * | ranged from 5.3 to 21.9% and from 7.1 to 36.1% for measurements of ϕ in the individual muscles. A positive correlation (R 2 value 0.80) was attained when the expected and measured |G * | ranking were compared, whilst a negative correlation (R 2 value 0.43) was found for ϕ. Created elastograms demonstrated good definition of muscle structure and were robust to noise. Variability of measurements across the 5 subjects was dramatically lower for |G * | than it was for ϕ. This large variability in ϕ measurements was attributed to artefacts. Copyright © 2017 Elsevier Inc. All rights reserved.

An Alternating Least Squares Method for the Weighted Approximation of a Symmetric Matrix.

ERIC Educational Resources Information Center

ten Berge, Jos M. F.; Kiers, Henk A. L.

1993-01-01

R. A. Bailey and J. C. Gower explored approximating a symmetric matrix "B" by another, "C," in the least squares sense when the squared discrepancies for diagonal elements receive specific nonunit weights. A solution is proposed where "C" is constrained to be positive semidefinite and of a fixed rank. (SLD)

Cognitive-graphic method for constructing of hierarchical forms of basic functions of biquadratic finite element

NASA Astrophysics Data System (ADS)

Astionenko, I. O.; Litvinenko, O. I.; Osipova, N. V.; Tuluchenko, G. Ya.; Khomchenko, A. N.

2016-10-01

Recently the interpolation bases of the hierarchical type have been used for the problem solving of the approximation of multiple arguments functions (such as in the finite-element method). In this work the cognitive graphical method of constructing of the hierarchical form bases on the serendipity finite elements is suggested, which allowed to get the alternative bases on a biquadratic finite element from the serendipity family without internal knots' inclusion. The cognitive-graphic method allowed to improve the known interpolation procedure of Taylor and to get the modified elements with irregular arrangement of knots. The proposed procedures are universal and are spread in the area of finite-elements.

Resolvent-based modeling of passive scalar dynamics in wall-bounded turbulence

NASA Astrophysics Data System (ADS)

Dawson, Scott; Saxton-Fox, Theresa; McKeon, Beverley

2017-11-01

The resolvent formulation of the Navier-Stokes equations expresses the system state as the output of a linear (resolvent) operator acting upon a nonlinear forcing. Previous studies have demonstrated that a low-rank approximation of this linear operator predicts many known features of incompressible wall-bounded turbulence. In this work, this resolvent model for wall-bounded turbulence is extended to include a passive scalar field. This formulation allows for a number of additional simplifications that reduce model complexity. Firstly, it is shown that the effect of changing scalar diffusivity can be approximated through a transformation of spatial wavenumbers and temporal frequencies. Secondly, passive scalar dynamics may be studied through the low-rank approximation of a passive scalar resolvent operator, which is decoupled from velocity response modes. Thirdly, this passive scalar resolvent operator is amenable to approximation by semi-analytic methods. We investigate the extent to which this resulting hierarchy of models can describe and predict passive scalar dynamics and statistics in wall-bounded turbulence. The support of AFOSR under Grant Numbers FA9550-16-1-0232 and FA9550-16-1-0361 is gratefully acknowledged.

Reduced rank regression via adaptive nuclear norm penalization

PubMed Central

Chen, Kun; Dong, Hongbo; Chan, Kung-Sik

2014-01-01

Summary We propose an adaptive nuclear norm penalization approach for low-rank matrix approximation, and use it to develop a new reduced rank estimation method for high-dimensional multivariate regression. The adaptive nuclear norm is defined as the weighted sum of the singular values of the matrix, and it is generally non-convex under the natural restriction that the weight decreases with the singular value. However, we show that the proposed non-convex penalized regression method has a global optimal solution obtained from an adaptively soft-thresholded singular value decomposition. The method is computationally efficient, and the resulting solution path is continuous. The rank consistency of and prediction/estimation performance bounds for the estimator are established for a high-dimensional asymptotic regime. Simulation studies and an application in genetics demonstrate its efficacy. PMID:25045172

Non-Linear Finite Element Modeling of THUNDER Piezoelectric Actuators

NASA Technical Reports Server (NTRS)

Taleghani, Barmac K.; Campbell, Joel F.

1999-01-01

A NASTRAN non-linear finite element model has been developed for predicting the dome heights of THUNDER (THin Layer UNimorph Ferroelectric DrivER) piezoelectric actuators. To analytically validate the finite element model, a comparison was made with a non-linear plate solution using Von Karmen's approximation. A 500 volt input was used to examine the actuator deformation. The NASTRAN finite element model was also compared with experimental results. Four groups of specimens were fabricated and tested. Four different input voltages, which included 120, 160, 200, and 240 Vp-p with a 0 volts offset, were used for this comparison.

Finite-surface method for the Maxwell equations with corner singularities

NASA Technical Reports Server (NTRS)

Vinokur, Marcel; Yarrow, Maurice

1994-01-01

The finite-surface method for the two-dimensional Maxwell equations in generalized coordinates is extended to treat perfect conductor boundaries with sharp corners. Known singular forms of the grid and the electromagnetic fields in the neighborhood of each corner are used to obtain accurate approximations to the surface and line integrals appearing in the method. Numerical results are presented for a harmonic plane wave incident on a finite flat plate. Comparisons with exact solutions show good agreement.

Combined Uncertainty and A-Posteriori Error Bound Estimates for CFD Calculations: Theory and Implementation

NASA Technical Reports Server (NTRS)

Barth, Timothy J.

2014-01-01

Simulation codes often utilize finite-dimensional approximation resulting in numerical error. Some examples include, numerical methods utilizing grids and finite-dimensional basis functions, particle methods using a finite number of particles. These same simulation codes also often contain sources of uncertainty, for example, uncertain parameters and fields associated with the imposition of initial and boundary data,uncertain physical model parameters such as chemical reaction rates, mixture model parameters, material property parameters, etc.

Mathematical aspects of finite element methods for incompressible viscous flows

NASA Technical Reports Server (NTRS)

Gunzburger, M. D.

1986-01-01

Mathematical aspects of finite element methods are surveyed for incompressible viscous flows, concentrating on the steady primitive variable formulation. The discretization of a weak formulation of the Navier-Stokes equations are addressed, then the stability condition is considered, the satisfaction of which insures the stability of the approximation. Specific choices of finite element spaces for the velocity and pressure are then discussed. Finally, the connection between different weak formulations and a variety of boundary conditions is explored.

Experimental Investigation of Hydrodynamic Self-Acting Gas Bearings at High Knudsen Numbers.

DTIC Science & Technology

1980-07-01

Reynolds equation. Two finite - difference algorithms were used to solve the equation. Numerical results - the predicted load and pitch angle - from the two...that should be used. The majority of the numerical solution are still based on the finite difference approximation of the governing equation. But in... finite difference method. Reddi and Chu [26) also noted that it is very difficult to compare the two techniques on the same level since the solution

Numerical Methods for Analysis of Charged Vacancy Diffusion in Dielectric Solids

DTIC Science & Technology

2006-12-01

theory for charged vacancy diffusion in elastic dielectric materials is formulated and implemented numerically in a finite difference code. The...one of the co-authors on neutral vacancy kinetics (Grinfeld and Hazzledine, 1997). The theory is implemented numerically in a finite difference code...accuracy of order ( )2x∆ , using a finite difference approximation (Hoffman, 1992) for the second spatial derivative of φ : ( )21 1 0ˆ2 /i i i i Rxφ

Navier-Stokes Solutions for Spin-Up from Rest in a Cylindrical Container

DTIC Science & Technology

1979-09-01

CONDITIONS The calculations employ a finite - difference analog of the unsteady axisyimetric Navier-Stokes equations formulated in cylindrical coordinates...derivatives are approximated by second- order accurate one-sided difference formulae involving three time levels. * The following finite - difference ...equation are identical in form to Equations (13). The finite - difference representations for the ?-equation are: "(i)[aJ~lk " /i’,J-l2k] T (14a) •g I

Group foliation of finite difference equations

NASA Astrophysics Data System (ADS)

Thompson, Robert; Valiquette, Francis

2018-06-01

Using the theory of equivariant moving frames, a group foliation method for invariant finite difference equations is developed. This method is analogous to the group foliation of differential equations and uses the symmetry group of the equation to decompose the solution process into two steps, called resolving and reconstruction. Our constructions are performed algorithmically and symbolically by making use of discrete recurrence relations among joint invariants. Applications to invariant finite difference equations that approximate differential equations are given.

A scalable kernel-based semisupervised metric learning algorithm with out-of-sample generalization ability.

PubMed

Yeung, Dit-Yan; Chang, Hong; Dai, Guang

2008-11-01

In recent years, metric learning in the semisupervised setting has aroused a lot of research interest. One type of semisupervised metric learning utilizes supervisory information in the form of pairwise similarity or dissimilarity constraints. However, most methods proposed so far are either limited to linear metric learning or unable to scale well with the data set size. In this letter, we propose a nonlinear metric learning method based on the kernel approach. By applying low-rank approximation to the kernel matrix, our method can handle significantly larger data sets. Moreover, our low-rank approximation scheme can naturally lead to out-of-sample generalization. Experiments performed on both artificial and real-world data show very promising results.

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

Chen, Chao; Pouransari, Hadi; Rajamanickam, Sivasankaran

We present a parallel hierarchical solver for general sparse linear systems on distributed-memory machines. For large-scale problems, this fully algebraic algorithm is faster and more memory-efficient than sparse direct solvers because it exploits the low-rank structure of fill-in blocks. Depending on the accuracy of low-rank approximations, the hierarchical solver can be used either as a direct solver or as a preconditioner. The parallel algorithm is based on data decomposition and requires only local communication for updating boundary data on every processor. Moreover, the computation-to-communication ratio of the parallel algorithm is approximately the volume-to-surface-area ratio of the subdomain owned by everymore » processor. We also provide various numerical results to demonstrate the versatility and scalability of the parallel algorithm.« less

Improving the In-Medium Similarity Renormalization Group via approximate inclusion of three-body effects

NASA Astrophysics Data System (ADS)

Morris, Titus; Bogner, Scott

2015-10-01

The In-Medium Similarity Renormalization Group (IM-SRG) has been applied successfully not only to several closed shell finite nuclei, but has recently been used to produce effective shell model interactions that are competitive with phenomenological interactions in the SD shell. A recent alternative method for solving of the IM-SRG equations, called the Magnus expansion, not only provides a computationally feasible route to producing observables, but also allows for approximate handling of induced three-body forces. Promising results for several systems, including finite nuclei, will be presented and discussed.

A Poisson equation formulation for pressure calculations in penalty finite element models for viscous incompressible flows

NASA Technical Reports Server (NTRS)

Sohn, J. L.; Heinrich, J. C.

1990-01-01

The calculation of pressures when the penalty-function approximation is used in finite-element solutions of laminar incompressible flows is addressed. A Poisson equation for the pressure is formulated that involves third derivatives of the velocity field. The second derivatives appearing in the weak formulation of the Poisson equation are calculated from the C0 velocity approximation using a least-squares method. The present scheme is shown to be efficient, free of spurious oscillations, and accurate. Examples of applications are given and compared with results obtained using mixed formulations.

Time-stable boundary conditions for finite-difference schemes solving hyperbolic systems: Methodology and application to high-order compact schemes

NASA Technical Reports Server (NTRS)

Carpenter, Mark H.; Gottlieb, David; Abarbanel, Saul

1993-01-01

We present a systematic method for constructing boundary conditions (numerical and physical) of the required accuracy, for compact (Pade-like) high-order finite-difference schemes for hyperbolic systems. First, a roper summation-by-parts formula is found for the approximate derivative. A 'simultaneous approximation term' (SAT) is then introduced to treat the boundary conditions. This procedure leads to time-stable schemes even in the system case. An explicit construction of the fourth-order compact case is given. Numerical studies are presented to verify the efficacy of the approach.

Quantum mean-field approximation for lattice quantum models: Truncating quantum correlations and retaining classical ones

NASA Astrophysics Data System (ADS)

Malpetti, Daniele; Roscilde, Tommaso

2017-02-01

The mean-field approximation is at the heart of our understanding of complex systems, despite its fundamental limitation of completely neglecting correlations between the elementary constituents. In a recent work [Phys. Rev. Lett. 117, 130401 (2016), 10.1103/PhysRevLett.117.130401], we have shown that in quantum many-body systems at finite temperature, two-point correlations can be formally separated into a thermal part and a quantum part and that quantum correlations are generically found to decay exponentially at finite temperature, with a characteristic, temperature-dependent quantum coherence length. The existence of these two different forms of correlation in quantum many-body systems suggests the possibility of formulating an approximation, which affects quantum correlations only, without preventing the correct description of classical fluctuations at all length scales. Focusing on lattice boson and quantum Ising models, we make use of the path-integral formulation of quantum statistical mechanics to introduce such an approximation, which we dub quantum mean-field (QMF) approach, and which can be readily generalized to a cluster form (cluster QMF or cQMF). The cQMF approximation reduces to cluster mean-field theory at T =0 , while at any finite temperature it produces a family of systematically improved, semi-classical approximations to the quantum statistical mechanics of the lattice theory at hand. Contrary to standard MF approximations, the correct nature of thermal critical phenomena is captured by any cluster size. In the two exemplary cases of the two-dimensional quantum Ising model and of two-dimensional quantum rotors, we study systematically the convergence of the cQMF approximation towards the exact result, and show that the convergence is typically linear or sublinear in the boundary-to-bulk ratio of the clusters as T →0 , while it becomes faster than linear as T grows. These results pave the way towards the development of semiclassical numerical approaches based on an approximate, yet systematically improved account of quantum correlations.

Self-energy matrices for electron transport calculations within the real-space finite-difference formalism

NASA Astrophysics Data System (ADS)

Tsukamoto, Shigeru; Ono, Tomoya; Hirose, Kikuji; Blügel, Stefan

2017-03-01

The self-energy term used in transport calculations, which describes the coupling between electrode and transition regions, is able to be evaluated only from a limited number of the propagating and evanescent waves of a bulk electrode. This obviously contributes toward the reduction of the computational expenses in transport calculations. In this paper, we present a mathematical formula for reducing the computational expenses further without using any approximation and without losing accuracy. So far, the self-energy term has been handled as a matrix with the same dimension as the Hamiltonian submatrix representing the interaction between an electrode and a transition region. In this work, through the singular-value decomposition of the submatrix, the self-energy matrix is handled as a smaller matrix, whose dimension is the rank number of the Hamiltonian submatrix. This procedure is practical in the case of using the pseudopotentials in a separable form, and the computational expenses for determining the self-energy matrix are reduced by 90% when employing a code based on the real-space finite-difference formalism and projector-augmented wave method. In addition, this technique is applicable to the transport calculations using atomic or localized basis sets. Adopting the self-energy matrices obtained from this procedure, we present the calculation of the electron transport properties of C20 molecular junctions. The application demonstrates that the electron transmissions are sensitive to the orientation of the molecule with respect to the electrode surface. In addition, channel decomposition of the scattering wave functions reveals that some unoccupied C20 molecular orbitals mainly contribute to the electron conduction through the molecular junction.

Extinction efficiencies from DDA calculations solved for finite circular cylinders and disks

NASA Technical Reports Server (NTRS)

Withrow, J. R.; Cox, S. K.

1993-01-01

One of the most commonly noted uncertainties with respect to the modeling of cirrus clouds and their effect upon the planetary radiation balance is the disputed validity of the use of Mie scattering results as an approximation to the scattering results of the hexagonal plates and columns found in cirrus clouds. This approximation has historically been a kind of default, a result of the lack of an appropriate analytical solution of Maxwell's equations to particles other than infinite cylinders and spheroids. Recently, however, the use of such approximate techniques as the Discrete Dipole Approximation has made scattering solutions on such particles a computationally intensive but feasible possibility. In this study, the Discrete Dipole Approximation (DDA) developed by Flatau (1992) is used to find such solutions for homogeneous, circular cylinders and disks. This can serve to not only assess the validity of the current radiative transfer schemes which are available for the study of cirrus but also to extend the current approximation of equivalent spheres to an approximation of second order, homogeneous finite circular cylinders and disks. The results will be presented in the form of a single variable, the extinction efficiency.

Fast dimension reduction and integrative clustering of multi-omics data using low-rank approximation: application to cancer molecular classification.

PubMed

Wu, Dingming; Wang, Dongfang; Zhang, Michael Q; Gu, Jin

2015-12-01

One major goal of large-scale cancer omics study is to identify molecular subtypes for more accurate cancer diagnoses and treatments. To deal with high-dimensional cancer multi-omics data, a promising strategy is to find an effective low-dimensional subspace of the original data and then cluster cancer samples in the reduced subspace. However, due to data-type diversity and big data volume, few methods can integrative and efficiently find the principal low-dimensional manifold of the high-dimensional cancer multi-omics data. In this study, we proposed a novel low-rank approximation based integrative probabilistic model to fast find the shared principal subspace across multiple data types: the convexity of the low-rank regularized likelihood function of the probabilistic model ensures efficient and stable model fitting. Candidate molecular subtypes can be identified by unsupervised clustering hundreds of cancer samples in the reduced low-dimensional subspace. On testing datasets, our method LRAcluster (low-rank approximation based multi-omics data clustering) runs much faster with better clustering performances than the existing method. Then, we applied LRAcluster on large-scale cancer multi-omics data from TCGA. The pan-cancer analysis results show that the cancers of different tissue origins are generally grouped as independent clusters, except squamous-like carcinomas. While the single cancer type analysis suggests that the omics data have different subtyping abilities for different cancer types. LRAcluster is a very useful method for fast dimension reduction and unsupervised clustering of large-scale multi-omics data. LRAcluster is implemented in R and freely available via http://bioinfo.au.tsinghua.edu.cn/software/lracluster/ .

Unbiased split variable selection for random survival forests using maximally selected rank statistics.

PubMed

Wright, Marvin N; Dankowski, Theresa; Ziegler, Andreas

2017-04-15

The most popular approach for analyzing survival data is the Cox regression model. The Cox model may, however, be misspecified, and its proportionality assumption may not always be fulfilled. An alternative approach for survival prediction is random forests for survival outcomes. The standard split criterion for random survival forests is the log-rank test statistic, which favors splitting variables with many possible split points. Conditional inference forests avoid this split variable selection bias. However, linear rank statistics are utilized by default in conditional inference forests to select the optimal splitting variable, which cannot detect non-linear effects in the independent variables. An alternative is to use maximally selected rank statistics for the split point selection. As in conditional inference forests, splitting variables are compared on the p-value scale. However, instead of the conditional Monte-Carlo approach used in conditional inference forests, p-value approximations are employed. We describe several p-value approximations and the implementation of the proposed random forest approach. A simulation study demonstrates that unbiased split variable selection is possible. However, there is a trade-off between unbiased split variable selection and runtime. In benchmark studies of prediction performance on simulated and real datasets, the new method performs better than random survival forests if informative dichotomous variables are combined with uninformative variables with more categories and better than conditional inference forests if non-linear covariate effects are included. In a runtime comparison, the method proves to be computationally faster than both alternatives, if a simple p-value approximation is used. Copyright © 2017 John Wiley & Sons, Ltd. Copyright © 2017 John Wiley & Sons, Ltd.

Understanding quantum phenomena without solving the Schrödinger equation: the case of the finite square well

NASA Astrophysics Data System (ADS)

Barsan, Victor

2015-11-01

An approximate formula for the energy levels of the bound states of a particle in a finite square well are obtained, without using the Schrödinger equation. The physics and mathematics involved in this approach are accessible to a gifted high school student.

Deception Detection Process and Accuracy: An Examination of How U.S. Military Officers Detect Deception in the Workplace

DTIC Science & Technology

2014-12-01

honest interview was selected by matching on sex , race, and approximate physical appearance. Thus, there were two honest non-cheaters and two lying...sister, mom , dad), peer/friend, teacher/caregiver, senior in rank (but no command relationship), and other. Relationship coding resulted in a Kappa of...fill in the blank): Sex : Male Female Age: ________ Years of Military Service: _______ Rank:____________ Branch (circle one): Army

User's manual for the one-dimensional hypersonic experimental aero-thermodynamic (1DHEAT) data reduction code

NASA Technical Reports Server (NTRS)

Hollis, Brian R.

1995-01-01

A FORTRAN computer code for the reduction and analysis of experimental heat transfer data has been developed. This code can be utilized to determine heat transfer rates from surface temperature measurements made using either thin-film resistance gages or coaxial surface thermocouples. Both an analytical and a numerical finite-volume heat transfer model are implemented in this code. The analytical solution is based on a one-dimensional, semi-infinite wall thickness model with the approximation of constant substrate thermal properties, which is empirically corrected for the effects of variable thermal properties. The finite-volume solution is based on a one-dimensional, implicit discretization. The finite-volume model directly incorporates the effects of variable substrate thermal properties and does not require the semi-finite wall thickness approximation used in the analytical model. This model also includes the option of a multiple-layer substrate. Fast, accurate results can be obtained using either method. This code has been used to reduce several sets of aerodynamic heating data, of which samples are included in this report.

A new mutually reinforcing network node and link ranking algorithm

PubMed Central

Wang, Zhenghua; Dueñas-Osorio, Leonardo; Padgett, Jamie E.

2015-01-01

This study proposes a novel Normalized Wide network Ranking algorithm (NWRank) that has the advantage of ranking nodes and links of a network simultaneously. This algorithm combines the mutual reinforcement feature of Hypertext Induced Topic Selection (HITS) and the weight normalization feature of PageRank. Relative weights are assigned to links based on the degree of the adjacent neighbors and the Betweenness Centrality instead of assigning the same weight to every link as assumed in PageRank. Numerical experiment results show that NWRank performs consistently better than HITS, PageRank, eigenvector centrality, and edge betweenness from the perspective of network connectivity and approximate network flow, which is also supported by comparisons with the expensive N-1 benchmark removal criteria based on network efficiency. Furthermore, it can avoid some problems, such as the Tightly Knit Community effect, which exists in HITS. NWRank provides a new inexpensive way to rank nodes and links of a network, which has practical applications, particularly to prioritize resource allocation for upgrade of hierarchical and distributed networks, as well as to support decision making in the design of networks, where node and link importance depend on a balance of local and global integrity. PMID:26492958

Learning to rank using user clicks and visual features for image retrieval.

PubMed

Yu, Jun; Tao, Dacheng; Wang, Meng; Rui, Yong

2015-04-01

The inconsistency between textual features and visual contents can cause poor image search results. To solve this problem, click features, which are more reliable than textual information in justifying the relevance between a query and clicked images, are adopted in image ranking model. However, the existing ranking model cannot integrate visual features, which are efficient in refining the click-based search results. In this paper, we propose a novel ranking model based on the learning to rank framework. Visual features and click features are simultaneously utilized to obtain the ranking model. Specifically, the proposed approach is based on large margin structured output learning and the visual consistency is integrated with the click features through a hypergraph regularizer term. In accordance with the fast alternating linearization method, we design a novel algorithm to optimize the objective function. This algorithm alternately minimizes two different approximations of the original objective function by keeping one function unchanged and linearizing the other. We conduct experiments on a large-scale dataset collected from the Microsoft Bing image search engine, and the results demonstrate that the proposed learning to rank models based on visual features and user clicks outperforms state-of-the-art algorithms.

An approximation formula for a class of fault-tolerant computers

NASA Technical Reports Server (NTRS)

White, A. L.

1986-01-01

An approximation formula is derived for the probability of failure for fault-tolerant process-control computers. These computers use redundancy and reconfiguration to achieve high reliability. Finite-state Markov models capture the dynamic behavior of component failure and system recovery, and the approximation formula permits an estimation of system reliability by an easy examination of the model.

Estimation of Rank Correlation for Clustered Data

PubMed Central

Rosner, Bernard; Glynn, Robert

2017-01-01

It is well known that the sample correlation coefficient (Rxy) is the maximum likelihood estimator (MLE) of the Pearson correlation (ρxy) for i.i.d. bivariate normal data. However, this is not true for ophthalmologic data where X (e.g., visual acuity) and Y (e.g., visual field) are available for each eye and there is positive intraclass correlation for both X and Y in fellow eyes. In this paper, we provide a regression-based approach for obtaining the MLE of ρxy for clustered data, which can be implemented using standard mixed effects model software. This method is also extended to allow for estimation of partial correlation by controlling both X and Y for a vector U of other covariates. In addition, these methods can be extended to allow for estimation of rank correlation for clustered data by (a) converting ranks of both X and Y to the probit scale, (b) estimating the Pearson correlation between probit scores for X and Y, and (c) using the relationship between Pearson and rank correlation for bivariate normally distributed data. The validity of the methods in finite-sized samples is supported by simulation studies. Finally, two examples from ophthalmology and analgesic abuse are used to illustrate the methods. PMID:28399615

Nonperturbative finite-temperature Yang-Mills theory

NASA Astrophysics Data System (ADS)

Cyrol, Anton K.; Mitter, Mario; Pawlowski, Jan M.; Strodthoff, Nils

2018-03-01

We present nonperturbative correlation functions in Landau-gauge Yang-Mills theory at finite temperature. The results are obtained from the functional renormalisation group within a self-consistent approximation scheme. In particular, we compute the magnetic and electric components of the gluon propagator, and the three- and four-gluon vertices. We also show the ghost propagator and the ghost-gluon vertex at finite temperature. Our results for the propagators are confronted with lattice simulations and our Debye mass is compared to hard thermal loop perturbation theory.

Error analysis of finite element method for Poisson–Nernst–Planck equations

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

Sun, Yuzhou; Sun, Pengtao; Zheng, Bin

A priori error estimates of finite element method for time-dependent Poisson-Nernst-Planck equations are studied in this work. We obtain the optimal error estimates in L∞(H1) and L2(H1) norms, and suboptimal error estimates in L∞(L2) norm, with linear element, and optimal error estimates in L∞(L2) norm with quadratic or higher-order element, for both semi- and fully discrete finite element approximations. Numerical experiments are also given to validate the theoretical results.

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

Ghysels, Pieter; Li, Xiaoye S.; Rouet, Francois -Henry

Here, we present a sparse linear system solver that is based on a multifrontal variant of Gaussian elimination and exploits low-rank approximation of the resulting dense frontal matrices. We use hierarchically semiseparable (HSS) matrices, which have low-rank off-diagonal blocks, to approximate the frontal matrices. For HSS matrix construction, a randomized sampling algorithm is used together with interpolative decompositions. The combination of the randomized compression with a fast ULV HSS factoriz ation leads to a solver with lower computational complexity than the standard multifrontal method for many applications, resulting in speedups up to 7 fold for problems in our test suite.more » The implementation targets many-core systems by using task parallelism with dynamic runtime scheduling. Numerical experiments show performance improvements over state-of-the-art sparse direct solvers. The implementation achieves high performance and good scalability on a range of modern shared memory parallel systems, including the Intel Xeon Phi (MIC). The code is part of a software package called STRUMPACK - STRUctured Matrices PACKage, which also has a distributed memory component for dense rank-structured matrices.« less

An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling

DOE PAGES

Ghysels, Pieter; Li, Xiaoye S.; Rouet, Francois -Henry; ...

2016-10-27

Here, we present a sparse linear system solver that is based on a multifrontal variant of Gaussian elimination and exploits low-rank approximation of the resulting dense frontal matrices. We use hierarchically semiseparable (HSS) matrices, which have low-rank off-diagonal blocks, to approximate the frontal matrices. For HSS matrix construction, a randomized sampling algorithm is used together with interpolative decompositions. The combination of the randomized compression with a fast ULV HSS factoriz ation leads to a solver with lower computational complexity than the standard multifrontal method for many applications, resulting in speedups up to 7 fold for problems in our test suite.more » The implementation targets many-core systems by using task parallelism with dynamic runtime scheduling. Numerical experiments show performance improvements over state-of-the-art sparse direct solvers. The implementation achieves high performance and good scalability on a range of modern shared memory parallel systems, including the Intel Xeon Phi (MIC). The code is part of a software package called STRUMPACK - STRUctured Matrices PACKage, which also has a distributed memory component for dense rank-structured matrices.« less

Optimal Tikhonov Regularization in Finite-Frequency Tomography

NASA Astrophysics Data System (ADS)

Fang, Y.; Yao, Z.; Zhou, Y.

2017-12-01

The last decade has witnessed a progressive transition in seismic tomography from ray theory to finite-frequency theory which overcomes the resolution limit of the high-frequency approximation in ray theory. In addition to approximations in wave propagation physics, a main difference between ray-theoretical tomography and finite-frequency tomography is the sparseness of the associated sensitivity matrix. It is well known that seismic tomographic problems are ill-posed and regularizations such as damping and smoothing are often applied to analyze the tradeoff between data misfit and model uncertainty. The regularizations depend on the structure of the matrix as well as noise level of the data. Cross-validation has been used to constrain data uncertainties in body-wave finite-frequency inversions when measurements at multiple frequencies are available to invert for a common structure. In this study, we explore an optimal Tikhonov regularization in surface-wave phase-velocity tomography based on minimization of an empirical Bayes risk function using theoretical training datasets. We exploit the structure of the sensitivity matrix in the framework of singular value decomposition (SVD) which also allows for the calculation of complete resolution matrix. We compare the optimal Tikhonov regularization in finite-frequency tomography with traditional tradeo-off analysis using surface wave dispersion measurements from global as well as regional studies.

First-Order System Least-Squares for Second-Order Elliptic Problems with Discontinuous Coefficients

NASA Technical Reports Server (NTRS)

Manteuffel, Thomas A.; McCormick, Stephen F.; Starke, Gerhard

1996-01-01

The first-order system least-squares methodology represents an alternative to standard mixed finite element methods. Among its advantages is the fact that the finite element spaces approximating the pressure and flux variables are not restricted by the inf-sup condition and that the least-squares functional itself serves as an appropriate error measure. This paper studies the first-order system least-squares approach for scalar second-order elliptic boundary value problems with discontinuous coefficients. Ellipticity of an appropriately scaled least-squares bilinear form of the size of the jumps in the coefficients leading to adequate finite element approximation results. The occurrence of singularities at interface corners and cross-points is discussed. and a weighted least-squares functional is introduced to handle such cases. Numerical experiments are presented for two test problems to illustrate the performance of this approach.

The Laguerre finite difference one-way equation solver

NASA Astrophysics Data System (ADS)

Terekhov, Andrew V.

2017-05-01

This paper presents a new finite difference algorithm for solving the 2D one-way wave equation with a preliminary approximation of a pseudo-differential operator by a system of partial differential equations. As opposed to the existing approaches, the integral Laguerre transform instead of Fourier transform is used. After carrying out the approximation of spatial variables it is possible to obtain systems of linear algebraic equations with better computing properties and to reduce computer costs for their solution. High accuracy of calculations is attained at the expense of employing finite difference approximations of higher accuracy order that are based on the dispersion-relationship-preserving method and the Richardson extrapolation in the downward continuation direction. The numerical experiments have verified that as compared to the spectral difference method based on Fourier transform, the new algorithm allows one to calculate wave fields with a higher degree of accuracy and a lower level of numerical noise and artifacts including those for non-smooth velocity models. In the context of solving the geophysical problem the post-stack migration for velocity models of the types Syncline and Sigsbee2A has been carried out. It is shown that the images obtained contain lesser noise and are considerably better focused as compared to those obtained by the known Fourier Finite Difference and Phase-Shift Plus Interpolation methods. There is an opinion that purely finite difference approaches do not allow carrying out the seismic migration procedure with sufficient accuracy, however the results obtained disprove this statement. For the supercomputer implementation it is proposed to use the parallel dichotomy algorithm when solving systems of linear algebraic equations with block-tridiagonal matrices.

Compatible-strain mixed finite element methods for incompressible nonlinear elasticity

NASA Astrophysics Data System (ADS)

Faghih Shojaei, Mostafa; Yavari, Arash

2018-05-01

We introduce a new family of mixed finite elements for incompressible nonlinear elasticity - compatible-strain mixed finite element methods (CSFEMs). Based on a Hu-Washizu-type functional, we write a four-field mixed formulation with the displacement, the displacement gradient, the first Piola-Kirchhoff stress, and a pressure-like field as the four independent unknowns. Using the Hilbert complexes of nonlinear elasticity, which describe the kinematics and the kinetics of motion, we identify the solution spaces of the independent unknown fields. In particular, we define the displacement in H1, the displacement gradient in H (curl), the stress in H (div), and the pressure field in L2. The test spaces of the mixed formulations are chosen to be the same as the corresponding solution spaces. Next, in a conforming setting, we approximate the solution and the test spaces with some piecewise polynomial subspaces of them. Among these approximation spaces are the tensorial analogues of the Nédélec and Raviart-Thomas finite element spaces of vector fields. This approach results in compatible-strain mixed finite element methods that satisfy both the Hadamard compatibility condition and the continuity of traction at the discrete level independently of the refinement level of the mesh. By considering several numerical examples, we demonstrate that CSFEMs have a good performance for bending problems and for bodies with complex geometries. CSFEMs are capable of capturing very large strains and accurately approximating stress and pressure fields. Using CSFEMs, we do not observe any numerical artifacts, e.g., checkerboarding of pressure, hourglass instability, or locking in our numerical examples. Moreover, CSFEMs provide an efficient framework for modeling heterogeneous solids.

Explorations in fuzzy physics and non-commutative geometry

NASA Astrophysics Data System (ADS)

Kurkcuoglu, Seckin

Fuzzy spaces arise as discrete approximations to continuum manifolds. They are usually obtained through quantizing coadjoint orbits of compact Lie groups and they can be described in terms of finite-dimensional matrix algebras, which for large matrix sizes approximate the algebra of functions of the limiting continuum manifold. Their ability to exactly preserve the symmetries of their parent manifolds is especially appealing for physical applications. Quantum Field Theories are built over them as finite-dimensional matrix models preserving almost all the symmetries of their respective continuum models. In this dissertation, we first focus our attention to the study of fuzzy supersymmetric spaces. In this regard, we obtain the fuzzy supersphere S2,2F through quantizing the supersphere, and demonstrate that it has exact supersymmetry. We derive a finite series formula for the *-product of functions over S2,2F and analyze the differential geometric information encoded in this formula. Subsequently, we show that quantum field theories on S2,2F are realized as finite-dimensional supermatrix models, and in particular we obtain the non-linear sigma model over the fuzzy supersphere by constructing the fuzzy supersymmetric extensions of a certain class of projectors. We show that this model too, is realized as a finite-dimensional supermatrix model with exact supersymmetry. Next, we show that fuzzy spaces have a generalized Hopf algebra structure. By focusing on the fuzzy sphere, we establish that there is a *-homomorphism from the group algebra SU(2)* of SU(2) to the fuzzy sphere. Using this and the canonical Hopf algebra structure of SU(2)* we show that both the fuzzy sphere and their direct sum are Hopf algebras. Using these results, we discuss processes in which a fuzzy sphere with angular momenta J splits into fuzzy spheres with angular momenta K and L. Finally, we study the formulation of Chern-Simons (CS) theory on an infinite strip of the non-commutative plane. We develop a finite-dimensional matrix model, whose large size limit approximates the CS theory on the infinite strip, and show that there are edge observables in this model obeying a finite-dimensional Lie algebra, that resembles the Kac-Moody algebra.

Real-time deblurring of handshake blurred images on smartphones

NASA Astrophysics Data System (ADS)

Pourreza-Shahri, Reza; Chang, Chih-Hsiang; Kehtarnavaz, Nasser

2015-02-01

This paper discusses an Android app for the purpose of removing blur that is introduced as a result of handshakes when taking images via a smartphone. This algorithm utilizes two images to achieve deblurring in a computationally efficient manner without suffering from artifacts associated with deconvolution deblurring algorithms. The first image is the normal or auto-exposure image and the second image is a short-exposure image that is automatically captured immediately before or after the auto-exposure image is taken. A low rank approximation image is obtained by applying singular value decomposition to the auto-exposure image which may appear blurred due to handshakes. This approximation image does not suffer from blurring while incorporating the image brightness and contrast information. The eigenvalues extracted from the low rank approximation image are then combined with those from the shortexposure image. It is shown that this deblurring app is computationally more efficient than the adaptive tonal correction algorithm which was previously developed for the same purpose.

Rényi and Tsallis formulations of separability conditions in finite dimensions

NASA Astrophysics Data System (ADS)

Rastegin, Alexey E.

2017-12-01

Separability conditions for a bipartite quantum system of finite-dimensional subsystems are formulated in terms of Rényi and Tsallis entropies. Entropic uncertainty relations often lead to entanglement criteria. We propose new approach based on the convolution of discrete probability distributions. Measurements on a total system are constructed of local ones according to the convolution scheme. Separability conditions are derived on the base of uncertainty relations of the Maassen-Uffink type as well as majorization relations. On each of subsystems, we use a pair of sets of subnormalized vectors that form rank-one POVMs. We also obtain entropic separability conditions for local measurements with a special structure, such as mutually unbiased bases and symmetric informationally complete measurements. The relevance of the derived separability conditions is demonstrated with several examples.

Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train.

PubMed

Bengua, Johann A; Phien, Ho N; Tuan, Hoang Duong; Do, Minh N

2017-05-01

This paper proposes a novel approach to tensor completion, which recovers missing entries of data represented by tensors. The approach is based on the tensor train (TT) rank, which is able to capture hidden information from tensors thanks to its definition from a well-balanced matricization scheme. Accordingly, new optimization formulations for tensor completion are proposed as well as two new algorithms for their solution. The first one called simple low-rank tensor completion via TT (SiLRTC-TT) is intimately related to minimizing a nuclear norm based on TT rank. The second one is from a multilinear matrix factorization model to approximate the TT rank of a tensor, and is called tensor completion by parallel matrix factorization via TT (TMac-TT). A tensor augmentation scheme of transforming a low-order tensor to higher orders is also proposed to enhance the effectiveness of SiLRTC-TT and TMac-TT. Simulation results for color image and video recovery show the clear advantage of our method over all other methods.

Wavelet and Multiresolution Analysis for Finite Element Networking Paradigms

NASA Technical Reports Server (NTRS)

Kurdila, Andrew J.; Sharpley, Robert C.

1999-01-01

This paper presents a final report on Wavelet and Multiresolution Analysis for Finite Element Networking Paradigms. The focus of this research is to derive and implement: 1) Wavelet based methodologies for the compression, transmission, decoding, and visualization of three dimensional finite element geometry and simulation data in a network environment; 2) methodologies for interactive algorithm monitoring and tracking in computational mechanics; and 3) Methodologies for interactive algorithm steering for the acceleration of large scale finite element simulations. Also included in this report are appendices describing the derivation of wavelet based Particle Image Velocity algorithms and reduced order input-output models for nonlinear systems by utilizing wavelet approximations.

Stable Artificial Dissipation Operators for Finite Volume Schemes on Unstructured Grids

NASA Technical Reports Server (NTRS)

Svard, Magnus; Gong, Jing; Nordstrom, Jan

2006-01-01

Our objective is to derive stable first-, second- and fourth-order artificial dissipation operators for node based finite volume schemes. Of particular interest are general unstructured grids where the strength of the finite volume method is fully utilized. A commonly used finite volume approximation of the Laplacian will be the basis in the construction of the artificial dissipation. Both a homogeneous dissipation acting in all directions with equal strength and a modification that allows different amount of dissipation in different directions are derived. Stability and accuracy of the new operators are proved and the theoretical results are supported by numerical computations.

Shear-flexible finite-element models of laminated composite plates and shells

NASA Technical Reports Server (NTRS)

Noor, A. K.; Mathers, M. D.

1975-01-01

Several finite-element models are applied to the linear static, stability, and vibration analysis of laminated composite plates and shells. The study is based on linear shallow-shell theory, with the effects of shear deformation, anisotropic material behavior, and bending-extensional coupling included. Both stiffness (displacement) and mixed finite-element models are considered. Discussion is focused on the effects of shear deformation and anisotropic material behavior on the accuracy and convergence of different finite-element models. Numerical studies are presented which show the effects of increasing the order of the approximating polynomials, adding internal degrees of freedom, and using derivatives of generalized displacements as nodal parameters.

Low-lying intruder and tensor-driven structures in 82As revealed by β decay at a new movable-tape-based experimental setup

NASA Astrophysics Data System (ADS)

Etilé, A.; Verney, D.; Arsenyev, N. N.; Bettane, J.; Borzov, I. N.; Cheikh Mhamed, M.; Cuong, P. V.; Delafosse, C.; Didierjean, F.; Gaulard, C.; Van Giai, Nguyen; Goasduff, A.; Ibrahim, F.; Kolos, K.; Lau, C.; Niikura, M.; Roccia, S.; Severyukhin, A. P.; Testov, D.; Tusseau-Nenez, S.; Voronov, V. V.

2015-06-01

The β decay of 82Ge Ge was re-investigated using the newly commissioned tape station BEDO at the electron-driven ISOL (isotope separation on line) facility ALTO operated by the Institut de Physique Nucléaire, Orsay. The original motivation of this work was focused on the sudden occurrence in the light N =49 odd-odd isotonic chain of a large number of J ≤1 states (positive or negative parity) in 80Ga by providing a reliable intermediate example, viz., 82As. The extension of the 82As level scheme towards higher energies from the present work has revealed three potential 1+ states above the already known one at 1092 keV. In addition our data allow ruling out the hypothesis that the 843 keV level could be a 1+ state. A detailed analysis of the level scheme using both an empirical core-particle coupling model and a fully microscopic treatment within a Skyrme-QRPA (quasiparticle random-phase approximation) approach using the finite-rank separable approximation was performed. From this analysis two conclusions can be drawn: (i) the presence of a large number of low-lying low-spin negative parity states is due to intruder states stemming from above the N =50 shell closure, and (ii) the sudden increase, from 82As to 80Ga, of the number of low-lying 1+ states and the corresponding Gamow-Teller fragmentation are naturally reproduced by the inclusion of tensor correlations and couplings to 2p-2h excitations.

Algorithm 971: An Implementation of a Randomized Algorithm for Principal Component Analysis

PubMed Central

LI, HUAMIN; LINDERMAN, GEORGE C.; SZLAM, ARTHUR; STANTON, KELLY P.; KLUGER, YUVAL; TYGERT, MARK

2017-01-01

Recent years have witnessed intense development of randomized methods for low-rank approximation. These methods target principal component analysis and the calculation of truncated singular value decompositions. The present article presents an essentially black-box, foolproof implementation for Mathworks’ MATLAB, a popular software platform for numerical computation. As illustrated via several tests, the randomized algorithms for low-rank approximation outperform or at least match the classical deterministic techniques (such as Lanczos iterations run to convergence) in basically all respects: accuracy, computational efficiency (both speed and memory usage), ease-of-use, parallelizability, and reliability. However, the classical procedures remain the methods of choice for estimating spectral norms and are far superior for calculating the least singular values and corresponding singular vectors (or singular subspaces). PMID:28983138

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

Shao, MeiYue; Lin, Lin; Yang, Chao

The single particle energies obtained in a Kohn-Sham density functional theory (DFT) calculation are generally known to be poor approximations to electron excitation energies that are measured in tr ansport, tunneling and spectroscopic experiments such as photo-emission spectroscopy. The correction to these energies can be obtained from the poles of a single particle Green’s function derived from a many-body perturbation theory. From a computational perspective, the accuracy and efficiency of such an approach depends on how a self energy term that properly accounts for dynamic screening of electrons is approximated. The G 0W 0 approximation is a widely used techniquemore » in which the self energy is expressed as the convolution of a noninteracting Green’s function (G 0) and a screened Coulomb interaction (W 0) in the frequency domain. The computational cost associated with such a convolution is high due to the high complexity of evaluating W 0 at multiple frequencies. In this paper, we discuss how the cost of G 0W 0 calculation can be reduced by constructing a low rank approximation to the frequency dependent part of W 0 . In particular, we examine the effect of such a low rank approximation on the accuracy of the G 0W 0 approximation. We also discuss how the numerical convolution of G 0 and W 0 can be evaluated efficiently and accurately by using a contour deformation technique with an appropriate choice of the contour.« less

Precision of Sensitivity in the Design Optimization of Indeterminate Structures

NASA Technical Reports Server (NTRS)

Patnaik, Surya N.; Pai, Shantaram S.; Hopkins, Dale A.

2006-01-01

Design sensitivity is central to most optimization methods. The analytical sensitivity expression for an indeterminate structural design optimization problem can be factored into a simple determinate term and a complicated indeterminate component. Sensitivity can be approximated by retaining only the determinate term and setting the indeterminate factor to zero. The optimum solution is reached with the approximate sensitivity. The central processing unit (CPU) time to solution is substantially reduced. The benefit that accrues from using the approximate sensitivity is quantified by solving a set of problems in a controlled environment. Each problem is solved twice: first using the closed-form sensitivity expression, then using the approximation. The problem solutions use the CometBoards testbed as the optimization tool with the integrated force method as the analyzer. The modification that may be required, to use the stiffener method as the analysis tool in optimization, is discussed. The design optimization problem of an indeterminate structure contains many dependent constraints because of the implicit relationship between stresses, as well as the relationship between the stresses and displacements. The design optimization process can become problematic because the implicit relationship reduces the rank of the sensitivity matrix. The proposed approximation restores the full rank and enhances the robustness of the design optimization method.

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.

Finite stretching of a circular plate of neo-Hookean material.

NASA Technical Reports Server (NTRS)

Biricikoglu, V.

1971-01-01

The analytical solution presented is based on the assumption that the deformed thickness of the plate is approximately constant. The nonlinear equations governing finite axisymmetric deformations of a circular plate made of neo-Hookean material are used in the analysis. The variation of circumferential extension ratio and the variation of deformed thickness are shown in graphs.

An electric-analog simulation of elliptic partial differential equations using finite element theory

USGS Publications Warehouse

Franke, O.L.; Pinder, G.F.; Patten, E.P.

1982-01-01

Elliptic partial differential equations can be solved using the Galerkin-finite element method to generate the approximating algebraic equations, and an electrical network to solve the resulting matrices. Some element configurations require the use of networks containing negative resistances which, while physically realizable, are more expensive and time-consuming to construct. ?? 1982.

Method for calculating the aerodynamic loading on an oscillating finite wing in subsonic and sonic flow

NASA Technical Reports Server (NTRS)

Runyan, Harry L; Woolston, Donald S

1957-01-01

A method is presented for calculating the loading on a finite wing oscillating in subsonic or sonic flow. The method is applicable to any plan form and may be used for determining the loading on deformed wings. The procedure is approximate and requires numerical integration over the wing surface.

Improving the In-Medium Similarity Renormalization Group via approximate inclusion of three-body effects

NASA Astrophysics Data System (ADS)

Morris, Titus; Bogner, Scott

2016-09-01

The In-Medium Similarity Renormalization Group (IM-SRG) has been applied successfully to the ground state of closed shell finite nuclei. Recent work has extended its ability to target excited states of these closed shell systems via equation of motion methods, and also complete spectra of the whole SD shell via effective shell model interactions. A recent alternative method for solving of the IM-SRG equations, based on the Magnus expansion, not only provides a computationally feasible route to producing observables, but also allows for approximate handling of induced three-body forces. Promising results for several systems, including finite nuclei, will be presented and discussed.

VENTURE: a code block for solving multigroup neutronics problems applying the finite-difference diffusion-theory approximation to neutron transport

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

Vondy, D.R.; Fowler, T.B.; Cunningham, G.W.

1975-10-01

The computer code block VENTURE, designed to solve multigroup neutronics problems with application of the finite-difference diffusion-theory approximation to neutron transport (or alternatively simple P$sub 1$) in up to three- dimensional geometry is described. A variety of types of problems may be solved: the usual eigenvalue problem, a direct criticality search on the buckling, on a reciprocal velocity absorber (prompt mode), or on nuclide concentrations, or an indirect criticality search on nuclide concentrations, or on dimensions. First- order perturbation analysis capability is available at the macroscopic cross section level. (auth)

Stress Characterization of 4H-SiC Metal-Oxide-Semiconductor Field-Effect Transistor (MOSFET) using Raman Spectroscopy and the Finite Element Method.

PubMed

Yoshikawa, Masanobu; Kosaka, Kenichi; Seki, Hirohumi; Kimoto, Tsunenobu

2016-07-01

We measured the depolarized and polarized Raman spectra of a 4H-SiC metal-oxide-semiconductor field-effect transistor (MOSFET) and found that compressive stress of approximately 20 MPa occurs under the source and gate electrodes and tensile stress of approximately 10 MPa occurs between the source and gate electrodes. The experimental result was in close agreement with the result obtained by calculation using the finite element method (FEM). A combination of Raman spectroscopy and FEM provides much data on the stresses in 4H-SiC MOSFET. © The Author(s) 2016.

Beyond Clausius-Mossotti - Wave propagation on a polarizable point lattice and the discrete dipole approximation. [electromagnetic scattering and absorption by interstellar grains

NASA Technical Reports Server (NTRS)

Draine, B. T.; Goodman, Jeremy

1993-01-01

We derive the dispersion relation for electromagnetic waves propagating on a lattice of polarizable points. From this dispersion relation we obtain a prescription for choosing dipole polarizabilities so that an infinite lattice with finite lattice spacing will mimic a continuum with dielectric constant. The discrete dipole approximation is used to calculate scattering and absorption by a finite target by replacing the target with an array of point dipoles. We compare different prescriptions for determining the dipole polarizabilities. We show that the most accurate results are obtained when the lattice dispersion relation is used to set the polarizabilities.

A finite element method with overlapping meshes for free-boundary axisymmetric plasma equilibria in realistic geometries

NASA Astrophysics Data System (ADS)

Heumann, Holger; Rapetti, Francesca

2017-04-01

Existing finite element implementations for the computation of free-boundary axisymmetric plasma equilibria approximate the unknown poloidal flux function by standard lowest order continuous finite elements with discontinuous gradients. As a consequence, the location of critical points of the poloidal flux, that are of paramount importance in tokamak engineering, is constrained to nodes of the mesh leading to undesired jumps in transient problems. Moreover, recent numerical results for the self-consistent coupling of equilibrium with resistive diffusion and transport suggest the necessity of higher regularity when approximating the flux map. In this work we propose a mortar element method that employs two overlapping meshes. One mesh with Cartesian quadrilaterals covers the vacuum chamber domain accessible by the plasma and one mesh with triangles discretizes the region outside. The two meshes overlap in a narrow region. This approach gives the flexibility to achieve easily and at low cost higher order regularity for the approximation of the flux function in the domain covered by the plasma, while preserving accurate meshing of the geometric details outside this region. The continuity of the numerical solution in the region of overlap is weakly enforced by a mortar-like mapping.

S-curve networks and an approximate method for estimating degree distributions of complex networks

NASA Astrophysics Data System (ADS)

Guo, Jin-Li

2010-12-01

In the study of complex networks almost all theoretical models have the property of infinite growth, but the size of actual networks is finite. According to statistics from the China Internet IPv4 (Internet Protocol version 4) addresses, this paper proposes a forecasting model by using S curve (logistic curve). The growing trend of IPv4 addresses in China is forecasted. There are some reference values for optimizing the distribution of IPv4 address resource and the development of IPv6. Based on the laws of IPv4 growth, that is, the bulk growth and the finitely growing limit, it proposes a finite network model with a bulk growth. The model is said to be an S-curve network. Analysis demonstrates that the analytic method based on uniform distributions (i.e., Barabási-Albert method) is not suitable for the network. It develops an approximate method to predict the growth dynamics of the individual nodes, and uses this to calculate analytically the degree distribution and the scaling exponents. The analytical result agrees with the simulation well, obeying an approximately power-law form. This method can overcome a shortcoming of Barabási-Albert method commonly used in current network research.

[Analysis of stress in periodontal ligament of the maxillary first molar on distal movement by nonlinear finite element method].

PubMed

Dong, Jing; Zhang, Zhe-chen; Zhou, Guo-liang

2015-06-01

To analyze the stress distribution in periodontal ligament of maxillary first molar during distal movement with nonlinear finite element analysis, and to compare it with the result of linear finite element analysis, consequently to provide biomechanical evidence for clinical application. The 3-D finite element model including a maxillary first molar, periodontal ligament, alveolar bone, cancellous bone, cortical bone and a buccal tube was built up by using Mimics, Geomagic, ProE and Ansys Workbench. The material of periodontal ligament was set as nonlinear material and linear elastic material, respectively. Loads of different combinations were applied to simulate the clinical situation of distalizing the maxillary first molar. There were channels of low stress in peak distribution of Von Mises equivalent stress and compressive stress of periodontal ligament in nonlinear finite element model. The peak of Von Mises equivalent stress was lower when it was satisfied that Mt/F minus Mr/F approximately equals 2. The peak of compressive stress was lower when it was satisfied that Mt/F was approximately equal to Mr/F. The relative stress of periodontal ligament was higher and violent in linear finite element model and there were no channels of low stress in peak distribution. There are channels in which stress of periodontal ligament is lower. The condition of low stress should be satisfied by applied M/F during the course of distalizing the maxillary first molar.

A point-value enhanced finite volume method based on approximate delta functions

NASA Astrophysics Data System (ADS)

Xuan, Li-Jun; Majdalani, Joseph

2018-02-01

We revisit the concept of an approximate delta function (ADF), introduced by Huynh (2011) [1], in the form of a finite-order polynomial that holds identical integral properties to the Dirac delta function when used in conjunction with a finite-order polynomial integrand over a finite domain. We show that the use of generic ADF polynomials can be effective at recovering and generalizing several high-order methods, including Taylor-based and nodal-based Discontinuous Galerkin methods, as well as the Correction Procedure via Reconstruction. Based on the ADF concept, we then proceed to formulate a Point-value enhanced Finite Volume (PFV) method, which stores and updates the cell-averaged values inside each element as well as the unknown quantities and, if needed, their derivatives on nodal points. The sharing of nodal information with surrounding elements saves the number of degrees of freedom compared to other compact methods at the same order. To ensure conservation, cell-averaged values are updated using an identical approach to that adopted in the finite volume method. Here, the updating of nodal values and their derivatives is achieved through an ADF concept that leverages all of the elements within the domain of integration that share the same nodal point. The resulting scheme is shown to be very stable at successively increasing orders. Both accuracy and stability of the PFV method are verified using a Fourier analysis and through applications to the linear wave and nonlinear Burgers' equations in one-dimensional space.

Exponential approximations in optimal design

NASA Technical Reports Server (NTRS)

Belegundu, A. D.; Rajan, S. D.; Rajgopal, J.

1990-01-01

One-point and two-point exponential functions have been developed and proved to be very effective approximations of structural response. The exponential has been compared to the linear, reciprocal and quadratic fit methods. Four test problems in structural analysis have been selected. The use of such approximations is attractive in structural optimization to reduce the numbers of exact analyses which involve computationally expensive finite element analysis.

Approximate Solutions for Ideal Dam-Break Sediment-Laden Flows on Uniform Slopes

NASA Astrophysics Data System (ADS)

Ni, Yufang; Cao, Zhixian; Borthwick, Alistair; Liu, Qingquan

2018-04-01

Shallow water hydro-sediment-morphodynamic (SHSM) models have been applied increasingly widely in hydraulic engineering and geomorphological studies over the past few decades. Analytical and approximate solutions are usually sought to verify such models and therefore confirm their credibility. Dam-break flows are often evoked because such flows normally feature shock waves and contact discontinuities that warrant refined numerical schemes to solve. While analytical and approximate solutions to clear-water dam-break flows have been available for some time, such solutions are rare for sediment transport in dam-break flows. Here we aim to derive approximate solutions for ideal dam-break sediment-laden flows resulting from the sudden release of a finite volume of frictionless, incompressible water-sediment mixture on a uniform slope. The approximate solutions are presented for three typical sediment transport scenarios, i.e., pure advection, pure sedimentation, and concurrent entrainment and deposition. Although the cases considered in this paper are not real, the approximate solutions derived facilitate suitable benchmark tests for evaluating SHSM models, especially presently when shock waves can be numerically resolved accurately with a suite of finite volume methods, while the accuracy of the numerical solutions of contact discontinuities in sediment transport remains generally poorer.

A denoising algorithm for CT image using low-rank sparse coding

NASA Astrophysics Data System (ADS)

Lei, Yang; Xu, Dong; Zhou, Zhengyang; Wang, Tonghe; Dong, Xue; Liu, Tian; Dhabaan, Anees; Curran, Walter J.; Yang, Xiaofeng

2018-03-01

We propose a denoising method of CT image based on low-rank sparse coding. The proposed method constructs an adaptive dictionary of image patches and estimates the sparse coding regularization parameters using the Bayesian interpretation. A low-rank approximation approach is used to simultaneously construct the dictionary and achieve sparse representation through clustering similar image patches. A variable-splitting scheme and a quadratic optimization are used to reconstruct CT image based on achieved sparse coefficients. We tested this denoising technology using phantom, brain and abdominal CT images. The experimental results showed that the proposed method delivers state-of-art denoising performance, both in terms of objective criteria and visual quality.

How to Rank Journals

PubMed Central

Bradshaw, Corey J. A.; Brook, Barry W.

2016-01-01

There are now many methods available to assess the relative citation performance of peer-reviewed journals. Regardless of their individual faults and advantages, citation-based metrics are used by researchers to maximize the citation potential of their articles, and by employers to rank academic track records. The absolute value of any particular index is arguably meaningless unless compared to other journals, and different metrics result in divergent rankings. To provide a simple yet more objective way to rank journals within and among disciplines, we developed a κ-resampled composite journal rank incorporating five popular citation indices: Impact Factor, Immediacy Index, Source-Normalized Impact Per Paper, SCImago Journal Rank and Google 5-year h-index; this approach provides an index of relative rank uncertainty. We applied the approach to six sample sets of scientific journals from Ecology (n = 100 journals), Medicine (n = 100), Multidisciplinary (n = 50); Ecology + Multidisciplinary (n = 25), Obstetrics & Gynaecology (n = 25) and Marine Biology & Fisheries (n = 25). We then cross-compared the κ-resampled ranking for the Ecology + Multidisciplinary journal set to the results of a survey of 188 publishing ecologists who were asked to rank the same journals, and found a 0.68–0.84 Spearman’s ρ correlation between the two rankings datasets. Our composite index approach therefore approximates relative journal reputation, at least for that discipline. Agglomerative and divisive clustering and multi-dimensional scaling techniques applied to the Ecology + Multidisciplinary journal set identified specific clusters of similarly ranked journals, with only Nature & Science separating out from the others. When comparing a selection of journals within or among disciplines, we recommend collecting multiple citation-based metrics for a sample of relevant and realistic journals to calculate the composite rankings and their relative uncertainty windows. PMID:26930052

How to Rank Journals.

PubMed

Bradshaw, Corey J A; Brook, Barry W

2016-01-01

There are now many methods available to assess the relative citation performance of peer-reviewed journals. Regardless of their individual faults and advantages, citation-based metrics are used by researchers to maximize the citation potential of their articles, and by employers to rank academic track records. The absolute value of any particular index is arguably meaningless unless compared to other journals, and different metrics result in divergent rankings. To provide a simple yet more objective way to rank journals within and among disciplines, we developed a κ-resampled composite journal rank incorporating five popular citation indices: Impact Factor, Immediacy Index, Source-Normalized Impact Per Paper, SCImago Journal Rank and Google 5-year h-index; this approach provides an index of relative rank uncertainty. We applied the approach to six sample sets of scientific journals from Ecology (n = 100 journals), Medicine (n = 100), Multidisciplinary (n = 50); Ecology + Multidisciplinary (n = 25), Obstetrics & Gynaecology (n = 25) and Marine Biology & Fisheries (n = 25). We then cross-compared the κ-resampled ranking for the Ecology + Multidisciplinary journal set to the results of a survey of 188 publishing ecologists who were asked to rank the same journals, and found a 0.68-0.84 Spearman's ρ correlation between the two rankings datasets. Our composite index approach therefore approximates relative journal reputation, at least for that discipline. Agglomerative and divisive clustering and multi-dimensional scaling techniques applied to the Ecology + Multidisciplinary journal set identified specific clusters of similarly ranked journals, with only Nature & Science separating out from the others. When comparing a selection of journals within or among disciplines, we recommend collecting multiple citation-based metrics for a sample of relevant and realistic journals to calculate the composite rankings and their relative uncertainty windows.

The BPS spectrum of the 4d {N}=2 SCFT's H 1, H 2, D 4, E 6, E 7, E 8

NASA Astrophysics Data System (ADS)

Cecotti, Sergio; Del Zotto, Michele

2013-06-01

Extending results of 1112.3984, we show that all rank 1 {N}=2 SCFT's in the sequence H 1, H 2, D 4 E 6, E 7, E 8 have canonical finite BPS chambers containing precisely 2 h(F) = 12(∆ - 1) hypermultiplets. The BPS spectrum of the canonical BPS chambers saturates the conformal central charge c, and satisfies some intriguing numerology.

First principles crystal engineering of nonlinear optical materials. I. Prototypical case of urea

NASA Astrophysics Data System (ADS)

Masunov, Artëm E.; Tannu, Arman; Dyakov, Alexander A.; Matveeva, Anastasia D.; Freidzon, Alexandra Ya.; Odinokov, Alexey V.; Bagaturyants, Alexander A.

2017-06-01

The crystalline materials with nonlinear optical (NLO) properties are critically important for several technological applications, including nanophotonic and second harmonic generation devices. Urea is often considered to be a standard NLO material, due to the combination of non-centrosymmetric crystal packing and capacity for intramolecular charge transfer. Various approaches to crystal engineering of non-centrosymmetric molecular materials were reported in the literature. Here we propose using global lattice energy minimization to predict the crystal packing from the first principles. We developed a methodology that includes the following: (1) parameter derivation for polarizable force field AMOEBA; (2) local minimizations of crystal structures with these parameters, combined with the evolutionary algorithm for a global minimum search, implemented in program USPEX; (3) filtering out duplicate polymorphs produced; (4) reoptimization and final ranking based on density functional theory (DFT) with many-body dispersion (MBD) correction; and (5) prediction of the second-order susceptibility tensor by finite field approach. This methodology was applied to predict virtual urea polymorphs. After filtering based on packing similarity, only two distinct packing modes were predicted: one experimental and one hypothetical. DFT + MBD ranking established non-centrosymmetric crystal packing as the global minimum, in agreement with the experiment. Finite field approach was used to predict nonlinear susceptibility, and H-bonding was found to account for a 2.5-fold increase in molecular hyperpolarizability to the bulk value.

The use of Galerkin finite-element methods to solve mass-transport equations

USGS Publications Warehouse

Grove, David B.

1977-01-01

The partial differential equation that describes the transport and reaction of chemical solutes in porous media was solved using the Galerkin finite-element technique. These finite elements were superimposed over finite-difference cells used to solve the flow equation. Both convection and flow due to hydraulic dispersion were considered. Linear and Hermite cubic approximations (basis functions) provided satisfactory results: however, the linear functions were computationally more efficient for two-dimensional problems. Successive over relaxation (SOR) and iteration techniques using Tchebyschef polynomials were used to solve the sparce matrices generated using the linear and Hermite cubic functions, respectively. Comparisons of the finite-element methods to the finite-difference methods, and to analytical results, indicated that a high degree of accuracy may be obtained using the method outlined. The technique was applied to a field problem involving an aquifer contaminated with chloride, tritium, and strontium-90. (Woodard-USGS)

SortNet: learning to rank by a neural preference function.

PubMed

Rigutini, Leonardo; Papini, Tiziano; Maggini, Marco; Scarselli, Franco

2011-09-01

Relevance ranking consists in sorting a set of objects with respect to a given criterion. However, in personalized retrieval systems, the relevance criteria may usually vary among different users and may not be predefined. In this case, ranking algorithms that adapt their behavior from users' feedbacks must be devised. Two main approaches are proposed in the literature for learning to rank: the use of a scoring function, learned by examples, that evaluates a feature-based representation of each object yielding an absolute relevance score, a pairwise approach, where a preference function is learned to determine the object that has to be ranked first in a given pair. In this paper, we present a preference learning method for learning to rank. A neural network, the comparative neural network (CmpNN), is trained from examples to approximate the comparison function for a pair of objects. The CmpNN adopts a particular architecture designed to implement the symmetries naturally present in a preference function. The learned preference function can be embedded as the comparator into a classical sorting algorithm to provide a global ranking of a set of objects. To improve the ranking performances, an active-learning procedure is devised, that aims at selecting the most informative patterns in the training set. The proposed algorithm is evaluated on the LETOR dataset showing promising performances in comparison with other state-of-the-art algorithms.

Solution of the two-dimensional spectral factorization problem

NASA Technical Reports Server (NTRS)

Lawton, W. M.

1985-01-01

An approximation theorem is proven which solves a classic problem in two-dimensional (2-D) filter theory. The theorem shows that any continuous two-dimensional spectrum can be uniformly approximated by the squared modulus of a recursively stable finite trigonometric polynomial supported on a nonsymmetric half-plane.

A simple finite element method for non-divergence form elliptic equation

DOE PAGES

Mu, Lin; Ye, Xiu

2017-03-01

Here, we develop a simple finite element method for solving second order elliptic equations in non-divergence form by combining least squares concept with discontinuous approximations. This simple method has a symmetric and positive definite system and can be easily analyzed and implemented. We could have also used general meshes with polytopal element and hanging node in the method. We prove that our finite element solution approaches to the true solution when the mesh size approaches to zero. Numerical examples are tested that demonstrate the robustness and flexibility of the method.

Radiation-driven winds of hot stars. VI - Analytical solutions for wind models including the finite cone angle effect

NASA Technical Reports Server (NTRS)

Kudritzki, R. P.; Pauldrach, A.; Puls, J.; Abbott, D. C.

1989-01-01

Analytical solutions for radiation-driven winds of hot stars including the important finite cone angle effect (see Pauldrach et al., 1986; Friend and Abbott, 1986) are derived which approximate the detailed numerical solutions of the exact wind equation of motion very well. They allow a detailed discussion of the finite cone angle effect and provide for given line force parameters k, alpha, delta definite formulas for mass-loss rate M and terminal velocity v-alpha as function of stellar parameters.

A simple finite element method for non-divergence form elliptic equation

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

Mu, Lin; Ye, Xiu

Here, we develop a simple finite element method for solving second order elliptic equations in non-divergence form by combining least squares concept with discontinuous approximations. This simple method has a symmetric and positive definite system and can be easily analyzed and implemented. We could have also used general meshes with polytopal element and hanging node in the method. We prove that our finite element solution approaches to the true solution when the mesh size approaches to zero. Numerical examples are tested that demonstrate the robustness and flexibility of the method.

An adaptive finite element method for the inequality-constrained Reynolds equation

NASA Astrophysics Data System (ADS)

Gustafsson, Tom; Rajagopal, Kumbakonam R.; Stenberg, Rolf; Videman, Juha

2018-07-01

We present a stabilized finite element method for the numerical solution of cavitation in lubrication, modeled as an inequality-constrained Reynolds equation. The cavitation model is written as a variable coefficient saddle-point problem and approximated by a residual-based stabilized method. Based on our recent results on the classical obstacle problem, we present optimal a priori estimates and derive novel a posteriori error estimators. The method is implemented as a Nitsche-type finite element technique and shown in numerical computations to be superior to the usually applied penalty methods.

Adaptive finite element method for turbulent flow near a propeller

NASA Astrophysics Data System (ADS)

Pelletier, Dominique; Ilinca, Florin; Hetu, Jean-Francois

1994-11-01

This paper presents an adaptive finite element method based on remeshing to solve incompressible turbulent free shear flow near a propeller. Solutions are obtained in primitive variables using a highly accurate finite element approximation on unstructured grids. Turbulence is modeled by a mixing length formulation. Two general purpose error estimators, which take into account swirl and the variation of the eddy viscosity, are presented and applied to the turbulent wake of a propeller. Predictions compare well with experimental measurements. The proposed adaptive scheme is robust, reliable and cost effective.

Implementation of a finite-amplitude method in a relativistic meson-exchange model

NASA Astrophysics Data System (ADS)

Sun, Xuwei; Lu, Dinghui

2017-08-01

The finite-amplitude method is a feasible numerical approach to large scale random phase approximation calculations. It avoids the storage and calculation of residual interaction elements as well as the diagonalization of the RPA matrix, which will be prohibitive when the configuration space is huge. In this work we finished the implementation of a finite-amplitude method in a relativistic meson exchange mean field model with axial symmetry. The direct variation approach makes our FAM scheme capable of being extended to the multipole excitation case.

Algorithm 782 : codes for rank-revealing QR factorizations of dense matrices.

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

Bischof, C. H.; Quintana-Orti, G.; Mathematics and Computer Science

1998-06-01

This article describes a suite of codes as well as associated testing and timing drivers for computing rank-revealing QR (RRQR) factorizations of dense matrices. The main contribution is an efficient block algorithm for approximating an RRQR factorization, employing a windowed version of the commonly used Golub pivoting strategy and improved versions of the RRQR algorithms for triangular matrices originally suggested by Chandrasekaran and Ipsen and by Pan and Tang, respectively, We highlight usage and features of these codes.

Development of Genuine Neural Network Prototype Chip

DTIC Science & Technology

1991-01-28

priori distribution is equivalent, and more readily visualized with a rank curve . The sonar signal data consisted of approximately 85% class Target and...15% class Clutter. For this reason, the rank curves for the class Clutter were used for device parameter analysis. R & D STATUS REPORT 1/28/91 N00014...the signal CLASSLD#. Four 10-bit class probabilities are available on the output bus (C0-C9, C16-C25, C32-C41 and C48- C57 ) at each clock cycle. A

A Posteriori Bounds for Linear-Functional Outputs of Crouzeix-Raviart Finite Element Discretizations of the Incompressible Stokes Problem

NASA Technical Reports Server (NTRS)

Patera, Anthony T.; Paraschivoiu, Marius

1998-01-01

We present a finite element technique for the efficient generation of lower and upper bounds to outputs which are linear functionals of the solutions to the incompressible Stokes equations in two space dimensions; the finite element discretization is effected by Crouzeix-Raviart elements, the discontinuous pressure approximation of which is central to our approach. The bounds are based upon the construction of an augmented Lagrangian: the objective is a quadratic "energy" reformulation of the desired output; the constraints are the finite element equilibrium equations (including the incompressibility constraint), and the intersubdomain continuity conditions on velocity. Appeal to the dual max-min problem for appropriately chosen candidate Lagrange multipliers then yields inexpensive bounds for the output associated with a fine-mesh discretization; the Lagrange multipliers are generated by exploiting an associated coarse-mesh approximation. In addition to the requisite coarse-mesh calculations, the bound technique requires solution only of local subdomain Stokes problems on the fine-mesh. The method is illustrated for the Stokes equations, in which the outputs of interest are the flowrate past, and the lift force on, a body immersed in a channel.

The aggregated unfitted finite element method for elliptic problems

NASA Astrophysics Data System (ADS)

Badia, Santiago; Verdugo, Francesc; Martín, Alberto F.

2018-07-01

Unfitted finite element techniques are valuable tools in different applications where the generation of body-fitted meshes is difficult. However, these techniques are prone to severe ill conditioning problems that obstruct the efficient use of iterative Krylov methods and, in consequence, hinders the practical usage of unfitted methods for realistic large scale applications. In this work, we present a technique that addresses such conditioning problems by constructing enhanced finite element spaces based on a cell aggregation technique. The presented method, called aggregated unfitted finite element method, is easy to implement, and can be used, in contrast to previous works, in Galerkin approximations of coercive problems with conforming Lagrangian finite element spaces. The mathematical analysis of the new method states that the condition number of the resulting linear system matrix scales as in standard finite elements for body-fitted meshes, without being affected by small cut cells, and that the method leads to the optimal finite element convergence order. These theoretical results are confirmed with 2D and 3D numerical experiments.

Linear quadratic tracking problems in Hilbert space - Application to optimal active noise suppression

NASA Technical Reports Server (NTRS)

Banks, H. T.; Silcox, R. J.; Keeling, S. L.; Wang, C.

1989-01-01

A unified treatment of the linear quadratic tracking (LQT) problem, in which a control system's dynamics are modeled by a linear evolution equation with a nonhomogeneous component that is linearly dependent on the control function u, is presented; the treatment proceeds from the theoretical formulation to a numerical approximation framework. Attention is given to two categories of LQT problems in an infinite time interval: the finite energy and the finite average energy. The behavior of the optimal solution for finite time-interval problems as the length of the interval tends to infinity is discussed. Also presented are the formulations and properties of LQT problems in a finite time interval.

Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm.

PubMed

Lu, Canyi; Tang, Jinhui; Yan, Shuicheng; Lin, Zhouchen

2016-02-01

The nuclear norm is widely used as a convex surrogate of the rank function in compressive sensing for low rank matrix recovery with its applications in image recovery and signal processing. However, solving the nuclear norm-based relaxed convex problem usually leads to a suboptimal solution of the original rank minimization problem. In this paper, we propose to use a family of nonconvex surrogates of L0-norm on the singular values of a matrix to approximate the rank function. This leads to a nonconvex nonsmooth minimization problem. Then, we propose to solve the problem by an iteratively re-weighted nuclear norm (IRNN) algorithm. IRNN iteratively solves a weighted singular value thresholding problem, which has a closed form solution due to the special properties of the nonconvex surrogate functions. We also extend IRNN to solve the nonconvex problem with two or more blocks of variables. In theory, we prove that the IRNN decreases the objective function value monotonically, and any limit point is a stationary point. Extensive experiments on both synthesized data and real images demonstrate that IRNN enhances the low rank matrix recovery compared with the state-of-the-art convex algorithms.

Low rank approach to computing first and higher order derivatives using automatic differentiation

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

Reed, J. A.; Abdel-Khalik, H. S.; Utke, J.

2012-07-01

This manuscript outlines a new approach for increasing the efficiency of applying automatic differentiation (AD) to large scale computational models. By using the principles of the Efficient Subspace Method (ESM), low rank approximations of the derivatives for first and higher orders can be calculated using minimized computational resources. The output obtained from nuclear reactor calculations typically has a much smaller numerical rank compared to the number of inputs and outputs. This rank deficiency can be exploited to reduce the number of derivatives that need to be calculated using AD. The effective rank can be determined according to ESM by computingmore » derivatives with AD at random inputs. Reduced or pseudo variables are then defined and new derivatives are calculated with respect to the pseudo variables. Two different AD packages are used: OpenAD and Rapsodia. OpenAD is used to determine the effective rank and the subspace that contains the derivatives. Rapsodia is then used to calculate derivatives with respect to the pseudo variables for the desired order. The overall approach is applied to two simple problems and to MATWS, a safety code for sodium cooled reactors. (authors)« less

Technique for information retrieval using enhanced latent semantic analysis generating rank approximation matrix by factorizing the weighted morpheme-by-document matrix

DOEpatents

Chew, Peter A; Bader, Brett W

2012-10-16

A technique for information retrieval includes parsing a corpus to identify a number of wordform instances within each document of the corpus. A weighted morpheme-by-document matrix is generated based at least in part on the number of wordform instances within each document of the corpus and based at least in part on a weighting function. The weighted morpheme-by-document matrix separately enumerates instances of stems and affixes. Additionally or alternatively, a term-by-term alignment matrix may be generated based at least in part on the number of wordform instances within each document of the corpus. At least one lower rank approximation matrix is generated by factorizing the weighted morpheme-by-document matrix and/or the term-by-term alignment matrix.

Using the Pearson Distribution for Synthesis of the Suboptimal Algorithms for Filtering Multi-Dimensional Markov Processes

NASA Astrophysics Data System (ADS)

Mit'kin, A. S.; Pogorelov, V. A.; Chub, E. G.

2015-08-01

We consider the method of constructing the suboptimal filter on the basis of approximating the a posteriori probability density of the multidimensional Markov process by the Pearson distributions. The proposed method can efficiently be used for approximating asymmetric, excessive, and finite densities.

Finite-element time evolution operator for the anharmonic oscillator

NASA Technical Reports Server (NTRS)

Milton, Kimball A.

1995-01-01

The finite-element approach to lattice field theory is both highly accurate (relative errors approximately 1/N(exp 2), where N is the number of lattice points) and exactly unitary (in the sense that canonical commutation relations are exactly preserved at the lattice sites). In this talk I construct matrix elements for dynamical variables and for the time evolution operator for the anharmonic oscillator, for which the continuum Hamiltonian is H = p(exp 2)/2 + lambda q(exp 4)/4. Construction of such matrix elements does not require solving the implicit equations of motion. Low order approximations turn out to be extremely accurate. For example, the matrix element of the time evolution operator in the harmonic oscillator ground state gives a results for the anharmonic oscillator ground state energy accurate to better than 1 percent, while a two-state approximation reduces the error to less than 0.1 percent.

The effect of grid transparency and finite collector size on determining ion temperature and density by the retarding potential analyzer

NASA Technical Reports Server (NTRS)

Troy, B. E., Jr.; Maier, E. J.

1973-01-01

The analysis of ion data from retarding potential analyzers (RPA's) is generally done under the planar approximation, which assumes that the grid transparency is constant with angle of incidence and that all ions reaching the plane of the collectors are collected. These approximations are not valid for situations in which the ion thermal velocity is comparable to the vehicle velocity, causing ions to enter the RPA with high average transverse velocity. To investigate these effects, the current-voltage curves for H+ at 4000 K were calculated, taking into account the finite collector size and the variation of grid transparency with angle. These curves are then analyzed under the planar approximation. The results show that only small errors in temperature and density are introduced for an RPA with typical dimensions; and that even when the density error is substantial for non-typical dimensions, the temperature error remains minimal.

Hadronic density of states from string theory.

PubMed

Pando Zayas, Leopoldo A; Vaman, Diana

2003-09-12

We present an exact calculation of the finite temperature partition function for the hadronic states corresponding to a Penrose-Güven limit of the Maldacena-Nùñez embedding of the N=1 super Yang-Mills (SYM) into string theory. It is established that the theory exhibits a Hagedorn density of states. We propose a semiclassical string approximation to the finite temperature partition function for confining gauge theories admitting a supergravity dual, by performing an expansion around classical solutions characterized by temporal windings. This semiclassical approximation reveals a hadronic energy density of states of a Hagedorn type, with the coefficient determined by the gauge theory string tension as expected for confining theories. We argue that our proposal captures primarily information about states of pure N=1 SYM theory, given that this semiclassical approximation does not entail a projection onto states of large U(1) charge.

The arbitrary order mixed mimetic finite difference method for the diffusion equation

DOE PAGES

Gyrya, Vitaliy; Lipnikov, Konstantin; Manzini, Gianmarco

2016-05-01

Here, we propose an arbitrary-order accurate mimetic finite difference (MFD) method for the approximation of diffusion problems in mixed form on unstructured polygonal and polyhedral meshes. As usual in the mimetic numerical technology, the method satisfies local consistency and stability conditions, which determines the accuracy and the well-posedness of the resulting approximation. The method also requires the definition of a high-order discrete divergence operator that is the discrete analog of the divergence operator and is acting on the degrees of freedom. The new family of mimetic methods is proved theoretically to be convergent and optimal error estimates for flux andmore » scalar variable are derived from the convergence analysis. A numerical experiment confirms the high-order accuracy of the method in solving diffusion problems with variable diffusion tensor. It is worth mentioning that the approximation of the scalar variable presents a superconvergence effect.« less

Free and Forced Vibrations of Thick-Walled Anisotropic Cylindrical Shells

NASA Astrophysics Data System (ADS)

Marchuk, A. V.; Gnedash, S. V.; Levkovskii, S. A.

2017-03-01

Two approaches to studying the free and forced axisymmetric vibrations of cylindrical shell are proposed. They are based on the three-dimensional theory of elasticity and division of the original cylindrical shell with concentric cross-sectional circles into several coaxial cylindrical shells. One approach uses linear polynomials to approximate functions defined in plan and across the thickness. The other approach also uses linear polynomials to approximate functions defined in plan, but their variation with thickness is described by the analytical solution of a system of differential equations. Both approaches have approximation and arithmetic errors. When determining the natural frequencies by the semi-analytical finite-element method in combination with the divide and conqure method, it is convenient to find the initial frequencies by the finite-element method. The behavior of the shell during free and forced vibrations is analyzed in the case where the loading area is half the shell thickness

Exchange-driven growth.

PubMed

Ben-Naim, E; Krapivsky, P L

2003-09-01

We study a class of growth processes in which clusters evolve via exchange of particles. We show that depending on the rate of exchange there are three possibilities: (I) Growth-clusters grow indefinitely, (II) gelation-all mass is transformed into an infinite gel in a finite time, and (III) instant gelation. In regimes I and II, the cluster size distribution attains a self-similar form. The large size tail of the scaling distribution is Phi(x) approximately exp(-x(2-nu)), where nu is a homogeneity degree of the rate of exchange. At the borderline case nu=2, the distribution exhibits a generic algebraic tail, Phi(x) approximately x(-5). In regime III, the gel nucleates immediately and consumes the entire system. For finite systems, the gelation time vanishes logarithmically, T approximately [lnN](-(nu-2)), in the large system size limit N--> infinity. The theory is applied to coarsening in the infinite range Ising-Kawasaki model and in electrostatically driven granular layers.

A characterization of positive linear maps and criteria of entanglement for quantum states

NASA Astrophysics Data System (ADS)

Hou, Jinchuan

2010-09-01

Let H and K be (finite- or infinite-dimensional) complex Hilbert spaces. A characterization of positive completely bounded normal linear maps from {\\mathcal B}(H) into {\\mathcal B}(K) is given, which particularly gives a characterization of positive elementary operators including all positive linear maps between matrix algebras. This characterization is then applied to give a representation of quantum channels (operations) between infinite-dimensional systems. A necessary and sufficient criterion of separability is given which shows that a state ρ on HotimesK is separable if and only if (ΦotimesI)ρ >= 0 for all positive finite-rank elementary operators Φ. Examples of NCP and indecomposable positive linear maps are given and are used to recognize some entangled states that cannot be recognized by the PPT criterion and the realignment criterion.

Estimation of rank correlation for clustered data.

PubMed

Rosner, Bernard; Glynn, Robert J

2017-06-30

It is well known that the sample correlation coefficient (R xy ) is the maximum likelihood estimator of the Pearson correlation (ρ xy ) for independent and identically distributed (i.i.d.) bivariate normal data. However, this is not true for ophthalmologic data where X (e.g., visual acuity) and Y (e.g., visual field) are available for each eye and there is positive intraclass correlation for both X and Y in fellow eyes. In this paper, we provide a regression-based approach for obtaining the maximum likelihood estimator of ρ xy for clustered data, which can be implemented using standard mixed effects model software. This method is also extended to allow for estimation of partial correlation by controlling both X and Y for a vector U_ of other covariates. In addition, these methods can be extended to allow for estimation of rank correlation for clustered data by (i) converting ranks of both X and Y to the probit scale, (ii) estimating the Pearson correlation between probit scores for X and Y, and (iii) using the relationship between Pearson and rank correlation for bivariate normally distributed data. The validity of the methods in finite-sized samples is supported by simulation studies. Finally, two examples from ophthalmology and analgesic abuse are used to illustrate the methods. Copyright © 2017 John Wiley & Sons, Ltd. Copyright © 2017 John Wiley & Sons, Ltd.

Chiral symmetry restoration at finite temperature and chemical potential in the improved ladder approximation

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

Taniguchi, Y.; Yoshida, Y.

1997-02-01

The chiral symmetry of QCD is studied at finite temperature and chemical potential using the Schwinger-Dyson equation in the improved ladder approximation. We calculate three order parameters: the vacuum expectation value of the quark bilinear operator, the pion decay constant, and the quark mass gap. We have a second order phase transition at the temperature T{sub c}=169 MeV along the zero chemical potential line, and a first order phase transition at the chemical potential {mu}{sub c}=598 MeV along the zero temperature line. We also calculate the critical exponents of the three order parameters. {copyright} {ital 1997} {ital The American Physicalmore » Society}« less

Numerical solution of nonlinear partial differential equations of mixed type. [finite difference approximation

NASA Technical Reports Server (NTRS)

Jameson, A.

1976-01-01

A review is presented of some recently developed numerical methods for the solution of nonlinear equations of mixed type. The methods considered use finite difference approximations to the differential equation. Central difference formulas are employed in the subsonic zone and upwind difference formulas are used in the supersonic zone. The relaxation method for the small disturbance equation is discussed and a description is given of difference schemes for the potential flow equation in quasi-linear form. Attention is also given to difference schemes for the potential flow equation in conservation form, the analysis of relaxation schemes by the time dependent analogy, the accelerated iterative method, and three-dimensional calculations.

FELIX-1.0: A finite element solver for the time dependent generator coordinate method with the Gaussian overlap approximation

NASA Astrophysics Data System (ADS)

Regnier, D.; Verrière, M.; Dubray, N.; Schunck, N.

2016-03-01

We describe the software package FELIX that solves the equations of the time-dependent generator coordinate method (TDGCM) in N-dimensions (N ≥ 1) under the Gaussian overlap approximation. The numerical resolution is based on the Galerkin finite element discretization of the collective space and the Crank-Nicolson scheme for time integration. The TDGCM solver is implemented entirely in C++. Several additional tools written in C++, Python or bash scripting language are also included for convenience. In this paper, the solver is tested with a series of benchmarks calculations. We also demonstrate the ability of our code to handle a realistic calculation of fission dynamics.

A Weak Galerkin Method for the Reissner–Mindlin Plate in Primary Form

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

Mu, Lin; Wang, Junping; Ye, Xiu

We developed a new finite element method for the Reissner–Mindlin equations in its primary form by using the weak Galerkin approach. Like other weak Galerkin finite element methods, this one is highly flexible and robust by allowing the use of discontinuous approximating functions on arbitrary shape of polygons and, at the same time, is parameter independent on its stability and convergence. Furthermore, error estimates of optimal order in mesh size h are established for the corresponding weak Galerkin approximations. Numerical experiments are conducted for verifying the convergence theory, as well as suggesting some superconvergence and a uniform convergence of themore » method with respect to the plate thickness.« less

Albedo of an irradiated plane-parallel atmosphere with finite optical depth

NASA Astrophysics Data System (ADS)

Fukue, Jun

2018-03-01

We analytically derive albedo for a plane-parallel atmosphere with finite optical depth, irradiated by an external source, under the local thermodynamic equilibrium approximation. Albedo is expressed as a function of the photon destruction probability ɛ and optical depth τ, with several parameters such as dilution factors of the external source. In the particular case of the infinite optical depth, albedo A is expressed as A=[1 + (1-W_J/W_H)√{3ɛ}/3]/(1+√{3ɛ}), where WJ and WH are the dilution factors for the mean intensity and Eddington flux, respectively. An example of a model atmosphere is also presented under a gray approximation.

A Weak Galerkin Method for the Reissner–Mindlin Plate in Primary Form

DOE PAGES

Mu, Lin; Wang, Junping; Ye, Xiu

2017-10-04

We developed a new finite element method for the Reissner–Mindlin equations in its primary form by using the weak Galerkin approach. Like other weak Galerkin finite element methods, this one is highly flexible and robust by allowing the use of discontinuous approximating functions on arbitrary shape of polygons and, at the same time, is parameter independent on its stability and convergence. Furthermore, error estimates of optimal order in mesh size h are established for the corresponding weak Galerkin approximations. Numerical experiments are conducted for verifying the convergence theory, as well as suggesting some superconvergence and a uniform convergence of themore » method with respect to the plate thickness.« less

A posteriori error estimation for multi-stage Runge–Kutta IMEX schemes

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

Chaudhry, Jehanzeb H.; Collins, J. B.; Shadid, John N.

Implicit–Explicit (IMEX) schemes are widely used for time integration methods for approximating solutions to a large class of problems. In this work, we develop accurate a posteriori error estimates of a quantity-of-interest for approximations obtained from multi-stage IMEX schemes. This is done by first defining a finite element method that is nodally equivalent to an IMEX scheme, then using typical methods for adjoint-based error estimation. Furthermore, the use of a nodally equivalent finite element method allows a decomposition of the error into multiple components, each describing the effect of a different portion of the method on the total error inmore » a quantity-of-interest.« less

Electromagnetic wave scattering from some vegetation samples

NASA Technical Reports Server (NTRS)

Karam, Mostafa A.; Fung, Adrian K.; Antar, Yahia M.

1988-01-01

For an incident plane wave, the field inside a thin scatterer (disk and needle) is estimated by the generalized Rayleigh-Gans (GRG) approximation. This leads to a scattering amplitude tensor equal to that obtained via the Rayleigh approximation (dipole term) with a modifying function. For a finite-length cylinder the inner field is estimated by the corresponding field for the same cylinder of infinite lenght. The effects of different approaches in estimating the field inside the scatterer on the backscattering cross section are illustrated numerically for a circular disk, a needle, and a finite-length cylinder as a function of the wave number and the incidence angle. Finally, the modeling predictions are compared with measurements.

A posteriori error estimation for multi-stage Runge–Kutta IMEX schemes

DOE PAGES

Chaudhry, Jehanzeb H.; Collins, J. B.; Shadid, John N.

2017-02-05

Implicit–Explicit (IMEX) schemes are widely used for time integration methods for approximating solutions to a large class of problems. In this work, we develop accurate a posteriori error estimates of a quantity-of-interest for approximations obtained from multi-stage IMEX schemes. This is done by first defining a finite element method that is nodally equivalent to an IMEX scheme, then using typical methods for adjoint-based error estimation. Furthermore, the use of a nodally equivalent finite element method allows a decomposition of the error into multiple components, each describing the effect of a different portion of the method on the total error inmore » a quantity-of-interest.« less

Computation of tightly-focused laser beams in the FDTD method

PubMed Central

Çapoğlu, İlker R.; Taflove, Allen; Backman, Vadim

2013-01-01

We demonstrate how a tightly-focused coherent TEMmn laser beam can be computed in the finite-difference time-domain (FDTD) method. The electromagnetic field around the focus is decomposed into a plane-wave spectrum, and approximated by a finite number of plane waves injected into the FDTD grid using the total-field/scattered-field (TF/SF) method. We provide an error analysis, and guidelines for the discrete approximation. We analyze the scattering of the beam from layered spaces and individual scatterers. The described method should be useful for the simulation of confocal microscopy and optical data storage. An implementation of the method can be found in our free and open source FDTD software (“Angora”). PMID:23388899

Computation of tightly-focused laser beams in the FDTD method.

PubMed

Capoğlu, Ilker R; Taflove, Allen; Backman, Vadim

2013-01-14

We demonstrate how a tightly-focused coherent TEMmn laser beam can be computed in the finite-difference time-domain (FDTD) method. The electromagnetic field around the focus is decomposed into a plane-wave spectrum, and approximated by a finite number of plane waves injected into the FDTD grid using the total-field/scattered-field (TF/SF) method. We provide an error analysis, and guidelines for the discrete approximation. We analyze the scattering of the beam from layered spaces and individual scatterers. The described method should be useful for the simulation of confocal microscopy and optical data storage. An implementation of the method can be found in our free and open source FDTD software ("Angora").

A low-rank control variate for multilevel Monte Carlo simulation of high-dimensional uncertain systems

NASA Astrophysics Data System (ADS)

Fairbanks, Hillary R.; Doostan, Alireza; Ketelsen, Christian; Iaccarino, Gianluca

2017-07-01

Multilevel Monte Carlo (MLMC) is a recently proposed variation of Monte Carlo (MC) simulation that achieves variance reduction by simulating the governing equations on a series of spatial (or temporal) grids with increasing resolution. Instead of directly employing the fine grid solutions, MLMC estimates the expectation of the quantity of interest from the coarsest grid solutions as well as differences between each two consecutive grid solutions. When the differences corresponding to finer grids become smaller, hence less variable, fewer MC realizations of finer grid solutions are needed to compute the difference expectations, thus leading to a reduction in the overall work. This paper presents an extension of MLMC, referred to as multilevel control variates (MLCV), where a low-rank approximation to the solution on each grid, obtained primarily based on coarser grid solutions, is used as a control variate for estimating the expectations involved in MLMC. Cost estimates as well as numerical examples are presented to demonstrate the advantage of this new MLCV approach over the standard MLMC when the solution of interest admits a low-rank approximation and the cost of simulating finer grids grows fast.

Semi-Analytic Reconstruction of Flux in Finite Volume Formulations

NASA Technical Reports Server (NTRS)

Gnoffo, Peter A.

2006-01-01

Semi-analytic reconstruction uses the analytic solution to a second-order, steady, ordinary differential equation (ODE) to simultaneously evaluate the convective and diffusive flux at all interfaces of a finite volume formulation. The second-order ODE is itself a linearized approximation to the governing first- and second- order partial differential equation conservation laws. Thus, semi-analytic reconstruction defines a family of formulations for finite volume interface fluxes using analytic solutions to approximating equations. Limiters are not applied in a conventional sense; rather, diffusivity is adjusted in the vicinity of changes in sign of eigenvalues in order to achieve a sufficiently small cell Reynolds number in the analytic formulation across critical points. Several approaches for application of semi-analytic reconstruction for the solution of one-dimensional scalar equations are introduced. Results are compared with exact analytic solutions to Burger s Equation as well as a conventional, upwind discretization using Roe s method. One approach, the end-point wave speed (EPWS) approximation, is further developed for more complex applications. One-dimensional vector equations are tested on a quasi one-dimensional nozzle application. The EPWS algorithm has a more compact difference stencil than Roe s algorithm but reconstruction time is approximately a factor of four larger than for Roe. Though both are second-order accurate schemes, Roe s method approaches a grid converged solution with fewer grid points. Reconstruction of flux in the context of multi-dimensional, vector conservation laws including effects of thermochemical nonequilibrium in the Navier-Stokes equations is developed.

Including fluid shear viscosity in a structural acoustic finite element model using a scalar fluid representation

PubMed Central

Cheng, Lei; Li, Yizeng; Grosh, Karl

2013-01-01

An approximate boundary condition is developed in this paper to model fluid shear viscosity at boundaries of coupled fluid-structure system. The effect of shear viscosity is approximated by a correction term to the inviscid boundary condition, written in terms of second order in-plane derivatives of pressure. Both thin and thick viscous boundary layer approximations are formulated; the latter subsumes the former. These approximations are used to develop a variational formation, upon which a viscous finite element method (FEM) model is based, requiring only minor modifications to the boundary integral contributions of an existing inviscid FEM model. Since this FEM formulation has only one degree of freedom for pressure, it holds a great computational advantage over the conventional viscous FEM formulation which requires discretization of the full set of linearized Navier-Stokes equations. The results from thick viscous boundary layer approximation are found to be in good agreement with the prediction from a Navier-Stokes model. When applicable, thin viscous boundary layer approximation also gives accurate results with computational simplicity compared to the thick boundary layer formulation. Direct comparison of simulation results using the boundary layer approximations and a full, linearized Navier-Stokes model are made and used to evaluate the accuracy of the approximate technique. Guidelines are given for the parameter ranges over which the accurate application of the thick and thin boundary approximations can be used for a fluid-structure interaction problem. PMID:23729844

Including fluid shear viscosity in a structural acoustic finite element model using a scalar fluid representation.

PubMed

Cheng, Lei; Li, Yizeng; Grosh, Karl

2013-08-15

An approximate boundary condition is developed in this paper to model fluid shear viscosity at boundaries of coupled fluid-structure system. The effect of shear viscosity is approximated by a correction term to the inviscid boundary condition, written in terms of second order in-plane derivatives of pressure. Both thin and thick viscous boundary layer approximations are formulated; the latter subsumes the former. These approximations are used to develop a variational formation, upon which a viscous finite element method (FEM) model is based, requiring only minor modifications to the boundary integral contributions of an existing inviscid FEM model. Since this FEM formulation has only one degree of freedom for pressure, it holds a great computational advantage over the conventional viscous FEM formulation which requires discretization of the full set of linearized Navier-Stokes equations. The results from thick viscous boundary layer approximation are found to be in good agreement with the prediction from a Navier-Stokes model. When applicable, thin viscous boundary layer approximation also gives accurate results with computational simplicity compared to the thick boundary layer formulation. Direct comparison of simulation results using the boundary layer approximations and a full, linearized Navier-Stokes model are made and used to evaluate the accuracy of the approximate technique. Guidelines are given for the parameter ranges over which the accurate application of the thick and thin boundary approximations can be used for a fluid-structure interaction problem.

A spectral mimetic least-squares method for the Stokes equations with no-slip boundary condition

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

Gerritsma, Marc; Bochev, Pavel

Formulation of locally conservative least-squares finite element methods (LSFEMs) for the Stokes equations with the no-slip boundary condition has been a long standing problem. Existing LSFEMs that yield exactly divergence free velocities require non-standard boundary conditions (Bochev and Gunzburger, 2009 [3]), while methods that admit the no-slip condition satisfy the incompressibility equation only approximately (Bochev and Gunzburger, 2009 [4, Chapter 7]). Here we address this problem by proving a new non-standard stability bound for the velocity–vorticity–pressure Stokes system augmented with a no-slip boundary condition. This bound gives rise to a norm-equivalent least-squares functional in which the velocity can be approximatedmore » by div-conforming finite element spaces, thereby enabling a locally-conservative approximations of this variable. Here, we also provide a practical realization of the new LSFEM using high-order spectral mimetic finite element spaces (Kreeft et al., 2011) and report several numerical tests, which confirm its mimetic properties.« less

Primal-mixed formulations for reaction-diffusion systems on deforming domains

NASA Astrophysics Data System (ADS)

Ruiz-Baier, Ricardo

2015-10-01

We propose a finite element formulation for a coupled elasticity-reaction-diffusion system written in a fully Lagrangian form and governing the spatio-temporal interaction of species inside an elastic, or hyper-elastic body. A primal weak formulation is the baseline model for the reaction-diffusion system written in the deformed domain, and a finite element method with piecewise linear approximations is employed for its spatial discretization. On the other hand, the strain is introduced as mixed variable in the equations of elastodynamics, which in turn acts as coupling field needed to update the diffusion tensor of the modified reaction-diffusion system written in a deformed domain. The discrete mechanical problem yields a mixed finite element scheme based on row-wise Raviart-Thomas elements for stresses, Brezzi-Douglas-Marini elements for displacements, and piecewise constant pressure approximations. The application of the present framework in the study of several coupled biological systems on deforming geometries in two and three spatial dimensions is discussed, and some illustrative examples are provided and extensively analyzed.

Use of source distributions for evaluating theoretical aerodynamics of thin finite wings at supersonic speeds

NASA Technical Reports Server (NTRS)

Evvard, John C

1950-01-01

A series of publications on the source-distribution methods for evaluating the aerodynamics of thin wings at supersonic speeds is summarized, extended, and unified. Included in the first part are the deviations of: (a) the linearized partial-differential equation for unsteady flow at a substantially constant Mach number. b) The source-distribution solution for the perturbation-velocity potential that satisfies the boundary conditions of tangential flow at the surface and in the plane of the wing; and (c) the integral equation for determining the strength and the location of sources to describe the interaction effects (as represented by upwash) of the bottom and top wing surfaces through the region between the finite wing boundary and the foremost Mach wave. The second part deals with steady-state thin-wing problems. The third part of the report approximates the integral equation for unsteady upwash and includes a solution of approximate equation. Expressions are then derived to evaluate the load distributions for time-dependent finite-wing motions.

Exploiting symmetries in the modeling and analysis of tires

NASA Technical Reports Server (NTRS)

Noor, Ahmed K.; Andersen, Carl M.; Tanner, John A.

1987-01-01

A simple and efficient computational strategy for reducing both the size of a tire model and the cost of the analysis of tires in the presence of symmetry-breaking conditions (unsymmetry in the tire material, geometry, or loading) is presented. The strategy is based on approximating the unsymmetric response of the tire with a linear combination of symmetric and antisymmetric global approximation vectors (or modes). Details are presented for the three main elements of the computational strategy, which include: use of special three-field mixed finite-element models, use of operator splitting, and substantial reduction in the number of degrees of freedom. The proposed computational stategy is applied to three quasi-symmetric problems of tires: linear analysis of anisotropic tires, through use of semianalytic finite elements, nonlinear analysis of anisotropic tires through use of two-dimensional shell finite elements, and nonlinear analysis of orthotropic tires subjected to unsymmetric loading. Three basic types of symmetry (and their combinations) exhibited by the tire response are identified.

A spectral mimetic least-squares method for the Stokes equations with no-slip boundary condition

DOE PAGES

Gerritsma, Marc; Bochev, Pavel

2016-03-22

Formulation of locally conservative least-squares finite element methods (LSFEMs) for the Stokes equations with the no-slip boundary condition has been a long standing problem. Existing LSFEMs that yield exactly divergence free velocities require non-standard boundary conditions (Bochev and Gunzburger, 2009 [3]), while methods that admit the no-slip condition satisfy the incompressibility equation only approximately (Bochev and Gunzburger, 2009 [4, Chapter 7]). Here we address this problem by proving a new non-standard stability bound for the velocity–vorticity–pressure Stokes system augmented with a no-slip boundary condition. This bound gives rise to a norm-equivalent least-squares functional in which the velocity can be approximatedmore » by div-conforming finite element spaces, thereby enabling a locally-conservative approximations of this variable. Here, we also provide a practical realization of the new LSFEM using high-order spectral mimetic finite element spaces (Kreeft et al., 2011) and report several numerical tests, which confirm its mimetic properties.« less

Mass Efficiency Considerations for Thermally Insulated Structural Skin of an Aerospace Vehicle

NASA Technical Reports Server (NTRS)

Blosser, Max L.

2012-01-01

An approximate equation was derived to predict the mass of insulation required to limit the maximum temperature reached by an insulated structure subjected to a transient heating pulse. In the course of the derivation two figures of merit were identified. One figure of merit correlates to the effectiveness of the heat capacity of the underlying structural material in reducing the amount of required insulation. The second figure of merit provides an indicator of the mass efficiency of the insulator material. An iterative, one dimensional finite element analysis was used to size the external insulation required to protect the structure at a single location on the Space Shuttle Orbiter and a reusable launch vehicle. Required insulation masses were calculated for a range of different materials for both structure and insulator. The required insulation masses calculated using the approximate equation were shown to typically agree with finite element results within 10 to 20 percent over the range of parameters studied. Finite element results closely followed the trends indicated by both figures of merit.

A comparison of matrix methods for calculating eigenvalues in acoustically lined ducts

NASA Technical Reports Server (NTRS)

Watson, W.; Lansing, D. L.

1976-01-01

Three approximate methods - finite differences, weighted residuals, and finite elements - were used to solve the eigenvalue problem which arises in finding the acoustic modes and propagation constants in an absorptively lined two-dimensional duct without airflow. The matrix equations derived for each of these methods were solved for the eigenvalues corresponding to various values of wall impedance. Two matrix orders, 20 x 20 and 40 x 40, were used. The cases considered included values of wall admittance for which exact eigenvalues were known and for which several nearly equal roots were present. Ten of the lower order eigenvalues obtained from the three approximate methods were compared with solutions calculated from the exact characteristic equation in order to make an assessment of the relative accuracy and reliability of the three methods. The best results were given by the finite element method using a cubic polynomial. Excellent accuracy was consistently obtained, even for nearly equal eigenvalues, by using a 20 x 20 order matrix.

Postinterview communication with residency applicants: a call for clarity!

PubMed

Frishman, Gary N; Matteson, Kristen A; Bienstock, Jessica L; George, Karen E; Ogburn, Tony; Rauk, Phillip N; Schnatz, Peter F; Learman, Lee A

2014-10-01

The residency match is an increasingly competitive process. Communication from medical student applicants to programs varies, and the effect this has on their rank status is unclear. We assessed how obstetrics and gynecology program directors interpret and act on postinterview communication initiated by applicants by conducting an anonymous cross-sectional web-based survey of allopathic obstetrics and gynecology program directors. One hundred thirty-seven program directors (55%) responded to the survey. Twenty-nine percent would consider ranking an applicant more favorably if the applicant expressed interest (beyond a routine thank you) or if a faculty mentor personally known to the program director stated that the applicant was ranking the program first. Fifty-two percent indicated that they would rank an applicant more favorably if a mentor known to them endorsed the applicant as outstanding. Approximately 30% responded that applicants who did not communicate with their program were disadvantaged compared with those who did. Approximately 17% stated it was desirable to create additional specialty-specific guidelines regarding postinterview contact between programs and applications. Based on the wide variation in how program directors interpret and act on postinterview communication from applicants, residency programs should formulate and communicate a clear policy about whether they request and how they respond to postinterview communication from applicants and their mentors. This will establish a more level playing field and eliminate potential inequities resulting from inconsistent communication practices. Copyright © 2014 Elsevier Inc. All rights reserved.

Did the Middlesboro, Kentucky, bolide impact event influence coal rank?

USGS Publications Warehouse

Hower, J.C.; Greb, S.F.; Kuehn, K.W.; Eble, C.F.

2009-01-01

The Middlesboro Basin, southeastern Kentucky, occurs on the Cumberland Overthrust Sheet and includes a ca. 5.5-km diameter impact structure. The Lower and Middle Pennsylvanian coal-bearing strata are faulted, with some evidence for shock metamorphism. The event post-dated the latest-Pennsylvanian-early-Permian thrusting and was likely prior to late-Mesozoic entrenchment of drainages. The impact of a 0.5-km meteor traveling at ca. 60,000??km/h would release about 1??EJ, the approximate equivalent of the instantaneous combustion of 30??Mt of coal. The coal rank, while increased slightly above the regional level, still is within the upper portion of the high volatile A bituminous rank range. This helps to constrain the depth of burial at the time of the impact. The coal would have had to have been at a depth of a few kilometers to have avoided a more substantial rank increase. In addition, it is possible that some of the coal rank increase might be attributable to movements along the cross-cutting Rocky Face fault, unrelated to the impact. ?? 2009 Elsevier B.V. All rights reserved.

A new fast direct solver for the boundary element method

NASA Astrophysics Data System (ADS)

Huang, S.; Liu, Y. J.

2017-09-01

A new fast direct linear equation solver for the boundary element method (BEM) is presented in this paper. The idea of the new fast direct solver stems from the concept of the hierarchical off-diagonal low-rank matrix. The hierarchical off-diagonal low-rank matrix can be decomposed into the multiplication of several diagonal block matrices. The inverse of the hierarchical off-diagonal low-rank matrix can be calculated efficiently with the Sherman-Morrison-Woodbury formula. In this paper, a more general and efficient approach to approximate the coefficient matrix of the BEM with the hierarchical off-diagonal low-rank matrix is proposed. Compared to the current fast direct solver based on the hierarchical off-diagonal low-rank matrix, the proposed method is suitable for solving general 3-D boundary element models. Several numerical examples of 3-D potential problems with the total number of unknowns up to above 200,000 are presented. The results show that the new fast direct solver can be applied to solve large 3-D BEM models accurately and with better efficiency compared with the conventional BEM.

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.

Reduced-rank approximations to the far-field transform in the gridded fast multipole method

NASA Astrophysics Data System (ADS)

Hesford, Andrew J.; Waag, Robert C.

2011-05-01

The fast multipole method (FMM) has been shown to have a reduced computational dependence on the size of finest-level groups of elements when the elements are positioned on a regular grid and FFT convolution is used to represent neighboring interactions. However, transformations between plane-wave expansions used for FMM interactions and pressure distributions used for neighboring interactions remain significant contributors to the cost of FMM computations when finest-level groups are large. The transformation operators, which are forward and inverse Fourier transforms with the wave space confined to the unit sphere, are smooth and well approximated using reduced-rank decompositions that further reduce the computational dependence of the FMM on finest-level group size. The adaptive cross approximation (ACA) is selected to represent the forward and adjoint far-field transformation operators required by the FMM. However, the actual error of the ACA is found to be greater than that predicted using traditional estimates, and the ACA generally performs worse than the approximation resulting from a truncated singular-value decomposition (SVD). To overcome these issues while avoiding the cost of a full-scale SVD, the ACA is employed with more stringent accuracy demands and recompressed using a reduced, truncated SVD. The results show a greatly reduced approximation error that performs comparably to the full-scale truncated SVD without degrading the asymptotic computational efficiency associated with ACA matrix assembly.

Reduced-Rank Approximations to the Far-Field Transform in the Gridded Fast Multipole Method.

PubMed

Hesford, Andrew J; Waag, Robert C

2011-05-10

The fast multipole method (FMM) has been shown to have a reduced computational dependence on the size of finest-level groups of elements when the elements are positioned on a regular grid and FFT convolution is used to represent neighboring interactions. However, transformations between plane-wave expansions used for FMM interactions and pressure distributions used for neighboring interactions remain significant contributors to the cost of FMM computations when finest-level groups are large. The transformation operators, which are forward and inverse Fourier transforms with the wave space confined to the unit sphere, are smooth and well approximated using reduced-rank decompositions that further reduce the computational dependence of the FMM on finest-level group size. The adaptive cross approximation (ACA) is selected to represent the forward and adjoint far-field transformation operators required by the FMM. However, the actual error of the ACA is found to be greater than that predicted using traditional estimates, and the ACA generally performs worse than the approximation resulting from a truncated singular-value decomposition (SVD). To overcome these issues while avoiding the cost of a full-scale SVD, the ACA is employed with more stringent accuracy demands and recompressed using a reduced, truncated SVD. The results show a greatly reduced approximation error that performs comparably to the full-scale truncated SVD without degrading the asymptotic computational efficiency associated with ACA matrix assembly.

Reduced-Rank Approximations to the Far-Field Transform in the Gridded Fast Multipole Method

PubMed Central

Hesford, Andrew J.; Waag, Robert C.

2011-01-01

The fast multipole method (FMM) has been shown to have a reduced computational dependence on the size of finest-level groups of elements when the elements are positioned on a regular grid and FFT convolution is used to represent neighboring interactions. However, transformations between plane-wave expansions used for FMM interactions and pressure distributions used for neighboring interactions remain significant contributors to the cost of FMM computations when finest-level groups are large. The transformation operators, which are forward and inverse Fourier transforms with the wave space confined to the unit sphere, are smooth and well approximated using reduced-rank decompositions that further reduce the computational dependence of the FMM on finest-level group size. The adaptive cross approximation (ACA) is selected to represent the forward and adjoint far-field transformation operators required by the FMM. However, the actual error of the ACA is found to be greater than that predicted using traditional estimates, and the ACA generally performs worse than the approximation resulting from a truncated singular-value decomposition (SVD). To overcome these issues while avoiding the cost of a full-scale SVD, the ACA is employed with more stringent accuracy demands and recompressed using a reduced, truncated SVD. The results show a greatly reduced approximation error that performs comparably to the full-scale truncated SVD without degrading the asymptotic computational efficiency associated with ACA matrix assembly. PMID:21552350

On the Hausdorff dimension faithfulness connected with Q_{\\infty} -expansion

NASA Astrophysics Data System (ADS)

Liu, Jia; Zhang, Zhenliang

2017-06-01

In this paper, we show that, the family of all possible unions of finitely many consecutive cylinders of the same rank of a Q∞ -expansion is faithful for the Hausdorff dimension calculations. Applying this result, we give a necessary and sufficient condition for the family of all cylinders of the Q∞ -expansion to be faithful for Hausdorff dimension calculation on the unit interval. This answers an open problem mentioned in Albeverio et al (2016 Math. Nachr. at press (https//:doi.org/10.1002/mana.201500471)).

New triangular and quadrilateral plate-bending finite elements

NASA Technical Reports Server (NTRS)

Narayanaswami, R.

1974-01-01

A nonconforming plate-bending finite element of triangular shape and associated quadrilateral elements are developed. The transverse displacement is approximated within the element by a quintic polynomial. The formulation takes into account the effects of transverse shear deformation. Results of the static and dynamic analysis of a square plate, with edges simply supported or clamped, are compared with exact solutions. Good accuracy is obtained in all calculations.

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.

Calculation of flexoelectric deformations of finite-size bodies

NASA Astrophysics Data System (ADS)

Yurkov, A. S.

2015-03-01

The previously developed approximate theory of flexoelectric deformations of finite-size bodies has been considered as applied to three special cases: a uniformly polarized ball, a uniformly polarized circular rod, and a uniformly polarized thin circular plate of an isotropic material. For these cases simple algebraic formulas have been derived. In the case of the ball, the solution is compared with the previously obtained exact solution.

The Magnetic Field of a Finite Solenoid

NASA Technical Reports Server (NTRS)

Callaghan, Edmund E.; Maslen, Stephen H.

1960-01-01

The axial and radial fields at any point inside or outside a finite solenoid with infinitely thin walls are derived. Solution of the equations has been obtained in terms of tabulated complete elliptic integrals. For the axial field an accurate approximation is given in terms of elementary functions. Fields internal and external to the solenoid are presented in graphical form for a wide variety of solenoid lengths.

Dual-scale Galerkin methods for Darcy flow

NASA Astrophysics Data System (ADS)

Wang, Guoyin; Scovazzi, Guglielmo; Nouveau, Léo; Kees, Christopher E.; Rossi, Simone; Colomés, Oriol; Main, Alex

2018-02-01

The discontinuous Galerkin (DG) method has found widespread application in elliptic problems with rough coefficients, of which the Darcy flow equations are a prototypical example. One of the long-standing issues of DG approximations is the overall computational cost, and many different strategies have been proposed, such as the variational multiscale DG method, the hybridizable DG method, the multiscale DG method, the embedded DG method, and the Enriched Galerkin method. In this work, we propose a mixed dual-scale Galerkin method, in which the degrees-of-freedom of a less computationally expensive coarse-scale approximation are linked to the degrees-of-freedom of a base DG approximation. We show that the proposed approach has always similar or improved accuracy with respect to the base DG method, with a considerable reduction in computational cost. For the specific definition of the coarse-scale space, we consider Raviart-Thomas finite elements for the mass flux and piecewise-linear continuous finite elements for the pressure. We provide a complete analysis of stability and convergence of the proposed method, in addition to a study on its conservation and consistency properties. We also present a battery of numerical tests to verify the results of the analysis, and evaluate a number of possible variations, such as using piecewise-linear continuous finite elements for the coarse-scale mass fluxes.

Rank score and permutation testing alternatives for regression quantile estimates

USGS Publications Warehouse

Cade, B.S.; Richards, J.D.; Mielke, P.W.

2006-01-01

Performance of quantile rank score tests used for hypothesis testing and constructing confidence intervals for linear quantile regression estimates (0 ≤ τ ≤ 1) were evaluated by simulation for models with p = 2 and 6 predictors, moderate collinearity among predictors, homogeneous and hetero-geneous errors, small to moderate samples (n = 20–300), and central to upper quantiles (0.50–0.99). Test statistics evaluated were the conventional quantile rank score T statistic distributed as χ2 random variable with q degrees of freedom (where q parameters are constrained by H 0:) and an F statistic with its sampling distribution approximated by permutation. The permutation F-test maintained better Type I errors than the T-test for homogeneous error models with smaller n and more extreme quantiles τ. An F distributional approximation of the F statistic provided some improvements in Type I errors over the T-test for models with > 2 parameters, smaller n, and more extreme quantiles but not as much improvement as the permutation approximation. Both rank score tests required weighting to maintain correct Type I errors when heterogeneity under the alternative model increased to 5 standard deviations across the domain of X. A double permutation procedure was developed to provide valid Type I errors for the permutation F-test when null models were forced through the origin. Power was similar for conditions where both T- and F-tests maintained correct Type I errors but the F-test provided some power at smaller n and extreme quantiles when the T-test had no power because of excessively conservative Type I errors. When the double permutation scheme was required for the permutation F-test to maintain valid Type I errors, power was less than for the T-test with decreasing sample size and increasing quantiles. Confidence intervals on parameters and tolerance intervals for future predictions were constructed based on test inversion for an example application relating trout densities to stream channel width:depth.

On the degrees of freedom of reduced-rank estimators in multivariate regression

PubMed Central

Mukherjee, A.; Chen, K.; Wang, N.; Zhu, J.

2015-01-01

Summary We study the effective degrees of freedom of a general class of reduced-rank estimators for multivariate regression in the framework of Stein's unbiased risk estimation. A finite-sample exact unbiased estimator is derived that admits a closed-form expression in terms of the thresholded singular values of the least-squares solution and hence is readily computable. The results continue to hold in the high-dimensional setting where both the predictor and the response dimensions may be larger than the sample size. The derived analytical form facilitates the investigation of theoretical properties and provides new insights into the empirical behaviour of the degrees of freedom. In particular, we examine the differences and connections between the proposed estimator and a commonly-used naive estimator. The use of the proposed estimator leads to efficient and accurate prediction risk estimation and model selection, as demonstrated by simulation studies and a data example. PMID:26702155

Gene Ranking of RNA-Seq Data via Discriminant Non-Negative Matrix Factorization.

PubMed

Jia, Zhilong; Zhang, Xiang; Guan, Naiyang; Bo, Xiaochen; Barnes, Michael R; Luo, Zhigang

2015-01-01

RNA-sequencing is rapidly becoming the method of choice for studying the full complexity of transcriptomes, however with increasing dimensionality, accurate gene ranking is becoming increasingly challenging. This paper proposes an accurate and sensitive gene ranking method that implements discriminant non-negative matrix factorization (DNMF) for RNA-seq data. To the best of our knowledge, this is the first work to explore the utility of DNMF for gene ranking. When incorporating Fisher's discriminant criteria and setting the reduced dimension as two, DNMF learns two factors to approximate the original gene expression data, abstracting the up-regulated or down-regulated metagene by using the sample label information. The first factor denotes all the genes' weights of two metagenes as the additive combination of all genes, while the second learned factor represents the expression values of two metagenes. In the gene ranking stage, all the genes are ranked as a descending sequence according to the differential values of the metagene weights. Leveraging the nature of NMF and Fisher's criterion, DNMF can robustly boost the gene ranking performance. The Area Under the Curve analysis of differential expression analysis on two benchmarking tests of four RNA-seq data sets with similar phenotypes showed that our proposed DNMF-based gene ranking method outperforms other widely used methods. Moreover, the Gene Set Enrichment Analysis also showed DNMF outweighs others. DNMF is also computationally efficient, substantially outperforming all other benchmarked methods. Consequently, we suggest DNMF is an effective method for the analysis of differential gene expression and gene ranking for RNA-seq data.

Low-Rank Linear Dynamical Systems for Motor Imagery EEG.

PubMed

Zhang, Wenchang; Sun, Fuchun; Tan, Chuanqi; Liu, Shaobo

2016-01-01

The common spatial pattern (CSP) and other spatiospectral feature extraction methods have become the most effective and successful approaches to solve the problem of motor imagery electroencephalography (MI-EEG) pattern recognition from multichannel neural activity in recent years. However, these methods need a lot of preprocessing and postprocessing such as filtering, demean, and spatiospectral feature fusion, which influence the classification accuracy easily. In this paper, we utilize linear dynamical systems (LDSs) for EEG signals feature extraction and classification. LDSs model has lots of advantages such as simultaneous spatial and temporal feature matrix generation, free of preprocessing or postprocessing, and low cost. Furthermore, a low-rank matrix decomposition approach is introduced to get rid of noise and resting state component in order to improve the robustness of the system. Then, we propose a low-rank LDSs algorithm to decompose feature subspace of LDSs on finite Grassmannian and obtain a better performance. Extensive experiments are carried out on public dataset from "BCI Competition III Dataset IVa" and "BCI Competition IV Database 2a." The results show that our proposed three methods yield higher accuracies compared with prevailing approaches such as CSP and CSSP.

An investigation of several numerical procedures for time-asymptotic compressible Navier-Stokes solutions

NASA Technical Reports Server (NTRS)

Rudy, D. H.; Morris, D. J.; Blanchard, D. K.; Cooke, C. H.; Rubin, S. G.

1975-01-01

The status of an investigation of four numerical techniques for the time-dependent compressible Navier-Stokes equations is presented. Results for free shear layer calculations in the Reynolds number range from 1000 to 81000 indicate that a sequential alternating-direction implicit (ADI) finite-difference procedure requires longer computing times to reach steady state than a low-storage hopscotch finite-difference procedure. A finite-element method with cubic approximating functions was found to require excessive computer storage and computation times. A fourth method, an alternating-direction cubic spline technique which is still being tested, is also described.

Singularity formations for a surface wave model

NASA Astrophysics Data System (ADS)

Castro, Angel; Córdoba, Diego; Gancedo, Francisco

2010-11-01

In this paper we study the Burgers equation with a nonlocal term of the form Hu where H is the Hilbert transform. This system has been considered as a quadratic approximation for the dynamics of a free boundary of a vortex patch (see Biello and Hunter 2010 Commun. Pure Appl. Math. LXIII 0303-36 Marsden and Weinstein 1983 Physica D 7 305-23). We prove blowup in finite time for a large class of initial data with finite energy. Considering a more general nonlocal term, of the form ΛαHu for 0 < α < 1, finite time singularity formation is also shown.

Solidification of a binary mixture

NASA Technical Reports Server (NTRS)

Antar, B. N.

1982-01-01

The time dependent concentration and temperature profiles of a finite layer of a binary mixture are investigated during solidification. The coupled time dependent Stefan problem is solved numerically using an implicit finite differencing algorithm with the method of lines. Specifically, the temporal operator is approximated via an implicit finite difference operator resulting in a coupled set of ordinary differential equations for the spatial distribution of the temperature and concentration for each time. Since the resulting differential equations set form a boundary value problem with matching conditions at an unknown spatial point, the method of invariant imbedding is used for its solution.

Electromagnetic finite elements based on a four-potential variational principle

NASA Technical Reports Server (NTRS)

Schuler, James J.; Felippa, Carlos A.

1991-01-01

Electromagnetic finite elements based on a variational principle that uses the electromagnetic four-potential as a primary variable are derived. This choice is used to construct elements suitable for downstream coupling with mechanical and thermal finite elements for the analysis of electromagnetic/mechanical systems that involve superconductors. The main advantages of the four-potential as a basis for finite element formulation are that the number of degrees of freedom per node remains modest as the problem dimensionally increases, that jump discontinuities on interfaces are naturally accommodated, and that statics as well as dynamics may be treated without any a priori approximations. The new elements are tested on an axisymmetric problem under steady state forcing conditions. The results are in excellent agreement with analytical solutions.

Development of an hp-version finite element method for computational optimal control

NASA Technical Reports Server (NTRS)

Hodges, Dewey H.; Warner, Michael S.

1993-01-01

The purpose of this research effort is to develop a means to use, and to ultimately implement, hp-version finite elements in the numerical solution of optimal control problems. The hybrid MACSYMA/FORTRAN code GENCODE was developed which utilized h-version finite elements to successfully approximate solutions to a wide class of optimal control problems. In that code the means for improvement of the solution was the refinement of the time-discretization mesh. With the extension to hp-version finite elements, the degrees of freedom include both nodal values and extra interior values associated with the unknown states, co-states, and controls, the number of which depends on the order of the shape functions in each element.

Random phase approximation and cluster mean field studies of hard core Bose Hubbard model

NASA Astrophysics Data System (ADS)

Alavani, Bhargav K.; Gaude, Pallavi P.; Pai, Ramesh V.

2018-04-01

We investigate zero temperature and finite temperature properties of the Bose Hubbard Model in the hard core limit using Random Phase Approximation (RPA) and Cluster Mean Field Theory (CMFT). We show that our RPA calculations are able to capture quantum and thermal fluctuations significantly better than CMFT.

Continuum calculations of continental deformation in transcurrent environments

NASA Technical Reports Server (NTRS)

Sonder, L. J.; England, P. C.; Houseman, G. A.

1986-01-01

A thin viscous sheet approximation is used to investigate continental deformation near a strike-slip boundary. The vertically averaged velocity field is calculated for a medium characterized by a power law rheology with stress exponent n. Driving stresses include those applied along boundaries of the sheet and those arising from buoyancy forces related to lateral differences in crustal thickness. Exact and approximate analytic solutions for a region with a sinusoidal strike-slip boundary condition are compared with solutions for more geologically relevant boundary conditions obtained using a finite element technique. The across-strike length scale of the deformation is approximately 1/4pi x sq rt n times the dominant wavelength of the imposed strike-slip boundary condition for both the analytic and the numerical solutions; this result is consistent with length scales observed in continental regions of large-scale transcurrent faulting. An approximate, linear relationship between displacement and rotation is found that depends only on the deformation length scale and the rheology. Calculated displacements, finite rotations, and distribution of crustal thicknesses are consistent with those observed in the region of the Pacific-North America plate boundary in California.

Iso-geometric analysis for neutron diffusion problems

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

Hall, S. K.; Eaton, M. D.; Williams, M. M. R.

Iso-geometric analysis can be viewed as a generalisation of the finite element method. It permits the exact representation of a wider range of geometries including conic sections. This is possible due to the use of concepts employed in computer-aided design. The underlying mathematical representations from computer-aided design are used to capture both the geometry and approximate the solution. In this paper the neutron diffusion equation is solved using iso-geometric analysis. The practical advantages are highlighted by looking at the problem of a circular fuel pin in a square moderator. For this problem the finite element method requires the geometry tomore » be approximated. This leads to errors in the shape and size of the interface between the fuel and the moderator. In contrast to this iso-geometric analysis allows the interface to be represented exactly. It is found that, due to a cancellation of errors, the finite element method converges more quickly than iso-geometric analysis for this problem. A fuel pin in a vacuum was then considered as this problem is highly sensitive to the leakage across the interface. In this case iso-geometric analysis greatly outperforms the finite element method. Due to the improvement in the representation of the geometry iso-geometric analysis can outperform traditional finite element methods. It is proposed that the use of iso-geometric analysis on neutron transport problems will allow deterministic solutions to be obtained for exact geometries. Something that is only currently possible with Monte Carlo techniques. (authors)« less

Slave finite elements: The temporal element approach to nonlinear analysis

NASA Technical Reports Server (NTRS)

Gellin, S.

1984-01-01

A formulation method for finite elements in space and time incorporating nonlinear geometric and material behavior is presented. The method uses interpolation polynomials for approximating the behavior of various quantities over the element domain, and only explicit integration over space and time. While applications are general, the plate and shell elements that are currently being programmed are appropriate to model turbine blades, vanes, and combustor liners.

Exact finite elements for conduction and convection

NASA Technical Reports Server (NTRS)

Thornton, E. A.; Dechaumphai, P.; Tamma, K. K.

1981-01-01

An approach for developing exact one dimensional conduction-convection finite elements is presented. Exact interpolation functions are derived based on solutions to the governing differential equations by employing a nodeless parameter. Exact interpolation functions are presented for combined heat transfer in several solids of different shapes, and for combined heat transfer in a flow passage. Numerical results demonstrate that exact one dimensional elements offer advantages over elements based on approximate interpolation functions.

Improved Regional Seismic Event Locations Using 3-D Velocity Models

DTIC Science & Technology

1999-12-15

regional velocity model to estimate event hypocenters. Travel times for the regional phases are calculated using a sophisticated eikonal finite...can greatly improve estimates of event locations. Our algorithm calculates travel times using a finite difference approximation of the eikonal ...such as IASP91 or J-B. 3-D velocity models require more sophisticated travel time modeling routines; thus, we use a 3-D eikonal equation solver

Modular synchronization in complex networks.

PubMed

Oh, E; Rho, K; Hong, H; Kahng, B

2005-10-01

We study the synchronization transition (ST) of a modified Kuramoto model on two different types of modular complex networks. It is found that the ST depends on the type of intermodular connections. For the network with decentralized (centralized) intermodular connections, the ST occurs at finite coupling constant (behaves abnormally). Such distinct features are found in the yeast protein interaction network and the Internet, respectively. Moreover, by applying the finite-size scaling analysis to an artificial network with decentralized intermodular connections, we obtain the exponent associated with the order parameter of the ST to be beta approximately 1 different from beta(MF) approximately 1/2 obtained from the scale-free network with the same degree distribution but the absence of modular structure, corresponding to the mean field value.

Experiences on p-Version Time-Discontinuous Galerkin's Method for Nonlinear Heat Transfer Analysis and Sensitivity Analysis

NASA Technical Reports Server (NTRS)

Hou, Gene

2004-01-01

The focus of this research is on the development of analysis and sensitivity analysis equations for nonlinear, transient heat transfer problems modeled by p-version, time discontinuous finite element approximation. The resulting matrix equation of the state equation is simply in the form ofA(x)x = c, representing a single step, time marching scheme. The Newton-Raphson's method is used to solve the nonlinear equation. Examples are first provided to demonstrate the accuracy characteristics of the resultant finite element approximation. A direct differentiation approach is then used to compute the thermal sensitivities of a nonlinear heat transfer problem. The report shows that only minimal coding effort is required to enhance the analysis code with the sensitivity analysis capability.

On approximation of non-Newtonian fluid flow by the finite element method

NASA Astrophysics Data System (ADS)

Svácek, Petr

2008-08-01

In this paper the problem of numerical approximation of non-Newtonian fluid flow with free surface is considered. Namely, the flow of fresh concrete is addressed. Industrial mixtures often behaves like non-Newtonian fluids exhibiting a yield stress that needs to be overcome for the flow to take place, cf. [R.B. Bird, R.C. Armstrong, O. Hassager, Dynamics of Polymeric Liquids, vol. 1, Fluid Mechanics, Wiley, New York, 1987; R.P. Chhabra, J.F. Richardson, Non-Newtonian Flow in the Process Industries, Butterworth-Heinemann, London, 1999]. The main interest is paid to the mathematical formulation of the problem and to discretization with the aid of finite element method. The described numerical procedure is applied onto the solution of several problems.

Computational methods for the identification of spatially varying stiffness and damping in beams

NASA Technical Reports Server (NTRS)

Banks, H. T.; Rosen, I. G.

1986-01-01

A numerical approximation scheme for the estimation of functional parameters in Euler-Bernoulli models for the transverse vibration of flexible beams with tip bodies is developed. The method permits the identification of spatially varying flexural stiffness and Voigt-Kelvin viscoelastic damping coefficients which appear in the hybrid system of ordinary and partial differential equations and boundary conditions describing the dynamics of such structures. An inverse problem is formulated as a least squares fit to data subject to constraints in the form of a vector system of abstract first order evolution equations. Spline-based finite element approximations are used to finite dimensionalize the problem. Theoretical convergence results are given and numerical studies carried out on both conventional (serial) and vector computers are discussed.

FELIX-1.0: A finite element solver for the time dependent generator coordinate method with the Gaussian overlap approximation

DOE PAGES

Regnier, D.; Verriere, M.; Dubray, N.; ...

2015-11-30

In this study, we describe the software package FELIX that solves the equations of the time-dependent generator coordinate method (TDGCM) in NN-dimensions (N ≥ 1) under the Gaussian overlap approximation. The numerical resolution is based on the Galerkin finite element discretization of the collective space and the Crank–Nicolson scheme for time integration. The TDGCM solver is implemented entirely in C++. Several additional tools written in C++, Python or bash scripting language are also included for convenience. In this paper, the solver is tested with a series of benchmarks calculations. We also demonstrate the ability of our code to handle amore » realistic calculation of fission dynamics.« less

Approximate minimum-time trajectories for 2-link flexible manipulators

NASA Technical Reports Server (NTRS)

Eisler, G. R.; Segalman, D. J.; Robinett, R. D.

1989-01-01

Powell's nonlinear programming code, VF02AD, was used to generate approximate minimum-time tip trajectories for 2-link semi-rigid and flexible manipulator movements in the horizontal plane. The manipulator is modeled with an efficient finite-element scheme for an n-link, m-joint system with horizontal-plane bending only. Constraints on the trajectory include boundary conditions on position and energy for a rest-to-rest maneuver, straight-line tracking between boundary positions, and motor torque limits. Trajectory comparisons utilize a change in the link stiffness, EI, to transition from the semi-rigid to flexible case. Results show the level of compliance necessary to excite significant modal behavior. Quiescence of the final configuration is examined with the finite-element model.

On improving the iterative convergence properties of an implicit approximate-factorization finite difference algorithm. [considering transonic flow

NASA Technical Reports Server (NTRS)

Desideri, J. A.; Steger, J. L.; Tannehill, J. C.

1978-01-01

The iterative convergence properties of an approximate-factorization implicit finite-difference algorithm are analyzed both theoretically and numerically. Modifications to the base algorithm were made to remove the inconsistency in the original implementation of artificial dissipation. In this way, the steady-state solution became independent of the time-step, and much larger time-steps can be used stably. To accelerate the iterative convergence, large time-steps and a cyclic sequence of time-steps were used. For a model transonic flow problem governed by the Euler equations, convergence was achieved with 10 times fewer time-steps using the modified differencing scheme. A particular form of instability due to variable coefficients is also analyzed.

Comparisons of Particle Tracking Techniques and Galerkin Finite Element Methods in Flow Simulations on Watershed Scales

NASA Astrophysics Data System (ADS)

Shih, D.; Yeh, G.

2009-12-01

This paper applies two numerical approximations, the particle tracking technique and Galerkin finite element method, to solve the diffusive wave equation in both one-dimensional and two-dimensional flow simulations. The finite element method is one of most commonly approaches in numerical problems. It can obtain accurate solutions, but calculation times may be rather extensive. The particle tracking technique, using either single-velocity or average-velocity tracks to efficiently perform advective transport, could use larger time-step sizes than the finite element method to significantly save computational time. Comparisons of the alternative approximations are examined in this poster. We adapt the model WASH123D to examine the work. WASH123D is an integrated multimedia, multi-processes, physics-based computational model suitable for various spatial-temporal scales, was first developed by Yeh et al., at 1998. The model has evolved in design capability and flexibility, and has been used for model calibrations and validations over the course of many years. In order to deliver a locally hydrological model in Taiwan, the Taiwan Typhoon and Flood Research Institute (TTFRI) is working with Prof. Yeh to develop next version of WASH123D. So, the work of our preliminary cooperationx is also sketched in this poster.

Combination of the discontinuous Galerkin method with finite differences for simulation of seismic wave propagation

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

Lisitsa, Vadim, E-mail: lisitsavv@ipgg.sbras.ru; Novosibirsk State University, Novosibirsk; Tcheverda, Vladimir

We present an algorithm for the numerical simulation of seismic wave propagation in models with a complex near surface part and free surface topography. The approach is based on the combination of finite differences with the discontinuous Galerkin method. The discontinuous Galerkin method can be used on polyhedral meshes; thus, it is easy to handle the complex surfaces in the models. However, this approach is computationally intense in comparison with finite differences. Finite differences are computationally efficient, but in general, they require rectangular grids, leading to the stair-step approximation of the interfaces, which causes strong diffraction of the wavefield. Inmore » this research we present a hybrid algorithm where the discontinuous Galerkin method is used in a relatively small upper part of the model and finite differences are applied to the main part of the model.« less

On the validation of seismic imaging methods: Finite frequency or ray theory?

DOE PAGES

Maceira, Monica; Larmat, Carene; Porritt, Robert W.; ...

2015-01-23

We investigate the merits of the more recently developed finite-frequency approach to tomography against the more traditional and approximate ray theoretical approach for state of the art seismic models developed for western North America. To this end, we employ the spectral element method to assess the agreement between observations on real data and measurements made on synthetic seismograms predicted by the models under consideration. We check for phase delay agreement as well as waveform cross-correlation values. Based on statistical analyses on S wave phase delay measurements, finite frequency shows an improvement over ray theory. Random sampling using cross-correlation values identifiesmore » regions where synthetic seismograms computed with ray theory and finite-frequency models differ the most. Our study suggests that finite-frequency approaches to seismic imaging exhibit measurable improvement for pronounced low-velocity anomalies such as mantle plumes.« less

Finite element computation of a viscous compressible free shear flow governed by the time dependent Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Cooke, C. H.; Blanchard, D. K.

1975-01-01

A finite element algorithm for solution of fluid flow problems characterized by the two-dimensional compressible Navier-Stokes equations was developed. The program is intended for viscous compressible high speed flow; hence, primitive variables are utilized. The physical solution was approximated by trial functions which at a fixed time are piecewise cubic on triangular elements. The Galerkin technique was employed to determine the finite-element model equations. A leapfrog time integration is used for marching asymptotically from initial to steady state, with iterated integrals evaluated by numerical quadratures. The nonsymmetric linear systems of equations governing time transition from step-to-step are solved using a rather economical block iterative triangular decomposition scheme. The concept was applied to the numerical computation of a free shear flow. Numerical results of the finite-element method are in excellent agreement with those obtained from a finite difference solution of the same problem.

Accurate computation of survival statistics in genome-wide studies.

PubMed

Vandin, Fabio; Papoutsaki, Alexandra; Raphael, Benjamin J; Upfal, Eli

2015-05-01

A key challenge in genomics is to identify genetic variants that distinguish patients with different survival time following diagnosis or treatment. While the log-rank test is widely used for this purpose, nearly all implementations of the log-rank test rely on an asymptotic approximation that is not appropriate in many genomics applications. This is because: the two populations determined by a genetic variant may have very different sizes; and the evaluation of many possible variants demands highly accurate computation of very small p-values. We demonstrate this problem for cancer genomics data where the standard log-rank test leads to many false positive associations between somatic mutations and survival time. We develop and analyze a novel algorithm, Exact Log-rank Test (ExaLT), that accurately computes the p-value of the log-rank statistic under an exact distribution that is appropriate for any size populations. We demonstrate the advantages of ExaLT on data from published cancer genomics studies, finding significant differences from the reported p-values. We analyze somatic mutations in six cancer types from The Cancer Genome Atlas (TCGA), finding mutations with known association to survival as well as several novel associations. In contrast, standard implementations of the log-rank test report dozens-hundreds of likely false positive associations as more significant than these known associations.

Accurate Computation of Survival Statistics in Genome-Wide Studies

PubMed Central

Vandin, Fabio; Papoutsaki, Alexandra; Raphael, Benjamin J.; Upfal, Eli

2015-01-01

A key challenge in genomics is to identify genetic variants that distinguish patients with different survival time following diagnosis or treatment. While the log-rank test is widely used for this purpose, nearly all implementations of the log-rank test rely on an asymptotic approximation that is not appropriate in many genomics applications. This is because: the two populations determined by a genetic variant may have very different sizes; and the evaluation of many possible variants demands highly accurate computation of very small p-values. We demonstrate this problem for cancer genomics data where the standard log-rank test leads to many false positive associations between somatic mutations and survival time. We develop and analyze a novel algorithm, Exact Log-rank Test (ExaLT), that accurately computes the p-value of the log-rank statistic under an exact distribution that is appropriate for any size populations. We demonstrate the advantages of ExaLT on data from published cancer genomics studies, finding significant differences from the reported p-values. We analyze somatic mutations in six cancer types from The Cancer Genome Atlas (TCGA), finding mutations with known association to survival as well as several novel associations. In contrast, standard implementations of the log-rank test report dozens-hundreds of likely false positive associations as more significant than these known associations. PMID:25950620

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

Compressed sparse tensor based quadrature for vibrational quantum mechanics integrals

DOE PAGES

Rai, Prashant; Sargsyan, Khachik; Najm, Habib N.

2018-03-20

A new method for fast evaluation of high dimensional integrals arising in quantum mechanics is proposed. Here, the method is based on sparse approximation of a high dimensional function followed by a low-rank compression. In the first step, we interpret the high dimensional integrand as a tensor in a suitable tensor product space and determine its entries by a compressed sensing based algorithm using only a few function evaluations. Secondly, we implement a rank reduction strategy to compress this tensor in a suitable low-rank tensor format using standard tensor compression tools. This allows representing a high dimensional integrand function asmore » a small sum of products of low dimensional functions. Finally, a low dimensional Gauss–Hermite quadrature rule is used to integrate this low-rank representation, thus alleviating the curse of dimensionality. Finally, numerical tests on synthetic functions, as well as on energy correction integrals for water and formaldehyde molecules demonstrate the efficiency of this method using very few function evaluations as compared to other integration strategies.« less

Basic Psychiatric Literature: I. Books*†

PubMed Central

Woods, Joan B.; Pieper, Sam; Frazier, Shervert H.

1968-01-01

Widely varying recommended reading lists for psychiatry residents were obtained from 140 AMA-approved training programs. Approximately 4,000 articles, 2,800 books, and 200 serials were listed. The number of recommendations for each book was counted, and a rank-order determined. A second rank-order was determined from the lists of those eighty-seven programs which indicated that their material covered the “basic” literature; a third rank-order was determined from the number of residents using the lists. All rank-orders agreed on the “most recommended” book and the first eighteen books; there was a 92 percent correlation through the first 453 books. One-third of the “basic” recommendations were for the first 104 books; one-third for the next 349 books, and one-third for the remaining 1,994 books. The subject matter of the first 104 books indicated that the currently most popular subjects in psychiatry are psychoanalytic theories of personality, schizophrenia, psychotherapy, and child psychiatry. A list of the 104 most recommended books is appended. PMID:4874980

Compressed sparse tensor based quadrature for vibrational quantum mechanics integrals

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

Rai, Prashant; Sargsyan, Khachik; Najm, Habib N.

A new method for fast evaluation of high dimensional integrals arising in quantum mechanics is proposed. Here, the method is based on sparse approximation of a high dimensional function followed by a low-rank compression. In the first step, we interpret the high dimensional integrand as a tensor in a suitable tensor product space and determine its entries by a compressed sensing based algorithm using only a few function evaluations. Secondly, we implement a rank reduction strategy to compress this tensor in a suitable low-rank tensor format using standard tensor compression tools. This allows representing a high dimensional integrand function asmore » a small sum of products of low dimensional functions. Finally, a low dimensional Gauss–Hermite quadrature rule is used to integrate this low-rank representation, thus alleviating the curse of dimensionality. Finally, numerical tests on synthetic functions, as well as on energy correction integrals for water and formaldehyde molecules demonstrate the efficiency of this method using very few function evaluations as compared to other integration strategies.« less

Efficient Multiple Kernel Learning Algorithms Using Low-Rank Representation.

PubMed

Niu, Wenjia; Xia, Kewen; Zu, Baokai; Bai, Jianchuan

2017-01-01

Unlike Support Vector Machine (SVM), Multiple Kernel Learning (MKL) allows datasets to be free to choose the useful kernels based on their distribution characteristics rather than a precise one. It has been shown in the literature that MKL holds superior recognition accuracy compared with SVM, however, at the expense of time consuming computations. This creates analytical and computational difficulties in solving MKL algorithms. To overcome this issue, we first develop a novel kernel approximation approach for MKL and then propose an efficient Low-Rank MKL (LR-MKL) algorithm by using the Low-Rank Representation (LRR). It is well-acknowledged that LRR can reduce dimension while retaining the data features under a global low-rank constraint. Furthermore, we redesign the binary-class MKL as the multiclass MKL based on pairwise strategy. Finally, the recognition effect and efficiency of LR-MKL are verified on the datasets Yale, ORL, LSVT, and Digit. Experimental results show that the proposed LR-MKL algorithm is an efficient kernel weights allocation method in MKL and boosts the performance of MKL largely.

An approach for including the stiffness and damping of elastohydrodynamic point contacts in deep groove ball bearing equilibrium models

NASA Astrophysics Data System (ADS)

Nonato, Fábio; Cavalca, Katia L.

2014-12-01

This work presents a methodology for including the Elastohydrodynamic (EHD) film effects to a lateral vibration model of a deep groove ball bearing by using a novel approximation for the EHD contacts by a set of equivalent nonlinear spring and viscous damper. The fitting of the equivalent contact model used the results of a transient multi-level finite difference EHD algorithm to adjust the dynamic parameters. The comparison between the approximated model and the finite difference simulated results showed a suitable representation of the stationary and dynamic contact behaviors. The linear damping hypothesis could be shown as a rough representation of the actual hysteretic behavior of the EHD contact. Nevertheless, the overall accuracy of the model was not impaired by the use of such approximation. Further on, the inclusion of the equivalent EHD contact model is equated for both the restoring and the dissipative components of the bearing's lateral dynamics. The derived model was used to investigate the effects of the rolling element bearing lubrication on the vibration response of a rotor's lumped parameter model. The fluid film stiffening effect, previously only observable by experimentation, could be quantified using the proposed model, as well as the portion of the bearing damping provided by the EHD fluid film. Results from a laboratory rotor-bearing test rig were used to indirectly validate the proposed contact approximation. A finite element model of the rotor accounting for the lubricated bearing formulation adequately portrayed the frequency content of the bearing orbits observed on the test rig.

Finite-dimensional compensators for infinite-dimensional systems via Galerkin-type approximation

NASA Technical Reports Server (NTRS)

Ito, Kazufumi

1990-01-01

In this paper existence and construction of stabilizing compensators for linear time-invariant systems defined on Hilbert spaces are discussed. An existence result is established using Galkerin-type approximations in which independent basis elements are used instead of the complete set of eigenvectors. A design procedure based on approximate solutions of the optimal regulator and optimal observer via Galerkin-type approximation is given and the Schumacher approach is used to reduce the dimension of compensators. A detailed discussion for parabolic and hereditary differential systems is included.

The application of Legendre-tau approximation to parameter identification for delay and partial differential equations

NASA Technical Reports Server (NTRS)

Ito, K.

1983-01-01

Approximation schemes based on Legendre-tau approximation are developed for application to parameter identification problem for delay and partial differential equations. The tau method is based on representing the approximate solution as a truncated series of orthonormal functions. The characteristic feature of the Legendre-tau approach is that when the solution to a problem is infinitely differentiable, the rate of convergence is faster than any finite power of 1/N; higher accuracy is thus achieved, making the approach suitable for small N.

High Order Well-balanced WENO Scheme for the Gas Dynamics Equations under Gravitational Fields

DTIC Science & Technology

2011-11-12

there exists the hydrostatic balance where the flux produced by the pressure is canceled by the gravitational source term. Many astro - physical...approximation to W (x) to obtain an approximation to W ′(xi) = fx (U(xi, yj)). See again [7, 15] for more details of finite difference WENO schemes in

A finite state projection algorithm for the stationary solution of the chemical master equation.

PubMed

Gupta, Ankit; Mikelson, Jan; Khammash, Mustafa

2017-10-21

The chemical master equation (CME) is frequently used in systems biology to quantify the effects of stochastic fluctuations that arise due to biomolecular species with low copy numbers. The CME is a system of ordinary differential equations that describes the evolution of probability density for each population vector in the state-space of the stochastic reaction dynamics. For many examples of interest, this state-space is infinite, making it difficult to obtain exact solutions of the CME. To deal with this problem, the Finite State Projection (FSP) algorithm was developed by Munsky and Khammash [J. Chem. Phys. 124(4), 044104 (2006)], to provide approximate solutions to the CME by truncating the state-space. The FSP works well for finite time-periods but it cannot be used for estimating the stationary solutions of CMEs, which are often of interest in systems biology. The aim of this paper is to develop a version of FSP which we refer to as the stationary FSP (sFSP) that allows one to obtain accurate approximations of the stationary solutions of a CME by solving a finite linear-algebraic system that yields the stationary distribution of a continuous-time Markov chain over the truncated state-space. We derive bounds for the approximation error incurred by sFSP and we establish that under certain stability conditions, these errors can be made arbitrarily small by appropriately expanding the truncated state-space. We provide several examples to illustrate our sFSP method and demonstrate its efficiency in estimating the stationary distributions. In particular, we show that using a quantized tensor-train implementation of our sFSP method, problems admitting more than 100 × 10 6 states can be efficiently solved.

Modeling hemodynamics in intracranial aneurysms: Comparing accuracy of CFD solvers based on finite element and finite volume schemes.

PubMed

Botti, Lorenzo; Paliwal, Nikhil; Conti, Pierangelo; Antiga, Luca; Meng, Hui

2018-06-01

Image-based computational fluid dynamics (CFD) has shown potential to aid in the clinical management of intracranial aneurysms (IAs) but its adoption in the clinical practice has been missing, partially due to lack of accuracy assessment and sensitivity analysis. To numerically solve the flow-governing equations CFD solvers generally rely on two spatial discretization schemes: Finite Volume (FV) and Finite Element (FE). Since increasingly accurate numerical solutions are obtained by different means, accuracies and computational costs of FV and FE formulations cannot be compared directly. To this end, in this study we benchmark two representative CFD solvers in simulating flow in a patient-specific IA model: (1) ANSYS Fluent, a commercial FV-based solver and (2) VMTKLab multidGetto, a discontinuous Galerkin (dG) FE-based solver. The FV solver's accuracy is improved by increasing the spatial mesh resolution (134k, 1.1m, 8.6m and 68.5m tetrahedral element meshes). The dGFE solver accuracy is increased by increasing the degree of polynomials (first, second, third and fourth degree) on the base 134k tetrahedral element mesh. Solutions from best FV and dGFE approximations are used as baseline for error quantification. On average, velocity errors for second-best approximations are approximately 1cm/s for a [0,125]cm/s velocity magnitude field. Results show that high-order dGFE provide better accuracy per degree of freedom but worse accuracy per Jacobian non-zero entry as compared to FV. Cross-comparison of velocity errors demonstrates asymptotic convergence of both solvers to the same numerical solution. Nevertheless, the discrepancy between under-resolved velocity fields suggests that mesh independence is reached following different paths. This article is protected by copyright. All rights reserved.

Adaptive finite-volume WENO schemes on dynamically redistributed grids for compressible Euler equations

NASA Astrophysics Data System (ADS)

Pathak, Harshavardhana S.; Shukla, Ratnesh K.

2016-08-01

A high-order adaptive finite-volume method is presented for simulating inviscid compressible flows on time-dependent redistributed grids. The method achieves dynamic adaptation through a combination of time-dependent mesh node clustering in regions characterized by strong solution gradients and an optimal selection of the order of accuracy and the associated reconstruction stencil in a conservative finite-volume framework. This combined approach maximizes spatial resolution in discontinuous regions that require low-order approximations for oscillation-free shock capturing. Over smooth regions, high-order discretization through finite-volume WENO schemes minimizes numerical dissipation and provides excellent resolution of intricate flow features. The method including the moving mesh equations and the compressible flow solver is formulated entirely on a transformed time-independent computational domain discretized using a simple uniform Cartesian mesh. Approximations for the metric terms that enforce discrete geometric conservation law while preserving the fourth-order accuracy of the two-point Gaussian quadrature rule are developed. Spurious Cartesian grid induced shock instabilities such as carbuncles that feature in a local one-dimensional contact capturing treatment along the cell face normals are effectively eliminated through upwind flux calculation using a rotated Hartex-Lax-van Leer contact resolving (HLLC) approximate Riemann solver for the Euler equations in generalized coordinates. Numerical experiments with the fifth and ninth-order WENO reconstructions at the two-point Gaussian quadrature nodes, over a range of challenging test cases, indicate that the redistributed mesh effectively adapts to the dynamic flow gradients thereby improving the solution accuracy substantially even when the initial starting mesh is non-adaptive. The high adaptivity combined with the fifth and especially the ninth-order WENO reconstruction allows remarkably sharp capture of discontinuous propagating shocks with simultaneous resolution of smooth yet complex small scale unsteady flow features to an exceptional detail.

A finite state projection algorithm for the stationary solution of the chemical master equation

NASA Astrophysics Data System (ADS)

Gupta, Ankit; Mikelson, Jan; Khammash, Mustafa

2017-10-01

The chemical master equation (CME) is frequently used in systems biology to quantify the effects of stochastic fluctuations that arise due to biomolecular species with low copy numbers. The CME is a system of ordinary differential equations that describes the evolution of probability density for each population vector in the state-space of the stochastic reaction dynamics. For many examples of interest, this state-space is infinite, making it difficult to obtain exact solutions of the CME. To deal with this problem, the Finite State Projection (FSP) algorithm was developed by Munsky and Khammash [J. Chem. Phys. 124(4), 044104 (2006)], to provide approximate solutions to the CME by truncating the state-space. The FSP works well for finite time-periods but it cannot be used for estimating the stationary solutions of CMEs, which are often of interest in systems biology. The aim of this paper is to develop a version of FSP which we refer to as the stationary FSP (sFSP) that allows one to obtain accurate approximations of the stationary solutions of a CME by solving a finite linear-algebraic system that yields the stationary distribution of a continuous-time Markov chain over the truncated state-space. We derive bounds for the approximation error incurred by sFSP and we establish that under certain stability conditions, these errors can be made arbitrarily small by appropriately expanding the truncated state-space. We provide several examples to illustrate our sFSP method and demonstrate its efficiency in estimating the stationary distributions. In particular, we show that using a quantized tensor-train implementation of our sFSP method, problems admitting more than 100 × 106 states can be efficiently solved.

Experimental congruence of interval scale production from paired comparisons and ranking for image evaluation

NASA Astrophysics Data System (ADS)

Handley, John C.; Babcock, Jason S.; Pelz, Jeff B.

2003-12-01

Image evaluation tasks are often conducted using paired comparisons or ranking. To elicit interval scales, both methods rely on Thurstone's Law of Comparative Judgment in which objects closer in psychological space are more often confused in preference comparisons by a putative discriminal random process. It is often debated whether paired comparisons and ranking yield the same interval scales. An experiment was conducted to assess scale production using paired comparisons and ranking. For this experiment a Pioneer Plasma Display and Apple Cinema Display were used for stimulus presentation. Observers performed rank order and paired comparisons tasks on both displays. For each of five scenes, six images were created by manipulating attributes such as lightness, chroma, and hue using six different settings. The intention was to simulate the variability from a set of digital cameras or scanners. Nineteen subjects, (5 females, 14 males) ranging from 19-51 years of age participated in this experiment. Using a paired comparison model and a ranking model, scales were estimated for each display and image combination yielding ten scale pairs, ostensibly measuring the same psychological scale. The Bradley-Terry model was used for the paired comparisons data and the Bradley-Terry-Mallows model was used for the ranking data. Each model was fit using maximum likelihood estimation and assessed using likelihood ratio tests. Approximate 95% confidence intervals were also constructed using likelihood ratios. Model fits for paired comparisons were satisfactory for all scales except those from two image/display pairs; the ranking model fit uniformly well on all data sets. Arguing from overlapping confidence intervals, we conclude that paired comparisons and ranking produce no conflicting decisions regarding ultimate ordering of treatment preferences, but paired comparisons yield greater precision at the expense of lack-of-fit.

Optimal mapping of irregular finite element domains to parallel processors

NASA Technical Reports Server (NTRS)

Flower, J.; Otto, S.; Salama, M.

1987-01-01

Mapping the solution domain of n-finite elements into N-subdomains that may be processed in parallel by N-processors is an optimal one if the subdomain decomposition results in a well-balanced workload distribution among the processors. The problem is discussed in the context of irregular finite element domains as an important aspect of the efficient utilization of the capabilities of emerging multiprocessor computers. Finding the optimal mapping is an intractable combinatorial optimization problem, for which a satisfactory approximate solution is obtained here by analogy to a method used in statistical mechanics for simulating the annealing process in solids. The simulated annealing analogy and algorithm are described, and numerical results are given for mapping an irregular two-dimensional finite element domain containing a singularity onto the Hypercube computer.

Development of low-frequency kernel-function aerodynamics for comparison with time-dependent finite-difference methods

NASA Technical Reports Server (NTRS)

Bland, S. R.

1982-01-01

Finite difference methods for unsteady transonic flow frequency use simplified equations in which certain of the time dependent terms are omitted from the governing equations. Kernel functions are derived for two dimensional subsonic flow, and provide accurate solutions of the linearized potential equation with the same time dependent terms omitted. These solutions make possible a direct evaluation of the finite difference codes for the linear problem. Calculations with two of these low frequency kernel functions verify the accuracy of the LTRAN2 and HYTRAN2 finite difference codes. Comparisons of the low frequency kernel function results with the Possio kernel function solution of the complete linear equations indicate the adequacy of the HYTRAN approximation for frequencies in the range of interest for flutter calculations.

Recovering task fMRI signals from highly under-sampled data with low-rank and temporal subspace constraints.

PubMed

Chiew, Mark; Graedel, Nadine N; Miller, Karla L

2018-07-01

Recent developments in highly accelerated fMRI data acquisition have employed low-rank and/or sparsity constraints for image reconstruction, as an alternative to conventional, time-independent parallel imaging. When under-sampling factors are high or the signals of interest are low-variance, however, functional data recovery can be poor or incomplete. We introduce a method for improving reconstruction fidelity using external constraints, like an experimental design matrix, to partially orient the estimated fMRI temporal subspace. Combining these external constraints with low-rank constraints introduces a new image reconstruction model that is analogous to using a mixture of subspace-decomposition (PCA/ICA) and regression (GLM) models in fMRI analysis. We show that this approach improves fMRI reconstruction quality in simulations and experimental data, focusing on the model problem of detecting subtle 1-s latency shifts between brain regions in a block-design task-fMRI experiment. Successful latency discrimination is shown at acceleration factors up to R = 16 in a radial-Cartesian acquisition. We show that this approach works with approximate, or not perfectly informative constraints, where the derived benefit is commensurate with the information content contained in the constraints. The proposed method extends low-rank approximation methods for under-sampled fMRI data acquisition by leveraging knowledge of expected task-based variance in the data, enabling improvements in the speed and efficiency of fMRI data acquisition without the loss of subtle features. Copyright © 2018 The Authors. Published by Elsevier Inc. All rights reserved.

Multireference configuration interaction theory using cumulant reconstruction with internal contraction of density matrix renormalization group wave function.

PubMed

Saitow, Masaaki; Kurashige, Yuki; Yanai, Takeshi

2013-07-28

We report development of the multireference configuration interaction (MRCI) method that can use active space scalable to much larger size references than has previously been possible. The recent development of the density matrix renormalization group (DMRG) method in multireference quantum chemistry offers the ability to describe static correlation in a large active space. The present MRCI method provides a critical correction to the DMRG reference by including high-level dynamic correlation through the CI treatment. When the DMRG and MRCI theories are combined (DMRG-MRCI), the full internal contraction of the reference in the MRCI ansatz, including contraction of semi-internal states, plays a central role. However, it is thought to involve formidable complexity because of the presence of the five-particle rank reduced-density matrix (RDM) in the Hamiltonian matrix elements. To address this complexity, we express the Hamiltonian matrix using commutators, which allows the five-particle rank RDM to be canceled out without any approximation. Then we introduce an approximation to the four-particle rank RDM by using a cumulant reconstruction from lower-particle rank RDMs. A computer-aided approach is employed to derive the exceedingly complex equations of the MRCI in tensor-contracted form and to implement them into an efficient parallel computer code. This approach extends to the size-consistency-corrected variants of MRCI, such as the MRCI+Q, MR-ACPF, and MR-AQCC methods. We demonstrate the capability of the DMRG-MRCI method in several benchmark applications, including the evaluation of single-triplet gap of free-base porphyrin using 24 active orbitals.

Life satisfaction and quality in Korean War veterans five decades after the war.

PubMed

Ikin, J F; Sim, M R; McKenzie, D P; Horsley, K W A; Wilson, E J; Harrex, W K; Moore, M R; Jelfs, P L; Henderson, S

2009-05-01

Military service is considered to be a hidden variable underlying current knowledge about well-being in the elderly. This study aimed to examine life satisfaction and quality of life in Australia's surviving male Korean War veterans and a community comparison group, and to investigate any association with war deployment-related factors. Participants completed a postal questionnaire which included the Life Satisfaction Scale, the brief World Health Organization Quality of Life (WHOQOL-Bref) questionnaire and the Combat Exposure Scale. Korean War veterans reported significantly lower Percentage Life Satisfaction (PLS) and quality of life scores on four WHOQOL-Bref domains, compared with similarly aged Australian men (each p value <0.001). These outcomes were most strongly associated with severity of combat exposure and low rank. Mean PLS was approximately 15% lower in veterans who reported heavy combat compared with those reporting no combat, and approximately 12% lower in enlisted ranked veterans compared with officers. Fifty years after the Korean War, life satisfaction and quality in Australian veterans is poor relative to other Australian men, and is associated with deployment-related factors including combat severity and low rank. In order to respond effectively to current and projected population health needs, nations with large veteran populations may need to consider the impact of military service on well-being in later life.

A Truncated Nuclear Norm Regularization Method Based on Weighted Residual Error for Matrix Completion.

PubMed

Qing Liu; Zhihui Lai; Zongwei Zhou; Fangjun Kuang; Zhong Jin

2016-01-01

Low-rank matrix completion aims to recover a matrix from a small subset of its entries and has received much attention in the field of computer vision. Most existing methods formulate the task as a low-rank matrix approximation problem. A truncated nuclear norm has recently been proposed as a better approximation to the rank of matrix than a nuclear norm. The corresponding optimization method, truncated nuclear norm regularization (TNNR), converges better than the nuclear norm minimization-based methods. However, it is not robust to the number of subtracted singular values and requires a large number of iterations to converge. In this paper, a TNNR method based on weighted residual error (TNNR-WRE) for matrix completion and its extension model (ETNNR-WRE) are proposed. TNNR-WRE assigns different weights to the rows of the residual error matrix in an augmented Lagrange function to accelerate the convergence of the TNNR method. The ETNNR-WRE is much more robust to the number of subtracted singular values than the TNNR-WRE, TNNR alternating direction method of multipliers, and TNNR accelerated proximal gradient with Line search methods. Experimental results using both synthetic and real visual data sets show that the proposed TNNR-WRE and ETNNR-WRE methods perform better than TNNR and Iteratively Reweighted Nuclear Norm (IRNN) methods.

Large-scale 3-D EM modelling with a Block Low-Rank multifrontal direct solver

NASA Astrophysics Data System (ADS)

Shantsev, Daniil V.; Jaysaval, Piyoosh; de la Kethulle de Ryhove, Sébastien; Amestoy, Patrick R.; Buttari, Alfredo; L'Excellent, Jean-Yves; Mary, Theo

2017-06-01

We put forward the idea of using a Block Low-Rank (BLR) multifrontal direct solver to efficiently solve the linear systems of equations arising from a finite-difference discretization of the frequency-domain Maxwell equations for 3-D electromagnetic (EM) problems. The solver uses a low-rank representation for the off-diagonal blocks of the intermediate dense matrices arising in the multifrontal method to reduce the computational load. A numerical threshold, the so-called BLR threshold, controlling the accuracy of low-rank representations was optimized by balancing errors in the computed EM fields against savings in floating point operations (flops). Simulations were carried out over large-scale 3-D resistivity models representing typical scenarios for marine controlled-source EM surveys, and in particular the SEG SEAM model which contains an irregular salt body. The flop count, size of factor matrices and elapsed run time for matrix factorization are reduced dramatically by using BLR representations and can go down to, respectively, 10, 30 and 40 per cent of their full-rank values for our largest system with N = 20.6 million unknowns. The reductions are almost independent of the number of MPI tasks and threads at least up to 90 × 10 = 900 cores. The BLR savings increase for larger systems, which reduces the factorization flop complexity from O(N2) for the full-rank solver to O(Nm) with m = 1.4-1.6. The BLR savings are significantly larger for deep-water environments that exclude the highly resistive air layer from the computational domain. A study in a scenario where simulations are required at multiple source locations shows that the BLR solver can become competitive in comparison to iterative solvers as an engine for 3-D controlled-source electromagnetic Gauss-Newton inversion that requires forward modelling for a few thousand right-hand sides.

Unmatched U.S. Allopathic Seniors in the 2015 Main Residency Match: A Study of Applicant Behavior, Interview Selection, and Match Outcome.

PubMed

Liang, Mei; Curtin, Laurie S; Signer, Mona M; Savoia, Maria C

2017-07-01

The application and interview behaviors of unmatched U.S. allopathic medical school senior students (U.S. seniors) participating in the 2015 National Resident Matching Program (NRMP) Main Residency Match were studied in conjunction with their United States Medical Licensing Examination (USMLE) Step 1 scores and ranking preferences to understand their effects on Match outcome. USMLE Step 1 score and preferred specialty information were reviewed for U.S. seniors who responded to the 2015 NRMP Applicant Survey. Unmatched U.S. seniors were categorized as "strong," "solid," "marginal," or "weak" based on the perceived competitiveness of their Step 1 scores compared with U.S. seniors who matched in the same preferred specialty. The numbers of applications sent, interviews obtained, and programs ranked also were examined by Match outcome. Strong unmatched U.S. seniors submitted significantly more applications to achieve and attend approximately the same number of interviews as strong matched U.S. seniors. Strong unmatched seniors ranked fewer programs than their matched counterparts. As a group, unmatched U.S. seniors were less likely than their matched counterparts to rank a mix of competitive and less competitive programs and more likely to rank programs based on their perceived likelihood of matching. A small number of unmatched U.S. seniors would have matched if they had ranked programs that ranked them. U.S. seniors' Match outcomes may be affected by applicant characteristics that negatively influence their selection for interviews, and their difficulties may be exacerbated by disadvantageous ranking behaviors.

a Bounded Finite-Difference Discretization of a Two-Dimensional Diffusion Equation with Logistic Nonlinear Reaction

NASA Astrophysics Data System (ADS)

Macías-Díaz, J. E.

In the present manuscript, we introduce a finite-difference scheme to approximate solutions of the two-dimensional version of Fisher's equation from population dynamics, which is a model for which the existence of traveling-wave fronts bounded within (0,1) is a well-known fact. The method presented here is a nonstandard technique which, in the linear regime, approximates the solutions of the original model with a consistency of second order in space and first order in time. The theory of M-matrices is employed here in order to elucidate conditions under which the method is able to preserve the positivity and the boundedness of solutions. In fact, our main result establishes relatively flexible conditions under which the preservation of the positivity and the boundedness of new approximations is guaranteed. Some simulations of the propagation of a traveling-wave solution confirm the analytical results derived in this work; moreover, the experiments evince a good agreement between the numerical result and the analytical solutions.

Anomalous thermodynamics at the microscale.

PubMed

Celani, Antonio; Bo, Stefano; Eichhorn, Ralf; Aurell, Erik

2012-12-28

Particle motion at the microscale is an incessant tug-of-war between thermal fluctuations and applied forces on one side and the strong resistance exerted by fluid viscosity on the other. Friction is so strong that completely neglecting inertia--the overdamped approximation--gives an excellent effective description of the actual particle mechanics. In sharp contrast to this result, here we show that the overdamped approximation dramatically fails when thermodynamic quantities such as the entropy production in the environment are considered, in the presence of temperature gradients. In the limit of vanishingly small, yet finite, inertia, we find that the entropy production is dominated by a contribution that is anomalous, i.e., has no counterpart in the overdamped approximation. This phenomenon, which we call an entropic anomaly, is due to a symmetry breaking that occurs when moving to the small, finite inertia limit. Anomalous entropy production is traced back to futile phase-space cyclic trajectories displaying a fast downgradient sweep followed by a slow upgradient return to the original position.

Computation of Relative Magnetic Helicity in Spherical Coordinates

NASA Astrophysics Data System (ADS)

Moraitis, Kostas; Pariat, Étienne; Savcheva, Antonia; Valori, Gherardo

2018-06-01

Magnetic helicity is a quantity of great importance in solar studies because it is conserved in ideal magnetohydrodynamics. While many methods for computing magnetic helicity in Cartesian finite volumes exist, in spherical coordinates, the natural coordinate system for solar applications, helicity is only treated approximately. We present here a method for properly computing the relative magnetic helicity in spherical geometry. The volumes considered are finite, of shell or wedge shape, and the three-dimensional magnetic field is considered to be fully known throughout the studied domain. Testing of the method with well-known, semi-analytic, force-free magnetic-field models reveals that it has excellent accuracy. Further application to a set of nonlinear force-free reconstructions of the magnetic field of solar active regions and comparison with an approximate method used in the past indicates that the proposed method can be significantly more accurate, thus making our method a promising tool in helicity studies that employ spherical geometry. Additionally, we determine and discuss the applicability range of the approximate method.

Spallation studies in Estane

NASA Astrophysics Data System (ADS)

Johnson, J. N.; Dick, J. J.

2000-04-01

Data are presented for the spall fracture of Estane. Estane has been studied previously to determine its low-pressure Hugoniot properties and high-rate viscoelastic response [J.N. Johnson, J.J. Dick and R.S. Hixson, J. Appl. Phys. 84, 2520-2529, 1998]. These results are used in the current analysis of spall fracture data for this material. Calculations are carried out with the characteristics code CHARADE and the finite-difference code FIDO. Comparison of model calculations with experimental data show the onset of spall failure to occur when the longitudinal stress reaches approximately 130 MPa in tension. At this point complete material separation does not occur, but rather the tensile strength in the material falls to approximately one-half the value at onset, as determined by CHARADE calculations. Finite-difference calculations indicate that the standard void-growth model (used previously to describe spall in metals) gives a reasonable approximation to the dynamic failure process in Estane. [Research supported by the USDOE under contract W-7405-ENG-36

ICANT, a code for the self-consistent computation of ICRH antenna coupling

NASA Astrophysics Data System (ADS)

Pécoul, S.; Heuraux, S.; Koch, R.; Leclert, G.

1996-02-01

The code deals with 3D antenna structures (finite length antennae) that are used to launch electromagnetic waves into tokamak plasmas. The antenna radiation problem is solved using a finite boundary element technique combined with a spectral solution of the interior problem. The slab approximation is used, and periodicity in y and z directions is introduced to account for toroidal geometry. We present results for various types of antennae radiating in vacuum: antenna with a finite Faraday screen and ideal Faraday screen, antenna with side limiters and phased antenna arrays. The results (radiated power, current profile) obtained are very close to analytical solutions when available.

Incremental analysis of large elastic deformation of a rotating cylinder

NASA Technical Reports Server (NTRS)

Buchanan, G. R.

1976-01-01

The effect of finite deformation upon a rotating, orthotropic cylinder was investigated using a general incremental theory. The incremental equations of motion are developed using the variational principle. The governing equations are derived using the principle of virtual work for a body with initial stress. The governing equations are reduced to those for the title problem and a numerical solution is obtained using finite difference approximations. Since the problem is defined in terms of one independent space coordinate, the finite difference grid can be modified as the incremental deformation occurs without serious numerical difficulties. The nonlinear problem is solved incrementally by totaling a series of linear solutions.

Advances and future directions of research on spectral methods

NASA Technical Reports Server (NTRS)

Patera, A. T.

1986-01-01

Recent advances in spectral methods are briefly reviewed and characterized with respect to their convergence and computational complexity. Classical finite element and spectral approaches are then compared, and spectral element (or p-type finite element) approximations are introduced. The method is applied to the full Navier-Stokes equations, and examples are given of the application of the technique to several transitional flows. Future directions of research in the field are outlined.

Mathematical Aspects of Finite Element Methods for Incompressible Viscous Flows.

DTIC Science & Technology

1986-09-01

respectively. Here h is a parameter which is usually related to the size of the grid associated with the finite element partitioning of Q. Then one... grid and of not at least performing serious mesh refinement studies. It also points out the usefulness of rigorous results concerning the stability...overconstrained the .1% approximate velocity field. However, by employing different grids for the ’z pressure and velocity fields, the linear-constant

Dispersion-relation-preserving finite difference schemes for computational acoustics

NASA Technical Reports Server (NTRS)

Tam, Christopher K. W.; Webb, Jay C.

1993-01-01

Time-marching dispersion-relation-preserving (DRP) schemes can be constructed by optimizing the finite difference approximations of the space and time derivatives in wave number and frequency space. A set of radiation and outflow boundary conditions compatible with the DRP schemes is constructed, and a sequence of numerical simulations is conducted to test the effectiveness of the DRP schemes and the radiation and outflow boundary conditions. Close agreement with the exact solutions is obtained.

Radiation Diffusion:. AN Overview of Physical and Numerical Concepts

NASA Astrophysics Data System (ADS)

Graziani, Frank

2005-12-01

An overview of the physical and mathematical foundations of radiation transport is given. Emphasis is placed on how the diffusion approximation and its transport corrections arise. An overview of the numerical handling of radiation diffusion coupled to matter is also given. Discussions center on partial temperature and grey methods with comments concerning fully implicit methods. In addition finite difference, finite element and Pert representations of the div-grad operator is also discussed

On the use of finite difference matrix-vector products in Newton-Krylov solvers for implicit climate dynamics with spectral elements

DOE PAGES

Woodward, Carol S.; Gardner, David J.; Evans, Katherine J.

2015-01-01

Efficient solutions of global climate models require effectively handling disparate length and time scales. Implicit solution approaches allow time integration of the physical system with a step size governed by accuracy of the processes of interest rather than by stability of the fastest time scales present. Implicit approaches, however, require the solution of nonlinear systems within each time step. Usually, a Newton's method is applied to solve these systems. Each iteration of the Newton's method, in turn, requires the solution of a linear model of the nonlinear system. This model employs the Jacobian of the problem-defining nonlinear residual, but thismore » Jacobian can be costly to form. If a Krylov linear solver is used for the solution of the linear system, the action of the Jacobian matrix on a given vector is required. In the case of spectral element methods, the Jacobian is not calculated but only implemented through matrix-vector products. The matrix-vector multiply can also be approximated by a finite difference approximation which may introduce inaccuracy in the overall nonlinear solver. In this paper, we review the advantages and disadvantages of finite difference approximations of these matrix-vector products for climate dynamics within the spectral element shallow water dynamical core of the Community Atmosphere Model.« less

Numerical calculation of thermo-mechanical problems at large strains based on complex step derivative approximation of tangent stiffness matrices

NASA Astrophysics Data System (ADS)

Balzani, Daniel; Gandhi, Ashutosh; Tanaka, Masato; Schröder, Jörg

2015-05-01

In this paper a robust approximation scheme for the numerical calculation of tangent stiffness matrices is presented in the context of nonlinear thermo-mechanical finite element problems and its performance is analyzed. The scheme extends the approach proposed in Kim et al. (Comput Methods Appl Mech Eng 200:403-413, 2011) and Tanaka et al. (Comput Methods Appl Mech Eng 269:454-470, 2014 and bases on applying the complex-step-derivative approximation to the linearizations of the weak forms of the balance of linear momentum and the balance of energy. By incorporating consistent perturbations along the imaginary axis to the displacement as well as thermal degrees of freedom, we demonstrate that numerical tangent stiffness matrices can be obtained with accuracy up to computer precision leading to quadratically converging schemes. The main advantage of this approach is that contrary to the classical forward difference scheme no round-off errors due to floating-point arithmetics exist within the calculation of the tangent stiffness. This enables arbitrarily small perturbation values and therefore leads to robust schemes even when choosing small values. An efficient algorithmic treatment is presented which enables a straightforward implementation of the method in any standard finite-element program. By means of thermo-elastic and thermo-elastoplastic boundary value problems at finite strains the performance of the proposed approach is analyzed.

Finite-Time Attitude Tracking Control for Spacecraft Using Terminal Sliding Mode and Chebyshev Neural Network.

PubMed

An-Min Zou; Kumar, K D; Zeng-Guang Hou; Xi Liu

2011-08-01

A finite-time attitude tracking control scheme is proposed for spacecraft using terminal sliding mode and Chebyshev neural network (NN) (CNN). The four-parameter representations (quaternion) are used to describe the spacecraft attitude for global representation without singularities. The attitude state (i.e., attitude and velocity) error dynamics is transformed to a double integrator dynamics with a constraint on the spacecraft attitude. With consideration of this constraint, a novel terminal sliding manifold is proposed for the spacecraft. In order to guarantee that the output of the NN used in the controller is bounded by the corresponding bound of the approximated unknown function, a switch function is applied to generate a switching between the adaptive NN control and the robust controller. Meanwhile, a CNN, whose basis functions are implemented using only desired signals, is introduced to approximate the desired nonlinear function and bounded external disturbances online, and the robust term based on the hyperbolic tangent function is applied to counteract NN approximation errors in the adaptive neural control scheme. Most importantly, the finite-time stability in both the reaching phase and the sliding phase can be guaranteed by a Lyapunov-based approach. Finally, numerical simulations on the attitude tracking control of spacecraft in the presence of an unknown mass moment of inertia matrix, bounded external disturbances, and control input constraints are presented to demonstrate the performance of the proposed controller.

Tools for Designing and Analyzing Structures

NASA Technical Reports Server (NTRS)

Luz, Paul L.

2005-01-01

Structural Design and Analysis Toolset is a collection of approximately 26 Microsoft Excel spreadsheet programs, each of which performs calculations within a different subdiscipline of structural design and analysis. These programs present input and output data in user-friendly, menu-driven formats. Although these programs cannot solve complex cases like those treated by larger finite element codes, these programs do yield quick solutions to numerous common problems more rapidly than the finite element codes, thereby making it possible to quickly perform multiple preliminary analyses - e.g., to establish approximate limits prior to detailed analyses by the larger finite element codes. These programs perform different types of calculations, as follows: 1. determination of geometric properties for a variety of standard structural components; 2. analysis of static, vibrational, and thermal- gradient loads and deflections in certain structures (mostly beams and, in the case of thermal-gradients, mirrors); 3. kinetic energies of fans; 4. detailed analysis of stress and buckling in beams, plates, columns, and a variety of shell structures; and 5. temperature dependent properties of materials, including figures of merit that characterize strength, stiffness, and deformation response to thermal gradients

An implicit finite-difference solution to the viscous shock layer, including the effects of radiation and strong blowing

NASA Technical Reports Server (NTRS)

Garrett, L. B.; Smith, G. L.; Perkins, J. N.

1972-01-01

An implicit finite-difference scheme is developed for the fully coupled solution of the viscous, radiating stagnation-streamline equations, including strong blowing. Solutions are presented for both air injection and injection of carbon-phenolic ablation products into air at conditions near the peak radiative heating point in an earth entry trajectory from interplanetary return missions. A detailed radiative-transport code that accounts for the important radiative exchange processes for gaseous mixtures in local thermodynamic and chemical equilibrium is utilized in the study. With minimum number of assumptions for the initially unknown parameters and profile distributions, convergent solutions to the full stagnation-line equations are rapidly obtained by a method of successive approximations. Damping of selected profiles is required to aid convergence of the solutions for massive blowing. It is shown that certain finite-difference approximations to the governing differential equations stabilize and improve the solutions. Detailed comparisons are made with the numerical results of previous investigations. Results of the present study indicate lower radiative heat fluxes at the wall for carbonphenolic ablation than previously predicted.

Calculation of reaction forces in the boiler supports using the method of equivalent stiffness of membrane wall.

PubMed

Sertić, Josip; Kozak, Dražan; Samardžić, Ivan

2014-01-01

The values of reaction forces in the boiler supports are the basis for the dimensioning of bearing steel structure of steam boiler. In this paper, the application of the method of equivalent stiffness of membrane wall is proposed for the calculation of reaction forces. The method of equalizing displacement, as the method of homogenization of membrane wall stiffness, was applied. On the example of "Milano" boiler, using the finite element method, the calculation of reactions in the supports for the real geometry discretized by the shell finite element was made. The second calculation was performed with the assumption of ideal stiffness of membrane walls and the third using the method of equivalent stiffness of membrane wall. In the third case, the membrane walls are approximated by the equivalent orthotropic plate. The approximation of membrane wall stiffness is achieved using the elasticity matrix of equivalent orthotropic plate at the level of finite element. The obtained results were compared, and the advantages of using the method of equivalent stiffness of membrane wall for the calculation of reactions in the boiler supports were emphasized.

Discontinuous finite volume element discretization for coupled flow-transport problems arising in models of sedimentation

NASA Astrophysics Data System (ADS)

Bürger, Raimund; Kumar, Sarvesh; Ruiz-Baier, Ricardo

2015-10-01

The sedimentation-consolidation and flow processes of a mixture of small particles dispersed in a viscous fluid at low Reynolds numbers can be described by a nonlinear transport equation for the solids concentration coupled with the Stokes problem written in terms of the mixture flow velocity and the pressure field. Here both the viscosity and the forcing term depend on the local solids concentration. A semi-discrete discontinuous finite volume element (DFVE) scheme is proposed for this model. The numerical method is constructed on a baseline finite element family of linear discontinuous elements for the approximation of velocity components and concentration field, whereas the pressure is approximated by piecewise constant elements. The unique solvability of both the nonlinear continuous problem and the semi-discrete DFVE scheme is discussed, and optimal convergence estimates in several spatial norms are derived. Properties of the model and the predicted space accuracy of the proposed formulation are illustrated by detailed numerical examples, including flows under gravity with changing direction, a secondary settling tank in an axisymmetric setting, and batch sedimentation in a tilted cylindrical vessel.

Extrapolating Weak Selection in Evolutionary Games

PubMed Central

Wu, Bin; García, Julián; Hauert, Christoph; Traulsen, Arne

2013-01-01

In evolutionary games, reproductive success is determined by payoffs. Weak selection means that even large differences in game outcomes translate into small fitness differences. Many results have been derived using weak selection approximations, in which perturbation analysis facilitates the derivation of analytical results. Here, we ask whether results derived under weak selection are also qualitatively valid for intermediate and strong selection. By “qualitatively valid” we mean that the ranking of strategies induced by an evolutionary process does not change when the intensity of selection increases. For two-strategy games, we show that the ranking obtained under weak selection cannot be carried over to higher selection intensity if the number of players exceeds two. For games with three (or more) strategies, previous examples for multiplayer games have shown that the ranking of strategies can change with the intensity of selection. In particular, rank changes imply that the most abundant strategy at one intensity of selection can become the least abundant for another. We show that this applies already to pairwise interactions for a broad class of evolutionary processes. Even when both weak and strong selection limits lead to consistent predictions, rank changes can occur for intermediate intensities of selection. To analyze how common such games are, we show numerically that for randomly drawn two-player games with three or more strategies, rank changes frequently occur and their likelihood increases rapidly with the number of strategies . In particular, rank changes are almost certain for , which jeopardizes the predictive power of results derived for weak selection. PMID:24339769

Grid-based lattice summation of electrostatic potentials by assembled rank-structured tensor approximation

NASA Astrophysics Data System (ADS)

Khoromskaia, Venera; Khoromskij, Boris N.

2014-12-01

Our recent method for low-rank tensor representation of sums of the arbitrarily positioned electrostatic potentials discretized on a 3D Cartesian grid reduces the 3D tensor summation to operations involving only 1D vectors however retaining the linear complexity scaling in the number of potentials. Here, we introduce and study a novel tensor approach for fast and accurate assembled summation of a large number of lattice-allocated potentials represented on 3D N × N × N grid with the computational requirements only weakly dependent on the number of summed potentials. It is based on the assembled low-rank canonical tensor representations of the collected potentials using pointwise sums of shifted canonical vectors representing the single generating function, say the Newton kernel. For a sum of electrostatic potentials over L × L × L lattice embedded in a box the required storage scales linearly in the 1D grid-size, O(N) , while the numerical cost is estimated by O(NL) . For periodic boundary conditions, the storage demand remains proportional to the 1D grid-size of a unit cell, n = N / L, while the numerical cost reduces to O(N) , that outperforms the FFT-based Ewald-type summation algorithms of complexity O(N3 log N) . The complexity in the grid parameter N can be reduced even to the logarithmic scale O(log N) by using data-sparse representation of canonical N-vectors via the quantics tensor approximation. For justification, we prove an upper bound on the quantics ranks for the canonical vectors in the overall lattice sum. The presented approach is beneficial in applications which require further functional calculus with the lattice potential, say, scalar product with a function, integration or differentiation, which can be performed easily in tensor arithmetics on large 3D grids with 1D cost. Numerical tests illustrate the performance of the tensor summation method and confirm the estimated bounds on the tensor ranks.

Edge-based nonlinear diffusion for finite element approximations of convection-diffusion equations and its relation to algebraic flux-correction schemes.

PubMed

Barrenechea, Gabriel R; Burman, Erik; Karakatsani, Fotini

2017-01-01

For the case of approximation of convection-diffusion equations using piecewise affine continuous finite elements a new edge-based nonlinear diffusion operator is proposed that makes the scheme satisfy a discrete maximum principle. The diffusion operator is shown to be Lipschitz continuous and linearity preserving. Using these properties we provide a full stability and error analysis, which, in the diffusion dominated regime, shows existence, uniqueness and optimal convergence. Then the algebraic flux correction method is recalled and we show that the present method can be interpreted as an algebraic flux correction method for a particular definition of the flux limiters. The performance of the method is illustrated on some numerical test cases in two space dimensions.

Fiber Composite Sandwich Thermostructural Behavior: Computational Simulation

NASA Technical Reports Server (NTRS)

Chamis, C. C.; Aiello, R. A.; Murthy, P. L. N.

1986-01-01

Several computational levels of progressive sophistication/simplification are described to computationally simulate composite sandwich hygral, thermal, and structural behavior. The computational levels of sophistication include: (1) three-dimensional detailed finite element modeling of the honeycomb, the adhesive and the composite faces; (2) three-dimensional finite element modeling of the honeycomb assumed to be an equivalent continuous, homogeneous medium, the adhesive and the composite faces; (3) laminate theory simulation where the honeycomb (metal or composite) is assumed to consist of plies with equivalent properties; and (4) derivations of approximate, simplified equations for thermal and mechanical properties by simulating the honeycomb as an equivalent homogeneous medium. The approximate equations are combined with composite hygrothermomechanical and laminate theories to provide a simple and effective computational procedure for simulating the thermomechanical/thermostructural behavior of fiber composite sandwich structures.

A computer code for three-dimensional incompressible flows using nonorthogonal body-fitted coordinate systems

NASA Technical Reports Server (NTRS)

Chen, Y. S.

1986-01-01

In this report, a numerical method for solving the equations of motion of three-dimensional incompressible flows in nonorthogonal body-fitted coordinate (BFC) systems has been developed. The equations of motion are transformed to a generalized curvilinear coordinate system from which the transformed equations are discretized using finite difference approximations in the transformed domain. The hybrid scheme is used to approximate the convection terms in the governing equations. Solutions of the finite difference equations are obtained iteratively by using a pressure-velocity correction algorithm (SIMPLE-C). Numerical examples of two- and three-dimensional, laminar and turbulent flow problems are employed to evaluate the accuracy and efficiency of the present computer code. The user's guide and computer program listing of the present code are also included.

Upwind methods for the Baer–Nunziato equations and higher-order reconstruction using artificial viscosity

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

Fraysse, F., E-mail: francois.fraysse@rs2n.eu; E. T. S. de Ingeniería Aeronáutica y del Espacio, Universidad Politécnica de Madrid, Madrid; Redondo, C.

This article is devoted to the numerical discretisation of the hyperbolic two-phase flow model of Baer and Nunziato. A special attention is paid on the discretisation of intercell flux functions in the framework of Finite Volume and Discontinuous Galerkin approaches, where care has to be taken to efficiently approximate the non-conservative products inherent to the model equations. Various upwind approximate Riemann solvers have been tested on a bench of discontinuous test cases. New discretisation schemes are proposed in a Discontinuous Galerkin framework following the criterion of Abgrall and the path-conservative formalism. A stabilisation technique based on artificial viscosity is appliedmore » to the high-order Discontinuous Galerkin method and compared against classical TVD-MUSCL Finite Volume flux reconstruction.« less

Scalable algorithms for three-field mixed finite element coupled poromechanics

NASA Astrophysics Data System (ADS)

Castelletto, Nicola; White, Joshua A.; Ferronato, Massimiliano

2016-12-01

We introduce a class of block preconditioners for accelerating the iterative solution of coupled poromechanics equations based on a three-field formulation. The use of a displacement/velocity/pressure mixed finite-element method combined with a first order backward difference formula for the approximation of time derivatives produces a sequence of linear systems with a 3 × 3 unsymmetric and indefinite block matrix. The preconditioners are obtained by approximating the two-level Schur complement with the aid of physically-based arguments that can be also generalized in a purely algebraic approach. A theoretical and experimental analysis is presented that provides evidence of the robustness, efficiency and scalability of the proposed algorithm. The performance is also assessed for a real-world challenging consolidation experiment of a shallow formation.

Chiral interface at the finite temperature transition point of QCD

NASA Technical Reports Server (NTRS)

Frei, Z.; Patkos, A.

1990-01-01

The domain wall between coexisting chirally symmetric and broken symmetry regions is studied in a saddle point approximation to the effective three-flavor sigma model. In the chiral limit the surface tension varies in the range ((40 to -50)MeV)(exp 3). The width of the domain wall is estimated to be approximately or equal to 4.5 fm.

Estimation on nonlinear damping in second order distributed parameter systems

NASA Technical Reports Server (NTRS)

Banks, H. T.; Reich, Simeon; Rosen, I. G.

1989-01-01

An approximation and convergence theory for the identification of nonlinear damping in abstract wave equations is developed. It is assumed that the unknown dissipation mechanism to be identified can be described by a maximal monotone operator acting on the generalized velocity. The stiffness is assumed to be linear and symmetric. Functional analytic techniques are used to establish that solutions to a sequence of finite dimensional (Galerkin) approximating identification problems in some sense approximate a solution to the original infinite dimensional inverse problem.

Low rank alternating direction method of multipliers reconstruction for MR fingerprinting.

PubMed

Assländer, Jakob; Cloos, Martijn A; Knoll, Florian; Sodickson, Daniel K; Hennig, Jürgen; Lattanzi, Riccardo

2018-01-01

The proposed reconstruction framework addresses the reconstruction accuracy, noise propagation and computation time for magnetic resonance fingerprinting. Based on a singular value decomposition of the signal evolution, magnetic resonance fingerprinting is formulated as a low rank (LR) inverse problem in which one image is reconstructed for each singular value under consideration. This LR approximation of the signal evolution reduces the computational burden by reducing the number of Fourier transformations. Also, the LR approximation improves the conditioning of the problem, which is further improved by extending the LR inverse problem to an augmented Lagrangian that is solved by the alternating direction method of multipliers. The root mean square error and the noise propagation are analyzed in simulations. For verification, in vivo examples are provided. The proposed LR alternating direction method of multipliers approach shows a reduced root mean square error compared to the original fingerprinting reconstruction, to a LR approximation alone and to an alternating direction method of multipliers approach without a LR approximation. Incorporating sensitivity encoding allows for further artifact reduction. The proposed reconstruction provides robust convergence, reduced computational burden and improved image quality compared to other magnetic resonance fingerprinting reconstruction approaches evaluated in this study. Magn Reson Med 79:83-96, 2018. © 2017 International Society for Magnetic Resonance in Medicine. © 2017 International Society for Magnetic Resonance in Medicine.

Neural network disturbance observer-based distributed finite-time formation tracking control for multiple unmanned helicopters.

PubMed

Wang, Dandan; Zong, Qun; Tian, Bailing; Shao, Shikai; Zhang, Xiuyun; Zhao, Xinyi

2018-02-01

The distributed finite-time formation tracking control problem for multiple unmanned helicopters is investigated in this paper. The control object is to maintain the positions of follower helicopters in formation with external interferences. The helicopter model is divided into a second order outer-loop subsystem and a second order inner-loop subsystem based on multiple-time scale features. Using radial basis function neural network (RBFNN) technique, we first propose a novel finite-time multivariable neural network disturbance observer (FMNNDO) to estimate the external disturbance and model uncertainty, where the neural network (NN) approximation errors can be dynamically compensated by adaptive law. Next, based on FMNNDO, a distributed finite-time formation tracking controller and a finite-time attitude tracking controller are designed using the nonsingular fast terminal sliding mode (NFTSM) method. In order to estimate the second derivative of the virtual desired attitude signal, a novel finite-time sliding mode integral filter is designed. Finally, Lyapunov analysis and multiple-time scale principle ensure the realization of control goal in finite-time. The effectiveness of the proposed FMNNDO and controllers are then verified by numerical simulations. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Deformation analysis of rotary combustion engine housings

NASA Technical Reports Server (NTRS)

Vilmann, Carl

1991-01-01

This analysis of the deformation of rotary combustion engine housings targeted the following objectives: (1) the development and verification of a finite element model of the trochoid housing, (2) the prediction of the stress and deformation fields present within the trochoid housing during operating conditions, and (3) the development of a specialized preprocessor which would shorten the time necessary for mesh generation of a trochoid housing's FEM model from roughly one month to approximately two man hours. Executable finite element models were developed for both the Mazda and the Outboard Marine Corporation trochoid housings. It was also demonstrated that a preprocessor which would hasten the generation of finite element models of a rotary engine was possible to develop. The above objectives are treated in detail in the attached appendices. The first deals with finite element modeling of a Wankel engine center housing, and the second with the development of a preprocessor that generates finite element models of rotary combustion engine center housings. A computer program, designed to generate finite element models of user defined rotary combustion engine center housing geometries, is also included.

Comparison of finite-difference schemes for analysis of shells of revolution. [stress and free vibration analysis

NASA Technical Reports Server (NTRS)

Noor, A. K.; Stephens, W. B.

1973-01-01

Several finite difference schemes are applied to the stress and free vibration analysis of homogeneous isotropic and layered orthotropic shells of revolution. The study is based on a form of the Sanders-Budiansky first-approximation linear shell theory modified such that the effects of shear deformation and rotary inertia are included. A Fourier approach is used in which all the shell stress resultants and displacements are expanded in a Fourier series in the circumferential direction, and the governing equations reduce to ordinary differential equations in the meridional direction. While primary attention is given to finite difference schemes used in conjunction with first order differential equation formulation, comparison is made with finite difference schemes used with other formulations. These finite difference discretization models are compared with respect to simplicity of application, convergence characteristics, and computational efficiency. Numerical studies are presented for the effects of variations in shell geometry and lamination parameters on the accuracy and convergence of the solutions obtained by the different finite difference schemes. On the basis of the present study it is shown that the mixed finite difference scheme based on the first order differential equation formulation and two interlacing grids for the different fundamental unknowns combines a number of advantages over other finite difference schemes previously reported in the literature.

Exact finite elements for conduction and convection

NASA Technical Reports Server (NTRS)

Thornton, E. A.; Dechaumphai, P.; Tamma, K. K.

1981-01-01

An appproach for developing exact one dimensional conduction-convection finite elements is presented. Exact interpolation functions are derived based on solutions to the governing differential equations by employing a nodeless parameter. Exact interpolation functions are presented for combined heat transfer in several solids of different shapes, and for combined heat transfer in a flow passage. Numerical results demonstrate that exact one dimensional elements offer advantages over elements based on approximate interpolation functions. Previously announced in STAR as N81-31507

Computational methods for the control of distributed parameter systems

NASA Technical Reports Server (NTRS)

Burns, J. A.; Cliff, E. M.; Powers, R. K.

1985-01-01

It is shown that care must be taken to ensure that finite dimensional approximations of distributed parameter systems preserve important system properties (i.e., controllability, observability, stabilizability, detectability, etc.). It is noted that, if the particular scheme used to construct the finite dimensional model does not take into account these system properties, the model may not be suitable for control design and analysis. These ideas are illustrated by a simple example, i.e., a cable-spring-mass system.

Finite element analysis of flexible, rotating blades

NASA Technical Reports Server (NTRS)

Mcgee, Oliver G.

1987-01-01

A reference guide that can be used when using the finite element method to approximate the static and dynamic behavior of flexible, rotating blades is given. Important parameters such as twist, sweep, camber, co-planar shell elements, centrifugal loads, and inertia properties are studied. Comparisons are made between NASTRAN elements through published benchmark tests. The main purpose is to summarize blade modeling strategies and to document capabilities and limitations (for flexible, rotating blades) of various NASTRAN elements.

A higher-order theory for geometrically nonlinear analysis of composite laminates

NASA Technical Reports Server (NTRS)

Reddy, J. N.; Liu, C. F.

1987-01-01

A third-order shear deformation theory of laminated composite plates and shells is developed, the Navier solutions are derived, and its finite element models are developed. The theory allows parabolic description of the transverse shear stresses, and therefore the shear correction factors of the usual shear deformation theory are not required in the present theory. The theory also accounts for the von Karman nonlinear strains. Closed-form solutions of the theory for rectangular cross-ply and angle-ply plates and cross-ply shells are developed. The finite element model is based on independent approximations of the displacements and bending moments (i.e., mixed finite element model), and therefore, only C sup o -approximation is required. The finite element model is used to analyze cross-ply and angle-ply laminated plates and shells for bending and natural vibration. Many of the numerical results presented here should serve as references for future investigations. Three major conclusions resulted from the research: First, for thick laminates, shear deformation theories predict deflections, stresses and vibration frequencies significantly different from those predicted by classical theories. Second, even for thin laminates, shear deformation effects are significant in dynamic and geometrically nonlinear analyses. Third, the present third-order theory is more accurate compared to the classical and firt-order theories in predicting static and dynamic response of laminated plates and shells made of high-modulus composite materials.

On the asymptotic evolution of finite energy Airy wave functions.

PubMed

Chamorro-Posada, P; Sánchez-Curto, J; Aceves, A B; McDonald, G S

2015-06-15

In general, there is an inverse relation between the degree of localization of a wave function of a certain class and its transform representation dictated by the scaling property of the Fourier transform. We report that in the case of finite energy Airy wave packets a simultaneous increase in their localization in the direct and transform domains can be obtained as the apodization parameter is varied. One consequence of this is that the far-field diffraction rate of a finite energy Airy beam decreases as the beam localization at the launch plane increases. We analyze the asymptotic properties of finite energy Airy wave functions using the stationary phase method. We obtain one dominant contribution to the long-term evolution that admits a Gaussian-like approximation, which displays the expected reduction of its broadening rate as the input localization is increased.

Comparison of toxicity rankings of six aircraft cabin polymers by lethality and by incapacitation in rats.

PubMed

Sanders, D C; Endecott, B R; Chaturvedi, A K

1992-10-01

Polymeric aircraft cabin materials have the potential to produce toxic gases in fires. Lethality (LC50) in animal models is a standard index to rank polymers on the basis of their combustion toxicity. However, the use of times-to-incapacitation (ti) may be more realistic for predicting relative escape times from a fire. Therefore, LC50 and ti for polymers, polyamide (I), polystyrene (II), Nylon 6/6 (III), polysulfone (IV), polyethylene (V) and chlorinated polyethylene (VI), of different chemical classes were determined and compared. Male rats, 12/fuel loading, were exposed to the pyrolysis products from selected weights of each polymer for 30 min in a 265-L combustion/exposure system, and LC50 values were determined following a 14-d observation period. For each polymer, ti was measured at 16 g and at its respective LC50 using the inability of rats (n greater than or equal to 12) to walk in rotating cages as a criterion for incapacitation. LC50 (45.7-87.5 mg/L) of the polymers had the order of I less than II approximately III less than IV less than V less than VI, while their ti (6.6-21.1 min) at 16 g (60 mg/L) had the order of III approximately I less than V approximately II less than VI less than IV. Based on ti at LC50, polymers were grouped into III & V; I, II & VI; and IV. LC50 and ti did not exhibit the same relative toxic hazard rankings for these polymers; ti were also not equal at the LC50 concentrations. These findings demonstrate the possible involvement of different mechanisms of action for the combustion products of these polymers at the selected end points.

Effect of Carreau-Yasuda rheological parameters on subcritical Lapwood convection in horizontal porous cavity saturated by shear-thinning fluid

NASA Astrophysics Data System (ADS)

Khechiba, Khaled; Mamou, Mahmoud; Hachemi, Madjid; Delenda, Nassim; Rebhi, Redha

2017-06-01

The present study is focused on Lapwood convection in isotropic porous media saturated with non-Newtonian shear thinning fluid. The non-Newtonian rheological behavior of the fluid is modeled using the general viscosity model of Carreau-Yasuda. The convection configuration consists of a shallow porous cavity with a finite aspect ratio and subject to a vertical constant heat flux, whereas the vertical walls are maintained impermeable and adiabatic. An approximate analytical solution is developed on the basis of the parallel flow assumption, and numerical solutions are obtained by solving the full governing equations. The Darcy model with the Boussinesq approximation and energy transport equations are solved numerically using a finite difference method. The results are obtained in terms of the Nusselt number and the flow fields as functions of the governing parameters. A good agreement is obtained between the analytical approximation and the numerical solution of the full governing equations. The effects of the rheological parameters of the Carreau-Yasuda fluid and Rayleigh number on the onset of subcritical convection thresholds are demonstrated. Regardless of the aspect ratio of the enclosure and thermal boundary condition type, the subcritical convective flows are seen to occur below the onset of stationary convection. Correlations are proposed to estimate the subcritical Rayleigh number for the onset of finite amplitude convection as a function of the fluid rheological parameters. Linear stability of the convective motion, predicted by the parallel flow approximation, is studied, and the onset of Hopf bifurcation, from steady convective flow to oscillatory behavior, is found to depend strongly on the rheological parameters. In general, Hopf bifurcation is triggered earlier as the fluid becomes more and more shear-thinning.

Modeling boundary measurements of scattered light using the corrected diffusion approximation

PubMed Central

Lehtikangas, Ossi; Tarvainen, Tanja; Kim, Arnold D.

2012-01-01

We study the modeling and simulation of steady-state measurements of light scattered by a turbid medium taken at the boundary. In particular, we implement the recently introduced corrected diffusion approximation in two spatial dimensions to model these boundary measurements. This implementation uses expansions in plane wave solutions to compute boundary conditions and the additive boundary layer correction, and a finite element method to solve the diffusion equation. We show that this corrected diffusion approximation models boundary measurements substantially better than the standard diffusion approximation in comparison to numerical solutions of the radiative transport equation. PMID:22435102

Application of the probabilistic approximate analysis method to a turbopump blade analysis. [for Space Shuttle Main Engine

NASA Technical Reports Server (NTRS)

Thacker, B. H.; Mcclung, R. C.; Millwater, H. R.

1990-01-01

An eigenvalue analysis of a typical space propulsion system turbopump blade is presented using an approximate probabilistic analysis methodology. The methodology was developed originally to investigate the feasibility of computing probabilistic structural response using closed-form approximate models. This paper extends the methodology to structures for which simple closed-form solutions do not exist. The finite element method will be used for this demonstration, but the concepts apply to any numerical method. The results agree with detailed analysis results and indicate the usefulness of using a probabilistic approximate analysis in determining efficient solution strategies.

On cell entropy inequality for discontinuous Galerkin methods

NASA Technical Reports Server (NTRS)

Jiang, Guangshan; Shu, Chi-Wang

1993-01-01

We prove a cell entropy inequality for a class of high order discontinuous Galerkin finite element methods approximating conservation laws, which implies convergence for the one dimensional scalar convex case.

Models and finite element approximations for interacting nanosized piezoelectric bodies and acoustic medium

NASA Astrophysics Data System (ADS)

Nasedkin, A. V.

2017-01-01

This research presents the new size-dependent models of piezoelectric materials oriented to finite element applications. The proposed models include the facilities of taking into account different mechanisms of damping for mechanical and electric fields. The coupled models also incorporate the equations of the theory of acoustics for viscous fluids. In particular cases, these models permit to use the mode superposition method with full separation of the finite element systems into independent equations for the independent modes for transient and harmonic problems. The main boundary conditions were supplemented with the facilities of taking into account the coupled surface effects, allowing to explore the nanoscale piezoelectric materials in the framework of theories of continuous media with surface stresses and their generalizations. For the considered problems we have implemented the finite element technologies and various numerical algorithms to maintain a symmetrical structure of the finite element quasi-definite matrices (matrix structure for the problems with a saddle point).

Propagating plane harmonic waves through finite length plates of variable thickness using finite element techniques

NASA Technical Reports Server (NTRS)

Clark, J. H.; Kalinowski, A. J.; Wagner, C. A.

1983-01-01

An analysis is given using finite element techniques which addresses the propagaton of a uniform incident pressure wave through a finite diameter axisymmetric tapered plate immersed in a fluid. The approach utilized in developing a finite element solution to this problem is based upon a technique for axisymmetric fluid structure interaction problems. The problem addressed is that of a 10 inch diameter axisymmetric fixed plate totally immersed in a fluid. The plate increases in thickness from approximately 0.01 inches thick at the center to 0.421 inches thick at a radius of 5 inches. Against each face of the tapered plate a cylindrical fluid volume was represented extending five wavelengths off the plate in the axial direction. The outer boundary of the fluid and plate regions were represented as a rigid encasement cylinder as was nearly the case in the physical problem. The primary objective of the analysis is to determine the form of the transmitted pressure distribution on the downstream side of the plate.

Well-Balanced Second-Order Approximation of the Shallow Water Equations With Friction via Continuous Galerkin Finite Elements

NASA Astrophysics Data System (ADS)

Quezada de Luna, M.; Farthing, M.; Guermond, J. L.; Kees, C. E.; Popov, B.

2017-12-01

The Shallow Water Equations (SWEs) are popular for modeling non-dispersive incompressible water waves where the horizontal wavelength is much larger than the vertical scales. They can be derived from the incompressible Navier-Stokes equations assuming a constant vertical velocity. The SWEs are important in Geophysical Fluid Dynamics for modeling surface gravity waves in shallow regimes; e.g., in the deep ocean. Some common geophysical applications are the evolution of tsunamis, river flooding and dam breaks, storm surge simulations, atmospheric flows and others. This work is concerned with the approximation of the time-dependent Shallow Water Equations with friction using explicit time stepping and continuous finite elements. The objective is to construct a method that is at least second-order accurate in space and third or higher-order accurate in time, positivity preserving, well-balanced with respect to rest states, well-balanced with respect to steady sliding solutions on inclined planes and robust with respect to dry states. Methods fulfilling the desired goals are common within the finite volume literature. However, to the best of our knowledge, schemes with the above properties are not well developed in the context of continuous finite elements. We start this work based on a finite element method that is second-order accurate in space, positivity preserving and well-balanced with respect to rest states. We extend it by: modifying the artificial viscosity (via the entropy viscosity method) to deal with issues of loss of accuracy around local extrema, considering a singular Manning friction term handled via an explicit discretization under the usual CFL condition, considering a water height regularization that depends on the mesh size and is consistent with the polynomial approximation, reducing dispersive errors introduced by lumping the mass matrix and others. After presenting the details of the method we show numerical tests that demonstrate the well-balanced nature of the scheme and its convergence properties. We conclude with well-known benchmark problems including the Malpasset dam break (see the attached figure). All numerical experiments are performed and available in the Proteus toolkit, which is an open source python package for modeling continuum mechanical processes and fluid flow.

Mixed finite element - discontinuous finite volume element discretization of a general class of multicontinuum models

NASA Astrophysics Data System (ADS)

Ruiz-Baier, Ricardo; Lunati, Ivan

2016-10-01

We present a novel discretization scheme tailored to a class of multiphase models that regard the physical system as consisting of multiple interacting continua. In the framework of mixture theory, we consider a general mathematical model that entails solving a system of mass and momentum equations for both the mixture and one of the phases. The model results in a strongly coupled and nonlinear system of partial differential equations that are written in terms of phase and mixture (barycentric) velocities, phase pressure, and saturation. We construct an accurate, robust and reliable hybrid method that combines a mixed finite element discretization of the momentum equations with a primal discontinuous finite volume-element discretization of the mass (or transport) equations. The scheme is devised for unstructured meshes and relies on mixed Brezzi-Douglas-Marini approximations of phase and total velocities, on piecewise constant elements for the approximation of phase or total pressures, as well as on a primal formulation that employs discontinuous finite volume elements defined on a dual diamond mesh to approximate scalar fields of interest (such as volume fraction, total density, saturation, etc.). As the discretization scheme is derived for a general formulation of multicontinuum physical systems, it can be readily applied to a large class of simplified multiphase models; on the other, the approach can be seen as a generalization of these models that are commonly encountered in the literature and employed when the latter are not sufficiently accurate. An extensive set of numerical test cases involving two- and three-dimensional porous media are presented to demonstrate the accuracy of the method (displaying an optimal convergence rate), the physics-preserving properties of the mixed-primal scheme, as well as the robustness of the method (which is successfully used to simulate diverse physical phenomena such as density fingering, Terzaghi's consolidation, deformation of a cantilever bracket, and Boycott effects). The applicability of the method is not limited to flow in porous media, but can also be employed to describe many other physical systems governed by a similar set of equations, including e.g. multi-component materials.

Invariant operators, orthogonal bases and correlators in general tensor models

NASA Astrophysics Data System (ADS)

Diaz, Pablo; Rey, Soo-Jong

2018-07-01

We study invariant operators in general tensor models. We show that representation theory provides an efficient framework to count and classify invariants in tensor models of (gauge) symmetry Gd = U (N1) ⊗ ⋯ ⊗ U (Nd). As a continuation and completion of our earlier work, we present two natural ways of counting invariants, one for arbitrary Gd and another valid for large rank of Gd. We construct bases of invariant operators based on the counting, and compute correlators of their elements. The basis associated with finite rank of Gd diagonalizes the two-point function of the free theory. It is analogous to the restricted Schur basis used in matrix models. We show that the constructions get almost identical as we swap the Littlewood-Richardson numbers in multi-matrix models with Kronecker coefficients in general tensor models. We explore the parallelism between matrix model and tensor model in depth from the perspective of representation theory and comment on several ideas for future investigation.

Kinetic Models for Topological Nearest-Neighbor Interactions

NASA Astrophysics Data System (ADS)

Blanchet, Adrien; Degond, Pierre

2017-12-01

We consider systems of agents interacting through topological interactions. These have been shown to play an important part in animal and human behavior. Precisely, the system consists of a finite number of particles characterized by their positions and velocities. At random times a randomly chosen particle, the follower, adopts the velocity of its closest neighbor, the leader. We study the limit of a system size going to infinity and, under the assumption of propagation of chaos, show that the limit kinetic equation is a non-standard spatial diffusion equation for the particle distribution function. We also study the case wherein the particles interact with their K closest neighbors and show that the corresponding kinetic equation is the same. Finally, we prove that these models can be seen as a singular limit of the smooth rank-based model previously studied in Blanchet and Degond (J Stat Phys 163:41-60, 2016). The proofs are based on a combinatorial interpretation of the rank as well as some concentration of measure arguments.

Cluster Tails for Critical Power-Law Inhomogeneous Random Graphs

NASA Astrophysics Data System (ADS)

van der Hofstad, Remco; Kliem, Sandra; van Leeuwaarden, Johan S. H.

2018-04-01

Recently, the scaling limit of cluster sizes for critical inhomogeneous random graphs of rank-1 type having finite variance but infinite third moment degrees was obtained in Bhamidi et al. (Ann Probab 40:2299-2361, 2012). It was proved that when the degrees obey a power law with exponent τ \\in (3,4), the sequence of clusters ordered in decreasing size and multiplied through by n^{-(τ -2)/(τ -1)} converges as n→ ∞ to a sequence of decreasing non-degenerate random variables. Here, we study the tails of the limit of the rescaled largest cluster, i.e., the probability that the scaling limit of the largest cluster takes a large value u, as a function of u. This extends a related result of Pittel (J Combin Theory Ser B 82(2):237-269, 2001) for the Erdős-Rényi random graph to the setting of rank-1 inhomogeneous random graphs with infinite third moment degrees. We make use of delicate large deviations and weak convergence arguments.

Progress on a generalized coordinates tensor product finite element 3DPNS algorithm for subsonic

NASA Technical Reports Server (NTRS)

Baker, A. J.; Orzechowski, J. A.

1983-01-01

A generalized coordinates form of the penalty finite element algorithm for the 3-dimensional parabolic Navier-Stokes equations for turbulent subsonic flows was derived. This algorithm formulation requires only three distinct hypermatrices and is applicable using any boundary fitted coordinate transformation procedure. The tensor matrix product approximation to the Jacobian of the Newton linear algebra matrix statement was also derived. Tne Newton algorithm was restructured to replace large sparse matrix solution procedures with grid sweeping using alpha-block tridiagonal matrices, where alpha equals the number of dependent variables. Numerical experiments were conducted and the resultant data gives guidance on potentially preferred tensor product constructions for the penalty finite element 3DPNS algorithm.

Gradient corrections to the exchange-correlation free energy

DOE PAGES

Sjostrom, Travis; Daligault, Jerome

2014-10-07

We develop the first-order gradient correction to the exchange-correlation free energy of the homogeneous electron gas for use in finite-temperature density functional calculations. Based on this, we propose and implement a simple temperature-dependent extension for functionals beyond the local density approximation. These finite-temperature functionals show improvement over zero-temperature functionals, as compared to path-integral Monte Carlo calculations for deuterium equations of state, and perform without computational cost increase compared to zero-temperature functionals and so should be used for finite-temperature calculations. Furthermore, while the present functionals are valid at all temperatures including zero, non-negligible difference with zero-temperature functionals begins at temperatures abovemore » 10 000 K.« less

On accuracy of the wave finite element predictions of wavenumbers and power flow: A benchmark problem

NASA Astrophysics Data System (ADS)

Søe-Knudsen, Alf; Sorokin, Sergey

2011-06-01

This rapid communication is concerned with justification of the 'rule of thumb', which is well known to the community of users of the finite element (FE) method in dynamics, for the accuracy assessment of the wave finite element (WFE) method. An explicit formula linking the size of a window in the dispersion diagram, where the WFE method is trustworthy, with the coarseness of a FE mesh employed is derived. It is obtained by the comparison of the exact Pochhammer-Chree solution for an elastic rod having the circular cross-section with its WFE approximations. It is shown that the WFE power flow predictions are also valid within this window.

Finite volume solution of the compressible boundary-layer equations

NASA Technical Reports Server (NTRS)

Loyd, B.; Murman, E. M.

1986-01-01

A box-type finite volume discretization is applied to the integral form of the compressible boundary layer equations. Boundary layer scaling is introduced through the grid construction: streamwise grid lines follow eta = y/h = const., where y is the normal coordinate and h(x) is a scale factor proportional to the boundary layer thickness. With this grid, similarity can be applied explicity to calculate initial conditions. The finite volume method preserves the physical transparency of the integral equations in the discrete approximation. The resulting scheme is accurate, efficient, and conceptually simple. Computations for similar and non-similar flows show excellent agreement with tabulated results, solutions computed with Keller's Box scheme, and experimental data.

The State-of-the-Art Parabolic Equation Approximation as Applied to Underwater Acoustic Propagation with Discussions on Intensive Computations: An Invited Paper Presented at the Meeting of the Acoustical Society of America (108th) Held in Minneapolis, Minnesota on 8-12 October 1984

DTIC Science & Technology

1984-10-12

MCYwWWm M& de4 l 8.id iW d by N1wk "wt Finite Difference Reference Wavenumber Interface Split-Step Ordinary Difference Equation Wide Angle Parabolic...Problems D. Lee and S. Praiser J. Comp. & Math. with Appls., 7(2), pp. 195-202 (1981) Finite - Difference Solution to the Parabolic Wave Equation D. Lee, G...was incorporated into the ODE and finite difference models. At that time, we did not have a better implementation of the ODE solution, but we

A 3D finite element ALE method using an approximate Riemann solution

DOE PAGES

Chiravalle, V. P.; Morgan, N. R.

2016-08-09

Arbitrary Lagrangian–Eulerian finite volume methods that solve a multidimensional Riemann-like problem at the cell center in a staggered grid hydrodynamic (SGH) arrangement have been proposed. This research proposes a new 3D finite element arbitrary Lagrangian–Eulerian SGH method that incorporates a multidimensional Riemann-like problem. Here, two different Riemann jump relations are investigated. A new limiting method that greatly improves the accuracy of the SGH method on isentropic flows is investigated. A remap method that improves upon a well-known mesh relaxation and remapping technique in order to ensure total energy conservation during the remap is also presented. Numerical details and test problemmore » results are presented.« less

A 3D finite element ALE method using an approximate Riemann solution

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

Chiravalle, V. P.; Morgan, N. R.

Arbitrary Lagrangian–Eulerian finite volume methods that solve a multidimensional Riemann-like problem at the cell center in a staggered grid hydrodynamic (SGH) arrangement have been proposed. This research proposes a new 3D finite element arbitrary Lagrangian–Eulerian SGH method that incorporates a multidimensional Riemann-like problem. Here, two different Riemann jump relations are investigated. A new limiting method that greatly improves the accuracy of the SGH method on isentropic flows is investigated. A remap method that improves upon a well-known mesh relaxation and remapping technique in order to ensure total energy conservation during the remap is also presented. Numerical details and test problemmore » results are presented.« less

Error and Uncertainty Quantification in the Numerical Simulation of Complex Fluid Flows

NASA Technical Reports Server (NTRS)

Barth, Timothy J.

2010-01-01

The failure of numerical simulation to predict physical reality is often a direct consequence of the compounding effects of numerical error arising from finite-dimensional approximation and physical model uncertainty resulting from inexact knowledge and/or statistical representation. In this topical lecture, we briefly review systematic theories for quantifying numerical errors and restricted forms of model uncertainty occurring in simulations of fluid flow. A goal of this lecture is to elucidate both positive and negative aspects of applying these theories to practical fluid flow problems. Finite-element and finite-volume calculations of subsonic and hypersonic fluid flow are presented to contrast the differing roles of numerical error and model uncertainty. for these problems.

Robust and Efficient Biomolecular Clustering of Tumor Based on ${p}$ -Norm Singular Value Decomposition.

PubMed

Kong, Xiang-Zhen; Liu, Jin-Xing; Zheng, Chun-Hou; Hou, Mi-Xiao; Wang, Juan

2017-07-01

High dimensionality has become a typical feature of biomolecular data. In this paper, a novel dimension reduction method named p-norm singular value decomposition (PSVD) is proposed to seek the low-rank approximation matrix to the biomolecular data. To enhance the robustness to outliers, the Lp-norm is taken as the error function and the Schatten p-norm is used as the regularization function in the optimization model. To evaluate the performance of PSVD, the Kmeans clustering method is then employed for tumor clustering based on the low-rank approximation matrix. Extensive experiments are carried out on five gene expression data sets including two benchmark data sets and three higher dimensional data sets from the cancer genome atlas. The experimental results demonstrate that the PSVD-based method outperforms many existing methods. Especially, it is experimentally proved that the proposed method is more efficient for processing higher dimensional data with good robustness, stability, and superior time performance.

Computer ranking of the sequence of appearance of 73 features of the brain and related structures in staged human embryos during the sixth week of development.

PubMed

O'Rahilly, R; Müller, F; Hutchins, G M; Moore, G W

1987-09-01

The sequence of events in the development of the brain in human embryos, already published for stages 8-15, is here continued for stages 16 and 17. With the aid of a computerized bubble-sort algorithm, 71 individual embryos were ranked in ascending order of the features present. Whereas these numbered 100 in the previous study, the increasing structural complexity gave 27 new features in the two stages now under investigation. The chief characteristics of stage 16 (approximately 37 postovulatory days) are protruding basal nuclei, the caudal olfactory elevation (olfactory tubercle), the tectobulbar tracts, and ascending fibers to the cerebellum. The main features of stage 17 (approximately 41 postovulatory days) are the cortical nucleus of the amygdaloid body, an intermediate layer in the tectum mesencephali, the posterior commissure, and the habenulo-interpeduncular tract. In addition, a typical feature at stage 17 is the crescentic shape of the lens cavity.

Thermal Density Functional Theory: Time-Dependent Linear Response and Approximate Functionals from the Fluctuation-Dissipation Theorem

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

Pribram-Jones, Aurora; Grabowski, Paul E.; Burke, Kieron

We present that the van Leeuwen proof of linear-response time-dependent density functional theory (TDDFT) is generalized to thermal ensembles. This allows generalization to finite temperatures of the Gross-Kohn relation, the exchange-correlation kernel of TDDFT, and fluctuation dissipation theorem for DFT. Finally, this produces a natural method for generating new thermal exchange-correlation approximations.

Thermal Density Functional Theory: Time-Dependent Linear Response and Approximate Functionals from the Fluctuation-Dissipation Theorem

DOE PAGES

Pribram-Jones, Aurora; Grabowski, Paul E.; Burke, Kieron

2016-06-08

We present that the van Leeuwen proof of linear-response time-dependent density functional theory (TDDFT) is generalized to thermal ensembles. This allows generalization to finite temperatures of the Gross-Kohn relation, the exchange-correlation kernel of TDDFT, and fluctuation dissipation theorem for DFT. Finally, this produces a natural method for generating new thermal exchange-correlation approximations.

A new Newton-like method for solving nonlinear equations.

PubMed

Saheya, B; Chen, Guo-Qing; Sui, Yun-Kang; Wu, Cai-Ying

2016-01-01

This paper presents an iterative scheme for solving nonline ar equations. We establish a new rational approximation model with linear numerator and denominator which has generalizes the local linear model. We then employ the new approximation for nonlinear equations and propose an improved Newton's method to solve it. The new method revises the Jacobian matrix by a rank one matrix each iteration and obtains the quadratic convergence property. The numerical performance and comparison show that the proposed method is efficient.

Navy Nurse Corps manpower management model.

PubMed

Kinstler, Daniel P; Johnson, Raymond W; Richter, Anke; Kocher, Kathryn

2008-01-01

The Navy Nurse Corps is part of a team of professionals that provides high quality, economical health care to approximately 700,000 active duty Navy and Marine Corps members, as well as 2.6 million retired and family members. Navy Nurse Corps manpower management efficiency is critical to providing this care. This paper aims to focus on manpower planning in the Navy Nurse Corps. The Nurse Corps manages personnel primarily through the recruitment process, drawing on multiple hiring sources. Promotion rates at the lowest two ranks are mandated, but not at the higher ranks. Retention rates vary across pay grades. Using these promotion and attrition rates, a Markov model was constructed to model the personnel flow of junior nurse corps officers. Hiring sources were shown to have a statistically significant effect on promotion and retention rates. However, these effects were not found to be practically significant in the Markov model. Only small improvements in rank imbalances are possible given current recruiting guidelines. Allowing greater flexibility in recruiting practices, fewer recruits would generate a 25 percent reduction in rank imbalances, but result in understaffing. Recruiting different ranks at entry would generate a 65 percent reduction in rank imbalances without understaffing issues. Policies adjusting promotion and retention rates are more powerful in controlling personnel flows than adjusting hiring sources. These policies are the only means for addressing the fundamental sources of rank imbalances in the Navy Nurse Corps arising from current manpower guidelines. The paper shows that modeling to improve manpower management may enable the Navy Nurse Corps to more efficiently fulfill its mandate for high-quality healthcare.

A conservative implicit finite difference algorithm for the unsteady transonic full potential equation

NASA Technical Reports Server (NTRS)

Steger, J. L.; Caradonna, F. X.

1980-01-01

An implicit finite difference procedure is developed to solve the unsteady full potential equation in conservation law form. Computational efficiency is maintained by use of approximate factorization techniques. The numerical algorithm is first order in time and second order in space. A circulation model and difference equations are developed for lifting airfoils in unsteady flow; however, thin airfoil body boundary conditions have been used with stretching functions to simplify the development of the numerical algorithm.

Geometrically nonlinear analysis of laminated elastic structures

NASA Technical Reports Server (NTRS)

Reddy, J. N.

1984-01-01

Laminated composite plates and shells that can be used to model automobile bodies, aircraft wings and fuselages, and pressure vessels among many other were analyzed. The finite element method, a numerical technique for engineering analysis of structures, is used to model the geometry and approximate the solution. Various alternative formulations for analyzing laminated plates and shells are developed and their finite element models are tested for accuracy and economy in computation. These include the shear deformation laminate theory and degenerated 3-D elasticity theory for laminates.

Three-dimensional elastic stress and displacement analysis of finite circular geometry solids containing cracks

NASA Technical Reports Server (NTRS)

Gyekenyesi, J. P.; Mendelson, A.; Kring, J.

1973-01-01

A seminumerical method is presented for solving a set of coupled partial differential equations subject to mixed and coupled boundary conditions. The use of this method is illustrated by obtaining solutions for two circular geometry and mixed boundary value problems in three-dimensional elasticity. Stress and displacement distributions are calculated in an axisymmetric, circular bar of finite dimensions containing a penny-shaped crack. Approximate results for an annular plate containing internal surface cracks are also presented.

Double absorbing boundaries for finite-difference time-domain electromagnetics

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

LaGrone, John, E-mail: jlagrone@smu.edu; Hagstrom, Thomas, E-mail: thagstrom@smu.edu

We describe the implementation of optimal local radiation boundary condition sequences for second order finite difference approximations to Maxwell's equations and the scalar wave equation using the double absorbing boundary formulation. Numerical experiments are presented which demonstrate that the design accuracy of the boundary conditions is achieved and, for comparable effort, exceeds that of a convolution perfectly matched layer with reasonably chosen parameters. An advantage of the proposed approach is that parameters can be chosen using an accurate a priori error bound.

Two-dimensional potential flow past a smooth wall with partly constant curvature

NASA Technical Reports Server (NTRS)

Koppenfels, Werner Von

1941-01-01

The speed of a two-dimensional flow potential flow past a smooth wall, which evinces a finite curvature jump at a certain point and approximates to two arcs in the surrounding area, has a vertical tangent of inflection in the critical point as a function of the arc length of the boundary curve. This report looks at a general theorem of the local character of the conformal function at the critical point as well as the case of the finite curvature jump.

An error analysis of least-squares finite element method of velocity-pressure-vorticity formulation for Stokes problem

NASA Technical Reports Server (NTRS)

Chang, Ching L.; Jiang, Bo-Nan

1990-01-01

A theoretical proof of the optimal rate of convergence for the least-squares method is developed for the Stokes problem based on the velocity-pressure-vorticity formula. The 2D Stokes problem is analyzed to define the product space and its inner product, and the a priori estimates are derived to give the finite-element approximation. The least-squares method is found to converge at the optimal rate for equal-order interpolation.

Efficient 3-D finite element failure analysis of compression loaded angle-ply plates with holes

NASA Technical Reports Server (NTRS)

Burns, S. W.; Herakovich, C. T.; Williams, J. G.

1987-01-01

Finite element stress analysis and the tensor polynomial failure criterion predict that failure always initiates at the interface between layers on the hole edge for notched angle-ply laminates loaded in compression. The angular location of initial failure is a function of the fiber orientation in the laminate. The dominant stress components initiating failure are shear. It is shown that approximate symmetry can be used to reduce the computer resources required for the case of unaxial loading.

Generation of an incident focused light pulse in FDTD.

PubMed

Capoğlu, Ilker R; Taflove, Allen; Backman, Vadim

2008-11-10

A straightforward procedure is described for accurately creating an incident focused light pulse in the 3-D finite-difference time-domain (FDTD) electromagnetic simulation of the image space of an aplanatic converging lens. In this procedure, the focused light pulse is approximated by a finite sum of plane waves, and each plane wave is introduced into the FDTD simulation grid using the total-field/scattered-field (TF/SF) approach. The accuracy of our results is demonstrated by comparison with exact theoretical formulas.

Generation of an incident focused light pulse in FDTD

PubMed Central

Çapoğlu, İlker R.; Taflove, Allen; Backman, Vadim

2009-01-01

A straightforward procedure is described for accurately creating an incident focused light pulse in the 3-D finite-difference time-domain (FDTD) electromagnetic simulation of the image space of an aplanatic converging lens. In this procedure, the focused light pulse is approximated by a finite sum of plane waves, and each plane wave is introduced into the FDTD simulation grid using the total-field/scattered-field (TF/SF) approach. The accuracy of our results is demonstrated by comparison with exact theoretical formulas. PMID:19582013

Black-Scholes finite difference modeling in forecasting of call warrant prices in Bursa Malaysia

NASA Astrophysics Data System (ADS)

Mansor, Nur Jariah; Jaffar, Maheran Mohd

2014-07-01

Call warrant is a type of structured warrant in Bursa Malaysia. It gives the holder the right to buy the underlying share at a specified price within a limited period of time. The issuer of the structured warrants usually uses European style to exercise the call warrant on the maturity date. Warrant is very similar to an option. Usually, practitioners of the financial field use Black-Scholes model to value the option. The Black-Scholes equation is hard to solve analytically. Therefore the finite difference approach is applied to approximate the value of the call warrant prices. The central in time and central in space scheme is produced to approximate the value of the call warrant prices. It allows the warrant holder to forecast the value of the call warrant prices before the expiry date.

Collapse of composite tubes under end moments

NASA Technical Reports Server (NTRS)

Stockwell, Alan E.; Cooper, Paul A.

1992-01-01

Cylindrical tubes of moderate wall thickness such as those proposed for the original space station truss, may fail due to the gradual collapse of the tube cross section as it distorts under load. Sometimes referred to as the Brazier instability, it is a nonlinear phenomenon. This paper presents an extension of an approximate closed form solution of the collapse of isotropic tubes subject to end moments developed by Reissner in 1959 to include specially orthotropic material. The closed form solution was verified by an extensive nonlinear finite element analysis of the collapse of long tubes under applied end moments for radius to thickness ratios and composite layups in the range proposed for recent space station truss framework designs. The finite element analysis validated the assumption of inextensional deformation of the cylindrical cross section and the approximation of the material as specially orthotropic.

Modified Taylor series method for solving nonlinear differential equations with mixed boundary conditions defined on finite intervals.

PubMed

Vazquez-Leal, Hector; Benhammouda, Brahim; Filobello-Nino, Uriel Antonio; Sarmiento-Reyes, Arturo; Jimenez-Fernandez, Victor Manuel; Marin-Hernandez, Antonio; Herrera-May, Agustin Leobardo; Diaz-Sanchez, Alejandro; Huerta-Chua, Jesus

2014-01-01

In this article, we propose the application of a modified Taylor series method (MTSM) for the approximation of nonlinear problems described on finite intervals. The issue of Taylor series method with mixed boundary conditions is circumvented using shooting constants and extra derivatives of the problem. In order to show the benefits of this proposal, three different kinds of problems are solved: three-point boundary valued problem (BVP) of third-order with a hyperbolic sine nonlinearity, two-point BVP for a second-order nonlinear differential equation with an exponential nonlinearity, and a two-point BVP for a third-order nonlinear differential equation with a radical nonlinearity. The result shows that the MTSM method is capable to generate easily computable and highly accurate approximations for nonlinear equations. 34L30.

A Note on Substructuring Preconditioning for Nonconforming Finite Element Approximations of Second Order Elliptic Problems

NASA Technical Reports Server (NTRS)

Maliassov, Serguei

1996-01-01

In this paper an algebraic substructuring preconditioner is considered for nonconforming finite element approximations of second order elliptic problems in 3D domains with a piecewise constant diffusion coefficient. Using a substructuring idea and a block Gauss elimination, part of the unknowns is eliminated and the Schur complement obtained is preconditioned by a spectrally equivalent very sparse matrix. In the case of quasiuniform tetrahedral mesh an appropriate algebraic multigrid solver can be used to solve the problem with this matrix. Explicit estimates of condition numbers and implementation algorithms are established for the constructed preconditioner. It is shown that the condition number of the preconditioned matrix does not depend on either the mesh step size or the jump of the coefficient. Finally, numerical experiments are presented to illustrate the theory being developed.

Aspects of numerical and representational methods related to the finite-difference simulation of advective and dispersive transport of freshwater in a thin brackish aquifer

USGS Publications Warehouse

Merritt, M.L.

1993-01-01

The simulation of the transport of injected freshwater in a thin brackish aquifer, overlain and underlain by confining layers containing more saline water, is shown to be influenced by the choice of the finite-difference approximation method, the algorithm for representing vertical advective and dispersive fluxes, and the values assigned to parametric coefficients that specify the degree of vertical dispersion and molecular diffusion that occurs. Computed potable water recovery efficiencies will differ depending upon the choice of algorithm and approximation method, as will dispersion coefficients estimated based on the calibration of simulations to match measured data. A comparison of centered and backward finite-difference approximation methods shows that substantially different transition zones between injected and native waters are depicted by the different methods, and computed recovery efficiencies vary greatly. Standard and experimental algorithms and a variety of values for molecular diffusivity, transverse dispersivity, and vertical scaling factor were compared in simulations of freshwater storage in a thin brackish aquifer. Computed recovery efficiencies vary considerably, and appreciable differences are observed in the distribution of injected freshwater in the various cases tested. The results demonstrate both a qualitatively different description of transport using the experimental algorithms and the interrelated influences of molecular diffusion and transverse dispersion on simulated recovery efficiency. When simulating natural aquifer flow in cross-section, flushing of the aquifer occurred for all tested coefficient choices using both standard and experimental algorithms. ?? 1993.

COMPARISONS OF THE FINITE-ELEMENT-WITH-DISCONTIGUOUS-SUPPORT METHOD TO CONTINUOUS-ENERGY MONTE CARLO FOR PIN-CELL PROBLEMS

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

A. T. Till; M. Hanuš; J. Lou

The standard multigroup (MG) method for energy discretization of the transport equation can be sensitive to approximations in the weighting spectrum chosen for cross-section averaging. As a result, MG often inaccurately treats important phenomena such as self-shielding variations across a material. From a finite-element viewpoint, MG uses a single fixed basis function (the pre-selected spectrum) within each group, with no mechanism to adapt to local solution behavior. In this work, we introduce the Finite-Element-with-Discontiguous-Support (FEDS) method, whose only approximation with respect to energy is that the angular flux is a linear combination of unknowns multiplied by basis functions. A basismore » function is non-zero only in the discontiguous set of energy intervals associated with its energy element. Discontiguous energy elements are generalizations of bands and are determined by minimizing a norm of the difference between snapshot spectra and their averages over the energy elements. We begin by presenting the theory of the FEDS method. We then compare to continuous-energy Monte Carlo for one-dimensional slab and two-dimensional pin-cell problem. We find FEDS to be accurate and efficient at producing quantities of interest such as reaction rates and eigenvalues. Results show that FEDS converges at a rate that is approximately first-order in the number of energy elements and that FEDS is less sensitive to weighting spectrum than standard MG.« less

An energy-based equilibrium contact angle boundary condition on jagged surfaces for phase-field methods.

PubMed

Frank, Florian; Liu, Chen; Scanziani, Alessio; Alpak, Faruk O; Riviere, Beatrice

2018-08-01

We consider an energy-based boundary condition to impose an equilibrium wetting angle for the Cahn-Hilliard-Navier-Stokes phase-field model on voxel-set-type computational domains. These domains typically stem from μCT (micro computed tomography) imaging of porous rock and approximate a (on μm scale) smooth domain with a certain resolution. Planar surfaces that are perpendicular to the main axes are naturally approximated by a layer of voxels. However, planar surfaces in any other directions and curved surfaces yield a jagged/topologically rough surface approximation by voxels. For the standard Cahn-Hilliard formulation, where the contact angle between the diffuse interface and the domain boundary (fluid-solid interface/wall) is 90°, jagged surfaces have no impact on the contact angle. However, a prescribed contact angle smaller or larger than 90° on jagged voxel surfaces is amplified. As a remedy, we propose the introduction of surface energy correction factors for each fluid-solid voxel face that counterbalance the difference of the voxel-set surface area with the underlying smooth one. The discretization of the model equations is performed with the discontinuous Galerkin method. However, the presented semi-analytical approach of correcting the surface energy is equally applicable to other direct numerical methods such as finite elements, finite volumes, or finite differences, since the correction factors appear in the strong formulation of the model. Copyright © 2018 Elsevier Inc. All rights reserved.

On the convergence of local approximations to pseudodifferential operators with applications

NASA Technical Reports Server (NTRS)

Hagstrom, Thomas

1994-01-01

We consider the approximation of a class pseudodifferential operators by sequences of operators which can be expressed as compositions of differential operators and their inverses. We show that the error in such approximations can be bounded in terms of L(1) error in approximating a convolution kernel, and use this fact to develop convergence results. Our main result is a finite time convergence analysis of the Engquist-Majda Pade approximants to the square root of the d'Alembertian. We also show that no spatially local approximation to this operator can be convergent uniformly in time. We propose some temporally local but spatially nonlocal operators with better long time behavior. These are based on Laguerre and exponential series.

A consistent hierarchy of generalized kinetic equation approximations to the master equation applied to surface catalysis.

PubMed

Herschlag, Gregory J; Mitran, Sorin; Lin, Guang

2015-06-21

We develop a hierarchy of approximations to the master equation for systems that exhibit translational invariance and finite-range spatial correlation. Each approximation within the hierarchy is a set of ordinary differential equations that considers spatial correlations of varying lattice distance; the assumption is that the full system will have finite spatial correlations and thus the behavior of the models within the hierarchy will approach that of the full system. We provide evidence of this convergence in the context of one- and two-dimensional numerical examples. Lower levels within the hierarchy that consider shorter spatial correlations are shown to be up to three orders of magnitude faster than traditional kinetic Monte Carlo methods (KMC) for one-dimensional systems, while predicting similar system dynamics and steady states as KMC methods. We then test the hierarchy on a two-dimensional model for the oxidation of CO on RuO2(110), showing that low-order truncations of the hierarchy efficiently capture the essential system dynamics. By considering sequences of models in the hierarchy that account for longer spatial correlations, successive model predictions may be used to establish empirical approximation of error estimates. The hierarchy may be thought of as a class of generalized phenomenological kinetic models since each element of the hierarchy approximates the master equation and the lowest level in the hierarchy is identical to a simple existing phenomenological kinetic models.

Semi-discrete approximations to nonlinear systems of conservation laws; consistency and L(infinity)-stability imply convergence

NASA Technical Reports Server (NTRS)

Tadmor, Eitan

1988-01-01

A convergence theory for semi-discrete approximations to nonlinear systems of conservation laws is developed. It is shown, by a series of scalar counter-examples, that consistency with the conservation law alone does not guarantee convergence. Instead, a notion of consistency which takes into account both the conservation law and its augmenting entropy condition is introduced. In this context it is concluded that consistency and L(infinity)-stability guarantee for a relevant class of admissible entropy functions, that their entropy production rate belongs to a compact subset of H(loc)sup -1 (x,t). One can now use compensated compactness arguments in order to turn this conclusion into a convergence proof. The current state of the art for these arguments includes the scalar and a wide class of 2 x 2 systems of conservation laws. The general framework of the vanishing viscosity method is studied as an effective way to meet the consistency and L(infinity)-stability requirements. How this method is utilized to enforce consistency and stability for scalar conservation laws is shown. In this context we prove, under the appropriate assumptions, the convergence of finite difference approximations (e.g., the high resolution TVD and UNO methods), finite element approximations (e.g., the Streamline-Diffusion methods) and spectral and pseudospectral approximations (e.g., the Spectral Viscosity methods).

Semi-discrete approximations to nonlinear systems of conservation laws; consistency and L(infinity)-stability imply convergence. Final report

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

Tadmor, E.

1988-07-01

A convergence theory for semi-discrete approximations to nonlinear systems of conservation laws is developed. It is shown, by a series of scalar counter-examples, that consistency with the conservation law alone does not guarantee convergence. Instead, a notion of consistency which takes into account both the conservation law and its augmenting entropy condition is introduced. In this context it is concluded that consistency and L(infinity)-stability guarantee for a relevant class of admissible entropy functions, that their entropy production rate belongs to a compact subset of H(loc)sup -1 (x,t). One can now use compensated compactness arguments in order to turn this conclusionmore » into a convergence proof. The current state of the art for these arguments includes the scalar and a wide class of 2 x 2 systems of conservation laws. The general framework of the vanishing viscosity method is studied as an effective way to meet the consistency and L(infinity)-stability requirements. How this method is utilized to enforce consistency and stability for scalar conservation laws is shown. In this context we prove, under the appropriate assumptions, the convergence of finite difference approximations (e.g., the high resolution TVD and UNO methods), finite element approximations (e.g., the Streamline-Diffusion methods) and spectral and pseudospectral approximations (e.g., the Spectral Viscosity methods).« less

Robust Visual Tracking via Online Discriminative and Low-Rank Dictionary Learning.

PubMed

Zhou, Tao; Liu, Fanghui; Bhaskar, Harish; Yang, Jie

2017-09-12

In this paper, we propose a novel and robust tracking framework based on online discriminative and low-rank dictionary learning. The primary aim of this paper is to obtain compact and low-rank dictionaries that can provide good discriminative representations of both target and background. We accomplish this by exploiting the recovery ability of low-rank matrices. That is if we assume that the data from the same class are linearly correlated, then the corresponding basis vectors learned from the training set of each class shall render the dictionary to become approximately low-rank. The proposed dictionary learning technique incorporates a reconstruction error that improves the reliability of classification. Also, a multiconstraint objective function is designed to enable active learning of a discriminative and robust dictionary. Further, an optimal solution is obtained by iteratively computing the dictionary, coefficients, and by simultaneously learning the classifier parameters. Finally, a simple yet effective likelihood function is implemented to estimate the optimal state of the target during tracking. Moreover, to make the dictionary adaptive to the variations of the target and background during tracking, an online update criterion is employed while learning the new dictionary. Experimental results on a publicly available benchmark dataset have demonstrated that the proposed tracking algorithm performs better than other state-of-the-art trackers.

Stochastic constructions of flows of rank 1

NASA Astrophysics Data System (ADS)

Prikhod'ko, A. A.

2001-12-01

Automorphisms of rank 1 appeared in the well-known papers of Chacon (1965), who constructed an example of a weakly mixing automorphism not having the strong mixing property, and Ornstein (1970), who proved the existence of mixing automorphisms without a square root. Ornstein's construction is essentially stochastic, since its parameters are chosen in a "sufficiently random manner" according to a certain random law.In the present article it is shown that mixing flows of rank 1 exist. The construction given is also stochastic and is based to a large extent on ideas in Ornstein's paper. At the same time it complements Ornstein's paper and makes it more transparent. The construction can be used also to obtain automorphisms with various approximation and statistical properties. It is established that the new examples of dynamical systems are not isomorphic to Ornstein automorphisms, that is, they are qualitatively new.

Stochastic constructions of flows of rank 1

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

Prikhod'ko, A A

2001-12-31

Automorphisms of rank 1 appeared in the well-known papers of Chacon (1965), who constructed an example of a weakly mixing automorphism not having the strong mixing property, and Ornstein (1970), who proved the existence of mixing automorphisms without a square root. Ornstein's construction is essentially stochastic, since its parameters are chosen in a 'sufficiently random manner' according to a certain random law. In the present article it is shown that mixing flows of rank 1 exist. The construction given is also stochastic and is based to a large extent on ideas in Ornstein's paper. At the same time it complementsmore » Ornstein's paper and makes it more transparent. The construction can be used also to obtain automorphisms with various approximation and statistical properties. It is established that the new examples of dynamical systems are not isomorphic to Ornstein automorphisms, that is, they are qualitatively new.« less

Identification of material parameters for plasticity models: A comparative study on the finite element model updating and the virtual fields method

NASA Astrophysics Data System (ADS)

Martins, J. M. P.; Thuillier, S.; Andrade-Campos, A.

2018-05-01

The identification of material parameters, for a given constitutive model, can be seen as the first step before any practical application. In the last years, the field of material parameters identification received an important boost with the development of full-field measurement techniques, such as Digital Image Correlation. These techniques enable the use of heterogeneous displacement/strain fields, which contain more information than the classical homogeneous tests. Consequently, different techniques have been developed to extract material parameters from full-field measurements. In this study, two of these techniques are addressed, the Finite Element Model Updating (FEMU) and the Virtual Fields Method (VFM). The main idea behind FEMU is to update the parameters of a constitutive model implemented in a finite element model until both numerical and experimental results match, whereas VFM makes use of the Principle of Virtual Work and does not require any finite element simulation. Though both techniques proved their feasibility in linear and non-linear constitutive models, it is rather difficult to rank their robustness in plasticity. The purpose of this work is to perform a comparative study in the case of elasto-plastic models. Details concerning the implementation of each strategy are presented. Moreover, a dedicated code for VFM within a large strain framework is developed. The reconstruction of the stress field is performed through a user subroutine. A heterogeneous tensile test is considered to compare FEMU and VFM strategies.

Finite Geometries in Quantum Theory:. from Galois (fields) to Hjelmslev (rings)

NASA Astrophysics Data System (ADS)

Saniga, Metod; Planat, Michel

Geometries over Galois fields (and related finite combinatorial structures/algebras) have recently been recognized to play an ever-increasing role in quantum theory, especially when addressing properties of mutually unbiased bases (MUBs). The purpose of this contribution is to show that completely new vistas open up if we consider a generalized class of finite (projective) geometries, viz. those defined over Galois rings and/or other finite Hjelmslev rings. The case is illustrated by demonstrating that the basic combinatorial properties of a complete set of MUBs of a q-dimensional Hilbert space { H}q, q = pr with p being a prime and r a positive integer, are qualitatively mimicked by the configuration of points lying on a proper conic in a projective Hjelmslev plane defined over a Galois ring of characteristic p2 and rank r. The q vectors of a basis of { H}q correspond to the q points of a (so-called) neighbour class and the q + 1 MUBs answer to the total number of (pairwise disjoint) neighbour classes on the conic. Although this remarkable analogy is still established at the level of cardinalities only, we currently work on constructing an explicit mapping by associating a MUB to each neighbour class of the points of the conic and a state vector of this MUB to a particular point of the class. Further research in this direction may prove to be of great relevance for many areas of quantum information theory, in particular for quantum information processing.

Improved Linear Algebra Methods for Redshift Computation from Limited Spectrum Data - II

NASA Technical Reports Server (NTRS)

Foster, Leslie; Waagen, Alex; Aijaz, Nabella; Hurley, Michael; Luis, Apolo; Rinsky, Joel; Satyavolu, Chandrika; Gazis, Paul; Srivastava, Ashok; Way, Michael

2008-01-01

Given photometric broadband measurements of a galaxy, Gaussian processes may be used with a training set to solve the regression problem of approximating the redshift of this galaxy. However, in practice solving the traditional Gaussian processes equation is too slow and requires too much memory. We employed several methods to avoid this difficulty using algebraic manipulation and low-rank approximation, and were able to quickly approximate the redshifts in our testing data within 17 percent of the known true values using limited computational resources. The accuracy of one method, the V Formulation, is comparable to the accuracy of the best methods currently used for this problem.

Nonlinear electroelastic deformations of dielectric elastomer composites: II - Non-Gaussian elastic dielectrics

NASA Astrophysics Data System (ADS)

Lefèvre, Victor; Lopez-Pamies, Oscar

2017-02-01

This paper presents an analytical framework to construct approximate homogenization solutions for the macroscopic elastic dielectric response - under finite deformations and finite electric fields - of dielectric elastomer composites with two-phase isotropic particulate microstructures. The central idea consists in employing the homogenization solution derived in Part I of this work for ideal elastic dielectric composites within the context of a nonlinear comparison medium method - this is derived as an extension of the comparison medium method of Lopez-Pamies et al. (2013) in nonlinear elastostatics to the coupled realm of nonlinear electroelastostatics - to generate in turn a corresponding solution for composite materials with non-ideal elastic dielectric constituents. Complementary to this analytical framework, a hybrid finite-element formulation to construct homogenization solutions numerically (in three dimensions) is also presented. The proposed analytical framework is utilized to work out a general approximate homogenization solution for non-Gaussian dielectric elastomers filled with nonlinear elastic dielectric particles that may exhibit polarization saturation. The solution applies to arbitrary (non-percolative) isotropic distributions of filler particles. By construction, it is exact in the limit of small deformations and moderate electric fields. For finite deformations and finite electric fields, its accuracy is demonstrated by means of direct comparisons with finite-element solutions. Aimed at gaining physical insight into the extreme enhancement in electrostriction properties displayed by emerging dielectric elastomer composites, various cases wherein the filler particles are of poly- and mono-disperse sizes and exhibit different types of elastic dielectric behavior are discussed in detail. Contrary to an initial conjecture in the literature, it is found (inter alia) that the isotropic addition of a small volume fraction of stiff (semi-)conducting/high-permittivity particles to dielectric elastomers does not lead to the extreme electrostriction enhancements observed in experiments. It is posited that such extreme enhancements are the manifestation of interphasial phenomena.

75 FR 72611 - Assessments, Large Bank Pricing

Federal Register 2010, 2011, 2012, 2013, 2014

2010-11-24

... the worst risk ranking and are included in the statistical analysis. Appendix 1 to the NPR describes the statistical analysis in detail. \\12\\ The percentage approximated by factors is based on the statistical model for that particual year. Actual weights assigned to each scorecard measure are largely based...

Sensitizing Community College Personnel through Customer Service Training.

ERIC Educational Resources Information Center

Chitwood, James P.

Educational institutions rank second among the largest service industries in the United States with more than 9.1 million employees. Unfortunately, higher education institutions have shown a lack of orientation towards clientele service. Okaloosa-Walton Community College (OWCC), a comprehensive college enrolling approximately 16,000 students…

Modeling and analysis of visual digital impact model for a Chinese human thorax.

PubMed

Zhu, Jin; Wang, Kai-Ming; Li, Shu; Liu, Hai-Yan; Jing, Xiao; Li, Xiao-Fang; Liu, Yi-He

2017-01-01

To establish a three-dimensional finite element model of the human chest for engineering research on individual protection. Computed tomography (CT) scanning data were used for three-dimensional reconstruction with the medical image reconstruction software Mimics. The finite element method (FEM) preprocessing software ANSYS ICEM CFD was used for cell mesh generation, and the relevant material behavior parameters of all of the model's parts were specified. The finite element model was constructed with the FEM software, and the model availability was verified based on previous cadaver experimental data. A finite element model approximating the anatomical structure of the human chest was established, and the model's simulation results conformed to the results of the cadaver experiment overall. Segment data of the human body and specialized software can be utilized for FEM model reconstruction to satisfy the need for numerical analysis of shocks to the human chest in engineering research on body mechanics.

An Optimal Order Nonnested Mixed Multigrid Method for Generalized Stokes Problems

NASA Technical Reports Server (NTRS)

Deng, Qingping

1996-01-01

A multigrid algorithm is developed and analyzed for generalized Stokes problems discretized by various nonnested mixed finite elements within a unified framework. It is abstractly proved by an element-independent analysis that the multigrid algorithm converges with an optimal order if there exists a 'good' prolongation operator. A technique to construct a 'good' prolongation operator for nonnested multilevel finite element spaces is proposed. Its basic idea is to introduce a sequence of auxiliary nested multilevel finite element spaces and define a prolongation operator as a composite operator of two single grid level operators. This makes not only the construction of a prolongation operator much easier (the final explicit forms of such prolongation operators are fairly simple), but the verification of the approximate properties for prolongation operators is also simplified. Finally, as an application, the framework and technique is applied to seven typical nonnested mixed finite elements.

Exponential convergence through linear finite element discretization of stratified subdomains

NASA Astrophysics Data System (ADS)

Guddati, Murthy N.; Druskin, Vladimir; Vaziri Astaneh, Ali

2016-10-01

Motivated by problems where the response is needed at select localized regions in a large computational domain, we devise a novel finite element discretization that results in exponential convergence at pre-selected points. The key features of the discretization are (a) use of midpoint integration to evaluate the contribution matrices, and (b) an unconventional mapping of the mesh into complex space. Named complex-length finite element method (CFEM), the technique is linked to Padé approximants that provide exponential convergence of the Dirichlet-to-Neumann maps and thus the solution at specified points in the domain. Exponential convergence facilitates drastic reduction in the number of elements. This, combined with sparse computation associated with linear finite elements, results in significant reduction in the computational cost. The paper presents the basic ideas of the method as well as illustration of its effectiveness for a variety of problems involving Laplace, Helmholtz and elastodynamics equations.