WorldWideScience

Sample records for approximate inverse preconditioner

  1. Fast wavelet based sparse approximate inverse preconditioner

    Energy Technology Data Exchange (ETDEWEB)

    Wan, W.L. [Univ. of California, Los Angeles, CA (United States)

    1996-12-31

    Incomplete LU factorization is a robust preconditioner for both general and PDE problems but unfortunately not easy to parallelize. Recent study of Huckle and Grote and Chow and Saad showed that sparse approximate inverse could be a potential alternative while readily parallelizable. However, for special class of matrix A that comes from elliptic PDE problems, their preconditioners are not optimal in the sense that independent of mesh size. A reason may be that no good sparse approximate inverse exists for the dense inverse matrix. Our observation is that for this kind of matrices, its inverse entries typically have piecewise smooth changes. We can take advantage of this fact and use wavelet compression techniques to construct a better sparse approximate inverse preconditioner. We shall show numerically that our approach is effective for this kind of matrices.

  2. Approximate Inverse Preconditioners with Adaptive Dropping

    Czech Academy of Sciences Publication Activity Database

    Kopal, J.; Rozložník, Miroslav; Tůma, Miroslav

    2015-01-01

    Roč. 84, June (2015), s. 13-20 ISSN 0965-9978 R&D Projects: GA ČR(CZ) GAP108/11/0853; GA ČR GA13-06684S Institutional support: RVO:67985807 Keywords : approximate inverse * Gram-Schmidt orthogonalization * incomplete decomposition * preconditioned conjugate gradient method * algebraic preconditioning * pivoting Subject RIV: BA - General Mathematics Impact factor: 1.673, year: 2015

  3. Parallel iterative solvers and preconditioners using approximate hierarchical methods

    Energy Technology Data Exchange (ETDEWEB)

    Grama, A.; Kumar, V.; Sameh, A. [Univ. of Minnesota, Minneapolis, MN (United States)

    1996-12-31

    In this paper, we report results of the performance, convergence, and accuracy of a parallel GMRES solver for Boundary Element Methods. The solver uses a hierarchical approximate matrix-vector product based on a hybrid Barnes-Hut / Fast Multipole Method. We study the impact of various accuracy parameters on the convergence and show that with minimal loss in accuracy, our solver yields significant speedups. We demonstrate the excellent parallel efficiency and scalability of our solver. The combined speedups from approximation and parallelism represent an improvement of several orders in solution time. We also develop fast and paralellizable preconditioners for this problem. We report on the performance of an inner-outer scheme and a preconditioner based on truncated Green`s function. Experimental results on a 256 processor Cray T3D are presented.

  4. Approximate inverse preconditioning of iterative methods for nonsymmetric linear systems

    Energy Technology Data Exchange (ETDEWEB)

    Benzi, M. [Universita di Bologna (Italy); Tuma, M. [Inst. of Computer Sciences, Prague (Czech Republic)

    1996-12-31

    A method for computing an incomplete factorization of the inverse of a nonsymmetric matrix A is presented. The resulting factorized sparse approximate inverse is used as a preconditioner in the iterative solution of Ax = b by Krylov subspace methods.

  5. Incomplete Sparse Approximate Inverses for Parallel Preconditioning

    International Nuclear Information System (INIS)

    Anzt, Hartwig; University of Tennessee, Knoxville, TN; Huckle, Thomas K.; Bräckle, Jürgen; Dongarra, Jack

    2017-01-01

    In this study, we propose a new preconditioning method that can be seen as a generalization of block-Jacobi methods, or as a simplification of the sparse approximate inverse (SAI) preconditioners. The “Incomplete Sparse Approximate Inverses” (ISAI) is in particular efficient in the solution of sparse triangular linear systems of equations. Those arise, for example, in the context of incomplete factorization preconditioning. ISAI preconditioners can be generated via an algorithm providing fine-grained parallelism, which makes them attractive for hardware with a high concurrency level. Finally, in a study covering a large number of matrices, we identify the ISAI preconditioner as an attractive alternative to exact triangular solves in the context of incomplete factorization preconditioning.

  6. Approximate tensor-product preconditioners for very high order discontinuous Galerkin methods

    Science.gov (United States)

    Pazner, Will; Persson, Per-Olof

    2018-02-01

    In this paper, we develop a new tensor-product based preconditioner for discontinuous Galerkin methods with polynomial degrees higher than those typically employed. This preconditioner uses an automatic, purely algebraic method to approximate the exact block Jacobi preconditioner by Kronecker products of several small, one-dimensional matrices. Traditional matrix-based preconditioners require O (p2d) storage and O (p3d) computational work, where p is the degree of basis polynomials used, and d is the spatial dimension. Our SVD-based tensor-product preconditioner requires O (p d + 1) storage, O (p d + 1) work in two spatial dimensions, and O (p d + 2) work in three spatial dimensions. Combined with a matrix-free Newton-Krylov solver, these preconditioners allow for the solution of DG systems in linear time in p per degree of freedom in 2D, and reduce the computational complexity from O (p9) to O (p5) in 3D. Numerical results are shown in 2D and 3D for the advection, Euler, and Navier-Stokes equations, using polynomials of degree up to p = 30. For many test cases, the preconditioner results in similar iteration counts when compared with the exact block Jacobi preconditioner, and performance is significantly improved for high polynomial degrees p.

  7. Comparison of preconditioners for collocation Chebyshev approximation of 2D and 3D generalized Stokes problem

    International Nuclear Information System (INIS)

    Garba, Abdou; Haldenwang, Pierre

    2003-01-01

    The aim of the paper is concerned with the iterative resolution of the generalized Stokes problem in the framework of collocation Chebyshev approximation. More precisely, we analyze the performance of several preconditioners improving the classical Uzawa method. We first recall that the general Stokes problem (GSP) is an elementary substep of general interest for computing not only incompressible flows but also low Mach number flows. We then remark that performances of the classical Uzawa algorithm for solving the GSP are in fact closely related to the Reynolds number. In order to overcome this dependence, preconditioners are needed. The preconditioners we analyze here are recommended by Fourier analysis of the pressure operator. We additionally give interpretation of the preconditioners in terms of influence (or capacitance) techniques. We give a detailed analysis of the conditioning of the discrete collocation Chebyshev versions of the operators. Numerical comparison is conducted in 2D as well as in 3D rectangular geometry. Our comparative study shows that the fictitious wall permeability (FWP) method is the most efficient preconditioner. If complemented with a suitable pressure filtering, its efficiency still increases

  8. Multilevel preconditioners for discontinuous, Galerkin approximations of elliptic problems, with jump coefficients

    KAUST Repository

    Ayuso Dios, Blanca

    2013-10-30

    We introduce and analyze two-level and multilevel preconditioners for a family of Interior Penalty (IP) discontinuous Galerkin (DG) discretizations of second order elliptic problems with large jumps in the diffusion coefficient. Our approach to IPDG-type methods is based on a splitting of the DG space into two components that are orthogonal in the energy inner product naturally induced by the methods. As a result, the methods and their analysis depend in a crucial way on the diffusion coefficient of the problem. The analysis of the proposed preconditioners is presented for both symmetric and non-symmetric IP schemes; dealing simultaneously with the jump in the diffusion coefficient and the non-nested character of the relevant discrete spaces presents additional difficulties in the analysis, which precludes a simple extension of existing results. However, we are able to establish robustness (with respect to the diffusion coefficient) and near-optimality (up to a logarithmic term depending on the mesh size) for both two-level and BPX-type preconditioners, by using a more refined Conjugate Gradient theory. Useful by-products of the analysis are the supporting results on the construction and analysis of simple, efficient and robust two-level and multilevel preconditioners for non-conforming Crouzeix-Raviart discretizations of elliptic problems with jump coefficients. Following the analysis, we present a sequence of detailed numerical results which verify the theory and illustrate the performance of the methods. © 2013 American Mathematical Society.

  9. Elliptic Preconditioner for Accelerating the Self-Consistent Field Iteration in Kohn--Sham Density Functional Theory

    Energy Technology Data Exchange (ETDEWEB)

    Lin, Lin [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States). Computational Research Division; Yang, Chao [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States). Computational Research Division

    2013-10-28

    We discuss techniques for accelerating the self consistent field (SCF) iteration for solving the Kohn-Sham equations. These techniques are all based on constructing approximations to the inverse of the Jacobian associated with a fixed point map satisfied by the total potential. They can be viewed as preconditioners for a fixed point iteration. We point out different requirements for constructing preconditioners for insulating and metallic systems respectively, and discuss how to construct preconditioners to keep the convergence rate of the fixed point iteration independent of the size of the atomistic system. We propose a new preconditioner that can treat insulating and metallic system in a unified way. The new preconditioner, which we call an elliptic preconditioner, is constructed by solving an elliptic partial differential equation. The elliptic preconditioner is shown to be more effective in accelerating the convergence of a fixed point iteration than the existing approaches for large inhomogeneous systems at low temperature.

  10. Nonlinear approximation with dictionaries. II. Inverse Estimates

    DEFF Research Database (Denmark)

    Gribonval, Rémi; Nielsen, Morten

    2006-01-01

    In this paper, which is the sequel to [16], we study inverse estimates of the Bernstein type for nonlinear approximation with structured redundant dictionaries in a Banach space. The main results are for blockwise incoherent dictionaries in Hilbert spaces, which generalize the notion of joint block...

  11. Nonlinear approximation with dictionaries,.. II: Inverse estimates

    DEFF Research Database (Denmark)

    Gribonval, Rémi; Nielsen, Morten

    In this paper we study inverse estimates of the Bernstein type for nonlinear approximation with structured redundant dictionaries in a Banach space. The main results are for separated decomposable dictionaries in Hilbert spaces, which generalize the notion of joint block-diagonal mutually...

  12. Factorized parallel preconditioner for the saddle point problem

    DEFF Research Database (Denmark)

    Lazarov, Boyan Stefanov; Sigmund, Ole

    2011-01-01

    The aim of this paper is to apply the factorized sparse approximate inverse (FSAI) preconditioner to the iterative solution of linear systems with indefinite symmetric matrices. Until now the FSAI technique has been applied mainly to positive definite systems and with a limited success for the in......The aim of this paper is to apply the factorized sparse approximate inverse (FSAI) preconditioner to the iterative solution of linear systems with indefinite symmetric matrices. Until now the FSAI technique has been applied mainly to positive definite systems and with a limited success...... for the indefinite case. Here, it is demonstrated that the sparsity pattern for the preconditioner can be chosen in such a way that it guarantees the existence of the factorization. The proposed scheme shows excellent parallel scalability, performance and robustness. It is applicable with short recurrence iterative...

  13. A convergence analysis for a sweeping preconditioner for block tridiagonal systems of linear equations

    KAUST Repository

    Bagci, Hakan

    2014-11-11

    We study sweeping preconditioners for symmetric and positive definite block tridiagonal systems of linear equations. The algorithm provides an approximate inverse that can be used directly or in a preconditioned iterative scheme. These algorithms are based on replacing the Schur complements appearing in a block Gaussian elimination direct solve by hierarchical matrix approximations with reduced off-diagonal ranks. This involves developing low rank hierarchical approximations to inverses. We first provide a convergence analysis for the algorithm for reduced rank hierarchical inverse approximation. These results are then used to prove convergence and preconditioning estimates for the resulting sweeping preconditioner.

  14. Factorized Approximate Inverses With Adaptive Dropping

    Czech Academy of Sciences Publication Activity Database

    Kopal, Jiří; Rozložník, Miroslav; Tůma, Miroslav

    2016-01-01

    Roč. 38, č. 3 (2016), A1807-A1820 ISSN 1064-8275 R&D Projects: GA ČR GA13-06684S Grant - others:GA MŠk(CZ) LL1202 Institutional support: RVO:67985807 Keywords : approximate inverses * incomplete factorization * Gram–Schmidt orthogonalization * preconditioned iterative methods Subject RIV: BA - General Mathematics Impact factor: 2.195, year: 2016

  15. Application of polynomial preconditioners to conservation laws

    NARCIS (Netherlands)

    Geurts, Bernardus J.; van Buuren, R.; Lu, H.

    2000-01-01

    Polynomial preconditioners which are suitable in implicit time-stepping methods for conservation laws are reviewed and analyzed. The preconditioners considered are either based on a truncation of a Neumann series or on Chebyshev polynomials for the inverse of the system-matrix. The latter class of

  16. Approximation of Bayesian Inverse Problems for PDEs

    OpenAIRE

    Cotter, S. L.; Dashti, M.; Stuart, A. M.

    2010-01-01

    Inverse problems are often ill posed, with solutions that depend sensitively on data.n any numerical approach to the solution of such problems, regularization of some form is needed to counteract the resulting instability. This paper is based on an approach to regularization, employing a Bayesian formulation of the problem, which leads to a notion of well posedness for inverse problems, at the level of probability measures. The stability which results from this well posedness may be used as t...

  17. Approximation of the inverse G-frame operator

    Indian Academy of Sciences (India)

    In this paper, we introduce the concept of (strong) projection method for -frames which works for all conditional -Riesz frames. We also derive a method for approximation of the inverse -frame operator which is efficient for all -frames. We show how the inverse of -frame operator can be approximated as close as we ...

  18. Approximation of the inverse G-frame operator

    Indian Academy of Sciences (India)

    ... projection method for -frames which works for all conditional -Riesz frames. We also derive a method for approximation of the inverse -frame operator which is efficient for all -frames. We show how the inverse of -frame operator can be approximated as close as we like using finite-dimensional linear algebra.

  19. Approximate 2D inversion of airborne TEM data

    DEFF Research Database (Denmark)

    Christensen, N.B.; Wolfgram, Peter

    2006-01-01

    We propose an approximate two-dimensional inversion procedure for transient electromagnetic data. The method is a two-stage procedure, where data are first inverted with 1D multi-layer models. The 1D model section is then considered as data for the next inversion stage that produces the 2D model...

  20. Using Chebyshev polynomials and approximate inverse triangular factorizations for preconditioning the conjugate gradient method

    Science.gov (United States)

    Kaporin, I. E.

    2012-02-01

    In order to precondition a sparse symmetric positive definite matrix, its approximate inverse is examined, which is represented as the product of two sparse mutually adjoint triangular matrices. In this way, the solution of the corresponding system of linear algebraic equations (SLAE) by applying the preconditioned conjugate gradient method (CGM) is reduced to performing only elementary vector operations and calculating sparse matrix-vector products. A method for constructing the above preconditioner is described and analyzed. The triangular factor has a fixed sparsity pattern and is optimal in the sense that the preconditioned matrix has a minimum K-condition number. The use of polynomial preconditioning based on Chebyshev polynomials makes it possible to considerably reduce the amount of scalar product operations (at the cost of an insignificant increase in the total number of arithmetic operations). The possibility of an efficient massively parallel implementation of the resulting method for solving SLAEs is discussed. For a sequential version of this method, the results obtained by solving 56 test problems from the Florida sparse matrix collection (which are large-scale and ill-conditioned) are presented. These results show that the method is highly reliable and has low computational costs.

  1. The method of approximate inverse theory and applications

    CERN Document Server

    Schuster, Thomas

    2007-01-01

    Inverse problems arise whenever one tries to calculate a required quantity from given measurements of a second quantity that is associated to the first one. Besides medical imaging and non-destructive testing, inverse problems also play an increasing role in other disciplines such as industrial and financial mathematics. Hence, there is a need for stable and efficient solvers. The book is concerned with the method of approximate inverse which is a regularization technique for stably solving inverse problems in various settings such as L2-spaces, Hilbert spaces or spaces of distributions. The performance and functionality of the method is demonstrated on several examples from medical imaging and non-destructive testing such as computerized tomography, Doppler tomography, SONAR, X-ray diffractometry and thermoacoustic computerized tomography. The book addresses graduate students and researchers interested in the numerical analysis of inverse problems and regularization techniques or in efficient solvers for the...

  2. Towards an ideal preconditioner for linearized Navier-Stokes problems

    Energy Technology Data Exchange (ETDEWEB)

    Murphy, M.F. [Univ. of Bristol (United Kingdom)

    1996-12-31

    Discretizing certain linearizations of the steady-state Navier-Stokes equations gives rise to nonsymmetric linear systems with indefinite symmetric part. We show that for such systems there exists a block diagonal preconditioner which gives convergence in three GMRES steps, independent of the mesh size and viscosity parameter (Reynolds number). While this {open_quotes}ideal{close_quotes} preconditioner is too expensive to be used in practice, it provides a useful insight into the problem. We then consider various approximations to the ideal preconditioner, and describe the eigenvalues of the preconditioned systems. Finally, we compare these preconditioners numerically, and present our conclusions.

  3. An Adaptive Multilevel Factorized Sparse Approximate Inverse Preconditioning

    Czech Academy of Sciences Publication Activity Database

    Kopal, Jiří; Rozložník, Miroslav; Tůma, Miroslav

    2017-01-01

    Roč. 113, November (2017), s. 19-24 ISSN 0965-9978 R&D Projects: GA ČR GA13-06684S Grant - others:GA MŠk(CZ) LL1202 Institutional support: RVO:67985807 Keywords : approximate inverse * Gram–Schmidt orthogonalization * incomplete factorization * multilevel methods * preconditioned conjugate gradient method Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 3.000, year: 2016

  4. On rational approximation methods for inverse source problems

    KAUST Repository

    Rundell, William

    2011-02-01

    The basis of most imaging methods is to detect hidden obstacles or inclusions within a body when one can only make measurements on an exterior surface. Such is the ubiquity of these problems, the underlying model can lead to a partial differential equation of any of the major types, but here we focus on the case of steady-state electrostatic or thermal imaging and consider boundary value problems for Laplace\\'s equation. Our inclusions are interior forces with compact support and our data consists of a single measurement of (say) voltage/current or temperature/heat flux on the external boundary. We propose an algorithm that under certain assumptions allows for the determination of the support set of these forces by solving a simpler "equivalent point source" problem, and which uses a Newton scheme to improve the corresponding initial approximation. © 2011 American Institute of Mathematical Sciences.

  5. Parallel accelerated cyclic reduction preconditioner for three-dimensional elliptic PDEs with variable coefficients

    KAUST Repository

    Chavez Chavez, Gustavo Ivan

    2017-12-07

    We present a robust and scalable preconditioner for the solution of large-scale linear systems that arise from the discretization of elliptic PDEs amenable to rank compression. The preconditioner is based on hierarchical low-rank approximations and the cyclic reduction method. The setup and application phases of the preconditioner achieve log-linear complexity in memory footprint and number of operations, and numerical experiments exhibit good weak and strong scalability at large processor counts in a distributed memory environment. Numerical experiments with linear systems that feature symmetry and nonsymmetry, definiteness and indefiniteness, constant and variable coefficients demonstrate the preconditioner applicability and robustness. Furthermore, it is possible to control the number of iterations via the accuracy threshold of the hierarchical matrix approximations and their arithmetic operations, and the tuning of the admissibility condition parameter. Together, these parameters allow for optimization of the memory requirements and performance of the preconditioner.

  6. Quasi-inverses and approximation with min-max operators in the l 1 ...

    African Journals Online (AJOL)

    The semi-group of min-max operators, as used for nonlinear smoothing or multiresolution analysis, has no nontrivial inverses. Having chosen a smoother for a specific purpose, the secondary approximation problem of minimising damage was considered by showing that quasi-inverses exist. This was done with respect to ...

  7. Approximation Of Multi-Valued Inverse Functions Using Clustering And Sugeno Fuzzy Inference

    Science.gov (United States)

    Walden, Maria A.; Bikdash, Marwan; Homaifar, Abdollah

    1998-01-01

    Finding the inverse of a continuous function can be challenging and computationally expensive when the inverse function is multi-valued. Difficulties may be compounded when the function itself is difficult to evaluate. We show that we can use fuzzy-logic approximators such as Sugeno inference systems to compute the inverse on-line. To do so, a fuzzy clustering algorithm can be used in conjunction with a discriminating function to split the function data into branches for the different values of the forward function. These data sets are then fed into a recursive least-squares learning algorithm that finds the proper coefficients of the Sugeno approximators; each Sugeno approximator finds one value of the inverse function. Discussions about the accuracy of the approximation will be included.

  8. The neural network approximation method for solving multidimensional nonlinear inverse problems of geophysics

    Science.gov (United States)

    Shimelevich, M. I.; Obornev, E. A.; Obornev, I. E.; Rodionov, E. A.

    2017-07-01

    The iterative approximation neural network method for solving conditionally well-posed nonlinear inverse problems of geophysics is presented. The method is based on the neural network approximation of the inverse operator. The inverse problem is solved in the class of grid (block) models of the medium on a regularized parameterization grid. The construction principle of this grid relies on using the calculated values of the continuity modulus of the inverse operator and its modifications determining the degree of ambiguity of the solutions. The method provides approximate solutions of inverse problems with the maximal degree of detail given the specified degree of ambiguity with the total number of the sought parameters n × 103 of the medium. The a priori and a posteriori estimates of the degree of ambiguity of the approximated solutions are calculated. The work of the method is illustrated by the example of the three-dimensional (3D) inversion of the synthesized 2D areal geoelectrical (audio magnetotelluric sounding, AMTS) data corresponding to the schematic model of a kimberlite pipe.

  9. Parallel N-Body Simulation Based on the PM and P3M Methods Using Multigrid Schemes in conjunction with Generic Approximate Sparse Inverses

    Directory of Open Access Journals (Sweden)

    P. E. Kyziropoulos

    2015-01-01

    Full Text Available During the last decades, Multigrid methods have been extensively used for solving large sparse linear systems. Considering their efficiency and the convergence behavior, Multigrid methods are used in many scientific fields as solvers or preconditioners. Herewith, we propose two hybrid parallel algorithms for N-Body simulations using the Particle Mesh method and the Particle Particle Particle Mesh method, respectively, based on the V-Cycle Multigrid method in conjunction with Generic Approximate Sparse Inverses. The N-Body problem resides in a three-dimensional torus space, and the bodies are subject only to gravitational forces. In each time step of the above methods, a large sparse linear system is solved to compute the gravity potential at each nodal point in order to interpolate the solution to each body. Then the Velocity Verlet method is used to compute the new position and velocity from the acceleration of each respective body. Moreover, a parallel Multigrid algorithm, with a truncated approach in the levels computed in parallel, is proposed for solving large linear systems. Furthermore, parallel results are provided indicating the efficiency of the proposed Multigrid N-Body scheme. Theoretical estimates for the complexity of the proposed simulation schemes are provided.

  10. Mie forward scattering - Improved semiempirical approximation with application to particle size distribution inversion

    Science.gov (United States)

    Fymat, A. L.; Mease, K. D.

    1981-01-01

    The approximation of Penndorf (1962) and Shifrin-Punina (1968) to the Mie solution at forward scattering angles are extended to small size parameters. The proposed semiempirical approximation accurately represents the Mie results down to x = 0.5-1 for refractive index m = 1.33, and to x = 2.0 for larger index values. The implications of the result for the inversion of particle size distribution from single scattering data in the forward direction are discussed.

  11. Decoupled deblurring filter and its application to elastic migration and inversion

    KAUST Repository

    Feng, Zongcai

    2017-08-17

    We present a decoupled deblurring filter that approximates the multiparameter Hessian inverse by using local filters to approximate its submatrices for the same and different parameter classes. Numerical tests show that the filter not only reduces the footprint noise, balances the amplitudes and increases the resolution of the elastic migration images, but also mitigates the crosstalk artifacts. When used as a preconditioner, it accelerates the convergence rate for elastic inversion.

  12. Wave equation dispersion inversion using a difference approximation to the dispersion-curve misfit gradient

    KAUST Repository

    Zhang, Zhendong

    2016-07-26

    We present a surface-wave inversion method that inverts for the S-wave velocity from the Rayleigh wave dispersion curve using a difference approximation to the gradient of the misfit function. We call this wave equation inversion of skeletonized surface waves because the skeletonized dispersion curve for the fundamental-mode Rayleigh wave is inverted using finite-difference solutions to the multi-dimensional elastic wave equation. The best match between the predicted and observed dispersion curves provides the optimal S-wave velocity model. Our method can invert for lateral velocity variations and also can mitigate the local minimum problem in full waveform inversion with a reasonable computation cost for simple models. Results with synthetic and field data illustrate the benefits and limitations of this method. © 2016 Elsevier B.V.

  13. Inverse scattering problem for a magnetic field in the Glauber approximation

    International Nuclear Information System (INIS)

    Bogdanov, I.V.

    1985-01-01

    New results in the general theory of scattering are obtained. An inverse problem at fixed energy for an axisymmetric magnetic field is formulated and solved within the frames of the quantum-mechanical Glauber approximation. The solution is found in quadratures in the form of an explicit inversion algorithm reproducing a vector potential by the angular dependence of the scattering amplitude. Extreme transitions from the eikonal inversion method to the classical and Born ones are investigated. Integral and differential equations are derived for the eikonal amplitude that ensure the real value of the vector potential and its energy independence. Magnetoelectric analogies the existence of equivalent axisymmetric electric and magnetic fields scattering charged particles in the same manner both in the Glauber and Born approximation are established. The mentioned analogies permit to simulate ion-potential scattering by potential one that is of interest from the practical viewpoint. Three-dimensional (excentral) eikonal inverse problems for the electric and magnetic fields are discussed. The results of the paper can be used in electron optics

  14. Multidisciplinary Inverse Reliability Analysis Based on Collaborative Optimization with Combination of Linear Approximations

    Directory of Open Access Journals (Sweden)

    Xin-Jia Meng

    2015-01-01

    Full Text Available Multidisciplinary reliability is an important part of the reliability-based multidisciplinary design optimization (RBMDO. However, it usually has a considerable amount of calculation. The purpose of this paper is to improve the computational efficiency of multidisciplinary inverse reliability analysis. A multidisciplinary inverse reliability analysis method based on collaborative optimization with combination of linear approximations (CLA-CO is proposed in this paper. In the proposed method, the multidisciplinary reliability assessment problem is first transformed into a problem of most probable failure point (MPP search of inverse reliability, and then the process of searching for MPP of multidisciplinary inverse reliability is performed based on the framework of CLA-CO. This method improves the MPP searching process through two elements. One is treating the discipline analyses as the equality constraints in the subsystem optimization, and the other is using linear approximations corresponding to subsystem responses as the replacement of the consistency equality constraint in system optimization. With these two elements, the proposed method realizes the parallel analysis of each discipline, and it also has a higher computational efficiency. Additionally, there are no difficulties in applying the proposed method to problems with nonnormal distribution variables. One mathematical test problem and an electronic packaging problem are used to demonstrate the effectiveness of the proposed method.

  15. Approximate Bayesian computation for machine learning, inverse problems and big data

    Science.gov (United States)

    Mohammad-Djafari, Ali

    2017-06-01

    This paper summarizes my tutorial talk in MaxEnt 2016 workshop. Starting from the basics of the Bayesian approach and simple example of low dimensional parameter estimation where almost all the computations can be done easily, we go very fast to high dimensional case. In those real world cases, even for the sample case of linear model with Gaussian prior, where the posterior law is also Gaussian, the cost of the computation of the posterior covariance becomes important and needs approximate and fast algorithms. Different approximation methods for model comparison and model selection in machine learning problems are presented in summary. Among the existing methods, we mention Laplace approximation, Akaike Information Criterion (AIC), Bayesian Information Criterion (BIC) and Variational Bayesian Approximation (VBA) Methods. Finally, through two examples of inverse problems in imaging systems: X ray and Diffraction wave Computed Tomography (CT), we show how to handle the real great dimensional problems.

  16. Block preconditioners for linear systems arising from multiscale collocation with compactly supported RBFs

    KAUST Repository

    Farrell, Patricio

    2015-04-30

    © 2015John Wiley & Sons, Ltd. Symmetric collocation methods with RBFs allow approximation of the solution of a partial differential equation, even if the right-hand side is only known at scattered data points, without needing to generate a grid. However, the benefit of a guaranteed symmetric positive definite block system comes at a high computational cost. This cost can be alleviated somewhat by considering compactly supported RBFs and a multiscale technique. But the condition number and sparsity will still deteriorate with the number of data points. Therefore, we study certain block diagonal and triangular preconditioners. We investigate ideal preconditioners and determine the spectra of the preconditioned matrices before proposing more practical preconditioners based on a restricted additive Schwarz method with coarse grid correction. Numerical results verify the effectiveness of the preconditioners.

  17. The approximate inverse in action: IV. Semi-discrete equations in a Banach space setting

    International Nuclear Information System (INIS)

    Schuster, T; Schöpfer, F; Rieder, A

    2012-01-01

    This article concerns the method of approximate inverse to solve semi-discrete, linear operator equations in Banach spaces. Semi-discrete means that we search for a solution in an infinite-dimensional Banach space having only a finite number of data available. In this sense the situation is applicable to a large variety of applications where a measurement process delivers a discretization of an infinite-dimensional data space. The method of approximate inverse computes scalar products of the data with pre-computed reconstruction kernels which are associated with mollifiers and the dual of the model operator. The convergence, approximation power and regularization property of this method when applied to semi-discrete operator equations in Hilbert spaces has been investigated in three prequels to this paper. Here we extend these results to a Banach space setting. We prove convergence and stability for general Banach spaces and reproduce the results specifically for the integration operator acting on the space of continuous functions. (paper)

  18. Approximate inverse for the common offset acquisition geometry in 2D seismic imaging

    Science.gov (United States)

    Grathwohl, Christine; Kunstmann, Peer; Quinto, Eric Todd; Rieder, Andreas

    2018-01-01

    We explore how the concept of approximate inverse can be used and implemented to recover singularities in the sound speed from common offset measurements in two space dimensions. Numerical experiments demonstrate the performance of the method. We gratefully acknowledge financial support by the Deutsche Forschungsgemeinschaft (DFG) through CRC 1173. Quinto additionally thanks the Otto Mønsteds Fond and U.S. National Science Foundation (under grants DMS 1311558 and DMS 1712207) for their support. He thanks colleagues at DTU and KIT for their warm hospitality while this research was being done.

  19. Approximation in generalized Hardy classes and resolution of inverse problems for tokamaks

    International Nuclear Information System (INIS)

    Fisher, Y.

    2011-11-01

    This thesis concerns both the theoretical and constructive resolution of inverse problems for isotropic diffusion equation in planar domains, simply and doubly connected. From partial Cauchy boundary data (potential, flux), we look for those quantities on the remaining part of the boundary, where no information is available, as well as inside the domain. The proposed approach proceeds by considering solutions to the diffusion equation as real parts of complex valued solutions to some conjugated Beltrami equation. These particular generalized analytic functions allow to introduce Hardy classes, where the inverse problem is stated as a best constrained approximation issue (bounded extrema problem), and thereby is regularized. Hence, existence and smoothness properties, together with density results of traces on the boundary, ensure well-posedness. An application is studied, to a free boundary problem for a magnetically confined plasma in the tokamak Tore Supra (CEA Cadarache France). The resolution of the approximation problem on a suitable basis of functions (toroidal harmonics) leads to a qualification criterion for the estimated plasma boundary. A descent algorithm makes it decrease, and refines the estimations. The method does not require any integration of the solution in the overall domain. It furnishes very accurate numerical results, and could be extended to other devices, like JET or ITER. (author)

  20. Domain decomposed preconditioners with Krylov subspace methods as subdomain solvers

    Energy Technology Data Exchange (ETDEWEB)

    Pernice, M. [Univ. of Utah, Salt Lake City, UT (United States)

    1994-12-31

    Domain decomposed preconditioners for nonsymmetric partial differential equations typically require the solution of problems on the subdomains. Most implementations employ exact solvers to obtain these solutions. Consequently work and storage requirements for the subdomain problems grow rapidly with the size of the subdomain problems. Subdomain solves constitute the single largest computational cost of a domain decomposed preconditioner, and improving the efficiency of this phase of the computation will have a significant impact on the performance of the overall method. The small local memory available on the nodes of most message-passing multicomputers motivates consideration of the use of an iterative method for solving subdomain problems. For large-scale systems of equations that are derived from three-dimensional problems, memory considerations alone may dictate the need for using iterative methods for the subdomain problems. In addition to reduced storage requirements, use of an iterative solver on the subdomains allows flexibility in specifying the accuracy of the subdomain solutions. Substantial savings in solution time is possible if the quality of the domain decomposed preconditioner is not degraded too much by relaxing the accuracy of the subdomain solutions. While some work in this direction has been conducted for symmetric problems, similar studies for nonsymmetric problems appear not to have been pursued. This work represents a first step in this direction, and explores the effectiveness of performing subdomain solves using several transpose-free Krylov subspace methods, GMRES, transpose-free QMR, CGS, and a smoothed version of CGS. Depending on the difficulty of the subdomain problem and the convergence tolerance used, a reduction in solution time is possible in addition to the reduced memory requirements. The domain decomposed preconditioner is a Schur complement method in which the interface operators are approximated using interface probing.

  1. Measurement-induced nonlocality in arbitrary dimensions in terms of the inverse approximate joint diagonalization

    Science.gov (United States)

    Zhang, Li-qiang; Ma, Ting-ting; Yu, Chang-shui

    2018-03-01

    The computability of the quantifier of a given quantum resource is the essential challenge in the resource theory and the inevitable bottleneck for its application. Here we focus on the measurement-induced nonlocality and present a redefinition in terms of the skew information subject to a broken observable. It is shown that the obtained quantity possesses an obvious operational meaning, can tackle the noncontractivity of the measurement-induced nonlocality and has analytic expressions for pure states, (2 ⊗d )-dimensional quantum states, and some particular high-dimensional quantum states. Most importantly, an inverse approximate joint diagonalization algorithm, due to its simplicity, high efficiency, stability, and state independence, is presented to provide almost-analytic expressions for any quantum state, which can also shed light on other aspects in physics. To illustrate applications as well as demonstrate the validity of the algorithm, we compare the analytic and numerical expressions of various examples and show their perfect consistency.

  2. A Performance Comparison of the Parallel Preconditioners for Iterative Methods for Large Sparse Linear Systems Arising from Partial Differential Equations on Structured Grids

    Science.gov (United States)

    Ma, Sangback

    In this paper we compare various parallel preconditioners such as Point-SSOR (Symmetric Successive OverRelaxation), ILU(0) (Incomplete LU) in the Wavefront ordering, ILU(0) in the Multi-color ordering, Multi-Color Block SOR (Successive OverRelaxation), SPAI (SParse Approximate Inverse) and pARMS (Parallel Algebraic Recursive Multilevel Solver) for solving large sparse linear systems arising from two-dimensional PDE (Partial Differential Equation)s on structured grids. Point-SSOR is well-known, and ILU(0) is one of the most popular preconditioner, but it is inherently serial. ILU(0) in the Wavefront ordering maximizes the parallelism in the natural order, but the lengths of the wave-fronts are often nonuniform. ILU(0) in the Multi-color ordering is a simple way of achieving a parallelism of the order N, where N is the order of the matrix, but its convergence rate often deteriorates as compared to that of natural ordering. We have chosen the Multi-Color Block SOR preconditioner combined with direct sparse matrix solver, since for the Laplacian matrix the SOR method is known to have a nondeteriorating rate of convergence when used with the Multi-Color ordering. By using block version we expect to minimize the interprocessor communications. SPAI computes the sparse approximate inverse directly by least squares method. Finally, ARMS is a preconditioner recursively exploiting the concept of independent sets and pARMS is the parallel version of ARMS. Experiments were conducted for the Finite Difference and Finite Element discretizations of five two-dimensional PDEs with large meshsizes up to a million on an IBM p595 machine with distributed memory. Our matrices are real positive, i. e., their real parts of the eigenvalues are positive. We have used GMRES(m) as our outer iterative method, so that the convergence of GMRES(m) for our test matrices are mathematically guaranteed. Interprocessor communications were done using MPI (Message Passing Interface) primitives. The

  3. Iterative algorithms for the input and state recovery from the approximate inverse of strictly proper multivariable systems

    Science.gov (United States)

    Chen, Liwen; Xu, Qiang

    2018-02-01

    This paper proposes new iterative algorithms for the unknown input and state recovery from the system outputs using an approximate inverse of the strictly proper linear time-invariant (LTI) multivariable system. One of the unique advantages from previous system inverse algorithms is that the output differentiation is not required. The approximate system inverse is stable due to the systematic optimal design of a dummy feedthrough D matrix in the state-space model via the feedback stabilization. The optimal design procedure avoids trial and error to identify such a D matrix which saves tremendous amount of efforts. From the derived and proved convergence criteria, such an optimal D matrix also guarantees the convergence of algorithms. Illustrative examples show significant improvement of the reference input signal tracking by the algorithms and optimal D design over non-iterative counterparts on controllable or stabilizable LTI systems, respectively. Case studies of two Boeing-767 aircraft aerodynamic models further demonstrate the capability of the proposed methods.

  4. Frames of exponentials:lower frame bounds for finite subfamilies, and approximation of the inverse frame operator

    DEFF Research Database (Denmark)

    Christensen, Ole; Lindner, Alexander M

    2001-01-01

    We give lower frame bounds for finite subfamilies of a frame of exponentials {e(i lambdak(.))}k is an element ofZ in L-2(-pi,pi). We also present a method for approximation of the inverse frame operator corresponding to {e(i lambdak(.))}k is an element ofZ, where knowledge of the frame bounds for...

  5. Preconditioner-free Wiener filtering with a dense noise matrix

    Science.gov (United States)

    Huffenberger, Kevin M.

    2018-05-01

    This work extends the Elsner & Wandelt (2013) iterative method for efficient, preconditioner-free Wiener filtering to cases in which the noise covariance matrix is dense, but can be decomposed into a sum whose parts are sparse in convenient bases. The new method, which uses multiple messenger fields, reproduces Wiener-filter solutions for test problems, and we apply it to a case beyond the reach of the Elsner & Wandelt (2013) method. We compute the Wiener-filter solution for a simulated Cosmic Microwave Background (CMB) map that contains spatially varying, uncorrelated noise, isotropic 1/f noise, and large-scale horizontal stripes (like those caused by atmospheric noise). We discuss simple extensions that can filter contaminated modes or inverse-noise-filter the data. These techniques help to address complications in the noise properties of maps from current and future generations of ground-based Microwave Background experiments, like Advanced ACTPol, Simons Observatory, and CMB-S4.

  6. Approximate non-linear multiparameter inversion for multicomponent single and double P-wave scattering in isotropic elastic media

    Science.gov (United States)

    Ouyang, Wei; Mao, Weijian

    2018-03-01

    An asymptotic quadratic true-amplitude inversion method for isotropic elastic P waves is proposed to invert medium parameters. The multicomponent P-wave scattered wavefield is computed based on a forward relationship using second-order Born approximation and corresponding high-frequency ray theoretical methods. Within the local double scattering mechanism, the P-wave transmission factors are elaborately calculated, which results in the radiation pattern for P-waves scattering being a quadratic combination of the density and Lamé's moduli perturbation parameters. We further express the elastic P-wave scattered wavefield in a form of generalized Radon transform (GRT). After introducing classical backprojection operators, we obtain an approximate solution of the inverse problem by solving a quadratic non-linear system. Numerical tests with synthetic data computed by finite-differences scheme demonstrate that our quadratic inversion can accurately invert perturbation parameters for strong perturbations, compared with the P-wave single-scattering linear inversion method. Although our inversion strategy here is only syncretized with P-wave scattering, it can be extended to invert multicomponent elastic data containing both P-wave and S-wave information.

  7. Eddy current imaging. Limits of the born approximation and advantages of an exact solution to the inverse problem

    International Nuclear Information System (INIS)

    Hamman, E.; Zorgati, R.

    1995-01-01

    Eddy current non-destructive testing is used by EDF to detect flaws affecting conductive objects such as steam generator tubes. With a view to obtaining ever more accurate information on equipment integrity, thereby facilitating diagnosis, studies aimed at using measurements to reconstruct an image of the flaw have been proceeding now for about ten years. In this context, our approach to eddy current imaging is based on inverse problem formalism. The direct problem, involving a mathematical model linking measurements provided by a probe with variables characterizing the defect, is dealt with elsewhere. Using the model results, we study the possibility of inverting it, i.e. of reconstructing an image of the flaw from the measurements. We first give an overview of the different inversion techniques, representative of the state of the art and all based on linearization of the inverse problem by means of the Born approximation. The model error resulting from an excessive Born approximation nevertheless severely limits the quantity of the images which can be obtained. In order to counteract this often critical error and extend the eddy current imaging application field, we have to del with the non-linear inverse problem. A method derived from recent research is proposed and implemented to ensure consistency with the exact model. Based on an 'optimization' type approach and provided with a convergence theorem, the method is highly efficient. (authors). 17 refs., 7 figs., 1 append

  8. Potential approximations to {delta}': an inverse Klauder phenomenon with norm-resolvent convergence

    Energy Technology Data Exchange (ETDEWEB)

    Exner, P. [Karlova Univ., Prague (Czech Republic). Dept. of Theoretical Physics; Doppler Inst., Czech Technical Univ., Prague (Czech Republic); Neidhardt, H. [Institut fuer Angewandte Analysis und Stochastik (IAAS), Berlin (Germany); Zagrebnov, V.A. [Aix-Marseille-1 Univ., 13 - Marseille (France). Centre de Physique Theorique; Centre National de la Recherche Scientifique (CNRS), 13 - Marseille (France). Centre de Physique Theorique

    2001-12-01

    We show that there is a family of Schroedinger operators with scaled potentials which approximates the {delta}'-interaction Hamiltonian in the norm-resolvent sense. This approximation, based on a formal scheme proposed by Cheon and Shigehara, has nontrivial convergence properties which are in several respects opposite to those of the Klauder phenomenon. (orig.)

  9. Depth-resolved residual stress evaluation from X-ray diffraction measurement data using the approximate inverse method

    CERN Document Server

    Schuster, T; Louis, A K

    2003-01-01

    The paper deals with the depth determination of residual stress states from diffraction data. First an historical overview of the known approaches is given. Then we apply the approximate inverse method to this problem. This method is known to be very efficient and stable with respect to noise-contaminated data. It is even possible to prove convergence and it allows an error estimate of the calculated depth resolved residual stress profile. (orig.)

  10. A numerical investigation of multi space reduced basis preconditioners for parametrized elliptic advection-diffusion equations

    Directory of Open Access Journals (Sweden)

    Santo Niccolò Dal

    2017-12-01

    Full Text Available We analyze the numerical performance of a preconditioning technique recently proposed in [1] for the efficient solution of parametrized linear systems arising from the finite element (FE discretization of parameterdependent elliptic partial differential equations (PDEs. In order to exploit the parametric dependence of the PDE, the proposed preconditioner takes advantage of the reduced basis (RB method within the preconditioned iterative solver employed to solve the linear system, and combines a RB solver, playing the role of coarse component, with a traditional fine grid (such as Additive Schwarz or block Jacobi preconditioner. A sequence of RB spaces is required to handle the approximation of the error-residual equation at each step of the iterative method at hand, whence the name of Multi Space Reduced Basis (MSRB method. In this paper, a numerical investigation of the proposed technique is carried on in the case of a Richardson iterative method, and then extended to the flexible GMRES method, in order to solve parameterized advection-diffusion problems. Particular attention is payed to the impact of anisotropic diffusion coefficients and (possibly dominant transport terms on the proposed preconditioner, by carrying out detailed comparisons with the current state of the art algebraic multigrid preconditioners.

  11. Contributions aux méthodes de calcul basées sur l'approximation de tenseurs et applications en mécanique numérique

    OpenAIRE

    Giraldi, Loïc

    2012-01-01

    This thesis makes several contributions to the resolution of high dimensional problems in scientific computing, particularly for uncertainty quantification. We consider here variational problems formulated on tensor product spaces. We first propose an efficient preconditioning strategy for linear systems solved by iterative solvers using low-rank tensor approximations. The preconditioner is found as a low rank approximation of the inverse of the operator. A greedy algorithm allows to compute ...

  12. Preconditioners Based on the ISM Factorization

    Czech Academy of Sciences Publication Activity Database

    Bru, R.; Cerdán, J.; Marín, J.; Mas, J.; Tůma, Miroslav

    2015-01-01

    Roč. 23, č. 3 (2015), s. 17-27 ISSN 1224-1784 R&D Projects: GA ČR GA13-06684S Institutional support: RVO:67985807 Keywords : preconditioned iterative methods * incomplete decompositions * approximate inverses * linear least squares Subject RIV: BA - General Mathematics Impact factor: 0.383, year: 2015 http://emis.muni.cz/journals/ASUO/mathematics_/anale2015vol3/Bru_R.__Cerdan_J.__Marin_J.__Mas_J.__Tuma_M..pdf

  13. Fast Multipole-Based Elliptic PDE Solver and Preconditioner

    KAUST Repository

    Ibeid, Huda

    2016-12-07

    Exascale systems are predicted to have approximately one billion cores, assuming Gigahertz cores. Limitations on affordable network topologies for distributed memory systems of such massive scale bring new challenges to the currently dominant parallel programing model. Currently, there are many efforts to evaluate the hardware and software bottlenecks of exascale designs. It is therefore of interest to model application performance and to understand what changes need to be made to ensure extrapolated scalability. Fast multipole methods (FMM) were originally developed for accelerating N-body problems for particle-based methods in astrophysics and molecular dynamics. FMM is more than an N-body solver, however. Recent efforts to view the FMM as an elliptic PDE solver have opened the possibility to use it as a preconditioner for even a broader range of applications. In this thesis, we (i) discuss the challenges for FMM on current parallel computers and future exascale architectures, with a focus on inter-node communication, and develop a performance model that considers the communication patterns of the FMM for spatially quasi-uniform distributions, (ii) employ this performance model to guide performance and scaling improvement of FMM for all-atom molecular dynamics simulations of uniformly distributed particles, and (iii) demonstrate that, beyond its traditional use as a solver in problems for which explicit free-space kernel representations are available, the FMM has applicability as a preconditioner in finite domain elliptic boundary value problems, by equipping it with boundary integral capability for satisfying conditions at finite boundaries and by wrapping it in a Krylov method for extensibility to more general operators. Compared with multilevel methods, FMM is capable of comparable algebraic convergence rates down to the truncation error of the discretized PDE, and it has superior multicore and distributed memory scalability properties on commodity

  14. A parallel sweeping preconditioner for frequency-domain seismic wave propagation

    KAUST Repository

    Poulson, Jack

    2012-09-01

    We present a parallel implementation of Engquist and Ying\\'s sweeping preconditioner, which exploits radiation boundary conditions in order to form an approximate block LDLT factorization of the Helmholtz operator with only O(N4/3) work and an application (and memory) cost of only O(N logN). The approximate factorization is then used as a preconditioner for GMRES, and we show that essentially O(1) iterations are required for convergence, even for the full SEG/EAGE over-thrust model at 30 Hz. In particular, we demonstrate the solution of said problem in a mere 15 minutes on 8192 cores of TACC\\'s Lonestar, which may be the largest-scale 3D heterogeneous Helmholtz calculation to date. Generalizations of our parallel strategy are also briefly discussed for time-harmonic linear elasticity and Maxwell\\'s equations.

  15. An evaluation of parallel multigrid as a solver and a preconditioner for singular perturbed problems

    Energy Technology Data Exchange (ETDEWEB)

    Oosterlee, C.W. [Inst. for Algorithms and Scientific Computing, Sankt Augustin (Germany); Washio, T. [C& C Research Lab., Sankt Augustin (Germany)

    1996-12-31

    In this paper we try to achieve h-independent convergence with preconditioned GMRES and BiCGSTAB for 2D singular perturbed equations. Three recently developed multigrid methods are adopted as a preconditioner. They are also used as solution methods in order to compare the performance of the methods as solvers and as preconditioners. Two of the multigrid methods differ only in the transfer operators. One uses standard matrix- dependent prolongation operators from. The second uses {open_quotes}upwind{close_quotes} prolongation operators, developed. Both employ the Galerkin coarse grid approximation and an alternating zebra line Gauss-Seidel smoother. The third method is based on the block LU decomposition of a matrix and on an approximate Schur complement. This multigrid variant is presented in. All three multigrid algorithms are algebraic methods.

  16. Numerical Approximation of Boundary Control for the Wave Equation - with Application to an Inverse Problem

    DEFF Research Database (Denmark)

    Mariegaard, Jesper Sandvig

    equation: a linear finite element method (L-FEM) and a discontinuous Galerkin-FEM (DG-FEM). The controllability operator is discretized with both L-FEM and DG-FEM to obtain a HUM matrix. We show that formulating HUM in a sine basis is beneficial for several reasons: (i) separation of low and high frequency......We consider a control problem for the wave equation: Given the initial state, find a specific boundary condition, called a control, that steers the system to a desired final state. The Hilbert uniqueness method (HUM) is a mathematical method for the solution of such control problems. It builds...... on the duality between the control system and its adjoint system, and these systems are connected via a so-called controllability operator. In this project, we are concerned with the numerical approximation of HUM control for the one-dimensional wave equation. We study two semi-discretizations of the wave...

  17. Surface wave mode coupling and the validity of the path average approximation in surface waveform inversions: an empirical assessment

    Science.gov (United States)

    Datta, Arjun; Priestley, Keith F.; Roecker, Steve; Chapman, Chris H.

    2017-11-01

    We employ an empirical approach to study the phenomenon of surface wave mode conversion due to lateral heterogeneity, and, as an example, assess its impact on a specific waveform inversion methodology used for surface wave tomography. Finite difference modelling in 2-D media, using a method that allows modelling of a single surface wave mode at a time, is combined with frequency domain decomposition of the wavefield onto a basis of local mode eigenfunctions, to illuminate mode conversion as a function of frequency and heterogeneity parameters. Synthetic waveforms generated by the modelling are inverted to study the effects of mode conversion on the inversion process. For heterogeneities in the upper mantle depth range of ∼40-300 km, we find that heterogeneity strengths of about 5 per cent (with sharp lateral boundaries), or lateral boundary length scales of 10-15 times the seismic wavelength (with 10 per cent maximum strength) produce significant mode conversion at periods of 30 s and shorter. These are significant in the sense that, depending on source strength, converted mode amplitudes can be well above typical noise levels in seismology. Correspondingly, waveform inversion with higher modes reveals the inadequacy of the path average approximation at these periods, with the potential for errors as large as 7 per cent in inferred group velocities, which will translate into errors in the inverted shear-velocity structure.

  18. Geometrical Inverse Preconditioning for Symmetric Positive Definite Matrices

    Directory of Open Access Journals (Sweden)

    Jean-Paul Chehab

    2016-07-01

    Full Text Available We focus on inverse preconditioners based on minimizing F ( X = 1 − cos ( X A , I , where X A is the preconditioned matrix and A is symmetric and positive definite. We present and analyze gradient-type methods to minimize F ( X on a suitable compact set. For this, we use the geometrical properties of the non-polyhedral cone of symmetric and positive definite matrices, and also the special properties of F ( X on the feasible set. Preliminary and encouraging numerical results are also presented in which dense and sparse approximations are included.

  19. Object-Oriented Software Tools for the Construction of Preconditioners

    Directory of Open Access Journals (Sweden)

    Eva Mossberg

    1997-01-01

    Full Text Available In recent years, there has been considerable progress concerning preconditioned iterative methods for large and sparse systems of equations arising from the discretization of differential equations. Such methods are particularly attractive in the context of high-performance (parallel computers. However, the implementation of a preconditioner is a nontrivial task. The focus of the present contribution is on a set of object-oriented software tools that support the construction of a family of preconditioners based on fast transforms. By combining objects of different classes, it is possible to conveniently construct any preconditioner within this family.

  20. Block-triangular preconditioners for PDE-constrained optimization

    KAUST Repository

    Rees, Tyrone

    2010-11-26

    In this paper we investigate the possibility of using a block-triangular preconditioner for saddle point problems arising in PDE-constrained optimization. In particular, we focus on a conjugate gradient-type method introduced by Bramble and Pasciak that uses self-adjointness of the preconditioned system in a non-standard inner product. We show when the Chebyshev semi-iteration is used as a preconditioner for the relevant matrix blocks involving the finite element mass matrix that the main drawback of the Bramble-Pasciak method-the appropriate scaling of the preconditioners-is easily overcome. We present an eigenvalue analysis for the block-triangular preconditioners that gives convergence bounds in the non-standard inner product and illustrates their competitiveness on a number of computed examples. Copyright © 2010 John Wiley & Sons, Ltd.

  1. Solution of the point kinetics equations in the presence of Newtonian temperature feedback by Pade approximations via the analytical inversion method

    International Nuclear Information System (INIS)

    Aboanber, A E; Nahla, A A

    2002-01-01

    A method based on the Pade approximations is applied to the solution of the point kinetics equations with a time varying reactivity. The technique consists of treating explicitly the roots of the inhour formula. A significant improvement has been observed by treating explicitly the most dominant roots of the inhour equation, which usually would make the Pade approximation inaccurate. Also the analytical inversion method which permits a fast inversion of polynomials of the point kinetics matrix is applied to the Pade approximations. Results are presented for several cases of Pade approximations using various options of the method with different types of reactivity. The formalism is applicable equally well to non-linear problems, where the reactivity depends on the neutron density through temperature feedback. It was evident that the presented method is particularly good for cases in which the reactivity can be represented by a series of steps and performed quite well for more general cases

  2. A Parallel Sweeping Preconditioner for Heterogeneous 3D Helmholtz Equations

    KAUST Repository

    Poulson, Jack

    2013-05-02

    A parallelization of a sweeping preconditioner for three-dimensional Helmholtz equations without large cavities is introduced and benchmarked for several challenging velocity models. The setup and application costs of the sequential preconditioner are shown to be O(γ2N4/3) and O(γN logN), where γ(ω) denotes the modestly frequency-dependent number of grid points per perfectly matched layer. Several computational and memory improvements are introduced relative to using black-box sparse-direct solvers for the auxiliary problems, and competitive runtimes and iteration counts are reported for high-frequency problems distributed over thousands of cores. Two open-source packages are released along with this paper: Parallel Sweeping Preconditioner (PSP) and the underlying distributed multifrontal solver, Clique. © 2013 Society for Industrial and Applied Mathematics.

  3. Scalable Domain Decomposition Preconditioners for Heterogeneous Elliptic Problems

    Directory of Open Access Journals (Sweden)

    Pierre Jolivet

    2014-01-01

    Full Text Available Domain decomposition methods are, alongside multigrid methods, one of the dominant paradigms in contemporary large-scale partial differential equation simulation. In this paper, a lightweight implementation of a theoretically and numerically scalable preconditioner is presented in the context of overlapping methods. The performance of this work is assessed by numerical simulations executed on thousands of cores, for solving various highly heterogeneous elliptic problems in both 2D and 3D with billions of degrees of freedom. Such problems arise in computational science and engineering, in solid and fluid mechanics. While focusing on overlapping domain decomposition methods might seem too restrictive, it will be shown how this work can be applied to a variety of other methods, such as non-overlapping methods and abstract deflation based preconditioners. It is also presented how multilevel preconditioners can be used to avoid communication during an iterative process such as a Krylov method.

  4. A universal preconditioner for simulating condensed phase materials

    International Nuclear Information System (INIS)

    Packwood, David; Ortner, Christoph; Kermode, James; Mones, Letif; Bernstein, Noam; Woolley, John; Gould, Nicholas; Csányi, Gábor

    2016-01-01

    We introduce a universal sparse preconditioner that accelerates geometry optimisation and saddle point search tasks that are common in the atomic scale simulation of materials. Our preconditioner is based on the neighbourhood structure and we demonstrate the gain in computational efficiency in a wide range of materials that include metals, insulators, and molecular solids. The simple structure of the preconditioner means that the gains can be realised in practice not only when using expensive electronic structure models but also for fast empirical potentials. Even for relatively small systems of a few hundred atoms, we observe speedups of a factor of two or more, and the gain grows with system size. An open source Python implementation within the Atomic Simulation Environment is available, offering interfaces to a wide range of atomistic codes.

  5. A comparison of deflation and the balancing Neumann-Neumann preconditioner

    NARCIS (Netherlands)

    Nabben, R.; Vuik, C.

    2004-01-01

    In this paper we compare various preconditioners for the numerical solution of partial differential equations. We compare the well-known balancing Neumann Neumann preconditioner used in domain decomposition methods with a so-called deflation preconditioner. We prove that the effective condition

  6. The Importance of Structure in Incomplete Factorization Preconditioners

    Czech Academy of Sciences Publication Activity Database

    Scott, J.; Tůma, Miroslav

    2011-01-01

    Roč. 51, č. 2 (2011), s. 385-404 ISSN 0006-3835 Grant - others:GA AV ČR(CZ) M100300902 Institutional research plan: CEZ:AV0Z10300504 Keywords : sparse symmetric linear systems * incomplete factorizations * preconditioners * level-based approach Subject RIV: BA - General Mathematics Impact factor: 0.724, year: 2011

  7. Parallel alternating direction preconditioner for isogeometric simulations of explicit dynamics

    KAUST Repository

    Łoś, Marcin

    2015-04-27

    In this paper we present a parallel implementation of the alternating direction preconditioner for isogeometric simulations of explicit dynamics. The Alternating Direction Implicit (ADI) algorithm, belongs to the category of matrix-splitting iterative methods, was proposed almost six decades ago for solving parabolic and elliptic partial differential equations, see [1–4]. The new version of this algorithm has been recently developed for isogeometric simulations of two dimensional explicit dynamics [5] and steady-state diffusion equations with orthotropic heterogenous coefficients [6]. In this paper we present a parallel version of the alternating direction implicit algorithm for three dimensional simulations. The algorithm has been incorporated as a part of PETIGA an isogeometric framework [7] build on top of PETSc [8]. We show the scalability of the parallel algorithm on STAMPEDE linux cluster up to 10,000 processors, as well as the convergence rate of the PCG solver with ADI algorithm as preconditioner.

  8. Scalable and Robust BDDC Preconditioners for Reservoir and Electromagnetics Modeling

    KAUST Repository

    Zampini, S.

    2015-09-13

    The purpose of the study is to show the effectiveness of recent algorithmic advances in Balancing Domain Decomposition by Constraints (BDDC) preconditioners for the solution of elliptic PDEs with highly heterogeneous coefficients, and discretized by means of the finite element method. Applications to large linear systems generated by div- and curl- conforming finite elements discretizations commonly arising in the contexts of modelling reservoirs and electromagnetics will be presented.

  9. The use of Trefftz functions for approximation of measurement data in an inverse problem of flow boiling in a minichannel

    Directory of Open Access Journals (Sweden)

    Hozejowski Leszek

    2012-04-01

    Full Text Available The paper is devoted to a computational problem of predicting a local heat transfer coefficient from experimental temperature data. The experimental part refers to boiling flow of a refrigerant in a minichannel. Heat is dissipated from heating alloy to the flowing liquid due to forced convection. The mathematical model of the problem consists of the governing Poisson equation and the proper boundary conditions. For accurate results it is required to smooth the measurements which was obtained by using Trefftz functions. The measurements were approximated with a linear combination of Trefftz functions. Due to the computational procedure in which the measurement errors are known, it was possible to smooth the data and also to reduce the residuals of approximation on the boundaries.

  10. Fully anisotropic 3-D EM modelling on a Lebedev grid with a multigrid pre-conditioner

    Science.gov (United States)

    Jaysaval, Piyoosh; Shantsev, Daniil V.; de la Kethulle de Ryhove, Sébastien; Bratteland, Tarjei

    2016-12-01

    We present a numerical algorithm for 3-D electromagnetic (EM) simulations in conducting media with general electric anisotropy. The algorithm is based on the finite-difference discretization of frequency-domain Maxwell's equations on a Lebedev grid, in which all components of the electric field are collocated but half a spatial step staggered with respect to the magnetic field components, which also are collocated. This leads to a system of linear equations that is solved using a stabilized biconjugate gradient method with a multigrid preconditioner. We validate the accuracy of the numerical results for layered and 3-D tilted transverse isotropic (TTI) earth models representing typical scenarios used in the marine controlled-source EM method. It is then demonstrated that not taking into account the full anisotropy of the conductivity tensor can lead to misleading inversion results. For synthetic data corresponding to a 3-D model with a TTI anticlinal structure, a standard vertical transverse isotropic (VTI) inversion is not able to image a resistor, while for a 3-D model with a TTI synclinal structure it produces a false resistive anomaly. However, if the VTI forward solver used in the inversion is replaced by the proposed TTI solver with perfect knowledge of the strike and dip of the dipping structures, the resulting resistivity images become consistent with the true models.

  11. Triangular preconditioners for saddle point problems with a penalty term

    Energy Technology Data Exchange (ETDEWEB)

    Klawonn, A. [Westfaelische Wilhelms-Universitaet, Muenster (Germany)

    1996-12-31

    Triangular preconditioners for a class of saddle point problems with a penalty term are considered. An important example is the mixed formulation of the pure displacement problem in linear elasticity. It is shown that the spectrum of the preconditioned system is contained in a real, positive interval, and that the interval bounds can be made independent of the discretization and penalty parameters. This fact is used to construct bounds of the convergence rate of the GMRES method used with an energy norm. Numerical results are given for GMRES and BI-CGSTAB.

  12. Scalability of preconditioners as a strategy for parallel computation of compressible fluid flow

    Energy Technology Data Exchange (ETDEWEB)

    Hansen, G.A.

    1996-05-01

    Parallel implementations of a Newton-Krylov-Schwarz algorithm are used to solve a model problem representing low Mach number compressible fluid flow over a backward-facing step. The Mach number is specifically selected to result in a numerically {open_quote}stiff{close_quotes} matrix problem, based on an implicit finite volume discretization of the compressible 2D Navier-Stokes/energy equations using primitive variables. Newton`s method is used to linearize the discrete system, and a preconditioned Krylov projection technique is used to solve the resulting linear system. Domain decomposition enables the development of a global preconditioner via the parallel construction of contributions derived from subdomains. Formation of the global preconditioner is based upon additive and multiplicative Schwarz algorithms, with and without subdomain overlap. The degree of parallelism of this technique is further enhanced with the use of a matrix-free approximation for the Jacobian used in the Krylov technique (in this case, GMRES(k)). Of paramount interest to this study is the implementation and optimization of these techniques on parallel shared-memory hardware, namely the Cray C90 and SGI Challenge architectures. These architectures were chosen as representative and commonly available to researchers interested in the solution of problems of this type. The Newton-Krylov-Schwarz solution technique is increasingly being investigated for computational fluid dynamics (CFD) applications due to the advantages of full coupling of all variables and equations, rapid non-linear convergence, and moderate memory requirements. A parallel version of this method that scales effectively on the above architectures would be extremely attractive to practitioners, resulting in efficient, cost-effective, parallel solutions exhibiting the benefits of the solution technique.

  13. The importance of eigenvectors for local preconditioners of the Euler equations

    International Nuclear Information System (INIS)

    Darmofal, D.L.; Schmid, P.J.

    1996-01-01

    The design of local preconditioners to accelerate the convergence to a steady state for the compressible Euler equations has so far been solely based on eigenvalue analysis. However, numerical evidence exists that the eigenvector structure also has an influence on the performance of preconditioners and should therefore be included in the design process. In this paper, we present the mathematical framework for the eigenvector analysis of local preconditioners for the multi-dimensional Euler equations. The non-normality of the preconditioned system is crucial in determining the potential for transient amplification of perturbations. Several existing local preconditioners are shown to possess a highly non-normal structure for low Mach numbers. This non-normality leads to significant robustness problems at stagnation points. A modification to these preconditioners which eliminates the non-normality is suggested, and numerical results are presented showing the marked improvement in robustness. 25 refs., 11 figs., 1 tab

  14. An Empirical Analysis of the Performance of Preconditioners for SPD Systems

    KAUST Repository

    George, Thomas

    2012-08-01

    Preconditioned iterative solvers have the potential to solve very large sparse linear systems with a fraction of the memory used by direct methods. However, the effectiveness and performance of most preconditioners is not only problem dependent, but also fairly sensitive to the choice of their tunable parameters. As a result, a typical practitioner is faced with an overwhelming number of choices of solvers, preconditioners, and their parameters. The diversity of preconditioners makes it difficult to analyze them in a unified theoretical model. A systematic empirical evaluation of existing preconditioned iterative solvers can help in identifying the relative advantages of various implementations. We present the results of a comprehensive experimental study of the most popular preconditioner and iterative solver combinations for symmetric positive-definite systems. We introduce a methodology for a rigorous comparative evaluation of various preconditioners, including the use of some simple but powerful metrics. The detailed comparison of various preconditioner implementations and a state-of-the-art direct solver gives interesting insights into their relative strengths and weaknesses. We believe that these results would be useful to researchers developing preconditioners and iterative solvers as well as practitioners looking for appropriate sparse solvers for their applications. © 2012 ACM.

  15. Adaptive Selection of Primal Constraints for Isogeometric BDDC Deluxe Preconditioners

    KAUST Repository

    Beirão Da Veiga, L.

    2017-02-23

    Isogeometric analysis has been introduced as an alternative to finite element methods in order to simplify the integration of computer-aided design (CAD) software and the discretization of variational problems of continuum mechanics. In contrast with the finite element case, the basis functions of isogeometric analysis are often not nodal. As a consequence, there are fat interfaces which can easily lead to an increase in the number of interface variables after a decomposition of the parameter space into subdomains. Building on earlier work on the deluxe version of the BDDC (balancing domain decomposition by constraints) family of domain decomposition algorithms, several adaptive algorithms are developed in this paper for scalar elliptic problems in an effort to decrease the dimension of the global, coarse component of these preconditioners. Numerical experiments provide evidence that this work can be successful, yielding scalable and quasi-optimal adaptive BDDC algorithms for isogeometric discretizations.

  16. Fast Multipole-Based Preconditioner for Sparse Iterative Solvers

    KAUST Repository

    Ibeid, Huda

    2014-05-04

    Among optimal hierarchical algorithms for the computational solution of elliptic problems, the Fast Multipole Method (FMM) stands out for its adaptability to emerging architectures, having high arithmetic intensity, tunable accuracy, and relaxed global synchronization requirements. We demonstrate that, beyond its traditional use as a solver in problems for which explicit free-space kernel representations are available, the FMM has applicability as a preconditioner in finite domain elliptic boundary value problems, by equipping it with boundary integral capability for finite boundaries and by wrapping it in a Krylov method for extensibility to more general operators. Compared with multilevel methods, it is capable of comparable algebraic convergence rates down to the truncation error of the discretized PDE, and it has superior multicore and distributed memory scalability properties on commodity architecture supercomputers.

  17. Weakly intrusive low-rank approximation method for nonlinear parameter-dependent equations

    KAUST Repository

    Giraldi, Loic

    2017-06-30

    This paper presents a weakly intrusive strategy for computing a low-rank approximation of the solution of a system of nonlinear parameter-dependent equations. The proposed strategy relies on a Newton-like iterative solver which only requires evaluations of the residual of the parameter-dependent equation and of a preconditioner (such as the differential of the residual) for instances of the parameters independently. The algorithm provides an approximation of the set of solutions associated with a possibly large number of instances of the parameters, with a computational complexity which can be orders of magnitude lower than when using the same Newton-like solver for all instances of the parameters. The reduction of complexity requires efficient strategies for obtaining low-rank approximations of the residual, of the preconditioner, and of the increment at each iteration of the algorithm. For the approximation of the residual and the preconditioner, weakly intrusive variants of the empirical interpolation method are introduced, which require evaluations of entries of the residual and the preconditioner. Then, an approximation of the increment is obtained by using a greedy algorithm for low-rank approximation, and a low-rank approximation of the iterate is finally obtained by using a truncated singular value decomposition. When the preconditioner is the differential of the residual, the proposed algorithm is interpreted as an inexact Newton solver for which a detailed convergence analysis is provided. Numerical examples illustrate the efficiency of the method.

  18. Approximate Schur complement preconditioning of the lowest order nodal discretizations

    Energy Technology Data Exchange (ETDEWEB)

    Moulton, J.D.; Ascher, U.M. [Univ. of British Columbia, Vancouver, British Columbia (Canada); Morel, J.E. [Los Alamos National Lab., NM (United States)

    1996-12-31

    Particular classes of nodal methods and mixed hybrid finite element methods lead to equivalent, robust and accurate discretizations of 2nd order elliptic PDEs. However, widespread popularity of these discretizations has been hindered by the awkward linear systems which result. The present work exploits this awkwardness, which provides a natural partitioning of the linear system, by defining two optimal preconditioners based on approximate Schur complements. Central to the optimal performance of these preconditioners is their sparsity structure which is compatible with Dendy`s black box multigrid code.

  19. Incomplete Augmented Lagrangian Preconditioner for Steady Incompressible Navier-Stokes Equations

    Directory of Open Access Journals (Sweden)

    Ning-Bo Tan

    2013-01-01

    Full Text Available An incomplete augmented Lagrangian preconditioner, for the steady incompressible Navier-Stokes equations discretized by stable finite elements, is proposed. The eigenvalues of the preconditioned matrix are analyzed. Numerical experiments show that the incomplete augmented Lagrangian-based preconditioner proposed is very robust and performs quite well by the Picard linearization or the Newton linearization over a wide range of values of the viscosity on both uniform and stretched grids.

  20. Incomplete augmented Lagrangian preconditioner for steady incompressible Navier-Stokes equations.

    Science.gov (United States)

    Tan, Ning-Bo; Huang, Ting-Zhu; Hu, Ze-Jun

    2013-01-01

    An incomplete augmented Lagrangian preconditioner, for the steady incompressible Navier-Stokes equations discretized by stable finite elements, is proposed. The eigenvalues of the preconditioned matrix are analyzed. Numerical experiments show that the incomplete augmented Lagrangian-based preconditioner proposed is very robust and performs quite well by the Picard linearization or the Newton linearization over a wide range of values of the viscosity on both uniform and stretched grids.

  1. Substructuring preconditioners for an h-p domain decomposition method with interior penalty mortaring

    KAUST Repository

    Antonietti, P. F.

    2014-05-13

    We propose and study an iterative substructuring method for an h-p Nitsche-type discretization, following the original approach introduced in Bramble et al. Math. Comp. 47(175):103–134, (1986) for conforming methods. We prove quasi-optimality with respect to the mesh size and the polynomial degree for the proposed preconditioner. Numerical experiments assess the performance of the preconditioner and verify the theory. © 2014, Springer-Verlag Italia.

  2. Multilevel Preconditioners for Discontinuous Galerkin Approximations of Elliptic Problems with Jump Coefficients

    Science.gov (United States)

    2010-12-01

    discontinuous coefficients on geometrically nonconforming substructures. Technical Report Serie A 634, Instituto de Matematica Pura e Aplicada, Brazil, 2009...Instituto de Matematica Pura e Aplicada, Brazil, 2010. submitted. [41] M. Dryja, M. V. Sarkis, and O. B. Widlund. Multilevel Schwarz methods for

  3. A Kronecker product splitting preconditioner for two-dimensional space-fractional diffusion equations

    Science.gov (United States)

    Chen, Hao; Lv, Wen; Zhang, Tongtong

    2018-05-01

    We study preconditioned iterative methods for the linear system arising in the numerical discretization of a two-dimensional space-fractional diffusion equation. Our approach is based on a formulation of the discrete problem that is shown to be the sum of two Kronecker products. By making use of an alternating Kronecker product splitting iteration technique we establish a class of fixed-point iteration methods. Theoretical analysis shows that the new method converges to the unique solution of the linear system. Moreover, the optimal choice of the involved iteration parameters and the corresponding asymptotic convergence rate are computed exactly when the eigenvalues of the system matrix are all real. The basic iteration is accelerated by a Krylov subspace method like GMRES. The corresponding preconditioner is in a form of a Kronecker product structure and requires at each iteration the solution of a set of discrete one-dimensional fractional diffusion equations. We use structure preserving approximations to the discrete one-dimensional fractional diffusion operators in the action of the preconditioning matrix. Numerical examples are presented to illustrate the effectiveness of this approach.

  4. Fast multipole preconditioners for sparse matrices arising from elliptic equations

    KAUST Repository

    Ibeid, Huda

    2017-11-09

    Among optimal hierarchical algorithms for the computational solution of elliptic problems, the fast multipole method (FMM) stands out for its adaptability to emerging architectures, having high arithmetic intensity, tunable accuracy, and relaxable global synchronization requirements. We demonstrate that, beyond its traditional use as a solver in problems for which explicit free-space kernel representations are available, the FMM has applicability as a preconditioner in finite domain elliptic boundary value problems, by equipping it with boundary integral capability for satisfying conditions at finite boundaries and by wrapping it in a Krylov method for extensibility to more general operators. Here, we do not discuss the well developed applications of FMM to implement matrix-vector multiplications within Krylov solvers of boundary element methods. Instead, we propose using FMM for the volume-to-volume contribution of inhomogeneous Poisson-like problems, where the boundary integral is a small part of the overall computation. Our method may be used to precondition sparse matrices arising from finite difference/element discretizations, and can handle a broader range of scientific applications. It is capable of algebraic convergence rates down to the truncation error of the discretized PDE comparable to those of multigrid methods, and it offers potentially superior multicore and distributed memory scalability properties on commodity architecture supercomputers. Compared with other methods exploiting the low-rank character of off-diagonal blocks of the dense resolvent operator, FMM-preconditioned Krylov iteration may reduce the amount of communication because it is matrix-free and exploits the tree structure of FMM. We describe our tests in reproducible detail with freely available codes and outline directions for further extensibility.

  5. Block Preconditioners for Complex Symmetric Linear System with Two-by-Two Block Form

    Directory of Open Access Journals (Sweden)

    Shi-Liang Wu

    2015-01-01

    Full Text Available Based on the previous work by Zhang and Zheng (A parameterized splitting iteration method for complex symmetric linear systems, Japan J. Indust. Appl. Math., 31 (2014 265–278, three block preconditioners for complex symmetric linear system with two-by-two block form are presented. Spectral properties of the preconditioned matrices are discussed in detail. It is shown that all the eigenvalues of the preconditioned matrices are well-clustered. Numerical experiments are reported to illustrate the efficiency of the proposed preconditioners.

  6. Multigrid solvers and multigrid preconditioners for the solution of variational data assimilation problems

    Science.gov (United States)

    Debreu, Laurent; Neveu, Emilie; Simon, Ehouarn; Le Dimet, Francois Xavier; Vidard, Arthur

    2014-05-01

    In order to lower the computational cost of the variational data assimilation process, we investigate the use of multigrid methods to solve the associated optimal control system. On a linear advection equation, we study the impact of the regularization term on the optimal control and the impact of discretization errors on the efficiency of the coarse grid correction step. We show that even if the optimal control problem leads to the solution of an elliptic system, numerical errors introduced by the discretization can alter the success of the multigrid methods. The view of the multigrid iteration as a preconditioner for a Krylov optimization method leads to a more robust algorithm. A scale dependent weighting of the multigrid preconditioner and the usual background error covariance matrix based preconditioner is proposed and brings significant improvements. [1] Laurent Debreu, Emilie Neveu, Ehouarn Simon, François-Xavier Le Dimet and Arthur Vidard, 2014: Multigrid solvers and multigrid preconditioners for the solution of variational data assimilation problems, submitted to QJRMS, http://hal.inria.fr/hal-00874643 [2] Emilie Neveu, Laurent Debreu and François-Xavier Le Dimet, 2011: Multigrid methods and data assimilation - Convergence study and first experiments on non-linear equations, ARIMA, 14, 63-80, http://intranet.inria.fr/international/arima/014/014005.html

  7. Comparison of Two-Level Preconditioners Derived from Deflation, Domain Decomposition and Multigrid Methods

    NARCIS (Netherlands)

    Tang, J.M.; Nabben, R.; Vuik, C.; Erlangga, Y.A.

    2009-01-01

    For various applications, it is well-known that a multi-level, in particular two-level, preconditioned CG (PCG) method is an efficient method for solving large and sparse linear systems with a coefficient matrix that is symmetric positive definite. The corresponding two-level preconditioner combines

  8. Domain Decomposition Preconditioners for Multiscale Flows in High-Contrast Media

    KAUST Repository

    Galvis, Juan

    2010-01-01

    In this paper, we study domain decomposition preconditioners for multiscale flows in high-contrast media. We consider flow equations governed by elliptic equations in heterogeneous media with a large contrast in the coefficients. Our main goal is to develop domain decomposition preconditioners with the condition number that is independent of the contrast when there are variations within coarse regions. This is accomplished by designing coarse-scale spaces and interpolators that represent important features of the solution within each coarse region. The important features are characterized by the connectivities of high-conductivity regions. To detect these connectivities, we introduce an eigenvalue problem that automatically detects high-conductivity regions via a large gap in the spectrum. A main observation is that this eigenvalue problem has a few small, asymptotically vanishing eigenvalues. The number of these small eigenvalues is the same as the number of connected high-conductivity regions. The coarse spaces are constructed such that they span eigenfunctions corresponding to these small eigenvalues. These spaces are used within two-level additive Schwarz preconditioners as well as overlapping methods for the Schur complement to design preconditioners. We show that the condition number of the preconditioned systems is independent of the contrast. More detailed studies are performed for the case when the high-conductivity region is connected within coarse block neighborhoods. Our numerical experiments confirm the theoretical results presented in this paper. © 2010 Society for Industrial and Applied Mathematics.

  9. FFT-based preconditioners for Toeplitz-Block least square problems

    Energy Technology Data Exchange (ETDEWEB)

    Chan, R.H. (Univ. of Hong Kong (Hong Kong). Dept. of Mathematics); Nagy, J.G.; Plemons, R.J. (Univ. of Minnesota, Minneapolis, MN (United States). Inst. for Mathematics and its Applications)

    1993-12-01

    Discretized two-dimensional deconvolution problems arising, e.g., in image restoration and seismic tomography, can be formulated as least squares computations, min [parallel] b [minus] Tx [parallel][sub 2], where T is often a large-scale rectangular Toeplitz-block matrix. The authors consider solving such block least squares problems by the preconditioned conjugate gradient algorithm using square nonsingular circulant-block and related preconditioners, constructed from the blocks of the rectangular matrix T. Preconditioning with such matrices allows efficient implementation using the one-dimensional or two-dimensional fast Fourier transform (FFT). Two-block preconditioners, related to those proposed by T. Chan and J. Olkin for square nonsingular Toeplitz-block systems, are derived and analyzed. It is shown that, for important classes of T, the singular values of the preconditioned matrix are clustered around one. This extends the authors' earlier work on preconditioners for Toeplitz least squares iterations for one-dimensional problems. It is well known that the resolution of ill-posed deconvolution problems can be substantially improved by regularization to compensate for their ill-posed nature. It is shown that regularization can easily be incorporated into the preconditioners, and a report is given on numerical experiments on a Cray Y-MP. The experiments illustrate good convergence properties of these FFT-based preconditioned iterations.

  10. A new preconditioner update strategy for the solution of sequences of linear systems in structural mechanics: application to saddle point problems in elasticity

    Science.gov (United States)

    Mercier, Sylvain; Gratton, Serge; Tardieu, Nicolas; Vasseur, Xavier

    2017-12-01

    Many applications in structural mechanics require the numerical solution of sequences of linear systems typically issued from a finite element discretization of the governing equations on fine meshes. The method of Lagrange multipliers is often used to take into account mechanical constraints. The resulting matrices then exhibit a saddle point structure and the iterative solution of such preconditioned linear systems is considered as challenging. A popular strategy is then to combine preconditioning and deflation to yield an efficient method. We propose an alternative that is applicable to the general case and not only to matrices with a saddle point structure. In this approach, we consider to update an existing algebraic or application-based preconditioner, using specific available information exploiting the knowledge of an approximate invariant subspace or of matrix-vector products. The resulting preconditioner has the form of a limited memory quasi-Newton matrix and requires a small number of linearly independent vectors. Numerical experiments performed on three large-scale applications in elasticity highlight the relevance of the new approach. We show that the proposed method outperforms the deflation method when considering sequences of linear systems with varying matrices.

  11. A preconditioner for the finite element computation of incompressible, nonlinear elastic deformations

    Science.gov (United States)

    Whiteley, J. P.

    2017-10-01

    Large, incompressible elastic deformations are governed by a system of nonlinear partial differential equations. The finite element discretisation of these partial differential equations yields a system of nonlinear algebraic equations that are usually solved using Newton's method. On each iteration of Newton's method, a linear system must be solved. We exploit the structure of the Jacobian matrix to propose a preconditioner, comprising two steps. The first step is the solution of a relatively small, symmetric, positive definite linear system using the preconditioned conjugate gradient method. This is followed by a small number of multigrid V-cycles for a larger linear system. Through the use of exemplar elastic deformations, the preconditioner is demonstrated to facilitate the iterative solution of the linear systems arising. The number of GMRES iterations required has only a very weak dependence on the number of degrees of freedom of the linear systems.

  12. Efficient Tridiagonal Preconditioner for the Matrix-Free Truncated Newton Method

    Czech Academy of Sciences Publication Activity Database

    Lukšan, Ladislav; Vlček, Jan

    2014-01-01

    Roč. 235, 25 May (2014), s. 394-407 ISSN 0096-3003 R&D Projects: GA ČR GA13-06684S Institutional support: RVO:67985807 Keywords : unconstrained optimization * large scale optimization * matrix-free truncated Newton method * preconditioned conjugate gradient method * preconditioners obtained by the directional differentiation * numerical algorithms Subject RIV: BA - General Mathematics Impact factor: 1.551, year: 2014

  13. Preconditioners for regularized saddle point problems with an application for heterogeneous Darcy flow problems

    Czech Academy of Sciences Publication Activity Database

    Axelsson, Owe; Blaheta, Radim; Byczanski, Petr; Karátson, J.; Ahmad, B.

    2015-01-01

    Roč. 280, č. 280 (2015), s. 141-157 ISSN 0377-0427 R&D Projects: GA MŠk ED1.1.00/02.0070 Institutional support: RVO:68145535 Keywords : preconditioners * heterogeneous coefficients * regularized saddle point Inner–outer iterations * Darcy flow Subject RIV: BA - General Mathematics Impact factor: 1.328, year: 2015 http://www.sciencedirect.com/science/article/pii/S0377042714005238

  14. A calderón multiplicative preconditioner for the combined field integral equation

    KAUST Repository

    Bagci, Hakan

    2009-10-01

    A Calderón multiplicative preconditioner (CMP) for the combined field integral equation (CFIE) is developed. Just like with previously proposed Caldern-preconditioned CFIEs, a localization procedure is employed to ensure that the equation is resonance-free. The iterative solution of the linear system of equations obtained via the CMP-based discretization of the CFIE converges rapidly regardless of the discretization density and the frequency of excitation. © 2009 IEEE.

  15. Analysis and performance of adjacent-cell preconditioners for accelerating multidimensional transport calculations

    International Nuclear Information System (INIS)

    Azmy, Y.Y.

    1996-01-01

    The formal development of the Adjacent-cell Preconditioner (AP) and its implementation in the TORT code are briefly reviewed. Based on earlier experience with diffusion type acceleration, and excellent results in slab geometry the reciprocal averaging formula is used to mix the preconditioner elements across material and mesh discontinuities. Numerical testing of the method employing the Burre Suite of Test Problems (BSTeP), a collection of 144 cases covering a wide range in parameter space, using AP, Partial Current Rebalance (PCR), and TWODANT's Diffusion Synthetic Acceleration (DSA) is presented. While AP outperforms the other two methods for the majority of the cases included in BSTeP it consumes many more iterations than can be explained by spectral analysis of the homogeneous model problem in cases with sharp material discontinuity. In order to verify this undesirable behavior and explore potential remedies a model problem, the Periodic Horizontal Interface (PHI), is developed that permits discontinuity of nuclear properties and cell height across the interface. Fourier mode decomposition is applied to AP with the reciprocal averaging mixing formula for the PHI configuration and shown to possess a spectral radius that approaches unity as the material discontinuity gets larger. The question of whether an unconditionally stable AP exists for PHI is tackled and preliminary indications are negative. Novel preconditioners that have nontraditional cell-coupling schemes that remain stable in these regimes may have to be sought

  16. Rational Approximations of the Inverse Gaussian Function.

    Science.gov (United States)

    Byars, Jackson A.; Roscoe, John T.

    There are at least two situations in which the behavioral scientist wishes to transform uniformly distributed data into normally distributed data: (1) In studies of sampling distributions where uniformly distributed pseudo-random numbers are generated by a computer but normally distributed numbers are desired; and (2) In measurement applications…

  17. Preconditioners for state-constrained optimal control problems with Moreau-Yosida penalty function

    KAUST Repository

    Pearson, John W.

    2012-11-21

    Optimal control problems with partial differential equations as constraints play an important role in many applications. The inclusion of bound constraints for the state variable poses a significant challenge for optimization methods. Our focus here is on the incorporation of the constraints via the Moreau-Yosida regularization technique. This method has been studied recently and has proven to be advantageous compared with other approaches. In this paper, we develop robust preconditioners for the efficient solution of the Newton steps associated with the fast solution of the Moreau-Yosida regularized problem. Numerical results illustrate the efficiency of our approach. © 2012 John Wiley & Sons, Ltd.

  18. Adjacent-cell Preconditioners for solving optically thick neutron transport problems

    International Nuclear Information System (INIS)

    Azmy, Y.Y.

    1994-01-01

    We develop, analyze, and test a new acceleration scheme for neutron transport methods, the Adjacent-cell Preconditioner (AP) that is particularly suited for solving optically thick problems. Our method goes beyond Diffusion Synthetic Acceleration (DSA) methods in that it's spectral radius vanishes with increasing cell thickness. In particular, for the ID case the AP method converges immediately, i.e. in one iteration, to 10 -4 pointwise relative criterion in problems with dominant cell size of 10 mfp or thicker. Also the AP has a simple formalism and is cell-centered hence, multidimensional and high order extensions are easier to develop, and more efficient to implement

  19. On performance of Krylov smoothing for fully-coupled AMG preconditioners for VMS resistive MHD

    Energy Technology Data Exchange (ETDEWEB)

    Lin, Paul T. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Shadid, John N. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Univ. of New Mexico, Albuquerque, NM (United States). Department of Mathematics and Statistics,; Tsuji, Paul H. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

    2017-11-01

    Here, this study explores the performance and scaling of a GMRES Krylov method employed as a smoother for an algebraic multigrid (AMG) preconditioned Newton- Krylov solution approach applied to a fully-implicit variational multiscale (VMS) nite element (FE) resistive magnetohydrodynamics (MHD) formulation. In this context a Newton iteration is used for the nonlinear system and a Krylov (GMRES) method is employed for the linear subsystems. The efficiency of this approach is critically dependent on the scalability and performance of the AMG preconditioner for the linear solutions and the performance of the smoothers play a critical role. Krylov smoothers are considered in an attempt to reduce the time and memory requirements of existing robust smoothers based on additive Schwarz domain decomposition (DD) with incomplete LU factorization solves on each subdomain. Three time dependent resistive MHD test cases are considered to evaluate the method. The results demonstrate that the GMRES smoother can be faster due to a decrease in the preconditioner setup time and a reduction in outer GMRESR solver iterations, and requires less memory (typically 35% less memory for global GMRES smoother) than the DD ILU smoother.

  20. Forward solving in Electrical Impedance Tomography with algebraic multigrid wavelet based preconditioners

    Science.gov (United States)

    Borsic, A.; Bayford, R.

    2010-04-01

    Electrical Impedance Tomography is a soft-field tomography modality, where image reconstruction is formulated as a non-linear least-squares model fitting problem. The Newton-Rahson scheme is used for actually reconstructing the image, and this involves three main steps: forward solving, computation of the Jacobian, and the computation of the conductivity update. Forward solving relies typically on the finite element method, resulting in the solution of a sparse linear system. In typical three dimensional biomedical applications of EIT, like breast, prostate, or brain imaging, it is desirable to work with sufficiently fine meshes in order to properly capture the shape of the domain, of the electrodes, and to describe the resulting electric filed with accuracy. These requirements result in meshes with 100,000 nodes or more. The solution the resulting forward problems is computationally intensive. We address this aspect by speeding up the solution of the FEM linear system by the use of efficient numeric methods and of new hardware architectures. In particular, in terms of numeric methods, we solve the forward problem using the Conjugate Gradient method, with a wavelet-based algebraic multigrid (AMG) preconditioner. This preconditioner is faster to set up than other AMG preconditoiners which are not based on wavelets, it does use less memory, and provides for a faster convergence. We report results for a MATLAB based prototype algorithm an we discuss details of a work in progress for a GPU implementation.

  1. Using Runtime Systems Tools to Implement Efficient Preconditioners for Heterogeneous Architectures

    Directory of Open Access Journals (Sweden)

    Roussel Adrien

    2016-11-01

    Full Text Available Solving large sparse linear systems is a time-consuming step in basin modeling or reservoir simulation. The choice of a robust preconditioner strongly impact the performance of the overall simulation. Heterogeneous architectures based on General Purpose computing on Graphic Processing Units (GPGPU or many-core architectures introduce programming challenges which can be managed in a transparent way for developer with the use of runtime systems. Nevertheless, algorithms need to be well suited for these massively parallel architectures. In this paper, we present preconditioning techniques which enable to take advantage of emerging architectures. We also present our task-based implementations through the use of the HARTS (Heterogeneous Abstract RunTime System runtime system, which aims to manage the recent architectures. We focus on two preconditoners. The first is ILU(0 preconditioner implemented on distributing memory systems. The second one is a multi-level domain decomposition method implemented on a shared-memory system. Obtained results are then presented on corresponding architectures, which open the way to discuss on the scalability of such methods according to numerical performances while keeping in mind that the next step is to propose a massively parallel implementations of these techniques.

  2. A Calderón multiplicative preconditioner for coupled surface-volume electric field integral equations

    KAUST Repository

    Bagci, Hakan

    2010-08-01

    A well-conditioned coupled set of surface (S) and volume (V) electric field integral equations (S-EFIE and V-EFIE) for analyzing wave interactions with densely discretized composite structures is presented. Whereas the V-EFIE operator is well-posed even when applied to densely discretized volumes, a classically formulated S-EFIE operator is ill-posed when applied to densely discretized surfaces. This renders the discretized coupled S-EFIE and V-EFIE system ill-conditioned, and its iterative solution inefficient or even impossible. The proposed scheme regularizes the coupled set of S-EFIE and V-EFIE using a Calderón multiplicative preconditioner (CMP)-based technique. The resulting scheme enables the efficient analysis of electromagnetic interactions with composite structures containing fine/subwavelength geometric features. Numerical examples demonstrate the efficiency of the proposed scheme. © 2006 IEEE.

  3. A fully implicit Newton-Krylov-Schwarz method for tokamak magnetohydrodynamics: Jacobian construction and preconditioner formulation

    KAUST Repository

    Reynolds, Daniel R.

    2012-01-01

    Single-fluid resistive magnetohydrodynamics (MHD) is a fluid description of fusion plasmas which is often used to investigate macroscopic instabilities in tokamaks. In MHD modeling of tokamaks, it is often desirable to compute MHD phenomena to resistive time scales or a combination of resistive-Alfvén time scales, which can render explicit time stepping schemes computationally expensive. We present recent advancements in the development of preconditioners for fully nonlinearly implicit simulations of single-fluid resistive tokamak MHD. Our work focuses on simulations using a structured mesh mapped into a toroidal geometry with a shaped poloidal cross-section, and a finite-volume spatial discretization of the partial differential equation model. We discretize the temporal dimension using a fully implicit or the backwards differentiation formula method, and solve the resulting nonlinear algebraic system using a standard inexact Newton-Krylov approach, provided by the sundials library. The focus of this paper is on the construction and performance of various preconditioning approaches for accelerating the convergence of the iterative solver algorithms. Effective preconditioners require information about the Jacobian entries; however, analytical formulae for these Jacobian entries may be prohibitive to derive/implement without error. We therefore compute these entries using automatic differentiation with OpenAD. We then investigate a variety of preconditioning formulations inspired by standard solution approaches in modern MHD codes, in order to investigate their utility in a preconditioning context. We first describe the code modifications necessary for the use of the OpenAD tool and sundials solver library. We conclude with numerical results for each of our preconditioning approaches in the context of pellet-injection fueling of tokamak plasmas. Of these, our optimal approach results in a speedup of a factor of 3 compared with non-preconditioned implicit tests, with

  4. Stochastic Approximation

    Indian Academy of Sciences (India)

    IAS Admin

    V S Borkar is the Institute. Chair Professor of. Electrical Engineering at. IIT Bombay. His research interests are stochastic optimization, theory, algorithms and applica- tions. 1 'Markov Chain Monte Carlo' is another one (see [1]), not to mention schemes that combine both. Stochastic approximation is one of the unsung.

  5. Two numerical methods for an inverse problem for the 2-D Helmholtz equation

    CERN Document Server

    Gryazin, Y A; Lucas, T R

    2003-01-01

    Two solution methods for the inverse problem for the 2-D Helmholtz equation are developed, tested, and compared. The proposed approaches are based on a marching finite-difference scheme which requires the solution of an overdetermined system at each step. The preconditioned conjugate gradient method is used for rapid solutions of these systems and an efficient preconditioner has been developed for this class of problems. Underlying target applications include the imaging of land mines, unexploded ordinance, and pollutant plumes in environmental cleanup sites, each formulated as an inverse problem for a 2-D Helmholtz equation. The images represent the electromagnetic properties of the respective underground regions. Extensive numerical results are presented.

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

    Science.gov (United States)

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

    2017-12-01

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

  7. Approximate Likelihood

    CERN Multimedia

    CERN. Geneva

    2015-01-01

    Most physics results at the LHC end in a likelihood ratio test. This includes discovery and exclusion for searches as well as mass, cross-section, and coupling measurements. The use of Machine Learning (multivariate) algorithms in HEP is mainly restricted to searches, which can be reduced to classification between two fixed distributions: signal vs. background. I will show how we can extend the use of ML classifiers to distributions parameterized by physical quantities like masses and couplings as well as nuisance parameters associated to systematic uncertainties. This allows for one to approximate the likelihood ratio while still using a high dimensional feature vector for the data. Both the MEM and ABC approaches mentioned above aim to provide inference on model parameters (like cross-sections, masses, couplings, etc.). ABC is fundamentally tied Bayesian inference and focuses on the “likelihood free” setting where only a simulator is available and one cannot directly compute the likelihood for the dat...

  8. Inverse photoemission

    International Nuclear Information System (INIS)

    Namatame, Hirofumi; Taniguchi, Masaki

    1994-01-01

    Photoelectron spectroscopy is regarded as the most powerful means since it can measure almost perfectly the occupied electron state. On the other hand, inverse photoelectron spectroscopy is the technique for measuring unoccupied electron state by using the inverse process of photoelectron spectroscopy, and in principle, the similar experiment to photoelectron spectroscopy becomes feasible. The development of the experimental technology for inverse photoelectron spectroscopy has been carried out energetically by many research groups so far. At present, the heightening of resolution of inverse photoelectron spectroscopy, the development of inverse photoelectron spectroscope in which light energy is variable and so on are carried out. But the inverse photoelectron spectroscope for vacuum ultraviolet region is not on the market. In this report, the principle of inverse photoelectron spectroscopy and the present state of the spectroscope are described, and the direction of the development hereafter is groped. As the experimental equipment, electron guns, light detectors and so on are explained. As the examples of the experiment, the inverse photoelectron spectroscopy of semimagnetic semiconductors and resonance inverse photoelectron spectroscopy are reported. (K.I.)

  9. On preconditioning techniques for dense linear systems arising from singular boundary integral equations

    Energy Technology Data Exchange (ETDEWEB)

    Chen, Ke [Univ. of Liverpool (United Kingdom)

    1996-12-31

    We study various preconditioning techniques for the iterative solution of boundary integral equations, and aim to provide a theory for a class of sparse preconditioners. Two related ideas are explored here: singularity separation and inverse approximation. Our preliminary conclusion is that singularity separation based preconditioners perform better than approximate inverse based while it is desirable to have both features.

  10. Approximations to the Newton potential

    International Nuclear Information System (INIS)

    Warburton, A.E.A.; Hatfield, R.W.

    1977-01-01

    Explicit expressions are obtained for Newton's (Newton, R.G., J. Math. Phys., 3:75-82 (1962)) solution to the inverse scattering problem in the approximations where up to two phase shifts are treated exactly and the rest to first order. (author)

  11. Comparison of iterative methods and preconditioners for the solution of miscible two-phase flow in heterogeneous porous media

    Science.gov (United States)

    Büsing, Henrik

    2014-05-01

    The geological sequestration of CO2 is considered as one option to mitigate anthropogenic effects on climate change. To describe the behavior of CO2 underground we consider mass balance equations for the two phases, CO2 and brine, which include the dissolution of CO2 into the brine phase and of H2O into the gas phase (c.f. [1]). After discretization in time with the implicit Euler method and in space with the Box method (c.f. [2]), we end up with a nonlinear system of equations. Newton's method is used to solve these systems, where the required Jacobians are obtained by automatic differentiation (AD) (c.f. [3]). In contrast to approximate Jacobians via finite differences, AD gives exact Jacobians through a source code transformation. These exact Jacobians have the advantage that no additional errors are introduced by the derivative computation. In consequence, fewer Newton iterations are needed and a performance increase during derivative computation can be observed (c.f. [4]). During the initial stage of a CO2 sequestration scenario the movement of the CO2 plume is driven by advective and buoyancy forces. After injection is finished solubility and density driven flow become dominant. We examine the performance of different iterative solvers and preconditioners for these two stages. To this end, we consider standard ILU preconditioning with BiCGStab as iterative solver, as well as GMRES, and algebraic and geometric multigrid methods. Our test example considers, on the one hand, a homogeneous permeability distribution and, on the other hand, a heterogeneous one. In the latter case we sample a heterogeneous porosity field from a Gaussian distribution and, subsequently, derive the corresponding permeabilities after [5]. Finally, we examine to which extent the amount of dissolved CO2 depends on the heterogeneities in the reservoir. References [1] Spycher, N., Pruess, K., & Ennis-King, J., 2003. CO2-H2O mixtures in the geological sequestration of CO2. I. Assessment and

  12. Inverse Limits

    CERN Document Server

    Ingram, WT

    2012-01-01

    Inverse limits provide a powerful tool for constructing complicated spaces from simple ones. They also turn the study of a dynamical system consisting of a space and a self-map into a study of a (likely more complicated) space and a self-homeomorphism. In four chapters along with an appendix containing background material the authors develop the theory of inverse limits. The book begins with an introduction through inverse limits on [0,1] before moving to a general treatment of the subject. Special topics in continuum theory complete the book. Although it is not a book on dynamics, the influen

  13. Performance evaluation of block-diagonal preconditioners for the divergence-conforming B-spline discretization of the Stokes system

    KAUST Repository

    Côrtes, A.M.A.

    2015-02-20

    The recently introduced divergence-conforming B-spline discretizations allow the construction of smooth discrete velocity–pressure pairs for viscous incompressible flows that are at the same time inf-sup stable and pointwise divergence-free. When applied to discretized Stokes equations, these spaces generate a symmetric and indefinite saddle-point linear system. Krylov subspace methods are usually the most efficient procedures to solve such systems. One of such methods, for symmetric systems, is the Minimum Residual Method (MINRES). However, the efficiency and robustness of Krylov subspace methods is closely tied to appropriate preconditioning strategies. For the discrete Stokes system, in particular, block-diagonal strategies provide efficient preconditioners. In this article, we compare the performance of block-diagonal preconditioners for several block choices. We verify how the eigenvalue clustering promoted by the preconditioning strategies affects MINRES convergence. We also compare the number of iterations and wall-clock timings. We conclude that among the building blocks we tested, the strategy with relaxed inner conjugate gradients preconditioned with incomplete Cholesky provided the best results.

  14. Mapping moveout approximations in TI media

    KAUST Repository

    Stovas, Alexey

    2013-11-21

    Moveout approximations play a very important role in seismic modeling, inversion, and scanning for parameters in complex media. We developed a scheme to map one-way moveout approximations for transversely isotropic media with a vertical axis of symmetry (VTI), which is widely available, to the tilted case (TTI) by introducing the effective tilt angle. As a result, we obtained highly accurate TTI moveout equations analogous with their VTI counterparts. Our analysis showed that the most accurate approximation is obtained from the mapping of generalized approximation. The new moveout approximations allow for, as the examples demonstrate, accurate description of moveout in the TTI case even for vertical heterogeneity. The proposed moveout approximations can be easily used for inversion in a layered TTI medium because the parameters of these approximations explicitly depend on corresponding effective parameters in a layered VTI medium.

  15. Approximation of the inverse G-frame operator

    Indian Academy of Sciences (India)

    17 (2004) 48–68. [8] Duffin R J and Schaeffer A C, A class of nonharmonic Fourier series, Trans. Am. Math. Soc. 72 (1952) 341–366. [9] Fornasier M, Decompositions of Hibert space: local construction of global frames, Proc. Int. Conf. on Constructive Function Theory, Varna (ed.) B Bojanov (2002) (DARBA,. Sofia) (2003) pp.

  16. Abdollahpour MR Approximation of the inverse g-frame operator ...

    Indian Academy of Sciences (India)

    user1

    Gurjar Sudarshan Rajendra. Principal bundles whose restrictions to a curve are isomorphic. 165. Haiour Mohamed. Overlapping domain decomposition methods for elliptic quasi-variational inequalities related to impulse control problem with mixed boundary conditions. 481. Hazarika G C. Analysis of a malaria model with.

  17. Preconditioners based on the Alternating-Direction-Implicit algorithm for the 2D steady-state diffusion equation with orthotropic heterogeneous coefficients

    KAUST Repository

    Gao, Longfei

    2015-01-01

    In this paper, we combine the Alternating Direction Implicit (ADI) algorithm with the concept of preconditioning and apply it to linear systems discretized from the 2D steady-state diffusion equations with orthotropic heterogeneous coefficients by the finite element method assuming tensor product basis functions. Specifically, we adopt the compound iteration idea and use ADI iterations as the preconditioner for the outside Krylov subspace method that is used to solve the preconditioned linear system. An efficient algorithm to perform each ADI iteration is crucial to the efficiency of the overall iterative scheme. We exploit the Kronecker product structure in the matrices, inherited from the tensor product basis functions, to achieve high efficiency in each ADI iteration. Meanwhile, in order to reduce the number of Krylov subspace iterations, we incorporate partially the coefficient information into the preconditioner by exploiting the local support property of the finite element basis functions. Numerical results demonstrated the efficiency and quality of the proposed preconditioner. © 2014 Elsevier B.V. All rights reserved.

  18. Bayesian seismic AVO inversion

    Energy Technology Data Exchange (ETDEWEB)

    Buland, Arild

    2002-07-01

    A new linearized AVO inversion technique is developed in a Bayesian framework. The objective is to obtain posterior distributions for P-wave velocity, S-wave velocity and density. Distributions for other elastic parameters can also be assessed, for example acoustic impedance, shear impedance and P-wave to S-wave velocity ratio. The inversion algorithm is based on the convolutional model and a linearized weak contrast approximation of the Zoeppritz equation. The solution is represented by a Gaussian posterior distribution with explicit expressions for the posterior expectation and covariance, hence exact prediction intervals for the inverted parameters can be computed under the specified model. The explicit analytical form of the posterior distribution provides a computationally fast inversion method. Tests on synthetic data show that all inverted parameters were almost perfectly retrieved when the noise approached zero. With realistic noise levels, acoustic impedance was the best determined parameter, while the inversion provided practically no information about the density. The inversion algorithm has also been tested on a real 3-D dataset from the Sleipner Field. The results show good agreement with well logs but the uncertainty is high. The stochastic model includes uncertainties of both the elastic parameters, the wavelet and the seismic and well log data. The posterior distribution is explored by Markov chain Monte Carlo simulation using the Gibbs sampler algorithm. The inversion algorithm has been tested on a seismic line from the Heidrun Field with two wells located on the line. The uncertainty of the estimated wavelet is low. In the Heidrun examples the effect of including uncertainty of the wavelet and the noise level was marginal with respect to the AVO inversion results. We have developed a 3-D linearized AVO inversion method with spatially coupled model parameters where the objective is to obtain posterior distributions for P-wave velocity, S

  19. Exploring the interplay of resilience and energy consumption for a task-based partial differential equations preconditioner

    KAUST Repository

    Rizzi, F.

    2017-05-25

    We discuss algorithm-based resilience to silent data corruptions (SDCs) in a task-based domain-decomposition preconditioner for partial differential equations (PDEs). The algorithm exploits a reformulation of the PDE as a sampling problem, followed by a solution update through data manipulation that is resilient to SDCs. The implementation is based on a server-client model where all state information is held by the servers, while clients are designed solely as computational units. Scalability tests run up to ∼ 51K cores show a parallel efficiency greater than 90%. We use a 2D elliptic PDE and a fault model based on random single and double bit-flip to demonstrate the resilience of the application to synthetically injected SDC. We discuss two fault scenarios: one based on the corruption of all data of a target task, and the other involving the corruption of a single data point. We show that for our application, given the test problem considered, a four-fold increase in the number of faults only yields a 2% change in the overhead to overcome their presence, from 7% to 9%. We then discuss potential savings in energy consumption via dynamic voltage/frequency scaling, and its interplay with fault-rates, and application overhead.

  20. Diophantine approximation and badly approximable sets

    DEFF Research Database (Denmark)

    Kristensen, S.; Thorn, R.; Velani, S.

    2006-01-01

    Let (X,d) be a metric space and (Omega, d) a compact subspace of X which supports a non-atomic finite measure m.  We consider `natural' classes of badly approximable  subsets of Omega. Loosely speaking, these consist of points in Omega which `stay clear' of some given set of points in X. The clas......Let (X,d) be a metric space and (Omega, d) a compact subspace of X which supports a non-atomic finite measure m.  We consider `natural' classes of badly approximable  subsets of Omega. Loosely speaking, these consist of points in Omega which `stay clear' of some given set of points in X....... The classical set Bad of `badly approximable' numbers in the theory of Diophantine approximation falls within our framework as do the sets Bad(i,j) of simultaneously badly approximable numbers. Under various natural conditions we prove that the badly approximable subsets of Omega have full Hausdorff dimension...

  1. Overlapping domain decomposition preconditioners for the generalized Davidson method for the eigenvalue problem

    Energy Technology Data Exchange (ETDEWEB)

    Stathopoulos, A.; Fischer, C.F. [Vanderbilt Univ., Nashville, TN (United States); Saad, Y.

    1994-12-31

    The solution of the large, sparse, symmetric eigenvalue problem, Ax = {lambda}x, is central to many scientific applications. Among many iterative methods that attempt to solve this problem, the Lanczos and the Generalized Davidson (GD) are the most widely used methods. The Lanczos method builds an orthogonal basis for the Krylov subspace, from which the required eigenvectors are approximated through a Rayleigh-Ritz procedure. Each Lanczos iteration is economical to compute but the number of iterations may grow significantly for difficult problems. The GD method can be considered a preconditioned version of Lanczos. In each step the Rayleigh-Ritz procedure is solved and explicit orthogonalization of the preconditioned residual ((M {minus} {lambda}I){sup {minus}1}(A {minus} {lambda}I)x) is performed. Therefore, the GD method attempts to improve convergence and robustness at the expense of a more complicated step.

  2. Modulated Pade approximant

    International Nuclear Information System (INIS)

    Ginsburg, C.A.

    1980-01-01

    In many problems, a desired property A of a function f(x) is determined by the behaviour of f(x) approximately equal to g(x,A) as x→xsup(*). In this letter, a method for resuming the power series in x of f(x) and approximating A (modulated Pade approximant) is presented. This new approximant is an extension of a resumation method for f(x) in terms of rational functions. (author)

  3. Approximate iterative algorithms

    CERN Document Server

    Almudevar, Anthony Louis

    2014-01-01

    Iterative algorithms often rely on approximate evaluation techniques, which may include statistical estimation, computer simulation or functional approximation. This volume presents methods for the study of approximate iterative algorithms, providing tools for the derivation of error bounds and convergence rates, and for the optimal design of such algorithms. Techniques of functional analysis are used to derive analytical relationships between approximation methods and convergence properties for general classes of algorithms. This work provides the necessary background in functional analysis a

  4. Approximation Properties of Certain Summation Integral Type Operators

    Directory of Open Access Journals (Sweden)

    Patel P.

    2015-03-01

    Full Text Available In the present paper, we study approximation properties of a family of linear positive operators and establish direct results, asymptotic formula, rate of convergence, weighted approximation theorem, inverse theorem and better approximation for this family of linear positive operators.

  5. Sparse approximation with bases

    CERN Document Server

    2015-01-01

    This book systematically presents recent fundamental results on greedy approximation with respect to bases. Motivated by numerous applications, the last decade has seen great successes in studying nonlinear sparse approximation. Recent findings have established that greedy-type algorithms are suitable methods of nonlinear approximation in both sparse approximation with respect to bases and sparse approximation with respect to redundant systems. These insights, combined with some previous fundamental results, form the basis for constructing the theory of greedy approximation. Taking into account the theoretical and practical demand for this kind of theory, the book systematically elaborates a theoretical framework for greedy approximation and its applications.  The book addresses the needs of researchers working in numerical mathematics, harmonic analysis, and functional analysis. It quickly takes the reader from classical results to the latest frontier, but is written at the level of a graduate course and do...

  6. Inverse problems of geophysics

    International Nuclear Information System (INIS)

    Yanovskaya, T.B.

    2003-07-01

    This report gives an overview and the mathematical formulation of geophysical inverse problems. General principles of statistical estimation are explained. The maximum likelihood and least square fit methods, the Backus-Gilbert method and general approaches for solving inverse problems are discussed. General formulations of linearized inverse problems, singular value decomposition and properties of pseudo-inverse solutions are given

  7. Fuzzy Inverse Compactness

    Directory of Open Access Journals (Sweden)

    Halis Aygün

    2008-01-01

    Full Text Available We introduce definitions of fuzzy inverse compactness, fuzzy inverse countable compactness, and fuzzy inverse Lindelöfness on arbitrary -fuzzy sets in -fuzzy topological spaces. We prove that the proposed definitions are good extensions of the corresponding concepts in ordinary topology and obtain different characterizations of fuzzy inverse compactness.

  8. Large maneuverable flight control using neural networks dynamic inversion

    Science.gov (United States)

    Yang, Enquan; Gao, Jinyuan

    2003-09-01

    An adaptive dynamic-inversion-based neural network is applied to aircraft large maneuverable flight control. Neural network is used to cancel the inversion error which may arise from imperfect modeling or approximate inversion. Simulation results for an aircraft model are presented to illustrate the performance of the flight control system.

  9. Topological approximations of multisets

    Directory of Open Access Journals (Sweden)

    El-Sayed A. Abo-Tabl

    2013-07-01

    Full Text Available Rough set theory is a powerful mathematical tool for dealing with inexact, uncertain or vague information. The core concept of rough set theory are information systems and approximation operators of approximation spaces. In this paper, we define and investigate three types of lower and upper multiset approximations of any multiset. These types based on the multiset base of multiset topology induced by a multiset relation. Moreover, the relationships between generalized rough msets and mset topologies are given. In addition, an illustrative example is given to illustrate the relationships between different types of generalized definitions of rough multiset approximations.

  10. Parallelizable approximate solvers for recursions arising in preconditioning

    Energy Technology Data Exchange (ETDEWEB)

    Shapira, Y. [Israel Inst. of Technology, Haifa (Israel)

    1996-12-31

    For the recursions used in the Modified Incomplete LU (MILU) preconditioner, namely, the incomplete decomposition, forward elimination and back substitution processes, a parallelizable approximate solver is presented. The present analysis shows that the solutions of the recursions depend only weakly on their initial conditions and may be interpreted to indicate that the inexact solution is close, in some sense, to the exact one. The method is based on a domain decomposition approach, suitable for parallel implementations with message passing architectures. It requires a fixed number of communication steps per preconditioned iteration, independently of the number of subdomains or the size of the problem. The overlapping subdomains are either cubes (suitable for mesh-connected arrays of processors) or constructed by the data-flow rule of the recursions (suitable for line-connected arrays with possibly SIMD or vector processors). Numerical examples show that, in both cases, the overhead in the number of iterations required for convergence of the preconditioned iteration is small relatively to the speed-up gained.

  11. Expectation Consistent Approximate Inference

    DEFF Research Database (Denmark)

    Opper, Manfred; Winther, Ole

    2005-01-01

    We propose a novel framework for approximations to intractable probabilistic models which is based on a free energy formulation. The approximation can be understood from replacing an average over the original intractable distribution with a tractable one. It requires two tractable probability...

  12. Approximations of Fuzzy Systems

    Directory of Open Access Journals (Sweden)

    Vinai K. Singh

    2013-03-01

    Full Text Available A fuzzy system can uniformly approximate any real continuous function on a compact domain to any degree of accuracy. Such results can be viewed as an existence of optimal fuzzy systems. Li-Xin Wang discussed a similar problem using Gaussian membership function and Stone-Weierstrass Theorem. He established that fuzzy systems, with product inference, centroid defuzzification and Gaussian functions are capable of approximating any real continuous function on a compact set to arbitrary accuracy. In this paper we study a similar approximation problem by using exponential membership functions

  13. Loose-cluster approximation

    Indian Academy of Sciences (India)

    First page Back Continue Last page Overview Graphics. Loose-cluster approximation. Continuous curve Our Theory. Dashed curve Our Simulation. Loose cluster approx. not only. captures -the anomalous. qualitative features but is also,. quantitatively, quite accurate. Notes:

  14. Approximation by mediants

    Science.gov (United States)

    Bosma, Wieb

    1990-01-01

    The distribution is determined of some sequences that measure how well a number is approximated by its mediants (or intermediate continued fraction convergents). The connection with a theorem of Fatou, as well as a new proof of this, is given.

  15. INTOR cost approximation

    International Nuclear Information System (INIS)

    Knobloch, A.F.

    1980-01-01

    A simplified cost approximation for INTOR parameter sets in a narrow parameter range is shown. Plausible constraints permit the evaluation of the consequences of parameter variations on overall cost. (orig.) [de

  16. Approximation and Computation

    CERN Document Server

    Gautschi, Walter; Rassias, Themistocles M

    2011-01-01

    Approximation theory and numerical analysis are central to the creation of accurate computer simulations and mathematical models. Research in these areas can influence the computational techniques used in a variety of mathematical and computational sciences. This collection of contributed chapters, dedicated to renowned mathematician Gradimir V. Milovanovia, represent the recent work of experts in the fields of approximation theory and numerical analysis. These invited contributions describe new trends in these important areas of research including theoretic developments, new computational alg

  17. Approximation Behooves Calibration

    DEFF Research Database (Denmark)

    da Silva Ribeiro, André Manuel; Poulsen, Rolf

    2013-01-01

    Calibration based on an expansion approximation for option prices in the Heston stochastic volatility model gives stable, accurate, and fast results for S&P500-index option data over the period 2005–2009.......Calibration based on an expansion approximation for option prices in the Heston stochastic volatility model gives stable, accurate, and fast results for S&P500-index option data over the period 2005–2009....

  18. Hierarchical matrix approximation of large covariance matrices

    KAUST Repository

    Litvinenko, Alexander

    2015-01-07

    We approximate large non-structured covariance matrices in the H-matrix format with a log-linear computational cost and storage O(n log n). We compute inverse, Cholesky decomposition and determinant in H-format. As an example we consider the class of Matern covariance functions, which are very popular in spatial statistics, geostatistics, machine learning and image analysis. Applications are: kriging and optimal design

  19. Hierarchical matrix approximation of large covariance matrices

    KAUST Repository

    Litvinenko, Alexander

    2015-01-05

    We approximate large non-structured covariance matrices in the H-matrix format with a log-linear computational cost and storage O(nlogn). We compute inverse, Cholesky decomposition and determinant in H-format. As an example we consider the class of Matern covariance functions, which are very popular in spatial statistics, geostatistics, machine learning and image analysis. Applications are: kriging and op- timal design.

  20. Solving inverse problems of optical microlithography

    Science.gov (United States)

    Granik, Yuri

    2005-05-01

    The direct problem of microlithography is to simulate printing features on the wafer under given mask, imaging system, and process characteristics. The goal of inverse problems is to find the best mask and/or imaging system and/or process to print the given wafer features. In this study we will describe and compare solutions of inverse mask problems. Pixel-based inverse problem of mask optimization (or "layout inversion") is harder than inverse source problem, especially for partially-coherent systems. It can be stated as a non-linear constrained minimization problem over complex domain, with large number of variables. We compare method of Nashold projections, variations of Fienap phase-retrieval algorithms, coherent approximation with deconvolution, local variations, and descent searches. We propose electrical field caching technique to substantially speedup the searching algorithms. We demonstrate applications of phase-shifted masks, assist features, and maskless printing.

  1. Wave-equation dispersion inversion

    KAUST Repository

    Li, Jing

    2016-12-08

    We present the theory for wave-equation inversion of dispersion curves, where the misfit function is the sum of the squared differences between the wavenumbers along the predicted and observed dispersion curves. The dispersion curves are obtained from Rayleigh waves recorded by vertical-component geophones. Similar to wave-equation traveltime tomography, the complicated surface wave arrivals in traces are skeletonized as simpler data, namely the picked dispersion curves in the phase-velocity and frequency domains. Solutions to the elastic wave equation and an iterative optimization method are then used to invert these curves for 2-D or 3-D S-wave velocity models. This procedure, denoted as wave-equation dispersion inversion (WD), does not require the assumption of a layered model and is significantly less prone to the cycle-skipping problems of full waveform inversion. The synthetic and field data examples demonstrate that WD can approximately reconstruct the S-wave velocity distributions in laterally heterogeneous media if the dispersion curves can be identified and picked. The WD method is easily extended to anisotropic data and the inversion of dispersion curves associated with Love waves.

  2. Inverse problem in neutron reflection

    International Nuclear Information System (INIS)

    Zhou, Xiao-Lin; Felcher, G.P.; Chen, Sow-Hsin

    1991-05-01

    Reflectance and transmittance of neutrons from a thin film deposited on a bulk substrate are derived from solution of Schroedinger wave equation in the material medium with an optical potential. A closed-form solution for the complex reflectance and transmittance is obtained in an approximation where the curvature of the scattering length density profile in the film is small. This closed-form solution reduces to all the known approximations in various limiting cases and is shown to be more accurate than the existing approximations. The closed-form solution of the reflectance is used as a starting point for an inversion algorithm whereby the reflectance data are inverted by a matrix iteration scheme to obtain the scattering length density distribution in the film. A preliminary test showed that the inverted profile is accurate for the linear scattering length density distribution but falls short in the case of an exponential distribution. 30 refs., 7 figs., 1 tab

  3. On Convex Quadratic Approximation

    NARCIS (Netherlands)

    den Hertog, D.; de Klerk, E.; Roos, J.

    2000-01-01

    In this paper we prove the counterintuitive result that the quadratic least squares approximation of a multivariate convex function in a finite set of points is not necessarily convex, even though it is convex for a univariate convex function. This result has many consequences both for the field of

  4. Improved Approximation Algorithm for

    NARCIS (Netherlands)

    Byrka, Jaroslaw; Li, S.; Rybicki, Bartosz

    2014-01-01

    We study the k-level uncapacitated facility location problem (k-level UFL) in which clients need to be connected with paths crossing open facilities of k types (levels). In this paper we first propose an approximation algorithm that for any constant k, in polynomial time, delivers solutions of

  5. Prestack wavefield approximations

    KAUST Repository

    Alkhalifah, Tariq

    2013-09-01

    The double-square-root (DSR) relation offers a platform to perform prestack imaging using an extended single wavefield that honors the geometrical configuration between sources, receivers, and the image point, or in other words, prestack wavefields. Extrapolating such wavefields, nevertheless, suffers from limitations. Chief among them is the singularity associated with horizontally propagating waves. I have devised highly accurate approximations free of such singularities which are highly accurate. Specifically, I use Padé expansions with denominators given by a power series that is an order lower than that of the numerator, and thus, introduce a free variable to balance the series order and normalize the singularity. For the higher-order Padé approximation, the errors are negligible. Additional simplifications, like recasting the DSR formula as a function of scattering angle, allow for a singularity free form that is useful for constant-angle-gather imaging. A dynamic form of this DSR formula can be supported by kinematic evaluations of the scattering angle to provide efficient prestack wavefield construction. Applying a similar approximation to the dip angle yields an efficient 1D wave equation with the scattering and dip angles extracted from, for example, DSR ray tracing. Application to the complex Marmousi data set demonstrates that these approximations, although they may provide less than optimal results, allow for efficient and flexible implementations. © 2013 Society of Exploration Geophysicists.

  6. Generalized Approximate Message Passing

    DEFF Research Database (Denmark)

    Oxvig, Christian Schou; Arildsen, Thomas; Larsen, Torben

    2017-01-01

    This tech report details a collection of results related to the Generalised Approximate Message Passing (GAMP) algorithm. It is a summary of the results that the authors have found critical in understanding the GAMP algorithm. In particular, emphasis is on the details that are crucial in implemen...

  7. On Stochastic Approximation.

    Science.gov (United States)

    Wolff, Hans

    This paper deals with a stochastic process for the approximation of the root of a regression equation. This process was first suggested by Robbins and Monro. The main result here is a necessary and sufficient condition on the iteration coefficients for convergence of the process (convergence with probability one and convergence in the quadratic…

  8. Approximating The DCM

    DEFF Research Database (Denmark)

    Madsen, Rasmus Elsborg

    2005-01-01

    The Dirichlet compound multinomial (DCM), which has recently been shown to be well suited for modeling for word burstiness in documents, is here investigated. A number of conceptual explanations that account for these recent results, are provided. An exponential family approximation of the DCM...

  9. Pade approximants and efficient analytic continuation of a power series

    International Nuclear Information System (INIS)

    Suetin, S P

    2002-01-01

    This survey reflects the current state of the theory of Pade approximants, that is, best rational approximations of power series. The main focus is on the so-called inverse problems of this theory, in which one must make deductions about analytic continuation of a given power series on the basis of the known asymptotic behaviour of the poles of some sequence of Pade approximants of this series. Row and diagonal sequences are studied from this point of view. Gonchar's and Rakhmanov's fundamental results of inverse nature are presented along with results of the author

  10. Robust and scalable hierarchical matrix-based fast direct solver and preconditioner for the numerical solution of elliptic partial differential equations

    KAUST Repository

    Chavez, Gustavo Ivan

    2017-07-10

    This dissertation introduces a novel fast direct solver and preconditioner for the solution of block tridiagonal linear systems that arise from the discretization of elliptic partial differential equations on a Cartesian product mesh, such as the variable-coefficient Poisson equation, the convection-diffusion equation, and the wave Helmholtz equation in heterogeneous media. The algorithm extends the traditional cyclic reduction method with hierarchical matrix techniques. The resulting method exposes substantial concurrency, and its arithmetic operations and memory consumption grow only log-linearly with problem size, assuming bounded rank of off-diagonal matrix blocks, even for problems with arbitrary coefficient structure. The method can be used as a standalone direct solver with tunable accuracy, or as a black-box preconditioner in conjunction with Krylov methods. The challenges that distinguish this work from other thrusts in this active field are the hybrid distributed-shared parallelism that can demonstrate the algorithm at large-scale, full three-dimensionality, and the three stressors of the current state-of-the-art multigrid technology: high wavenumber Helmholtz (indefiniteness), high Reynolds convection (nonsymmetry), and high contrast diffusion (inhomogeneity). Numerical experiments corroborate the robustness, accuracy, and complexity claims and provide a baseline of the performance and memory footprint by comparisons with competing approaches such as the multigrid solver hypre, and the STRUMPACK implementation of the multifrontal factorization with hierarchically semi-separable matrices. The companion implementation can utilize many thousands of cores of Shaheen, KAUST\\'s Haswell-based Cray XC-40 supercomputer, and compares favorably with other implementations of hierarchical solvers in terms of time-to-solution and memory consumption.

  11. Prestack traveltime approximations

    KAUST Repository

    Alkhalifah, Tariq Ali

    2011-01-01

    Most prestack traveltime relations we tend work with are based on homogeneous (or semi-homogenous, possibly effective) media approximations. This includes the multi-focusing or double square-root (DSR) and the common reflection stack (CRS) equations. Using the DSR equation, I analyze the associated eikonal form in the general source-receiver domain. Like its wave-equation counterpart, it suffers from a critical singularity for horizontally traveling waves. As a result, I derive expansion based solutions of this eikonal based on polynomial expansions in terms of the reflection and dip angles in a generally inhomogenous background medium. These approximate solutions are free of singularities and can be used to estimate travetimes for small to moderate offsets (or reflection angles) in a generally inhomogeneous medium. A Marmousi example demonstrates the usefulness of the approach. © 2011 Society of Exploration Geophysicists.

  12. Topology, calculus and approximation

    CERN Document Server

    Komornik, Vilmos

    2017-01-01

    Presenting basic results of topology, calculus of several variables, and approximation theory which are rarely treated in a single volume, this textbook includes several beautiful, but almost forgotten, classical theorems of Descartes, Erdős, Fejér, Stieltjes, and Turán. The exposition style of Topology, Calculus and Approximation follows the Hungarian mathematical tradition of Paul Erdős and others. In the first part, the classical results of Alexandroff, Cantor, Hausdorff, Helly, Peano, Radon, Tietze and Urysohn illustrate the theories of metric, topological and normed spaces. Following this, the general framework of normed spaces and Carathéodory's definition of the derivative are shown to simplify the statement and proof of various theorems in calculus and ordinary differential equations. The third and final part is devoted to interpolation, orthogonal polynomials, numerical integration, asymptotic expansions and the numerical solution of algebraic and differential equations. Students of both pure an...

  13. Fragments of approximate counting

    Czech Academy of Sciences Publication Activity Database

    Buss, S.R.; Kolodziejczyk, L. A.; Thapen, Neil

    2014-01-01

    Roč. 79, č. 2 (2014), s. 496-525 ISSN 0022-4812 R&D Projects: GA AV ČR IAA100190902 Institutional support: RVO:67985840 Keywords : approximate counting * bounded arithmetic * ordering principle Subject RIV: BA - General Mathematics Impact factor: 0.541, year: 2014 http://journals.cambridge.org/action/displayAbstract?fromPage=online&aid=9287274&fileId=S0022481213000376

  14. Optimization and approximation

    CERN Document Server

    Pedregal, Pablo

    2017-01-01

    This book provides a basic, initial resource, introducing science and engineering students to the field of optimization. It covers three main areas: mathematical programming, calculus of variations and optimal control, highlighting the ideas and concepts and offering insights into the importance of optimality conditions in each area. It also systematically presents affordable approximation methods. Exercises at various levels have been included to support the learning process.

  15. Approximate Bayesian recursive estimation

    Czech Academy of Sciences Publication Activity Database

    Kárný, Miroslav

    2014-01-01

    Roč. 285, č. 1 (2014), s. 100-111 ISSN 0020-0255 R&D Projects: GA ČR GA13-13502S Institutional support: RVO:67985556 Keywords : Approximate parameter estimation * Bayesian recursive estimation * Kullback–Leibler divergence * Forgetting Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 4.038, year: 2014 http://library.utia.cas.cz/separaty/2014/AS/karny-0425539.pdf

  16. Topics in Metric Approximation

    Science.gov (United States)

    Leeb, William Edward

    This thesis develops effective approximations of certain metrics that occur frequently in pure and applied mathematics. We show that distances that often arise in applications, such as the Earth Mover's Distance between two probability measures, can be approximated by easily computed formulas for a wide variety of ground distances. We develop simple and easily computed characterizations both of norms measuring a function's regularity -- such as the Lipschitz norm -- and of their duals. We are particularly concerned with the tensor product of metric spaces, where the natural notion of regularity is not the Lipschitz condition but the mixed Lipschitz condition. A theme that runs throughout this thesis is that snowflake metrics (metrics raised to a power less than 1) are often better-behaved than ordinary metrics. For example, we show that snowflake metrics on finite spaces can be approximated by the average of tree metrics with a distortion bounded by intrinsic geometric characteristics of the space and not the number of points. Many of the metrics for which we characterize the Lipschitz space and its dual are snowflake metrics. We also present applications of the characterization of certain regularity norms to the problem of recovering a matrix that has been corrupted by noise. We are able to achieve an optimal rate of recovery for certain families of matrices by exploiting the relationship between mixed-variable regularity conditions and the decay of a function's coefficients in a certain orthonormal basis.

  17. On transparent potentials: a Born approximation study

    International Nuclear Information System (INIS)

    Coudray, C.

    1980-01-01

    In the frame of the scattering inverse problem at fixed energy, a class of potentials transparent in Born approximation is obtained. All these potentials are spherically symmetric and are oscillating functions of the reduced radial variable. Amongst them, the Born approximation of the transparent potential of the Newton-Sabatier method is found. In the same class, quasi-transparent potentials are exhibited. Very general features of potentials transparent in Born approximation are then stated. And bounds are given for the exact scattering amplitudes corresponding to most of the potentials previously exhibited. These bounds, obtained at fixed energy, and for large values of the angular momentum, are found to be independent on the energy

  18. Finite elements and approximation

    CERN Document Server

    Zienkiewicz, O C

    2006-01-01

    A powerful tool for the approximate solution of differential equations, the finite element is extensively used in industry and research. This book offers students of engineering and physics a comprehensive view of the principles involved, with numerous illustrative examples and exercises.Starting with continuum boundary value problems and the need for numerical discretization, the text examines finite difference methods, weighted residual methods in the context of continuous trial functions, and piecewise defined trial functions and the finite element method. Additional topics include higher o

  19. On the WKBJ approximation

    International Nuclear Information System (INIS)

    El Sawi, M.

    1983-07-01

    A simple approach employing properties of solutions of differential equations is adopted to derive an appropriate extension of the WKBJ method. Some of the earlier techniques that are commonly in use are unified, whereby the general approximate solution to a second-order homogeneous linear differential equation is presented in a standard form that is valid for all orders. In comparison to other methods, the present one is shown to be leading in the order of iteration, and thus possibly has the ability of accelerating the convergence of the solution. The method is also extended for the solution of inhomogeneous equations. (author)

  20. Cyclic approximation to stasis

    Directory of Open Access Journals (Sweden)

    Stewart D. Johnson

    2009-06-01

    Full Text Available Neighborhoods of points in $mathbb{R}^n$ where a positive linear combination of $C^1$ vector fields sum to zero contain, generically, cyclic trajectories that switch between the vector fields. Such points are called stasis points, and the approximating switching cycle can be chosen so that the timing of the switches exactly matches the positive linear weighting. In the case of two vector fields, the stasis points form one-dimensional $C^1$ manifolds containing nearby families of two-cycles. The generic case of two flows in $mathbb{R}^3$ can be diffeomorphed to a standard form with cubic curves as trajectories.

  1. Approximate Euclidean Ramsey theorems

    Directory of Open Access Journals (Sweden)

    Adrian Dumitrescu

    2011-04-01

    Full Text Available According to a classical result of Szemerédi, every dense subset of 1,2,…,N contains an arbitrary long arithmetic progression, if N is large enough. Its analogue in higher dimensions due to Fürstenberg and Katznelson says that every dense subset of {1,2,…,N}d contains an arbitrary large grid, if N is large enough. Here we generalize these results for separated point sets on the line and respectively in the Euclidean space: (i every dense separated set of points in some interval [0,L] on the line contains an arbitrary long approximate arithmetic progression, if L is large enough. (ii every dense separated set of points in the d-dimensional cube [0,L]d in Rd contains an arbitrary large approximate grid, if L is large enough. A further generalization for any finite pattern in Rd is also established. The separation condition is shown to be necessary for such results to hold. In the end we show that every sufficiently large point set in Rd contains an arbitrarily large subset of almost collinear points. No separation condition is needed in this case.

  2. Approximate Bayesian computation.

    Directory of Open Access Journals (Sweden)

    Mikael Sunnåker

    Full Text Available Approximate Bayesian computation (ABC constitutes a class of computational methods rooted in Bayesian statistics. In all model-based statistical inference, the likelihood function is of central importance, since it expresses the probability of the observed data under a particular statistical model, and thus quantifies the support data lend to particular values of parameters and to choices among different models. For simple models, an analytical formula for the likelihood function can typically be derived. However, for more complex models, an analytical formula might be elusive or the likelihood function might be computationally very costly to evaluate. ABC methods bypass the evaluation of the likelihood function. In this way, ABC methods widen the realm of models for which statistical inference can be considered. ABC methods are mathematically well-founded, but they inevitably make assumptions and approximations whose impact needs to be carefully assessed. Furthermore, the wider application domain of ABC exacerbates the challenges of parameter estimation and model selection. ABC has rapidly gained popularity over the last years and in particular for the analysis of complex problems arising in biological sciences (e.g., in population genetics, ecology, epidemiology, and systems biology.

  3. Inverse Kinematics using Quaternions

    DEFF Research Database (Denmark)

    Henriksen, Knud; Erleben, Kenny; Engell-Nørregård, Morten

    In this project I describe the status of inverse kinematics research, with the focus firmly on the methods that solve the core problem. An overview of the different methods are presented Three common methods used in inverse kinematics computation have been chosen as subject for closer inspection....

  4. Inverse logarithmic potential problem

    CERN Document Server

    Cherednichenko, V G

    1996-01-01

    The Inverse and Ill-Posed Problems Series is a series of monographs publishing postgraduate level information on inverse and ill-posed problems for an international readership of professional scientists and researchers. The series aims to publish works which involve both theory and applications in, e.g., physics, medicine, geophysics, acoustics, electrodynamics, tomography, and ecology.

  5. Electron self-energy calculation using a general multi-pole approximation

    CERN Document Server

    Soininen, J A; Shirley, E L

    2003-01-01

    We present a method for calculating the inverse of the dielectric matrix in a solid using a band Lanczos algorithm. The method produces a multi-pole approximation for the inverse dielectric matrix with an arbitrary number of poles. We discuss how this approximation can be used to calculate the screened Coulomb interaction needed for electron self-energy calculations in solids.

  6. The quasilocalized charge approximation

    International Nuclear Information System (INIS)

    Kalman, G J; Golden, K I; Donko, Z; Hartmann, P

    2005-01-01

    The quasilocalized charge approximation (QLCA) has been used for some time as a formalism for the calculation of the dielectric response and for determining the collective mode dispersion in strongly coupled Coulomb and Yukawa liquids. The approach is based on a microscopic model in which the charges are quasilocalized on a short-time scale in local potential fluctuations. We review the conceptual basis and theoretical structure of the QLC approach and together with recent results from molecular dynamics simulations that corroborate and quantify the theoretical concepts. We also summarize the major applications of the QLCA to various physical systems, combined with the corresponding results of the molecular dynamics simulations and point out the general agreement and instances of disagreement between the two

  7. Discrete inverse scattering theory and the continuum limit

    International Nuclear Information System (INIS)

    Berryman, J.G.; Greene, R.R.

    1978-01-01

    The class of satisfactory difference approximations for the Schroedinger equation in discrete inverse scattering theory is shown smaller than previously supposed. A fast algorithm (analogous to the Levinson algorithm for Toeplitz matrices) is found for solving the discrete inverse problem. (Auth.)

  8. Gravity inversion code

    International Nuclear Information System (INIS)

    Burkhard, N.R.

    1979-01-01

    The gravity inversion code applies stabilized linear inverse theory to determine the topography of a subsurface density anomaly from Bouguer gravity data. The gravity inversion program consists of four source codes: SEARCH, TREND, INVERT, and AVERAGE. TREND and INVERT are used iteratively to converge on a solution. SEARCH forms the input gravity data files for Nevada Test Site data. AVERAGE performs a covariance analysis on the solution. This document describes the necessary input files and the proper operation of the code. 2 figures, 2 tables

  9. Approximate quantum Markov chains

    CERN Document Server

    Sutter, David

    2018-01-01

    This book is an introduction to quantum Markov chains and explains how this concept is connected to the question of how well a lost quantum mechanical system can be recovered from a correlated subsystem. To achieve this goal, we strengthen the data-processing inequality such that it reveals a statement about the reconstruction of lost information. The main difficulty in order to understand the behavior of quantum Markov chains arises from the fact that quantum mechanical operators do not commute in general. As a result we start by explaining two techniques of how to deal with non-commuting matrices: the spectral pinching method and complex interpolation theory. Once the reader is familiar with these techniques a novel inequality is presented that extends the celebrated Golden-Thompson inequality to arbitrarily many matrices. This inequality is the key ingredient in understanding approximate quantum Markov chains and it answers a question from matrix analysis that was open since 1973, i.e., if Lieb's triple ma...

  10. Prestack traveltime approximations

    KAUST Repository

    Alkhalifah, Tariq Ali

    2012-05-01

    Many of the explicit prestack traveltime relations used in practice are based on homogeneous (or semi-homogenous, possibly effective) media approximations. This includes the multifocusing, based on the double square-root (DSR) equation, and the common reflection stack (CRS) approaches. Using the DSR equation, I constructed the associated eikonal form in the general source-receiver domain. Like its wave-equation counterpart, it suffers from a critical singularity for horizontally traveling waves. As a result, I recasted the eikonal in terms of the reflection angle, and thus, derived expansion based solutions of this eikonal in terms of the difference between the source and receiver velocities in a generally inhomogenous background medium. The zero-order term solution, corresponding to ignoring the lateral velocity variation in estimating the prestack part, is free of singularities and can be used to estimate traveltimes for small to moderate offsets (or reflection angles) in a generally inhomogeneous medium. The higher-order terms include limitations for horizontally traveling waves, however, we can readily enforce stability constraints to avoid such singularities. In fact, another expansion over reflection angle can help us avoid these singularities by requiring the source and receiver velocities to be different. On the other hand, expansions in terms of reflection angles result in singularity free equations. For a homogenous background medium, as a test, the solutions are reasonably accurate to large reflection and dip angles. A Marmousi example demonstrated the usefulness and versatility of the formulation. © 2012 Society of Exploration Geophysicists.

  11. Sharp spatially constrained inversion

    DEFF Research Database (Denmark)

    Vignoli, Giulio G.; Fiandaca, Gianluca G.; Christiansen, Anders Vest C A.V.C.

    2013-01-01

    We present sharp reconstruction of multi-layer models using a spatially constrained inversion with minimum gradient support regularization. In particular, its application to airborne electromagnetic data is discussed. Airborne surveys produce extremely large datasets, traditionally inverted...... by using smoothly varying 1D models. Smoothness is a result of the regularization constraints applied to address the inversion ill-posedness. The standard Occam-type regularized multi-layer inversion produces results where boundaries between layers are smeared. The sharp regularization overcomes...... inversions are compared against classical smooth results and available boreholes. With the focusing approach, the obtained blocky results agree with the underlying geology and allow for easier interpretation by the end-user....

  12. Inverse planning IMRT

    International Nuclear Information System (INIS)

    Rosenwald, J.-C.

    2008-01-01

    The lecture addressed the following topics: Optimizing radiotherapy dose distribution; IMRT contributes to optimization of energy deposition; Inverse vs direct planning; Main steps of IMRT; Background of inverse planning; General principle of inverse planning; The 3 main components of IMRT inverse planning; The simplest cost function (deviation from prescribed dose); The driving variable : the beamlet intensity; Minimizing a 'cost function' (or 'objective function') - the walker (or skier) analogy; Application to IMRT optimization (the gradient method); The gradient method - discussion; The simulated annealing method; The optimization criteria - discussion; Hard and soft constraints; Dose volume constraints; Typical user interface for definition of optimization criteria; Biological constraints (Equivalent Uniform Dose); The result of the optimization process; Semi-automatic solutions for IMRT; Generalisation of the optimization problem; Driving and driven variables used in RT optimization; Towards multi-criteria optimization; and Conclusions for the optimization phase. (P.A.)

  13. Submucous Myoma Induces Uterine Inversion

    Directory of Open Access Journals (Sweden)

    Yu-Li Chen

    2006-06-01

    Conclusion: Nonpuerperal inversion of the uterus is rarely encountered by gynecologists. Diagnosis of uterine inversion is often not easy and imaging studies might be helpful. Surgical treatment is the method of choice in nonpuerperal uterine inversion.

  14. P-FFT Accelerated EFIE with a Novel Diagonal Perturbed ILUT Preconditioner for Electromagnetic Scattering by Conducting Objects in Half Space

    Directory of Open Access Journals (Sweden)

    Lan-Wei Guo

    2015-01-01

    Full Text Available A highly efficient and robust scheme is proposed for analyzing electromagnetic scattering from electrically large arbitrary shaped conductors in a half space. This scheme is based on the electric field integral equation (EFIE with a half-space Green’s function. The precorrected fast Fourier transform (p-FFT is first extended to a half space for general three-dimensional scattering problems. A novel enhanced dual threshold incomplete LU factorization (ILUT is then constructed as an effective preconditioner to improve the convergence of the half-space EFIE. Inspired by the idea of the improved electric field integral operator (IEFIO, the geometrical-optics current/principle value term of the magnetic field integral equation is used as a physical perturbation to stabilize the traditional ILUT perconditioning matrix. The high accuracy of EFIE is maintained, yet good calculating efficiency comparable to the combined field integral equation (CFIE can be achieved. Furthermore, this approach can be applied to arbitrary geometrical structures including open surfaces and requires no extra types of Sommerfeld integrals needed in the half-space CFIE. Numerical examples are presented to demonstrate the high performance of the proposed solver among several other approaches in typical half-space problems.

  15. Inverse design of multicomponent assemblies

    Science.gov (United States)

    Piñeros, William D.; Lindquist, Beth A.; Jadrich, Ryan B.; Truskett, Thomas M.

    2018-03-01

    Inverse design can be a useful strategy for discovering interactions that drive particles to spontaneously self-assemble into a desired structure. Here, we extend an inverse design methodology—relative entropy optimization—to determine isotropic interactions that promote assembly of targeted multicomponent phases, and we apply this extension to design interactions for a variety of binary crystals ranging from compact triangular and square architectures to highly open structures with dodecagonal and octadecagonal motifs. We compare the resulting optimized (self- and cross) interactions for the binary assemblies to those obtained from optimization of analogous single-component systems. This comparison reveals that self-interactions act as a "primer" to position particles at approximately correct coordination shell distances, while cross interactions act as the "binder" that refines and locks the system into the desired configuration. For simpler binary targets, it is possible to successfully design self-assembling systems while restricting one of these interaction types to be a hard-core-like potential. However, optimization of both self- and cross interaction types appears necessary to design for assembly of more complex or open structures.

  16. International Conference Approximation Theory XV

    CERN Document Server

    Schumaker, Larry

    2017-01-01

    These proceedings are based on papers presented at the international conference Approximation Theory XV, which was held May 22–25, 2016 in San Antonio, Texas. The conference was the fifteenth in a series of meetings in Approximation Theory held at various locations in the United States, and was attended by 146 participants. The book contains longer survey papers by some of the invited speakers covering topics such as compressive sensing, isogeometric analysis, and scaling limits of polynomials and entire functions of exponential type. The book also includes papers on a variety of current topics in Approximation Theory drawn from areas such as advances in kernel approximation with applications, approximation theory and algebraic geometry, multivariate splines for applications, practical function approximation, approximation of PDEs, wavelets and framelets with applications, approximation theory in signal processing, compressive sensing, rational interpolation, spline approximation in isogeometric analysis, a...

  17. Augmented weak forms and element-by-element preconditioners: Efficient iterative strategies for structural finite elements. A preliminary study

    Science.gov (United States)

    Muller, A.; Hughes, T. J. R.

    1984-01-01

    A weak formulation in structural analysis that provides well conditioned matrices suitable for iterative solutions is presented. A mixed formulation ensures the proper representation of the problem and the constitutive relations are added in a penalized form. The problem is solved by a double conjugate gradient algorithm combined with an element by element approximate factorization procedure. The double conjugate gradient strategy resembles Uzawa's variable-length type algorithms the main difference is the presence of quadratic terms in the mixed variables. In the case of shear deformable beams these terms ensure that the proper finite thickness solution is obtained.

  18. Inverse scale space decomposition

    DEFF Research Database (Denmark)

    Schmidt, Marie Foged; Benning, Martin; Schönlieb, Carola-Bibiane

    2018-01-01

    We investigate the inverse scale space flow as a decomposition method for decomposing data into generalised singular vectors. We show that the inverse scale space flow, based on convex and even and positively one-homogeneous regularisation functionals, can decompose data represented...... by the application of a forward operator to a linear combination of generalised singular vectors into its individual singular vectors. We verify that for this decomposition to hold true, two additional conditions on the singular vectors are sufficient: orthogonality in the data space and inclusion of partial sums...... of the subgradients of the singular vectors in the subdifferential of the regularisation functional at zero. We also address the converse question of when the inverse scale space flow returns a generalised singular vector given that the initial data is arbitrary (and therefore not necessarily in the range...

  19. Hierarchical low-rank approximation for high dimensional approximation

    KAUST Repository

    Nouy, Anthony

    2016-01-07

    Tensor methods are among the most prominent tools for the numerical solution of high-dimensional problems where functions of multiple variables have to be approximated. Such high-dimensional approximation problems naturally arise in stochastic analysis and uncertainty quantification. In many practical situations, the approximation of high-dimensional functions is made computationally tractable by using rank-structured approximations. In this talk, we present algorithms for the approximation in hierarchical tensor format using statistical methods. Sparse representations in a given tensor format are obtained with adaptive or convex relaxation methods, with a selection of parameters using crossvalidation methods.

  20. Comparative Study of Approximate Multipliers

    OpenAIRE

    Masadeh, Mahmoud; Hasan, Osman; Tahar, Sofiene

    2018-01-01

    Approximate multipliers are widely being advocated for energy-efficient computing in applications that exhibit an inherent tolerance to inaccuracy. However, the inclusion of accuracy as a key design parameter, besides the performance, area and power, makes the identification of the most suitable approximate multiplier quite challenging. In this paper, we identify three major decision making factors for the selection of an approximate multipliers circuit: (1) the type of approximate full adder...

  1. Forms of Approximate Radiation Transport

    CERN Document Server

    Brunner, G

    2002-01-01

    Photon radiation transport is described by the Boltzmann equation. Because this equation is difficult to solve, many different approximate forms have been implemented in computer codes. Several of the most common approximations are reviewed, and test problems illustrate the characteristics of each of the approximations. This document is designed as a tutorial so that code users can make an educated choice about which form of approximate radiation transport to use for their particular simulation.

  2. A 2.5-D Diffraction Tomography Inversion Scheme for Ground Penetrating Radar

    DEFF Research Database (Denmark)

    Meincke, Peter

    1999-01-01

    A new 2.5-D inversion scheme is derived for ground penetrating radar (GPR) that applies to a monostatic fixed-offset measurement configuration. The inversion scheme, which is based upon the first Born approximation and the pseudo-inverse operator, takes rigorously into account the planar air...

  3. Inversion assuming weak scattering

    DEFF Research Database (Denmark)

    Xenaki, Angeliki; Gerstoft, Peter; Mosegaard, Klaus

    2013-01-01

    due to the complex nature of the field. A method based on linear inversion is employed to infer information about the statistical properties of the scattering field from the obtained cross-spectral matrix. A synthetic example based on an active high-frequency sonar demonstrates that the proposed...

  4. Locative Inversion in English

    NARCIS (Netherlands)

    Broekhuis, H.

    2005-01-01

    This article aims at reformulating in more current terms Hoekstra and Mulder’s (1990) analysis of the Locative Inversion (LI) construction. The new proposal is crucially based on the assumption that Small Clause (SC) predicates agree with their external argument in phi-features, which may be

  5. International Conference Approximation Theory XIV

    CERN Document Server

    Schumaker, Larry

    2014-01-01

    This volume developed from papers presented at the international conference Approximation Theory XIV,  held April 7–10, 2013 in San Antonio, Texas. The proceedings contains surveys by invited speakers, covering topics such as splines on non-tensor-product meshes, Wachspress and mean value coordinates, curvelets and shearlets, barycentric interpolation, and polynomial approximation on spheres and balls. Other contributed papers address a variety of current topics in approximation theory, including eigenvalue sequences of positive integral operators, image registration, and support vector machines. This book will be of interest to mathematicians, engineers, and computer scientists working in approximation theory, computer-aided geometric design, numerical analysis, and related approximation areas.

  6. Exact constants in approximation theory

    CERN Document Server

    Korneichuk, N

    1991-01-01

    This book is intended as a self-contained introduction for non-specialists, or as a reference work for experts, to the particular area of approximation theory that is concerned with exact constants. The results apply mainly to extremal problems in approximation theory, which in turn are closely related to numerical analysis and optimization. The book encompasses a wide range of questions and problems: best approximation by polynomials and splines; linear approximation methods, such as spline-approximation; optimal reconstruction of functions and linear functionals. Many of the results are base

  7. Certain approximation problems for functions on the infinite-dimensional torus: Lipschitz spaces

    Science.gov (United States)

    Platonov, S. S.

    2018-02-01

    We consider some questions about the approximation of functions on the infinite-dimensional torus by trigonometric polynomials. Our main results are analogues of the direct and inverse theorems in the classical theory of approximation of periodic functions and a description of the Lipschitz spaces on the infinite-dimensional torus in terms of the best approximation.

  8. Pseudo waveform inversion

    Energy Technology Data Exchange (ETDEWEB)

    Shin, Chang Soo; Park, Keun Pil [Korea Inst. of Geology Mining and Materials, Taejon (Korea, Republic of); Suh, Jung Hee; Hyun, Byung Koo; Shin, Sung Ryul [Seoul National University, Seoul (Korea, Republic of)

    1995-12-01

    The seismic reflection exploration technique which is one of the geophysical methods for oil exploration became effectively to image the subsurface structure with rapid development of computer. However, the imagining of subsurface based on the conventional data processing is almost impossible to obtain the information on physical properties of the subsurface such as velocity and density. Since seismic data are implicitly function of velocities of subsurface, it is necessary to develop the inversion method that can delineate the velocity structure using seismic topography and waveform inversion. As a tool to perform seismic inversion, seismic forward modeling program using ray tracing should be developed. In this study, we have developed the algorithm that calculate the travel time of the complex geologic structure using shooting ray tracing by subdividing the geologic model into blocky structure having the constant velocity. With the travel time calculation, the partial derivatives of travel time can be calculated efficiently without difficulties. Since the current ray tracing technique has a limitation to calculate the travel times for extremely complex geologic model, our aim in the future is to develop the powerful ray tracer using the finite element technique. After applying the pseudo waveform inversion to the seismic data of Korea offshore, we can obtain the subsurface velocity model and use the result in bring up the quality of the seismic data processing. If conventional seismic data processing and seismic interpretation are linked with this inversion technique, the high quality of seismic data processing can be expected to image the structure of the subsurface. Future research area is to develop the powerful ray tracer of ray tracing which can calculate the travel times for the extremely complex geologic model. (author). 39 refs., 32 figs., 2 tabs.

  9. Calculation of the inverse data space via sparse inversion

    KAUST Repository

    Saragiotis, Christos

    2011-01-01

    The inverse data space provides a natural separation of primaries and surface-related multiples, as the surface multiples map onto the area around the origin while the primaries map elsewhere. However, the calculation of the inverse data is far from trivial as theory requires infinite time and offset recording. Furthermore regularization issues arise during inversion. We perform the inversion by minimizing the least-squares norm of the misfit function by constraining the $ell_1$ norm of the solution, being the inverse data space. In this way a sparse inversion approach is obtained. We show results on field data with an application to surface multiple removal.

  10. Inverse problems and uncertainty quantification

    KAUST Repository

    Litvinenko, Alexander

    2013-12-18

    In a Bayesian setting, inverse problems and uncertainty quantification (UQ)— the propagation of uncertainty through a computational (forward) model—are strongly connected. In the form of conditional expectation the Bayesian update becomes computationally attractive. This is especially the case as together with a functional or spectral approach for the forward UQ there is no need for time- consuming and slowly convergent Monte Carlo sampling. The developed sampling- free non-linear Bayesian update is derived from the variational problem associated with conditional expectation. This formulation in general calls for further discretisa- tion to make the computation possible, and we choose a polynomial approximation. After giving details on the actual computation in the framework of functional or spectral approximations, we demonstrate the workings of the algorithm on a number of examples of increasing complexity. At last, we compare the linear and quadratic Bayesian update on the small but taxing example of the chaotic Lorenz 84 model, where we experiment with the influence of different observation or measurement operators on the update.

  11. Inverse Problems and Uncertainty Quantification

    KAUST Repository

    Litvinenko, Alexander

    2014-01-06

    In a Bayesian setting, inverse problems and uncertainty quantification (UQ) - the propagation of uncertainty through a computational (forward) modelare strongly connected. In the form of conditional expectation the Bayesian update becomes computationally attractive. This is especially the case as together with a functional or spectral approach for the forward UQ there is no need for time- consuming and slowly convergent Monte Carlo sampling. The developed sampling- free non-linear Bayesian update is derived from the variational problem associated with conditional expectation. This formulation in general calls for further discretisa- tion to make the computation possible, and we choose a polynomial approximation. After giving details on the actual computation in the framework of functional or spectral approximations, we demonstrate the workings of the algorithm on a number of examples of increasing complexity. At last, we compare the linear and quadratic Bayesian update on the small but taxing example of the chaotic Lorenz 84 model, where we experiment with the influence of different observation or measurement operators on the update.

  12. The impact of approximations and arbitrary choices on geophysical images

    Science.gov (United States)

    Valentine, Andrew P.; Trampert, Jeannot

    2016-01-01

    Whenever a geophysical image is to be constructed, a variety of choices must be made. Some, such as those governing data selection and processing, or model parametrization, are somewhat arbitrary: there may be little reason to prefer one choice over another. Others, such as defining the theoretical framework within which the data are to be explained, may be more straightforward: typically, an `exact' theory exists, but various approximations may need to be adopted in order to make the imaging problem computationally tractable. Differences between any two images of the same system can be explained in terms of differences between these choices. Understanding the impact of each particular decision is essential if images are to be interpreted properly-but little progress has been made towards a quantitative treatment of this effect. In this paper, we consider a general linearized inverse problem, applicable to a wide range of imaging situations. We write down an expression for the difference between two images produced using similar inversion strategies, but where different choices have been made. This provides a framework within which inversion algorithms may be analysed, and allows us to consider how image effects may arise. In this paper, we take a general view, and do not specialize our discussion to any specific imaging problem or setup (beyond the restrictions implied by the use of linearized inversion techniques). In particular, we look at the concept of `hybrid inversion', in which highly accurate synthetic data (typically the result of an expensive numerical simulation) is combined with an inverse operator constructed based on theoretical approximations. It is generally supposed that this offers the benefits of using the more complete theory, without the full computational costs. We argue that the inverse operator is as important as the forward calculation in determining the accuracy of results. We illustrate this using a simple example, based on imaging the

  13. Discrete Spectrum Reconstruction Using Integral Approximation Algorithm.

    Science.gov (United States)

    Sizikov, Valery; Sidorov, Denis

    2017-07-01

    An inverse problem in spectroscopy is considered. The objective is to restore the discrete spectrum from observed spectrum data, taking into account the spectrometer's line spread function. The problem is reduced to solution of a system of linear-nonlinear equations (SLNE) with respect to intensities and frequencies of the discrete spectral lines. The SLNE is linear with respect to lines' intensities and nonlinear with respect to the lines' frequencies. The integral approximation algorithm is proposed for the solution of this SLNE. The algorithm combines solution of linear integral equations with solution of a system of linear algebraic equations and avoids nonlinear equations. Numerical examples of the application of the technique, both to synthetic and experimental spectra, demonstrate the efficacy of the proposed approach in enabling an effective enhancement of the spectrometer's resolution.

  14. Approximate truncation robust computed tomography—ATRACT

    International Nuclear Information System (INIS)

    Dennerlein, Frank; Maier, Andreas

    2013-01-01

    We present an approximate truncation robust algorithm to compute tomographic images (ATRACT). This algorithm targets at reconstructing volumetric images from cone-beam projections in scenarios where these projections are highly truncated in each dimension. It thus facilitates reconstructions of small subvolumes of interest, without involving prior knowledge about the object. Our method is readily applicable to medical C-arm imaging, where it may contribute to new clinical workflows together with a considerable reduction of x-ray dose. We give a detailed derivation of ATRACT that starts from the conventional Feldkamp filtered-backprojection algorithm and that involves, as one component, a novel original formula for the inversion of the two-dimensional Radon transform. Discretization and numerical implementation are discussed and reconstruction results from both, simulated projections and first clinical data sets are presented. (paper)

  15. Linearized inversion of two components seismic data; Inversion linearisee de donnees sismiques a deux composantes

    Energy Technology Data Exchange (ETDEWEB)

    Lebrun, D.

    1997-05-22

    The aim of the dissertation is the linearized inversion of multicomponent seismic data for 3D elastic horizontally stratified media, using Born approximation. A Jacobian matrix is constructed; it will be used to model seismic data from elastic parameters. The inversion technique, relying on single value decomposition (SVD) of the Jacobian matrix, is described. Next, the resolution of inverted elastic parameters is quantitatively studies. A first use of the technique is shown in the frame of an evaluation of a sea bottom acquisition (synthetic data). Finally, a real data set acquired with conventional marine technique is inverted. (author) 70 refs.

  16. Electrochemically driven emulsion inversion

    International Nuclear Information System (INIS)

    Johans, Christoffer; Kontturi, Kyoesti

    2007-01-01

    It is shown that emulsions stabilized by ionic surfactants can be inverted by controlling the electrical potential across the oil-water interface. The potential dependent partitioning of sodium dodecyl sulfate (SDS) was studied by cyclic voltammetry at the 1,2-dichlorobenzene|water interface. In the emulsion the potential control was achieved by using a potential-determining salt. The inversion of a 1,2-dichlorobenzene-in-water (O/W) emulsion stabilized by SDS was followed by conductometry as a function of added tetrapropylammonium chloride. A sudden drop in conductivity was observed, indicating the change of the continuous phase from water to 1,2-dichlorobenzene, i.e. a water-in-1,2-dichlorobenzene emulsion was formed. The inversion potential is well in accordance with that predicted by the hydrophilic-lipophilic deviation if the interfacial potential is appropriately accounted for

  17. Channelling versus inversion

    DEFF Research Database (Denmark)

    Gale, A.S.; Surlyk, Finn; Anderskouv, Kresten

    2013-01-01

    Evidence from regional stratigraphical patterns in Santonian−Campanian chalk is used to infer the presence of a very broad channel system (5 km across) with a depth of at least 50 m, running NNW−SSE across the eastern Isle of Wight; only the western part of the channel wall and fill is exposed. W......−Campanian chalks in the eastern Isle of Wight, involving penecontemporaneous tectonic inversion of the underlying basement structure, are rejected....

  18. Intersections, ideals, and inversion

    International Nuclear Information System (INIS)

    Vasco, D.W.

    1998-01-01

    Techniques from computational algebra provide a framework for treating large classes of inverse problems. In particular, the discretization of many types of integral equations and of partial differential equations with undetermined coefficients lead to systems of polynomial equations. The structure of the solution set of such equations may be examined using algebraic techniques.. For example, the existence and dimensionality of the solution set may be determined. Furthermore, it is possible to bound the total number of solutions. The approach is illustrated by a numerical application to the inverse problem associated with the Helmholtz equation. The algebraic methods are used in the inversion of a set of transverse electric (TE) mode magnetotelluric data from Antarctica. The existence of solutions is demonstrated and the number of solutions is found to be finite, bounded from above at 50. The best fitting structure is dominantly one dimensional with a low crustal resistivity of about 2 ohm-m. Such a low value is compatible with studies suggesting lower surface wave velocities than found in typical stable cratons

  19. Intersections, ideals, and inversion

    Energy Technology Data Exchange (ETDEWEB)

    Vasco, D.W.

    1998-10-01

    Techniques from computational algebra provide a framework for treating large classes of inverse problems. In particular, the discretization of many types of integral equations and of partial differential equations with undetermined coefficients lead to systems of polynomial equations. The structure of the solution set of such equations may be examined using algebraic techniques.. For example, the existence and dimensionality of the solution set may be determined. Furthermore, it is possible to bound the total number of solutions. The approach is illustrated by a numerical application to the inverse problem associated with the Helmholtz equation. The algebraic methods are used in the inversion of a set of transverse electric (TE) mode magnetotelluric data from Antarctica. The existence of solutions is demonstrated and the number of solutions is found to be finite, bounded from above at 50. The best fitting structure is dominantly onedimensional with a low crustal resistivity of about 2 ohm-m. Such a low value is compatible with studies suggesting lower surface wave velocities than found in typical stable cratons.

  20. Inverse transition radiation

    International Nuclear Information System (INIS)

    Steinhauer, L.C.; Romea, R.D.; Kimura, W.D.

    1997-01-01

    A new method for laser acceleration is proposed based upon the inverse process of transition radiation. The laser beam intersects an electron-beam traveling between two thin foils. The principle of this acceleration method is explored in terms of its classical and quantum bases and its inverse process. A closely related concept based on the inverse of diffraction radiation is also presented: this concept has the significant advantage that apertures are used to allow free passage of the electron beam. These concepts can produce net acceleration because they do not satisfy the conditions in which the Lawson-Woodward theorem applies (no net acceleration in an unbounded vacuum). Finally, practical aspects such as damage limits at optics are employed to find an optimized set of parameters. For reasonable assumptions an acceleration gradient of 200 MeV/m requiring a laser power of less than 1 GW is projected. An interesting approach to multi-staging the acceleration sections is also presented. copyright 1997 American Institute of Physics

  1. Trimming and procrastination as inversion techniques

    Science.gov (United States)

    Backus, George E.

    1996-12-01

    By examining the processes of truncating and approximating the model space (trimming it), and by committing to neither the objectivist nor the subjectivist interpretation of probability (procrastinating), we construct a formal scheme for solving linear and non-linear geophysical inverse problems. The necessary prior information about the correct model xE can be either a collection of inequalities or a probability measure describing where xE was likely to be in the model space X before the data vector y0 was measured. The results of the inversion are (1) a vector z0 that estimates some numerical properties zE of xE; (2) an estimate of the error δz = z0 - zE. As y0 is finite dimensional, so is z0, and hence in principle inversion cannot describe all of xE. The error δz is studied under successively more specialized assumptions about the inverse problem, culminating in a complete analysis of the linear inverse problem with a prior quadratic bound on xE. Our formalism appears to encompass and provide error estimates for many of the inversion schemes current in geomagnetism, and would be equally applicable in geodesy and seismology if adequate prior information were available there. As an idealized example we study the magnetic field at the core-mantle boundary, using satellite measurements of field elements at sites assumed to be almost uniformly distributed on a single spherical surface. Magnetospheric currents are neglected and the crustal field is idealized as a random process with rotationally invariant statistics. We find that an appropriate data compression diagonalizes the variance matrix of the crustal signal and permits an analytic trimming of the idealized problem.

  2. Optimal control of a single qubit by direct inversion

    International Nuclear Information System (INIS)

    Wenin, M.; Poetz, W.

    2006-01-01

    Optimal control of a driven single dissipative qubit is formulated as an inverse problem. We show that direct inversion is possible which allows an analytic construction of optimal control fields. Exact inversion is shown to be possible for dissipative qubits which can be described by a Lindblad equation. It is shown that optimal solutions are not unique. For a qubit with weak coupling to phonons we choose, among the set of exact solutions for the dissipationless qubit, one which minimizes the dissipative contribution in the kinetic equations. Examples are given for state trapping and Z-gate operation. Using analytic expressions for optimal control fields, favorable domains for dynamic stabilization in the Bloch sphere are identified. In the case of approximate inversion, the identified approximate solution may be used as a starting point for further optimization following standard methods

  3. Approximation by planar elastic curves

    DEFF Research Database (Denmark)

    Brander, David; Gravesen, Jens; Nørbjerg, Toke Bjerge

    2016-01-01

    We give an algorithm for approximating a given plane curve segment by a planar elastic curve. The method depends on an analytic representation of the space of elastic curve segments, together with a geometric method for obtaining a good initial guess for the approximating curve. A gradient-driven...

  4. Anytime classification by ontology approximation

    NARCIS (Netherlands)

    Schlobach, S.; Blaauw, E.; El Kebir, M.; Ten Teije, A.; Van Harmelen, F.; Bortoli, S.; Hobbelman, M.C.; Millian, K.; Ren, Y.; Stam, S.; Thomassen, P.; Van Het Schip, R.; Van Willigem, W.

    2007-01-01

    Reasoning with large or complex ontologies is one of the bottle-necks of the Semantic Web. In this paper we present an anytime algorithm for classification based on approximate subsumption. We give the formal definitions for approximate subsumption, and show its monotonicity and soundness; we show

  5. Some results in Diophantine approximation

    DEFF Research Database (Denmark)

    Pedersen, Steffen Højris

    This thesis consists of three papers in Diophantine approximation, a subbranch of number theory. Preceding these papers is an introduction to various aspects of Diophantine approximation and formal Laurent series over Fq and a summary of each of the three papers. The introduction introduces...... the basic concepts on which the papers build. Among other it introduces metric Diophantine approximation, Mahler’s approach on algebraic approximation, the Hausdorff measure, and properties of the formal Laurent series over Fq. The introduction ends with a discussion on Mahler’s problem when considered...... in the formal Laurent series over F3. The first paper is on intrinsic Diophantine approximation in the Cantor set in the formal Laurent series over F3. The summary contains a short motivation, the results of the paper and sketches of the proofs, mainly focusing on the ideas involved. The details of the proofs...

  6. Approximate circuits for increased reliability

    Science.gov (United States)

    Hamlet, Jason R.; Mayo, Jackson R.

    2015-08-18

    Embodiments of the invention describe a Boolean circuit having a voter circuit and a plurality of approximate circuits each based, at least in part, on a reference circuit. The approximate circuits are each to generate one or more output signals based on values of received input signals. The voter circuit is to receive the one or more output signals generated by each of the approximate circuits, and is to output one or more signals corresponding to a majority value of the received signals. At least some of the approximate circuits are to generate an output value different than the reference circuit for one or more input signal values; however, for each possible input signal value, the majority values of the one or more output signals generated by the approximate circuits and received by the voter circuit correspond to output signal result values of the reference circuit.

  7. Inverse scattering with supersymmetric quantum mechanics

    International Nuclear Information System (INIS)

    Baye, Daniel; Sparenberg, Jean-Marc

    2004-01-01

    The application of supersymmetric quantum mechanics to the inverse scattering problem is reviewed. The main difference with standard treatments of the inverse problem lies in the simple and natural extension to potentials with singularities at the origin and with a Coulomb behaviour at infinity. The most general form of potentials which are phase-equivalent to a given potential is discussed. The use of singular potentials allows adding or removing states from the bound spectrum without contradicting the Levinson theorem. Physical applications of phase-equivalent potentials in nuclear reactions and in three-body systems are described. Derivation of a potential from the phase shift at fixed orbital momentum can also be performed with the supersymmetric inversion by using a Bargmann-type approximation of the scattering matrix or phase shift. A unique singular potential without bound states can be obtained from any phase shift. A limited number of bound states depending on the singularity can then be added. This inversion procedure is illustrated with nucleon-nucleon scattering

  8. Multiscale Phase Inversion of Seismic Data

    KAUST Repository

    Fu, Lei

    2017-12-02

    We present a scheme for multiscale phase inversion (MPI) of seismic data that is less sensitive to the unmodeled physics of wave propagation and a poor starting model than standard full waveform inversion (FWI). To avoid cycle-skipping, the multiscale strategy temporally integrates the traces several times, i.e. high-order integration, to produce low-boost seismograms that are used as input data for the initial iterations of MPI. As the iterations proceed, higher frequencies in the data are boosted by using integrated traces of lower order as the input data. The input data are also filtered into different narrow frequency bands for the MPI implementation. At low frequencies, we show that MPI with windowed reflections approximates wave equation inversion of the reflection traveltimes, except no traveltime picking is needed. Numerical results with synthetic acoustic data show that MPI is more robust than conventional multiscale FWI when the initial model is far from the true model. Results from synthetic viscoacoustic and elastic data show that MPI is less sensitive than FWI to some of the unmodeled physics. Inversion of marine data shows that MPI is more robust and produces modestly more accurate results than FWI for this data set.

  9. Theory of the inverse Faraday effect in metals

    International Nuclear Information System (INIS)

    Hertel, Riccardo

    2006-01-01

    An analytic expression is given for the inverse Faraday effect, i.e., for the magnetization occurring in a transparent medium exposed to a circularly polarized high-frequency electromagnetic wave. Using a microscopic approach based on the Drude approximation of a free-electron gas, the magnetization of the medium due to the inverse Faraday effect is identified as the result of microscopic solenoidal currents generated by the electromagnetic wave. In contrast to the better known phenomenological derivation, this microscopic treatment provides important information on the frequency dependence of the inverse Faraday effect

  10. Displacement parameter inversion for a novel electromagnetic underground displacement sensor.

    Science.gov (United States)

    Shentu, Nanying; Li, Qing; Li, Xiong; Tong, Renyuan; Shentu, Nankai; Jiang, Guoqing; Qiu, Guohua

    2014-05-22

    Underground displacement monitoring is an effective method to explore deep into rock and soil masses for execution of subsurface displacement measurements. It is not only an important means of geological hazards prediction and forecasting, but also a forefront, hot and sophisticated subject in current geological disaster monitoring. In previous research, the authors had designed a novel electromagnetic underground horizontal displacement sensor (called the H-type sensor) by combining basic electromagnetic induction principles with modern sensing techniques and established a mutual voltage measurement theoretical model called the Equation-based Equivalent Loop Approach (EELA). Based on that work, this paper presents an underground displacement inversion approach named "EELA forward modeling-approximate inversion method". Combining the EELA forward simulation approach with the approximate optimization inversion theory, it can deduce the underground horizontal displacement through parameter inversion of the H-type sensor. Comprehensive and comparative studies have been conducted between the experimentally measured and theoretically inversed values of horizontal displacement under counterpart conditions. The results show when the measured horizontal displacements are in the 0-100 mm range, the horizontal displacement inversion discrepancy is generally tested to be less than 3 mm under varied tilt angles and initial axial distances conditions, which indicates that our proposed parameter inversion method can predict underground horizontal displacement measurements effectively and robustly for the H-type sensor and the technique is applicable for practical geo-engineering applications.

  11. Displacement Parameter Inversion for a Novel Electromagnetic Underground Displacement Sensor

    Directory of Open Access Journals (Sweden)

    Nanying Shentu

    2014-05-01

    Full Text Available Underground displacement monitoring is an effective method to explore deep into rock and soil masses for execution of subsurface displacement measurements. It is not only an important means of geological hazards prediction and forecasting, but also a forefront, hot and sophisticated subject in current geological disaster monitoring. In previous research, the authors had designed a novel electromagnetic underground horizontal displacement sensor (called the H-type sensor by combining basic electromagnetic induction principles with modern sensing techniques and established a mutual voltage measurement theoretical model called the Equation-based Equivalent Loop Approach (EELA. Based on that work, this paper presents an underground displacement inversion approach named “EELA forward modeling-approximate inversion method”. Combining the EELA forward simulation approach with the approximate optimization inversion theory, it can deduce the underground horizontal displacement through parameter inversion of the H-type sensor. Comprehensive and comparative studies have been conducted between the experimentally measured and theoretically inversed values of horizontal displacement under counterpart conditions. The results show when the measured horizontal displacements are in the 0–100 mm range, the horizontal displacement inversion discrepancy is generally tested to be less than 3 mm under varied tilt angles and initial axial distances conditions, which indicates that our proposed parameter inversion method can predict underground horizontal displacement measurements effectively and robustly for the H-type sensor and the technique is applicable for practical geo-engineering applications.

  12. Limits to Nonlinear Inversion

    DEFF Research Database (Denmark)

    Mosegaard, Klaus

    2012-01-01

    For non-linear inverse problems, the mathematical structure of the mapping from model parameters to data is usually unknown or partly unknown. Absence of information about the mathematical structure of this function prevents us from presenting an analytical solution, so our solution depends on our...... ability to produce efficient search algorithms. Such algorithms may be completely problem-independent (which is the case for the so-called 'meta-heuristics' or 'blind-search' algorithms), or they may be designed with the structure of the concrete problem in mind. We show that pure meta...

  13. Approximate Implicitization Using Linear Algebra

    Directory of Open Access Journals (Sweden)

    Oliver J. D. Barrowclough

    2012-01-01

    Full Text Available We consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore well suited to floating-point implementation in computer-aided geometric design (CAGD systems. We unify the approaches under the names of commonly known polynomial basis functions and consider various theoretical and practical aspects of the algorithms. We offer new methods for a least squares approach to approximate implicitization using orthogonal polynomials, which tend to be faster and more numerically stable than some existing algorithms. We propose several simple propositions relating the properties of the polynomial bases to their implicit approximation properties.

  14. Rollout sampling approximate policy iteration

    NARCIS (Netherlands)

    Dimitrakakis, C.; Lagoudakis, M.G.

    2008-01-01

    Several researchers have recently investigated the connection between reinforcement learning and classification. We are motivated by proposals of approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a

  15. Shearlets and Optimally Sparse Approximations

    DEFF Research Database (Denmark)

    Kutyniok, Gitta; Lemvig, Jakob; Lim, Wang-Q

    2012-01-01

    of such functions. Recently, cartoon-like images were introduced in 2D and 3D as a suitable model class, and approximation properties were measured by considering the decay rate of the $L^2$ error of the best $N$-term approximation. Shearlet systems are to date the only representation system, which provide...... optimally sparse approximations of this model class in 2D as well as 3D. Even more, in contrast to all other directional representation systems, a theory for compactly supported shearlet frames was derived which moreover also satisfy this optimality benchmark. This chapter shall serve as an introduction...... to and a survey about sparse approximations of cartoon-like images by band-limited and also compactly supported shearlet frames as well as a reference for the state-of-the-art of this research field....

  16. Mathematical algorithms for approximate reasoning

    Science.gov (United States)

    Murphy, John H.; Chay, Seung C.; Downs, Mary M.

    1988-01-01

    Most state of the art expert system environments contain a single and often ad hoc strategy for approximate reasoning. Some environments provide facilities to program the approximate reasoning algorithms. However, the next generation of expert systems should have an environment which contain a choice of several mathematical algorithms for approximate reasoning. To meet the need for validatable and verifiable coding, the expert system environment must no longer depend upon ad hoc reasoning techniques but instead must include mathematically rigorous techniques for approximate reasoning. Popular approximate reasoning techniques are reviewed, including: certainty factors, belief measures, Bayesian probabilities, fuzzy logic, and Shafer-Dempster techniques for reasoning. A group of mathematically rigorous algorithms for approximate reasoning are focused on that could form the basis of a next generation expert system environment. These algorithms are based upon the axioms of set theory and probability theory. To separate these algorithms for approximate reasoning various conditions of mutual exclusivity and independence are imposed upon the assertions. Approximate reasoning algorithms presented include: reasoning with statistically independent assertions, reasoning with mutually exclusive assertions, reasoning with assertions that exhibit minimum overlay within the state space, reasoning with assertions that exhibit maximum overlay within the state space (i.e. fuzzy logic), pessimistic reasoning (i.e. worst case analysis), optimistic reasoning (i.e. best case analysis), and reasoning with assertions with absolutely no knowledge of the possible dependency among the assertions. A robust environment for expert system construction should include the two modes of inference: modus ponens and modus tollens. Modus ponens inference is based upon reasoning towards the conclusion in a statement of logical implication, whereas modus tollens inference is based upon reasoning away

  17. Parallelized Three-Dimensional Resistivity Inversion Using Finite Elements And Adjoint State Methods

    Science.gov (United States)

    Schaa, Ralf; Gross, Lutz; Du Plessis, Jaco

    2015-04-01

    resistivity. The Hessian of the regularization term is used as preconditioner which requires an additional PDE solution in each iteration step. As it turns out, the relevant PDEs are naturally formulated in the finite element framework. Using the domain decomposition method provided in Escript, the inversion scheme has been parallelized for distributed memory computers with multi-core shared memory nodes. We show numerical examples from simple layered models to complex 3D models and compare with the results from other methods. The inversion scheme is furthermore tested on a field data example to characterise localised freshwater discharge in a coastal environment.. References: L. Gross and C. Kemp (2013) Large Scale Joint Inversion of Geophysical Data using the Finite Element Method in escript. ASEG Extended Abstracts 2013, http://dx.doi.org/10.1071/ASEG2013ab306

  18. Approximate deconvolution models of turbulence analysis, phenomenology and numerical analysis

    CERN Document Server

    Layton, William J

    2012-01-01

    This volume presents a mathematical development of a recent approach to the modeling and simulation of turbulent flows based on methods for the approximate solution of inverse problems. The resulting Approximate Deconvolution Models or ADMs have some advantages over more commonly used turbulence models – as well as some disadvantages. Our goal in this book is to provide a clear and complete mathematical development of ADMs, while pointing out the difficulties that remain. In order to do so, we present the analytical theory of ADMs, along with its connections, motivations and complements in the phenomenology of and algorithms for ADMs.

  19. Fourier-Jacobi harmonic analysis and approximation of functions

    International Nuclear Information System (INIS)

    Platonov, S S

    2014-01-01

    We use the methods of Fourier-Jacobi harmonic analysis to study problems of the approximation of functions by algebraic polynomials in weighted function spaces on [−1,1]. We prove analogues of Jackson's direct theorem for the moduli of smoothness of all orders constructed on the basis of Jacobi generalized translations. The moduli of smoothness are shown to be equivalent to K-functionals constructed from Sobolev-type spaces. We define Nikol'skii-Besov spaces for the Jacobi generalized translation and describe them in terms of best approximations. We also prove analogues of some inverse theorems of Stechkin

  20. Approximation with positive linear operators and linear combinations

    CERN Document Server

    Gupta, Vijay

    2017-01-01

    This book presents a systematic overview of approximation by linear combinations of positive linear operators, a useful tool used to increase the order of approximation. Fundamental and recent results from the past decade are described with their corresponding proofs. The volume consists of eight chapters that provide detailed insight into the representation of monomials of the operators Ln , direct and inverse estimates for a broad class of positive linear operators, and case studies involving finite and unbounded intervals of real and complex functions. Strong converse inequalities of Type A in terminology of Ditzian–Ivanov for linear combinations of Bernstein and Bernstein–Kantorovich operators and various Voronovskaja-type estimates for some linear combinations are analyzed and explained. Graduate students and researchers in approximation theory will find the list of open problems in approximation of linear combinations useful. The book serves as a reference for graduate and postgraduate courses as we...

  1. Approximate number sense theory or approximate theory of magnitude?

    Science.gov (United States)

    Content, Alain; Velde, Michael Vande; Adriano, Andrea

    2017-01-01

    Leibovich et al. argue that the evidence in favor of a perceptual mechanism devoted to the extraction of numerosity from visual collections is unsatisfactory and propose to replace it with an unspecific mechanism capturing approximate magnitudes from continuous dimensions. We argue that their representation of the evidence is incomplete and that their theoretical proposal is too vague to be useful.

  2. Inverse plasma equilibria

    International Nuclear Information System (INIS)

    Hicks, H.R.; Dory, R.A.; Holmes, J.A.

    1983-01-01

    We illustrate in some detail a 2D inverse-equilibrium solver that was constructed to analyze tokamak configurations and stellarators (the latter in the context of the average method). To ensure that the method is suitable not only to determine equilibria, but also to provide appropriately represented data for existing stability codes, it is important to be able to control the Jacobian, tilde J is identical to delta(R,Z)/delta(rho, theta). The form chosen is tilde J = J 0 (rho)R/sup l/rho where rho is a flux surface label, and l is an integer. The initial implementation is for a fixed conducting-wall boundary, but the technique can be extended to a free-boundary model

  3. Approximate Matching of Hierarchial Data

    DEFF Research Database (Denmark)

    Augsten, Nikolaus

    The goal of this thesis is to design, develop, and evaluate new methods for the approximate matching of hierarchical data represented as labeled trees. In approximate matching scenarios two items should be matched if they are similar. Computing the similarity between labeled trees is hard...... formally proof that the pq-gram index can be incrementally updated based on the log of edit operations without reconstructing intermediate tree versions. The incremental update is independent of the data size and scales to a large number of changes in the data. We introduce windowed pq...... as in addition to the data values also the structure must be considered. A well-known measure for comparing trees is the tree edit distance. It is computationally expensive and leads to a prohibitively high run time. Our solution for the approximate matching of hierarchical data are pq-grams. The pq...

  4. Approximations to camera sensor noise

    Science.gov (United States)

    Jin, Xiaodan; Hirakawa, Keigo

    2013-02-01

    Noise is present in all image sensor data. Poisson distribution is said to model the stochastic nature of the photon arrival process, while it is common to approximate readout/thermal noise by additive white Gaussian noise (AWGN). Other sources of signal-dependent noise such as Fano and quantization also contribute to the overall noise profile. Question remains, however, about how best to model the combined sensor noise. Though additive Gaussian noise with signal-dependent noise variance (SD-AWGN) and Poisson corruption are two widely used models to approximate the actual sensor noise distribution, the justification given to these types of models are based on limited evidence. The goal of this paper is to provide a more comprehensive characterization of random noise. We concluded by presenting concrete evidence that Poisson model is a better approximation to real camera model than SD-AWGN. We suggest further modification to Poisson that may improve the noise model.

  5. Face Recognition using Approximate Arithmetic

    DEFF Research Database (Denmark)

    Marso, Karol

    Face recognition is image processing technique which aims to identify human faces and found its use in various different fields for example in security. Throughout the years this field evolved and there are many approaches and many different algorithms which aim to make the face recognition as effective...... as possible. The use of different approaches such as neural networks and machine learning can lead to fast and efficient solutions however, these solutions are expensive in terms of hardware resources and power consumption. A possible solution to this problem can be use of approximate arithmetic. In many image...... processing applications the results do not need to be completely precise and use of the approximate arithmetic can lead to reduction in terms of delay, space and power consumption. In this paper we examine possible use of approximate arithmetic in face recognition using Eigenfaces algorithm....

  6. Diophantine approximation and Dirichlet series

    CERN Document Server

    Queffélec, Hervé

    2013-01-01

    This self-contained book will benefit beginners as well as researchers. It is devoted to Diophantine approximation, the analytic theory of Dirichlet series, and some connections between these two domains, which often occur through the Kronecker approximation theorem. Accordingly, the book is divided into seven chapters, the first three of which present tools from commutative harmonic analysis, including a sharp form of the uncertainty principle, ergodic theory and Diophantine approximation to be used in the sequel. A presentation of continued fraction expansions, including the mixing property of the Gauss map, is given. Chapters four and five present the general theory of Dirichlet series, with classes of examples connected to continued fractions, the famous Bohr point of view, and then the use of random Dirichlet series to produce non-trivial extremal examples, including sharp forms of the Bohnenblust-Hille theorem. Chapter six deals with Hardy-Dirichlet spaces, which are new and useful Banach spaces of anal...

  7. Approximate reasoning in physical systems

    International Nuclear Information System (INIS)

    Mutihac, R.

    1991-01-01

    The theory of fuzzy sets provides excellent ground to deal with fuzzy observations (uncertain or imprecise signals, wavelengths, temperatures,etc.) fuzzy functions (spectra and depth profiles) and fuzzy logic and approximate reasoning. First, the basic ideas of fuzzy set theory are briefly presented. Secondly, stress is put on application of simple fuzzy set operations for matching candidate reference spectra of a spectral library to an unknown sample spectrum (e.g. IR spectroscopy). Thirdly, approximate reasoning is applied to infer an unknown property from information available in a database (e.g. crystal systems). Finally, multi-dimensional fuzzy reasoning techniques are suggested. (Author)

  8. Numerical Inversion for the Multiple Fractional Orders in the Multiterm TFDE

    Directory of Open Access Journals (Sweden)

    Chunlong Sun

    2017-01-01

    Full Text Available The fractional order in a fractional diffusion model is a key parameter which characterizes the anomalous diffusion behaviors. This paper deals with an inverse problem of determining the multiple fractional orders in the multiterm time-fractional diffusion equation (TFDE for short from numerics. The homotopy regularization algorithm is applied to solve the inversion problem using the finite data at one interior point in the space domain. The inversion fractional orders with random noisy data give good approximations to the exact order demonstrating the efficiency of the inversion algorithm and numerical stability of the inversion problem.

  9. Iterative methods for 3D implicit finite-difference migration using the complex Padé approximation

    International Nuclear Information System (INIS)

    Costa, Carlos A N; Campos, Itamara S; Costa, Jessé C; Neto, Francisco A; Schleicher, Jörg; Novais, Amélia

    2013-01-01

    Conventional implementations of 3D finite-difference (FD) migration use splitting techniques to accelerate performance and save computational cost. However, such techniques are plagued with numerical anisotropy that jeopardises the correct positioning of dipping reflectors in the directions not used for the operator splitting. We implement 3D downward continuation FD migration without splitting using a complex Padé approximation. In this way, the numerical anisotropy is eliminated at the expense of a computationally more intensive solution of a large-band linear system. We compare the performance of the iterative stabilized biconjugate gradient (BICGSTAB) and that of the multifrontal massively parallel direct solver (MUMPS). It turns out that the use of the complex Padé approximation not only stabilizes the solution, but also acts as an effective preconditioner for the BICGSTAB algorithm, reducing the number of iterations as compared to the implementation using the real Padé expansion. As a consequence, the iterative BICGSTAB method is more efficient than the direct MUMPS method when solving a single term in the Padé expansion. The results of both algorithms, here evaluated by computing the migration impulse response in the SEG/EAGE salt model, are of comparable quality. (paper)

  10. Holocaust inversion and contemporary antisemitism.

    OpenAIRE

    Klaff, Lesley D

    2014-01-01

    One of the cruellest aspects of the new antisemitism is its perverse use of the Holocaust as a stick to beat 'the Jews'. This article explains the phenomenon of 'Holocaust Inversion', which involves an 'inversion of reality' (the Israelis are cast as the 'new' Nazis and the Palestinians as the 'new' Jews) and an 'inversion of morality' (the Holocaust is presented as a moral lesson for, or even a moral indictment of, 'the Jews'). Holocaust inversion is a form of soft-core Holocaust denial, yet...

  11. Approximation properties of haplotype tagging

    Directory of Open Access Journals (Sweden)

    Dreiseitl Stephan

    2006-01-01

    Full Text Available Abstract Background Single nucleotide polymorphisms (SNPs are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns, disease association studies are facilitated by identifying SNPs that allow the unique identification of such patterns. This process, known as haplotype tagging, is formulated as a combinatorial optimization problem and analyzed in terms of complexity and approximation properties. Results It is shown that the tagging problem is NP-hard but approximable within 1 + ln((n2 - n/2 for n haplotypes but not approximable within (1 - ε ln(n/2 for any ε > 0 unless NP ⊂ DTIME(nlog log n. A simple, very easily implementable algorithm that exhibits the above upper bound on solution quality is presented. This algorithm has running time O((2m - p + 1 ≤ O(m(n2 - n/2 where p ≤ min(n, m for n haplotypes of size m. As we show that the approximation bound is asymptotically tight, the algorithm presented is optimal with respect to this asymptotic bound. Conclusion The haplotype tagging problem is hard, but approachable with a fast, practical, and surprisingly simple algorithm that cannot be significantly improved upon on a single processor machine. Hence, significant improvement in computatational efforts expended can only be expected if the computational effort is distributed and done in parallel.

  12. Approximate Reanalysis in Topology Optimization

    DEFF Research Database (Denmark)

    Amir, Oded; Bendsøe, Martin P.; Sigmund, Ole

    2009-01-01

    In the nested approach to structural optimization, most of the computational effort is invested in the solution of the finite element analysis equations. In this study, the integration of an approximate reanalysis procedure into the framework of topology optimization of continuum structures...

  13. Ultrafast Approximation for Phylogenetic Bootstrap

    NARCIS (Netherlands)

    Bui Quang Minh, [No Value; Nguyen, Thi; von Haeseler, Arndt

    Nonparametric bootstrap has been a widely used tool in phylogenetic analysis to assess the clade support of phylogenetic trees. However, with the rapidly growing amount of data, this task remains a computational bottleneck. Recently, approximation methods such as the RAxML rapid bootstrap (RBS) and

  14. APPROXIMATE MODELS FOR FLOOD ROUTING

    African Journals Online (AJOL)

    kinematic model and a nonlinear convection-diffusion model are extracted from a normalized form of the St. Venant equations, and applied to ... normal flow condition is moderate. Keywords: approximate models, nonlinear kinematic ... The concern here is with the movement of an abnormal amount of water along a river or ...

  15. On badly approximable complex numbers

    DEFF Research Database (Denmark)

    Esdahl-Schou, Rune; Kristensen, S.

    We show that the set of complex numbers which are badly approximable by ratios of elements of , where has maximal Hausdorff dimension. In addition, the intersection of these sets is shown to have maximal dimension. The results remain true when the sets in question are intersected with a suitably...

  16. Rational approximation of vertical segments

    Science.gov (United States)

    Salazar Celis, Oliver; Cuyt, Annie; Verdonk, Brigitte

    2007-08-01

    In many applications, observations are prone to imprecise measurements. When constructing a model based on such data, an approximation rather than an interpolation approach is needed. Very often a least squares approximation is used. Here we follow a different approach. A natural way for dealing with uncertainty in the data is by means of an uncertainty interval. We assume that the uncertainty in the independent variables is negligible and that for each observation an uncertainty interval can be given which contains the (unknown) exact value. To approximate such data we look for functions which intersect all uncertainty intervals. In the past this problem has been studied for polynomials, or more generally for functions which are linear in the unknown coefficients. Here we study the problem for a particular class of functions which are nonlinear in the unknown coefficients, namely rational functions. We show how to reduce the problem to a quadratic programming problem with a strictly convex objective function, yielding a unique rational function which intersects all uncertainty intervals and satisfies some additional properties. Compared to rational least squares approximation which reduces to a nonlinear optimization problem where the objective function may have many local minima, this makes the new approach attractive.

  17. All-Norm Approximation Algorithms

    NARCIS (Netherlands)

    Azar, Yossi; Epstein, Leah; Richter, Yossi; Woeginger, Gerhard J.; Penttonen, Martti; Meineche Schmidt, Erik

    2002-01-01

    A major drawback in optimization problems and in particular in scheduling problems is that for every measure there may be a different optimal solution. In many cases the various measures are different ℓ p norms. We address this problem by introducing the concept of an All-norm ρ-approximation

  18. Approximate Reasoning with Fuzzy Booleans

    NARCIS (Netherlands)

    van den Broek, P.M.; Noppen, J.A.R.

    This paper introduces, in analogy to the concept of fuzzy numbers, the concept of fuzzy booleans, and examines approximate reasoning with the compositional rule of inference using fuzzy booleans. It is shown that each set of fuzzy rules is equivalent to a set of fuzzy rules with singleton crisp

  19. Inverse feasibility problems of the inverse maximum flow problems

    Indian Academy of Sciences (India)

    A linear time method to decide if any inverse maximum flow (denoted General Inverse Maximum Flow problems (IMFG)) problem has solution is deduced. If IMFG does not have solution, methods to transform IMFG into a feasible problem are presented. The methods consist of modifying as little as possible the restrictions to ...

  20. Inverse feasibility problems of the inverse maximum flow problems

    Indian Academy of Sciences (India)

    199–209. c Indian Academy of Sciences. Inverse feasibility problems of the inverse maximum flow problems. ADRIAN DEACONU. ∗ and ELEONOR CIUREA. Department of Mathematics and Computer Science, Faculty of Mathematics and Informatics, Transilvania University of Brasov, Brasov, Iuliu Maniu st. 50,. Romania.

  1. Confidence Intervals for Asbestos Fiber Counts: Approximate Negative Binomial Distribution.

    Science.gov (United States)

    Bartley, David; Slaven, James; Harper, Martin

    2017-03-01

    The negative binomial distribution is adopted for analyzing asbestos fiber counts so as to account for both the sampling errors in capturing only a finite number of fibers and the inevitable human variation in identifying and counting sampled fibers. A simple approximation to this distribution is developed for the derivation of quantiles and approximate confidence limits. The success of the approximation depends critically on the use of Stirling's expansion to sufficient order, on exact normalization of the approximating distribution, on reasonable perturbation of quantities from the normal distribution, and on accurately approximating sums by inverse-trapezoidal integration. Accuracy of the approximation developed is checked through simulation and also by comparison to traditional approximate confidence intervals in the specific case that the negative binomial distribution approaches the Poisson distribution. The resulting statistics are shown to relate directly to early research into the accuracy of asbestos sampling and analysis. Uncertainty in estimating mean asbestos fiber concentrations given only a single count is derived. Decision limits (limits of detection) and detection limits are considered for controlling false-positive and false-negative detection assertions and are compared to traditional limits computed assuming normal distributions. Published by Oxford University Press on behalf of the British Occupational Hygiene Society 2017.

  2. Inverse problem in hydrogeology

    Science.gov (United States)

    Carrera, Jesús; Alcolea, Andrés; Medina, Agustín; Hidalgo, Juan; Slooten, Luit J.

    2005-03-01

    The state of the groundwater inverse problem is synthesized. Emphasis is placed on aquifer characterization, where modelers have to deal with conceptual model uncertainty (notably spatial and temporal variability), scale dependence, many types of unknown parameters (transmissivity, recharge, boundary conditions, etc.), nonlinearity, and often low sensitivity of state variables (typically heads and concentrations) to aquifer properties. Because of these difficulties, calibration cannot be separated from the modeling process, as it is sometimes done in other fields. Instead, it should be viewed as one step in the process of understanding aquifer behavior. In fact, it is shown that actual parameter estimation methods do not differ from each other in the essence, though they may differ in the computational details. It is argued that there is ample room for improvement in groundwater inversion: development of user-friendly codes, accommodation of variability through geostatistics, incorporation of geological information and different types of data (temperature, occurrence and concentration of isotopes, age, etc.), proper accounting of uncertainty, etc. Despite this, even with existing codes, automatic calibration facilitates enormously the task of modeling. Therefore, it is contended that its use should become standard practice. L'état du problème inverse des eaux souterraines est synthétisé. L'accent est placé sur la caractérisation de l'aquifère, où les modélisateurs doivent jouer avec l'incertitude des modèles conceptuels (notamment la variabilité spatiale et temporelle), les facteurs d'échelle, plusieurs inconnues sur différents paramètres (transmissivité, recharge, conditions aux limites, etc.), la non linéarité, et souvent la sensibilité de plusieurs variables d'état (charges hydrauliques, concentrations) des propriétés de l'aquifère. A cause de ces difficultés, le calibrage ne peut êtreséparé du processus de modélisation, comme c'est le

  3. Face inversion increases attractiveness.

    Science.gov (United States)

    Leder, Helmut; Goller, Juergen; Forster, Michael; Schlageter, Lena; Paul, Matthew A

    2017-07-01

    Assessing facial attractiveness is a ubiquitous, inherent, and hard-wired phenomenon in everyday interactions. As such, it has highly adapted to the default way that faces are typically processed: viewing faces in upright orientation. By inverting faces, we can disrupt this default mode, and study how facial attractiveness is assessed. Faces, rotated at 90 (tilting to either side) and 180°, were rated on attractiveness and distinctiveness scales. For both orientations, we found that faces were rated more attractive and less distinctive than upright faces. Importantly, these effects were more pronounced for faces rated low in upright orientation, and smaller for highly attractive faces. In other words, the less attractive a face was, the more it gained in attractiveness by inversion or rotation. Based on these findings, we argue that facial attractiveness assessments might not rely on the presence of attractive facial characteristics, but on the absence of distinctive, unattractive characteristics. These unattractive characteristics are potentially weighed against an individual, attractive prototype in assessing facial attractiveness. Copyright © 2017 The Authors. Published by Elsevier B.V. All rights reserved.

  4. Multiples waveform inversion

    KAUST Repository

    Zhang, Dongliang

    2013-01-01

    To increase the illumination of the subsurface and to eliminate the dependency of FWI on the source wavelet, we propose multiples waveform inversion (MWI) that transforms each hydrophone into a virtual point source with a time history equal to that of the recorded data. These virtual sources are used to numerically generate downgoing wavefields that are correlated with the backprojected surface-related multiples to give the migration image. Since the recorded data are treated as the virtual sources, knowledge of the source wavelet is not required, and the subsurface illumination is greatly enhanced because the entire free surface acts as an extended source compared to the radiation pattern of a traditional point source. Numerical tests on the Marmousi2 model show that the convergence rate and the spatial resolution of MWI is, respectively, faster and more accurate then FWI. The potential pitfall with this method is that the multiples undergo more than one roundtrip to the surface, which increases attenuation and reduces spatial resolution. This can lead to less resolved tomograms compared to conventional FWI. The possible solution is to combine both FWI and MWI in inverting for the subsurface velocity distribution.

  5. Hydrogen: Beyond the Classic Approximation

    International Nuclear Information System (INIS)

    Scivetti, Ivan

    2003-01-01

    The classical nucleus approximation is the most frequently used approach for the resolution of problems in condensed matter physics.However, there are systems in nature where it is necessary to introduce the nuclear degrees of freedom to obtain a correct description of the properties.Examples of this, are the systems with containing hydrogen.In this work, we have studied the resolution of the quantum nuclear problem for the particular case of the water molecule.The Hartree approximation has been used, i.e. we have considered that the nuclei are distinguishable particles.In addition, we have proposed a model to solve the tunneling process, which involves the resolution of the nuclear problem for configurations of the system away from its equilibrium position

  6. Hydrogen Beyond the Classic Approximation

    CERN Document Server

    Scivetti, I

    2003-01-01

    The classical nucleus approximation is the most frequently used approach for the resolution of problems in condensed matter physics.However, there are systems in nature where it is necessary to introduce the nuclear degrees of freedom to obtain a correct description of the properties.Examples of this, are the systems with containing hydrogen.In this work, we have studied the resolution of the quantum nuclear problem for the particular case of the water molecule.The Hartree approximation has been used, i.e. we have considered that the nuclei are distinguishable particles.In addition, we have proposed a model to solve the tunneling process, which involves the resolution of the nuclear problem for configurations of the system away from its equilibrium position

  7. Coin tossing and Laplace inversion

    Indian Academy of Sciences (India)

    MS received 5 May 1999; revised 3 April 2000. Abstract. An analysis of exchangeable sequences of coin tossings leads to inversion formulae for Laplace transforms of probability measures. Keywords. Laplace inversion; moment problem; exchangeable probabilities. 1. Introduction. There is an intimate relationship between ...

  8. Inverse problems for Maxwell's equations

    CERN Document Server

    Romanov, V G

    1994-01-01

    The Inverse and Ill-Posed Problems Series is a series of monographs publishing postgraduate level information on inverse and ill-posed problems for an international readership of professional scientists and researchers. The series aims to publish works which involve both theory and applications in, e.g., physics, medicine, geophysics, acoustics, electrodynamics, tomography, and ecology.

  9. Good points for diophantine approximation

    Indian Academy of Sciences (India)

    n=1 of real numbers in the interval [0, 1) and a sequence. (δn)∞ n=1 of positive numbers tending to zero, we consider the size of the set of numbers in [0, 1] which can be 'well approximated' by terms of the first sequence, namely, those y ∈ [0, 1] for which the inequality |y − xn| < δn holds for infinitely many positive integers n ...

  10. Dimensionality Reduction with Adaptive Approximation

    OpenAIRE

    Kokiopoulou, Effrosyni; Frossard, Pascal

    2007-01-01

    In this paper, we propose the use of (adaptive) nonlinear approximation for dimensionality reduction. In particular, we propose a dimensionality reduction method for learning a parts based representation of signals using redundant dictionaries. A redundant dictionary is an overcomplete set of basis vectors that spans the signal space. The signals are jointly represented in a common subspace extracted from the redundant dictionary, using greedy pursuit algorithms for simultaneous sparse approx...

  11. Ultrafast approximation for phylogenetic bootstrap.

    Science.gov (United States)

    Minh, Bui Quang; Nguyen, Minh Anh Thi; von Haeseler, Arndt

    2013-05-01

    Nonparametric bootstrap has been a widely used tool in phylogenetic analysis to assess the clade support of phylogenetic trees. However, with the rapidly growing amount of data, this task remains a computational bottleneck. Recently, approximation methods such as the RAxML rapid bootstrap (RBS) and the Shimodaira-Hasegawa-like approximate likelihood ratio test have been introduced to speed up the bootstrap. Here, we suggest an ultrafast bootstrap approximation approach (UFBoot) to compute the support of phylogenetic groups in maximum likelihood (ML) based trees. To achieve this, we combine the resampling estimated log-likelihood method with a simple but effective collection scheme of candidate trees. We also propose a stopping rule that assesses the convergence of branch support values to automatically determine when to stop collecting candidate trees. UFBoot achieves a median speed up of 3.1 (range: 0.66-33.3) to 10.2 (range: 1.32-41.4) compared with RAxML RBS for real DNA and amino acid alignments, respectively. Moreover, our extensive simulations show that UFBoot is robust against moderate model violations and the support values obtained appear to be relatively unbiased compared with the conservative standard bootstrap. This provides a more direct interpretation of the bootstrap support. We offer an efficient and easy-to-use software (available at http://www.cibiv.at/software/iqtree) to perform the UFBoot analysis with ML tree inference.

  12. Initially Approximated Quasi Equilibrium Manifold

    International Nuclear Information System (INIS)

    Shahzad, M.; Arif, H.; Gulistan, M.; Sajid, M.

    2015-01-01

    Most commonly, kinetics model reduction techniques are based on exploiting time scale separation into fast and slow reaction processes. Then, a researcher approximates the system dynamically with dimension reduction for slow ones eliminating the fast modes. The main idea behind the construction of the lower dimension manifold is based on finding its initial approximation using Quasi Equilibrium Manifold (QEM). Here, we provide an efficient numerical method, which allow us to calculate low dimensional manifolds of chemical reaction systems. This computation technique is not restricted to our specific complex problem, but it can also be applied to other reacting flows or dynamic systems provided with the condition that a large number of extra (decaying) components can be eliminated from the system. Through computational approach, we approximate low dimensional manifold for a mechanism of six chemical species to simplify complex chemical kinetics. A reduced descriptive form of slow invariant manifold is obtained from dissipative system. This method is applicable for higher dimensions and is applied over an oxidation of CO/Pt. (author)

  13. Algebraic properties of generalized inverses

    CERN Document Server

    Cvetković‐Ilić, Dragana S

    2017-01-01

    This book addresses selected topics in the theory of generalized inverses. Following a discussion of the “reverse order law” problem and certain problems involving completions of operator matrices, it subsequently presents a specific approach to solving the problem of the reverse order law for {1} -generalized inverses. Particular emphasis is placed on the existence of Drazin invertible completions of an upper triangular operator matrix; on the invertibility and different types of generalized invertibility of a linear combination of operators on Hilbert spaces and Banach algebra elements; on the problem of finding representations of the Drazin inverse of a 2x2 block matrix; and on selected additive results and algebraic properties for the Drazin inverse. In addition to the clarity of its content, the book discusses the relevant open problems for each topic discussed. Comments on the latest references on generalized inverses are also included. Accordingly, the book will be useful for graduate students, Ph...

  14. A rainbow inverse problem

    Directory of Open Access Journals (Sweden)

    Calvez V.

    2010-12-01

    Full Text Available We consider the radiative transfer equation (RTE with reflection in a three-dimensional domain, infinite in two dimensions, and prove an existence result. Then, we study the inverse problem of retrieving the optical parameters from boundary measurements, with help of existing results by Choulli and Stefanov. This theoretical analysis is the framework of an attempt to model the color of the skin. For this purpose, a code has been developed to solve the RTE and to study the sensitivity of the measurements made by biophysicists with respect to the physiological parameters responsible for the optical properties of this complex, multi-layered material. On étudie l’équation du transfert radiatif (ETR dans un domaine tridimensionnel infini dans deux directions, et on prouve un résultat d’existence. On s’intéresse ensuite à la reconstruction des paramètres optiques à partir de mesures faites au bord, en s’appuyant sur des résultats de Choulli et Stefanov. Cette analyse sert de cadre théorique à un travail de modélisation de la couleur de la peau. Dans cette perspective, un code à été développé pour résoudre l’ETR et étudier la sensibilité des mesures effectuées par les biophysiciens par rapport aux paramètres physiologiques tenus pour responsables des propriétés optiques de ce complexe matériau multicouche.

  15. A Newton–Krylov method with an approximate analytical Jacobian for implicit solution of Navier–Stokes equations on staggered overset-curvilinear grids with immersed boundaries

    Science.gov (United States)

    Asgharzadeh, Hafez; Borazjani, Iman

    2016-01-01

    diagonal of the Jacobian further improves the performance by 42 – 74% compared to the full Jacobian. The NKM with an analytical Jacobian showed better performance than the fixed point Runge-Kutta because it converged with higher time steps and in approximately 30% less iterations even when the grid was stretched and the Reynold number was increased. In fact, stretching the grid decreased the performance of all methods, but the fixed-point Runge-Kutta performance decreased 4.57 and 2.26 times more than NKM with a diagonal Jacobian when the stretching factor was increased, respectively. The NKM with a diagonal analytical Jacobian and matrix-free method with an analytical preconditioner are the fastest methods and the superiority of one to another depends on the flow problem. Furthermore, the implemented methods are fully parallelized with parallel efficiency of 80–90% on the problems tested. The NKM with the analytical Jacobian can guide building preconditioners for other techniques to improve their performance in the future. PMID:28042172

  16. A Newton-Krylov method with an approximate analytical Jacobian for implicit solution of Navier-Stokes equations on staggered overset-curvilinear grids with immersed boundaries.

    Science.gov (United States)

    Asgharzadeh, Hafez; Borazjani, Iman

    2017-02-15

    diagonal of the Jacobian further improves the performance by 42 - 74% compared to the full Jacobian. The NKM with an analytical Jacobian showed better performance than the fixed point Runge-Kutta because it converged with higher time steps and in approximately 30% less iterations even when the grid was stretched and the Reynold number was increased. In fact, stretching the grid decreased the performance of all methods, but the fixed-point Runge-Kutta performance decreased 4.57 and 2.26 times more than NKM with a diagonal Jacobian when the stretching factor was increased, respectively. The NKM with a diagonal analytical Jacobian and matrix-free method with an analytical preconditioner are the fastest methods and the superiority of one to another depends on the flow problem. Furthermore, the implemented methods are fully parallelized with parallel efficiency of 80-90% on the problems tested. The NKM with the analytical Jacobian can guide building preconditioners for other techniques to improve their performance in the future.

  17. Inverse Problems in a Bayesian Setting

    KAUST Repository

    Matthies, Hermann G.

    2016-02-13

    In a Bayesian setting, inverse problems and uncertainty quantification (UQ)—the propagation of uncertainty through a computational (forward) model—are strongly connected. In the form of conditional expectation the Bayesian update becomes computationally attractive. We give a detailed account of this approach via conditional approximation, various approximations, and the construction of filters. Together with a functional or spectral approach for the forward UQ there is no need for time-consuming and slowly convergent Monte Carlo sampling. The developed sampling-free non-linear Bayesian update in form of a filter is derived from the variational problem associated with conditional expectation. This formulation in general calls for further discretisation to make the computation possible, and we choose a polynomial approximation. After giving details on the actual computation in the framework of functional or spectral approximations, we demonstrate the workings of the algorithm on a number of examples of increasing complexity. At last, we compare the linear and nonlinear Bayesian update in form of a filter on some examples.

  18. Approximate Inference for Wireless Communications

    DEFF Research Database (Denmark)

    Hansen, Morten

    to the optimal one, which usually requires an unacceptable high complexity. Some of the treated approximate methods are based on QL-factorization of the channel matrix. In the work presented in this thesis it is proven how the QL-factorization of frequency-selective channels asymptotically provides the minimum......-phase and all-pass filters. This enables us to view Sphere Detection (SD) as an adaptive variant of minimum-phase prefiltered reduced-state sequence estimation. Thus, a novel way of computing the minimum-phase filter and its associated all-pass filter using the numerically stable QL-factorization is suggested...

  19. Generalized Gradient Approximation Made Simple

    International Nuclear Information System (INIS)

    Perdew, J.P.; Burke, K.; Ernzerhof, M.

    1996-01-01

    Generalized gradient approximations (GGA close-quote s) for the exchange-correlation energy improve upon the local spin density (LSD) description of atoms, molecules, and solids. We present a simple derivation of a simple GGA, in which all parameters (other than those in LSD) are fundamental constants. Only general features of the detailed construction underlying the Perdew-Wang 1991 (PW91) GGA are invoked. Improvements over PW91 include an accurate description of the linear response of the uniform electron gas, correct behavior under uniform scaling, and a smoother potential. copyright 1996 The American Physical Society

  20. Inverse picobarns to you

    International Nuclear Information System (INIS)

    Anon.

    1994-01-01

    The impact of some spectacular colliding beam records this summer has been muted by the cryptic terminology which scientists invariably use when describing their best achievements. Early this century, nuclear physicists calculated the collision rate of a particle beam with a sample of stationary atoms by multiplying the intensity of the beam (particles per unit area per second), the total number of targets, and the area of each target. In searching for a yardstick to measure this effective 'cross-section', they first thought of a unit called a 'barn', equal to 10 -24 square centimetres, the approximate surface area of a nucleus. A beam crossing such an area would be almost certain to produce a nuclear collision - 'as easy as hitting a barn door'

  1. The quasi-diffusive approximation in transport theory: Local solutions

    International Nuclear Information System (INIS)

    Celaschi, M.; Montagnini, B.

    1995-01-01

    The one velocity, plane geometry integral neutron transport equation is transformed into a system of two equations, one of them being the equation of continuity and the other a generalized Fick's law, in which the usual diffusion coefficient is replaced by a self-adjoint integral operator. As the kernel of this operator is very close to the Green function of a diffusion equation, an approximate inversion by means of a second order differential operator allows to transform these equations into a purely differential system which is shown to be equivalent, in the simplest case, to a diffusion-like equation. The method, the principles of which have been exposed in a previous paper, is here extended and applied to a variety of problems. If the inversion is properly performed, the quasi-diffusive solutions turn out to be quite accurate, even in the vicinity of the interface between different material regions, where elementary diffusion theory usually fails. 16 refs., 3 tabs

  2. Linear GPR inversion for lossy soil and a planar air-soil interface

    DEFF Research Database (Denmark)

    Meincke, Peter

    2001-01-01

    A three-dimensional inversion scheme for fixed-offset ground penetrating radar (GPR) is derived that takes into account the loss in the soil and the planar air-soil interface. The forward model of this inversion scheme is based upon the first Born approximation and the dyadic Green function...

  3. Wavelet Approximation in Data Assimilation

    Science.gov (United States)

    Tangborn, Andrew; Atlas, Robert (Technical Monitor)

    2002-01-01

    Estimation of the state of the atmosphere with the Kalman filter remains a distant goal because of high computational cost of evolving the error covariance for both linear and nonlinear systems. Wavelet approximation is presented here as a possible solution that efficiently compresses both global and local covariance information. We demonstrate the compression characteristics on the the error correlation field from a global two-dimensional chemical constituent assimilation, and implement an adaptive wavelet approximation scheme on the assimilation of the one-dimensional Burger's equation. In the former problem, we show that 99%, of the error correlation can be represented by just 3% of the wavelet coefficients, with good representation of localized features. In the Burger's equation assimilation, the discrete linearized equations (tangent linear model) and analysis covariance are projected onto a wavelet basis and truncated to just 6%, of the coefficients. A nearly optimal forecast is achieved and we show that errors due to truncation of the dynamics are no greater than the errors due to covariance truncation.

  4. Plasma Physics Approximations in Ares

    International Nuclear Information System (INIS)

    Managan, R. A.

    2015-01-01

    Lee & More derived analytic forms for the transport properties of a plasma. Many hydro-codes use their formulae for electrical and thermal conductivity. The coefficients are complex functions of Fermi-Dirac integrals, Fn( μ/θ ), the chemical potential, μ or ζ = ln(1+e μ/θ ), and the temperature, θ = kT. Since these formulae are expensive to compute, rational function approximations were fit to them. Approximations are also used to find the chemical potential, either μ or ζ . The fits use ζ as the independent variable instead of μ/θ . New fits are provided for A α (ζ ),A β (ζ ), ζ, f(ζ ) = (1 + e -μ/θ )F 1/2 (μ/θ), F 1/2 '/F 1/2 , F c α , and F c β . In each case the relative error of the fit is minimized since the functions can vary by many orders of magnitude. The new fits are designed to exactly preserve the limiting values in the non-degenerate and highly degenerate limits or as ζ→ 0 or ∞. The original fits due to Lee & More and George Zimmerman are presented for comparison.

  5. Pade approximants, NN scattering, and hard core repulsions

    International Nuclear Information System (INIS)

    Hartt, K.

    1980-01-01

    Pade approximants to the scattering function F=k cot(delta 0 ) are studied in terms of the variable x=k 2 , using four examples of potential models which possess features of the np 1 S 0 state. Strategies are thereby developed for analytically continuing F when only approximate partial knowledge of F is available. Results are characterized by high accuracy of interpolation. It is suggested that a physically realistic inverse scattering problem begins with such an analytically continued F. When it exists, the solution of this problem in terms of the Marchenko equation is a local potential of the Bargmann type. Some strategies for carrying out this program lead to a stably defined potential, while others do not. With hard core repulsions present, low-order Pade approximants accurately describe F for E/sub c.m./< or =300 MeV. However, since the condition Δ(infinity)-delta(0)=0 is not satisfied in any of our examples containing hard core repulsions, the Marchenko method does not have a solution for them. A possible physical consequence of this result is discussed. Another inverse scattering method is proposed for application to hard core problems

  6. Approximation by double Walsh polynomials

    Directory of Open Access Journals (Sweden)

    Ferenc Móricz

    1992-01-01

    Full Text Available We study the rate of approximation by rectangular partial sums, Cesàro means, and de la Vallée Poussin means of double Walsh-Fourier series of a function in a homogeneous Banach space X. In particular, X may be Lp(I2, where 1≦p<∞ and I2=[0,1×[0,1, or CW(I2, the latter being the collection of uniformly W-continuous functions on I2. We extend the results by Watari, Fine, Yano, Jastrebova, Bljumin, Esfahanizadeh and Siddiqi from univariate to multivariate cases. As by-products, we deduce sufficient conditions for convergence in Lp(I2-norm and uniform convergence on I2 as well as characterizations of Lipschitz classes of functions. At the end, we raise three problems.

  7. Approximating the minimum cycle mean

    Directory of Open Access Journals (Sweden)

    Krishnendu Chatterjee

    2013-07-01

    Full Text Available We consider directed graphs where each edge is labeled with an integer weight and study the fundamental algorithmic question of computing the value of a cycle with minimum mean weight. Our contributions are twofold: (1 First we show that the algorithmic question is reducible in O(n^2 time to the problem of a logarithmic number of min-plus matrix multiplications of n-by-n matrices, where n is the number of vertices of the graph. (2 Second, when the weights are nonnegative, we present the first (1 + ε-approximation algorithm for the problem and the running time of our algorithm is ilde(O(n^ω log^3(nW/ε / ε, where O(n^ω is the time required for the classic n-by-n matrix multiplication and W is the maximum value of the weights.

  8. Bayesian Approach to Inverse Problems

    CERN Document Server

    2008-01-01

    Many scientific, medical or engineering problems raise the issue of recovering some physical quantities from indirect measurements; for instance, detecting or quantifying flaws or cracks within a material from acoustic or electromagnetic measurements at its surface is an essential problem of non-destructive evaluation. The concept of inverse problems precisely originates from the idea of inverting the laws of physics to recover a quantity of interest from measurable data.Unfortunately, most inverse problems are ill-posed, which means that precise and stable solutions are not easy to devise. Regularization is the key concept to solve inverse problems.The goal of this book is to deal with inverse problems and regularized solutions using the Bayesian statistical tools, with a particular view to signal and image estimation

  9. Testing earthquake source inversion methodologies

    KAUST Repository

    Page, Morgan T.

    2011-01-01

    Source Inversion Validation Workshop; Palm Springs, California, 11-12 September 2010; Nowadays earthquake source inversions are routinely performed after large earthquakes and represent a key connection between recorded seismic and geodetic data and the complex rupture process at depth. The resulting earthquake source models quantify the spatiotemporal evolution of ruptures. They are also used to provide a rapid assessment of the severity of an earthquake and to estimate losses. However, because of uncertainties in the data, assumed fault geometry and velocity structure, and chosen rupture parameterization, it is not clear which features of these source models are robust. Improved understanding of the uncertainty and reliability of earthquake source inversions will allow the scientific community to use the robust features of kinematic inversions to more thoroughly investigate the complexity of the rupture process and to better constrain other earthquakerelated computations, such as ground motion simulations and static stress change calculations.

  10. Parameter estimation and inverse problems

    CERN Document Server

    Aster, Richard C; Thurber, Clifford H

    2005-01-01

    Parameter Estimation and Inverse Problems primarily serves as a textbook for advanced undergraduate and introductory graduate courses. Class notes have been developed and reside on the World Wide Web for faciliting use and feedback by teaching colleagues. The authors'' treatment promotes an understanding of fundamental and practical issus associated with parameter fitting and inverse problems including basic theory of inverse problems, statistical issues, computational issues, and an understanding of how to analyze the success and limitations of solutions to these probles. The text is also a practical resource for general students and professional researchers, where techniques and concepts can be readily picked up on a chapter-by-chapter basis.Parameter Estimation and Inverse Problems is structured around a course at New Mexico Tech and is designed to be accessible to typical graduate students in the physical sciences who may not have an extensive mathematical background. It is accompanied by a Web site that...

  11. Statistical perspectives on inverse problems

    DEFF Research Database (Denmark)

    Andersen, Kim Emil

    of the interior of an object from electrical boundary measurements. One part of this thesis concerns statistical approaches for solving, possibly non-linear, inverse problems. Thus inverse problems are recasted in a form suitable for statistical inference. In particular, a Bayesian approach for regularisation...... problem is given in terms of probability distributions. Posterior inference is obtained by Markov chain Monte Carlo methods and new, powerful simulation techniques based on e.g. coupled Markov chains and simulated tempering is developed to improve the computational efficiency of the overall simulation......Inverse problems arise in many scientific disciplines and pertain to situations where inference is to be made about a particular phenomenon from indirect measurements. A typical example, arising in diffusion tomography, is the inverse boundary value problem for non-invasive reconstruction...

  12. Computation of inverse magnetic cascades

    International Nuclear Information System (INIS)

    Montgomery, D.

    1981-10-01

    Inverse cascades of magnetic quantities for turbulent incompressible magnetohydrodynamics are reviewed, for two and three dimensions. The theory is extended to the Strauss equations, a description intermediate between two and three dimensions appropriate to tokamak magnetofluids. Consideration of the absolute equilibrium Gibbs ensemble for the system leads to a prediction of an inverse cascade of magnetic helicity, which may manifest itself as a major disruption. An agenda for computational investigation of this conjecture is proposed

  13. Thermal measurements and inverse techniques

    CERN Document Server

    Orlande, Helcio RB; Maillet, Denis; Cotta, Renato M

    2011-01-01

    With its uncommon presentation of instructional material regarding mathematical modeling, measurements, and solution of inverse problems, Thermal Measurements and Inverse Techniques is a one-stop reference for those dealing with various aspects of heat transfer. Progress in mathematical modeling of complex industrial and environmental systems has enabled numerical simulations of most physical phenomena. In addition, recent advances in thermal instrumentation and heat transfer modeling have improved experimental procedures and indirect measurements for heat transfer research of both natural phe

  14. Coin tossing and Laplace inversion

    Indian Academy of Sciences (India)

    of a probability measure " on Е0Y 1К via the obvious change of variables e└t И xX An inversion formula for " in terms of its moments yields an inversion formula for # in terms of the values of its Laplace transform at n И 0Y 1Y 2Y ... and vice versa. In our discussion we allow " (respectively #) to have positive mass at 0 ...

  15. Nonlinear approximation with dictionaries I. Direct estimates

    DEFF Research Database (Denmark)

    Gribonval, Rémi; Nielsen, Morten

    2004-01-01

    We study various approximation classes associated with m-term approximation by elements from a (possibly) redundant dictionary in a Banach space. The standard approximation class associated with the best m-term approximation is compared to new classes defined by considering m-term approximation w...

  16. EDITORIAL: Inverse Problems in Engineering

    Science.gov (United States)

    West, Robert M.; Lesnic, Daniel

    2007-01-01

    Presented here are 11 noteworthy papers selected from the Fifth International Conference on Inverse Problems in Engineering: Theory and Practice held in Cambridge, UK during 11-15 July 2005. The papers have been peer-reviewed to the usual high standards of this journal and the contributions of reviewers are much appreciated. The conference featured a good balance of the fundamental mathematical concepts of inverse problems with a diverse range of important and interesting applications, which are represented here by the selected papers. Aspects of finite-element modelling and the performance of inverse algorithms are investigated by Autrique et al and Leduc et al. Statistical aspects are considered by Emery et al and Watzenig et al with regard to Bayesian parameter estimation and inversion using particle filters. Electrostatic applications are demonstrated by van Berkel and Lionheart and also Nakatani et al. Contributions to the applications of electrical techniques and specifically electrical tomographies are provided by Wakatsuki and Kagawa, Kim et al and Kortschak et al. Aspects of inversion in optical tomography are investigated by Wright et al and Douiri et al. The authors are representative of the worldwide interest in inverse problems relating to engineering applications and their efforts in producing these excellent papers will be appreciated by many readers of this journal.

  17. L∞ fitting for inverse problems with uniform noise

    Science.gov (United States)

    Clason, Christian

    2012-10-01

    For inverse problems where the data are corrupted by uniform noise such as arising from quantization errors, the L∞ norm is a more robust data-fitting term than the standard L2 norm. Well-posedness and regularization properties for linear inverse problems with L∞ data fitting are shown, and the automatic choice of the regularization parameter is discussed. After introducing an equivalent reformulation of the problem and a Moreau-Yosida approximation, a superlinearly convergent semi-smooth Newton method becomes applicable for the numerical solution of L∞ fitting problems. Numerical examples illustrate the performance of the proposed approach as well as the qualitative behavior of L∞ fitting.

  18. Homogeneous approximation property for continuous shearlet transforms in higher dimensions

    Directory of Open Access Journals (Sweden)

    Yu Su

    2016-07-01

    Full Text Available Abstract This paper is concerned with the generalization of the homogeneous approximation property (HAP for a continuous shearlet transform to higher dimensions. First, we give a pointwise convergence result on the inverse shearlet transform in higher dimensions. Second, we show that every pair of admissible shearlets possess the HAP in the sense of L 2 ( R d $L^{2}(R^{d}$ . Third, we give a sufficient condition for the pointwise HAP to hold, which depends on both shearlets and functions to be reconstructed.

  19. 2.5D far-field diffraction tomography inversion scheme for GPR that takes into account the planar air-soil interface

    DEFF Research Database (Denmark)

    Meincke, Peter

    2001-01-01

    A new 2.5D inversion scheme is derived for fixed-offset ground penetrating radar (GPR) that takes into account the planar air-soil interface. The inversion scheme is based upon the first Born approximation and a far-field approximation of the dyadic Green function for a two-layer medium.......A new 2.5D inversion scheme is derived for fixed-offset ground penetrating radar (GPR) that takes into account the planar air-soil interface. The inversion scheme is based upon the first Born approximation and a far-field approximation of the dyadic Green function for a two-layer medium....

  20. Chromatid Painting for Chromosomal Inversion Detection Project

    Data.gov (United States)

    National Aeronautics and Space Administration — We propose a novel approach to the detection of chromosomal inversions. Transmissible chromosome aberrations (translocations and inversions) have profound genetic...

  1. Analysis of 2D NMR relaxation data using Chisholm approximations.

    Science.gov (United States)

    Huber, S; Haase, A; Gleich, B

    2017-08-01

    To analyze 2D NMR relaxation data based on a discrete delta-like relaxation map we extended the Padé-Laplace method to two dimensions. We approximate the forward Laplace image of the time domain signal by a Chisholm approximation, i.e. a rational polynomial in two dimensions. The poles and residues of this approximation correspond to the relaxation rates and weighting factors of the underlying relaxation map. In this work we explain the principle ideas of our algorithm and demonstrate its applicability. Therefore we compare the inversion results of the Chisholm approximation and Tikhonov regularization method as a function of SNR when the investigated signal is based on a given discrete relaxation map. Our algorithm proved to be reliable for SNRs larger than 50 and is able to compete with the Tikhonov regularization method. Furthermore we show that our method is also able to detect the simulated relaxation compartments of narrow Gaussian distributions with widths less or equal than 0.05s -1 . Finally we investigate the resolution limit with experimental data. For a SNR of 750 the Chisholm approximation method was able to resolve two relaxation compartments in 8 of 10 cases when both compartments differ by a factor of 1.7. Copyright © 2017 Elsevier Inc. All rights reserved.

  2. A local adaptive method for the numerical approximation in seismic wave modelling

    Directory of Open Access Journals (Sweden)

    Galuzzi Bruno G.

    2017-12-01

    Full Text Available We propose a new numerical approach for the solution of the 2D acoustic wave equation to model the predicted data in the field of active-source seismic inverse problems. This method consists in using an explicit finite difference technique with an adaptive order of approximation of the spatial derivatives that takes into account the local velocity at the grid nodes. Testing our method to simulate the recorded seismograms in a marine seismic acquisition, we found that the low computational time and the low approximation error of the proposed approach make it suitable in the context of seismic inversion problems.

  3. An improvement of speed control performances of a two-mass system using a universal approximator

    DEFF Research Database (Denmark)

    Lee, Kyo Beum; Blåbjerg, Frede

    2007-01-01

    A new control scheme using a universal approximator based on a radial basis ti.tnction network (RBFN) is proposed and investigated for improving the control characteristics of the high-performance motion control system. This control method presents better performance in the corresponding speed...... vibration response, compared with the inverse model-based disturbance observer. The proposed RBFN-universal approximator keeps the self-learning capability, whereas the inverse model-based disturbance observer with the low-pass filter should adjust the time constant of the filter according to the resonance...

  4. Inversion of the total cross sections for electron-molecule and electron-atom scattering

    International Nuclear Information System (INIS)

    Lun, D.R.; Amos, K.; Allen, L.J.

    1994-01-01

    Inverse scattering theory has been applied to construct the interaction potentials from total cross sections as a function of energy for electrons scattered off of atoms and molecules. The underlying potentials are assumed to be real and energy independent and are evaluated using the Eikonal approximation and with real phase shifts determined from the total cross sections. The inversion potentials have been determined using either a high energy limit approximation or by using a fixed energy inversion method at select energies. These procedures have been used to analyse e - - CH 4 , e - - SiH 4 , e - -Kr and e - -Xe scattering data in particular. 14 refs., 1 tabs., 3 figs

  5. Likelihood Approximation With Hierarchical Matrices For Large Spatial Datasets

    KAUST Repository

    Litvinenko, Alexander

    2017-09-03

    We use available measurements to estimate the unknown parameters (variance, smoothness parameter, and covariance length) of a covariance function by maximizing the joint Gaussian log-likelihood function. To overcome cubic complexity in the linear algebra, we approximate the discretized covariance function in the hierarchical (H-) matrix format. The H-matrix format has a log-linear computational cost and storage O(kn log n), where the rank k is a small integer and n is the number of locations. The H-matrix technique allows us to work with general covariance matrices in an efficient way, since H-matrices can approximate inhomogeneous covariance functions, with a fairly general mesh that is not necessarily axes-parallel, and neither the covariance matrix itself nor its inverse have to be sparse. We demonstrate our method with Monte Carlo simulations and an application to soil moisture data. The C, C++ codes and data are freely available.

  6. An Entropic Estimator for Linear Inverse Problems

    Directory of Open Access Journals (Sweden)

    Amos Golan

    2012-05-01

    Full Text Available In this paper we examine an Information-Theoretic method for solving noisy linear inverse estimation problems which encompasses under a single framework a whole class of estimation methods. Under this framework, the prior information about the unknown parameters (when such information exists, and constraints on the parameters can be incorporated in the statement of the problem. The method builds on the basics of the maximum entropy principle and consists of transforming the original problem into an estimation of a probability density on an appropriate space naturally associated with the statement of the problem. This estimation method is generic in the sense that it provides a framework for analyzing non-normal models, it is easy to implement and is suitable for all types of inverse problems such as small and or ill-conditioned, noisy data. First order approximation, large sample properties and convergence in distribution are developed as well. Analytical examples, statistics for model comparisons and evaluations, that are inherent to this method, are discussed and complemented with explicit examples.

  7. Neutron inverse kinetics via Gaussian Processes

    International Nuclear Information System (INIS)

    Picca, Paolo; Furfaro, Roberto

    2012-01-01

    Highlights: ► A novel technique for the interpretation of experiments in ADS is presented. ► The technique is based on Bayesian regression, implemented via Gaussian Processes. ► GPs overcome the limits of classical methods, based on PK approximation. ► Results compares GPs and ANN performance, underlining similarities and differences. - Abstract: The paper introduces the application of Gaussian Processes (GPs) to determine the subcriticality level in accelerator-driven systems (ADSs) through the interpretation of pulsed experiment data. ADSs have peculiar kinetic properties due to their special core design. For this reason, classical – inversion techniques based on point kinetic (PK) generally fail to generate an accurate estimate of reactor subcriticality. Similarly to Artificial Neural Networks (ANNs), Gaussian Processes can be successfully trained to learn the underlying inverse neutron kinetic model and, as such, they are not limited to the model choice. Importantly, GPs are strongly rooted into the Bayes’ theorem which makes them a powerful tool for statistical inference. Here, GPs have been designed and trained on a set of kinetics models (e.g. point kinetics and multi-point kinetics) for homogeneous and heterogeneous settings. The results presented in the paper show that GPs are very efficient and accurate in predicting the reactivity for ADS-like systems. The variance computed via GPs may provide an indication on how to generate additional data as function of the desired accuracy.

  8. Wave-equation reflection traveltime inversion

    KAUST Repository

    Zhang, Sanzong

    2011-01-01

    The main difficulty with iterative waveform inversion using a gradient optimization method is that it tends to get stuck in local minima associated within the waveform misfit function. This is because the waveform misfit function is highly nonlinear with respect to changes in the velocity model. To reduce this nonlinearity, we present a reflection traveltime tomography method based on the wave equation which enjoys a more quasi-linear relationship between the model and the data. A local crosscorrelation of the windowed downgoing direct wave and the upgoing reflection wave at the image point yields the lag time that maximizes the correlation. This lag time represents the reflection traveltime residual that is back-projected into the earth model to update the velocity in the same way as wave-equation transmission traveltime inversion. No travel-time picking is needed and no high-frequency approximation is assumed. The mathematical derivation and the numerical examples are presented to partly demonstrate its efficiency and robustness. © 2011 Society of Exploration Geophysicists.

  9. Producing a steady-state population inversion

    International Nuclear Information System (INIS)

    Richards, R.K.; Griffin, D.C.

    1986-03-01

    An observed steady-state transition at 17.5 nm is identified as the 2p 5 3s3p 4 S/sub 3/2/ → 2p 6 3p 2 P/sub 3/2/ transition in Na-like aluminum. The upper level is populated by electron inner shell ionization of metastable Mg-like aluminum. From the emission intensity, the rate coefficient for populating the upper level is calculated to be approximately 5 x 10 -10 ) cm 3 /sec. Since the upper level is quasimetastable with a lifetime 22 times longer than the lower level, it may be possible to produce a population inversion, if a competing process to populate the lower level can be reduced

  10. Confidence bands for inverse regression models

    International Nuclear Information System (INIS)

    Birke, Melanie; Bissantz, Nicolai; Holzmann, Hajo

    2010-01-01

    We construct uniform confidence bands for the regression function in inverse, homoscedastic regression models with convolution-type operators. Here, the convolution is between two non-periodic functions on the whole real line rather than between two periodic functions on a compact interval, since the former situation arguably arises more often in applications. First, following Bickel and Rosenblatt (1973 Ann. Stat. 1 1071–95) we construct asymptotic confidence bands which are based on strong approximations and on a limit theorem for the supremum of a stationary Gaussian process. Further, we propose bootstrap confidence bands based on the residual bootstrap and prove consistency of the bootstrap procedure. A simulation study shows that the bootstrap confidence bands perform reasonably well for moderate sample sizes. Finally, we apply our method to data from a gel electrophoresis experiment with genetically engineered neuronal receptor subunits incubated with rat brain extract

  11. The inverse problem for Schwinger pair production

    Directory of Open Access Journals (Sweden)

    F. Hebenstreit

    2016-02-01

    Full Text Available The production of electron–positron pairs in time-dependent electric fields (Schwinger mechanism depends non-linearly on the applied field profile. Accordingly, the resulting momentum spectrum is extremely sensitive to small variations of the field parameters. Owing to this non-linear dependence it is so far unpredictable how to choose a field configuration such that a predetermined momentum distribution is generated. We show that quantum kinetic theory along with optimal control theory can be used to approximately solve this inverse problem for Schwinger pair production. We exemplify this by studying the superposition of a small number of harmonic components resulting in predetermined signatures in the asymptotic momentum spectrum. In the long run, our results could facilitate the observation of this yet unobserved pair production mechanism in quantum electrodynamics by providing suggestions for tailored field configurations.

  12. ANNIT - An Efficient Inversion Algorithm based on Prediction Principles

    Science.gov (United States)

    Růžek, B.; Kolář, P.

    2009-04-01

    Solution of inverse problems represents meaningful job in geophysics. The amount of data is continuously increasing, methods of modeling are being improved and the computer facilities are also advancing great technical progress. Therefore the development of new and efficient algorithms and computer codes for both forward and inverse modeling is still up to date. ANNIT is contributing to this stream since it is a tool for efficient solution of a set of non-linear equations. Typical geophysical problems are based on parametric approach. The system is characterized by a vector of parameters p, the response of the system is characterized by a vector of data d. The forward problem is usually represented by unique mapping F(p)=d. The inverse problem is much more complex and the inverse mapping p=G(d) is available in an analytical or closed form only exceptionally and generally it may not exist at all. Technically, both forward and inverse mapping F and G are sets of non-linear equations. ANNIT solves such situation as follows: (i) joint subspaces {pD, pM} of original data and model spaces D, M, resp. are searched for, within which the forward mapping F is sufficiently smooth that the inverse mapping G does exist, (ii) numerical approximation of G in subspaces {pD, pM} is found, (iii) candidate solution is predicted by using this numerical approximation. ANNIT is working in an iterative way in cycles. The subspaces {pD, pM} are searched for by generating suitable populations of individuals (models) covering data and model spaces. The approximation of the inverse mapping is made by using three methods: (a) linear regression, (b) Radial Basis Function Network technique, (c) linear prediction (also known as "Kriging"). The ANNIT algorithm has built in also an archive of already evaluated models. Archive models are re-used in a suitable way and thus the number of forward evaluations is minimized. ANNIT is now implemented both in MATLAB and SCILAB. Numerical tests show good

  13. Inverse comptonization vs. thermal synchrotron

    International Nuclear Information System (INIS)

    Fenimore, E.E.; Klebesadel, R.W.; Laros, J.G.

    1983-01-01

    There are currently two radiation mechanisms being considered for gamma-ray bursts: thermal synchrotron and inverse comptonization. They are mutually exclusive since thermal synchrotron requires a magnetic field of approx. 10 12 Gauss whereas inverse comptonization cannot produce a monotonic spectrum if the field is larger than 10 11 and is too inefficient relative to thermal synchrotron unless the field is less than 10 9 Gauss. Neither mechanism can explain completely the observed characteristics of gamma-ray bursts. However, we conclude that thermal synchrotron is more consistent with the observations if the sources are approx. 40 kpc away whereas inverse comptonization is more consistent if they are approx. 300 pc away. Unfortunately, the source distance is still not known and, thus, the radiation mechanism is still uncertain

  14. Inverse comorbidity in multiple sclerosis

    DEFF Research Database (Denmark)

    Thormann, Anja; Koch-Henriksen, Nils; Laursen, Bjarne

    2016-01-01

    discovery rate and investigated each of eight pre-specified comorbidity categories: psychiatric, cerebrovascular, cardiovascular, lung, and autoimmune comorbidities, diabetes, cancer, and Parkinson's disease. Results A total of 8947 MS-cases and 44,735 controls were eligible for inclusion. We found...... This study showed a decreased risk of cancers and pulmonary diseases after onset of MS. Identification of inverse comorbidity and of its underlying mechanisms may provide important new entry points into the understanding of MS.......Background Inverse comorbidity is disease occurring at lower rates than expected among persons with a given index disease. The objective was to identify inverse comorbidity in MS. Methods We performed a combined case-control and cohort study in a total nationwide cohort of cases with clinical onset...

  15. Inverse photoemission of uranium oxides

    International Nuclear Information System (INIS)

    Roussel, P.; Morrall, P.; Tull, S.J.

    2009-01-01

    Understanding the itinerant-localised bonding role of the 5f electrons in the light actinides will afford an insight into their unusual physical and chemical properties. In recent years, the combination of core and valance band electron spectroscopies with theoretic modelling have already made significant progress in this area. However, information of the unoccupied density of states is still scarce. When compared to the forward photoemission techniques, measurements of the unoccupied states suffer from significantly less sensitivity and lower resolution. In this paper, we report on our experimental apparatus, which is designed to measure the inverse photoemission spectra of the light actinides. Inverse photoemission spectra of UO 2 and UO 2.2 along with the corresponding core and valance electron spectra are presented in this paper. UO 2 has been reported previously, although through its inclusion here it allows us to compare and contrast results from our experimental apparatus to the previous Bremsstrahlung Isochromat Spectroscopy and Inverse Photoemission Spectroscopy investigations

  16. Inverse source problems in elastodynamics

    Science.gov (United States)

    Bao, Gang; Hu, Guanghui; Kian, Yavar; Yin, Tao

    2018-04-01

    We are concerned with time-dependent inverse source problems in elastodynamics. The source term is supposed to be the product of a spatial function and a temporal function with compact support. We present frequency-domain and time-domain approaches to show uniqueness in determining the spatial function from wave fields on a large sphere over a finite time interval. The stability estimate of the temporal function from the data of one receiver and the uniqueness result using partial boundary data are proved. Our arguments rely heavily on the use of the Fourier transform, which motivates inversion schemes that can be easily implemented. A Landweber iterative algorithm for recovering the spatial function and a non-iterative inversion scheme based on the uniqueness proof for recovering the temporal function are proposed. Numerical examples are demonstrated in both two and three dimensions.

  17. Optimization for nonlinear inverse problem

    International Nuclear Information System (INIS)

    Boyadzhiev, G.; Brandmayr, E.; Pinat, T.; Panza, G.F.

    2007-06-01

    The nonlinear inversion of geophysical data in general does not yield a unique solution, but a single model, representing the investigated field, is preferred for an easy geological interpretation of the observations. The analyzed region is constituted by a number of sub-regions where the multi-valued nonlinear inversion is applied, which leads to a multi-valued solution. Therefore, combining the values of the solution in each sub-region, many acceptable models are obtained for the entire region and this complicates the geological interpretation of geophysical investigations. In this paper are presented new methodologies, capable to select one model, among all acceptable ones, that satisfies different criteria of smoothness in the explored space of solutions. In this work we focus on the non-linear inversion of surface waves dispersion curves, which gives structural models of shear-wave velocity versus depth, but the basic concepts have a general validity. (author)

  18. Inverse methods in hydrologic optics

    Directory of Open Access Journals (Sweden)

    Howard R. Gordon

    2002-03-01

    Full Text Available Methods for solving the hydrologic-optics inverse problem, i.e., estimating the inherent optical properties of a water body based solely on measurements of the apparent optical properties, are reviewed in detail. A new method is developed for the inverse problem in water bodies in which fluorescence is important. It is shown that in principle, given profiles of the spectra of up- and downwelling irradiance, estimation of the coefficient of inelastic scattering from any wave band to any other wave band can be effected.

  19. Inverse Interval Matrix: A Survey

    Czech Academy of Sciences Publication Activity Database

    Rohn, Jiří; Farhadsefat, R.

    2011-01-01

    Roč. 22, - (2011), s. 704-719 E-ISSN 1081-3810 R&D Projects: GA ČR GA201/09/1957; GA ČR GC201/08/J020 Institutional research plan: CEZ:AV0Z10300504 Keywords : interval matrix * inverse interval matrix * NP-hardness * enclosure * unit midpoint * inverse sign stability * nonnegative invertibility * absolute value equation * algorithm Subject RIV: BA - General Mathematics Impact factor: 0.808, year: 2010 http://www.math.technion.ac.il/iic/ela/ela-articles/articles/vol22_pp704-719.pdf

  20. Size Estimates in Inverse Problems

    KAUST Repository

    Di Cristo, Michele

    2014-01-06

    Detection of inclusions or obstacles inside a body by boundary measurements is an inverse problems very useful in practical applications. When only finite numbers of measurements are available, we try to detect some information on the embedded object such as its size. In this talk we review some recent results on several inverse problems. The idea is to provide constructive upper and lower estimates of the area/volume of the unknown defect in terms of a quantity related to the work that can be expressed with the available boundary data.

  1. -Dimensional Fractional Lagrange's Inversion Theorem

    Directory of Open Access Journals (Sweden)

    F. A. Abd El-Salam

    2013-01-01

    Full Text Available Using Riemann-Liouville fractional differential operator, a fractional extension of the Lagrange inversion theorem and related formulas are developed. The required basic definitions, lemmas, and theorems in the fractional calculus are presented. A fractional form of Lagrange's expansion for one implicitly defined independent variable is obtained. Then, a fractional version of Lagrange's expansion in more than one unknown function is generalized. For extending the treatment in higher dimensions, some relevant vectors and tensors definitions and notations are presented. A fractional Taylor expansion of a function of -dimensional polyadics is derived. A fractional -dimensional Lagrange inversion theorem is proved.

  2. Joint inversion of seismic velocities and source location without rays using the truncated Newton and the adjoint-state method

    Science.gov (United States)

    Virieux, J.; Bretaudeau, F.; Metivier, L.; Brossier, R.

    2013-12-01

    computed in the internal loop, each parameter being rescaled by its corresponding Hessian. The velocities and the source attributes are then updated in the external loop where the line search is performed. As the TCN method uses an iterative algorithm to compute Δm, it also needs a stopping criteria to avoid time-consuming large number of iterations and return the truncated solution of the normal equation. The strategy proposed by Eisenstat and Walker (1994) and used by Métivier et al. (2012) for FWI ensures superlinear convergence far from the solution and quadratic convergence in its attraction basin. In order to obtain better convergence of the resolution of the Newton system, it is also possible to use specific preconditioners for each inverted parameter. In particular, the exact Hessian for source parameters can be directly used as a preconditioner for the inversion. As it allows to consider the full Hessian operator, the TCN method mitigates scaling and trade-offs between seismic velocities and source parameters. We compare in this study the performances of various optimization algorithms (steepest descent, conjugate gradient, LBFGS and TCN) used with and without preconditioning, for this multi-parameter inversion problem. Tests are performed here on 2D models, but extensions to 3D is affordable.

  3. Motion can amplify the face-inversion effect

    Directory of Open Access Journals (Sweden)

    Thornton Ian M.

    2011-01-01

    Full Text Available The face-inversion effect (FIE refers to increased response times or error rates for faces that are presented upside-down relative to those seen in a canonical, upright orientation. Here we report one situation in which this FIE can be amplified when observers are shown dynamic facial expressions, rather than static facial expressions. In two experiments observers were asked to assign gender to a random sequence of un-degraded static or moving faces. Each face was seen both upright and inverted. For static images, this task led to little or no effect of inversion. For moving faces, the cost of inversion was a response time increase of approximately 100 ms relative to upright. Motion thus led to a disadvantage in the context of inversion. The fact that such motion could not be ignored in favour of available form cues suggests that dynamic processing may be mandatory. In two control experiments a difference between static and dynamic inversion was not observed for whole-body stimuli or for human-animal decisions. These latter findings suggest that the processing of upside-down movies is not always more difficult for the visual system than the processing of upside-down static images.

  4. Superconductivity in Pb inverse opal

    International Nuclear Information System (INIS)

    Aliev, Ali E.; Lee, Sergey B.; Zakhidov, Anvar A.; Baughman, Ray H.

    2007-01-01

    Type-II superconducting behavior was observed in highly periodic three-dimensional lead inverse opal prepared by infiltration of melted Pb in blue (D = 160 nm), green (D = 220 nm) and red (D = 300 nm) opals and followed by the extraction of the SiO 2 spheres by chemical etching. The onset of a broad phase transition (ΔT = 0.3 K) was shifted from T c = 7.196 K for bulk Pb to T c = 7.325 K. The upper critical field H c2 (3150 Oe) measured from high-field hysteresis loops exceeds the critical field for bulk lead (803 Oe) fourfold. Two well resolved peaks observed in the hysteresis loops were ascribed to flux penetration into the cylindrical void space that can be found in inverse opal structure and into the periodic structure of Pb nanoparticles. The red inverse opal shows pronounced oscillations of magnetic moment in the mixed state at low temperatures, T 0.9T c has been observed for all of the samples studied. The magnetic field periodicity of resistivity modulation is in good agreement with the lattice parameter of the inverse opal structure. We attribute the failure to observe pronounced modulation in magneto-resistive measurement to difficulties in the precision orientation of the sample along the magnetic field

  5. Statistical and Computational Inverse Problems

    CERN Document Server

    Kaipio, Jari

    2005-01-01

    Develops the statistical approach to inverse problems with an emphasis on modeling and computations. The book discusses the measurement noise modeling and Bayesian estimation, and uses Markov Chain Monte Carlo methods to explore the probability distributions. It is for researchers and advanced students in applied mathematics.

  6. Coin Tossing and Laplace Inversion

    Indian Academy of Sciences (India)

    An analysis of exchangeable sequences of coin tossings leads to inversion formulae for Laplace transforms of probability measures. Author Affiliations. J C Gupta1 2. Indian Statistical Institute, New Delhi 110 016, India; 32, Mirdha Tola, Budaun 243 601, India. Dates. Manuscript received: 5 May 1999; Manuscript revised: 3 ...

  7. Givental Graphs and Inversion Symmetry

    NARCIS (Netherlands)

    Dunin-Barkovskiy, P.; Shadrin, S.; Spitz, L.

    2013-01-01

    Inversion symmetry is a very non-trivial discrete symmetry of Frobenius manifolds. It was obtained by Dubrovin from one of the elementary Schlesinger transformations of a special ODE associated to a Frobenius manifold. In this paper, we review the Givental group action on Frobenius manifolds in

  8. Adjoint modeling for acoustic inversion

    Science.gov (United States)

    Hursky, Paul; Porter, Michael B.; Cornuelle, B. D.; Hodgkiss, W. S.; Kuperman, W. A.

    2004-02-01

    The use of adjoint modeling for acoustic inversion is investigated. An adjoint model is derived from a linearized forward propagation model to propagate data-model misfit at the observation points back through the medium to the medium perturbations not being accounted for in the model. This adjoint model can be used to aid in inverting for these unaccounted medium perturbations. Adjoint methods are being applied to a variety of inversion problems, but have not drawn much attention from the underwater acoustic community. This paper presents an application of adjoint methods to acoustic inversion. Inversions are demonstrated in simulation for both range-independent and range-dependent sound speed profiles using the adjoint of a parabolic equation model. Sensitivity and error analyses are discussed showing how the adjoint model enables calculations to be performed in the space of observations, rather than the often much larger space of model parameters. Using an adjoint model enables directions of steepest descent in the model parameters (what we invert for) to be calculated using far fewer modeling runs than if a forward model only were used.

  9. Sparse inverse covariance estimation with the graphical lasso.

    Science.gov (United States)

    Friedman, Jerome; Hastie, Trevor; Tibshirani, Robert

    2008-07-01

    We consider the problem of estimating sparse graphs by a lasso penalty applied to the inverse covariance matrix. Using a coordinate descent procedure for the lasso, we develop a simple algorithm--the graphical lasso--that is remarkably fast: It solves a 1000-node problem ( approximately 500,000 parameters) in at most a minute and is 30-4000 times faster than competing methods. It also provides a conceptual link between the exact problem and the approximation suggested by Meinshausen and Bühlmann (2006). We illustrate the method on some cell-signaling data from proteomics.

  10. Workflows for Full Waveform Inversions

    Science.gov (United States)

    Boehm, Christian; Krischer, Lion; Afanasiev, Michael; van Driel, Martin; May, Dave A.; Rietmann, Max; Fichtner, Andreas

    2017-04-01

    Despite many theoretical advances and the increasing availability of high-performance computing clusters, full seismic waveform inversions still face considerable challenges regarding data and workflow management. While the community has access to solvers which can harness modern heterogeneous computing architectures, the computational bottleneck has fallen to these often manpower-bounded issues that need to be overcome to facilitate further progress. Modern inversions involve huge amounts of data and require a tight integration between numerical PDE solvers, data acquisition and processing systems, nonlinear optimization libraries, and job orchestration frameworks. To this end we created a set of libraries and applications revolving around Salvus (http://salvus.io), a novel software package designed to solve large-scale full waveform inverse problems. This presentation focuses on solving passive source seismic full waveform inversions from local to global scales with Salvus. We discuss (i) design choices for the aforementioned components required for full waveform modeling and inversion, (ii) their implementation in the Salvus framework, and (iii) how it is all tied together by a usable workflow system. We combine state-of-the-art algorithms ranging from high-order finite-element solutions of the wave equation to quasi-Newton optimization algorithms using trust-region methods that can handle inexact derivatives. All is steered by an automated interactive graph-based workflow framework capable of orchestrating all necessary pieces. This naturally facilitates the creation of new Earth models and hopefully sparks new scientific insights. Additionally, and even more importantly, it enhances reproducibility and reliability of the final results.

  11. A material optimization model to approximate energy bounds for cellular materials under multiload conditions

    DEFF Research Database (Denmark)

    Guedes, J.M.; Rodrigues, H.C.; Bendsøe, Martin P.

    2003-01-01

    This paper describes a computational model, based on inverse homogenization and topology design, for approximating energy bounds for two-phase composites under multiple load cases. The approach allows for the identification of possible single-scale cellular materials that give rise to the optimal...

  12. Approximation properties of fine hyperbolic graphs

    Indian Academy of Sciences (India)

    is called the metric invariant translation approximation property for a countable dis- crete metric space. Moreover ... Uniform Roe algebras; fine hyperbolic graph; metric invariant translation approximation property. ..... ate Studies in Mathematics, Volume 88 (2008) (Rhode Island: American Mathematical. Society Providence).

  13. Approximate Uniqueness Estimates for Singular Correlation Matrices.

    Science.gov (United States)

    Finkbeiner, C. T.; Tucker, L. R.

    1982-01-01

    The residual variance is often used as an approximation to the uniqueness in factor analysis. An upper bound approximation to the residual variance is presented for the case when the correlation matrix is singular. (Author/JKS)

  14. Reduction of Linear Programming to Linear Approximation

    OpenAIRE

    Vaserstein, Leonid N.

    2006-01-01

    It is well known that every Chebyshev linear approximation problem can be reduced to a linear program. In this paper we show that conversely every linear program can be reduced to a Chebyshev linear approximation problem.

  15. HE11 radiation patterns and gaussian approximations

    International Nuclear Information System (INIS)

    Rebuffi, L.; Crenn, J.P.

    1986-12-01

    The possibility of approximating the HE11 radiation pattern with a Gaussian distribution is presented. A numerical comparison between HE11 far-field theoretical patterns and Abrams and Crenn approximations permits an evaluation of the validity of these two approximations. A new numerically optimized HE11 Gaussian approximation for the far-field, extended to great part of the near field, has been found. In particular, the value given for the beam radius at the waist, has been demonstrated to give the best HE11 Gaussian approximation in the far-field. The Crenn approximation is found to be very close to this optimal approximation, while the Abrams approximation is shown to be less precise. Universal curves for intensity, amplitude and power distribution are given for the HE11 radiated mode. These results are of interest for laser waveguide applications and for plasma ECRH transmission systems

  16. Analytical approximations of Chandrasekhar's H-Function

    International Nuclear Information System (INIS)

    Simovic, R.; Vukanic, J.

    1995-01-01

    Analytical approximations of Chandrasekhar's H-function are derived in this paper by using ordinary and modified DPN methods. The accuracy of the approximations is discussed and the energy dependent albedo problem is treated. (author)

  17. Axiomatic Characterizations of IVF Rough Approximation Operators

    Directory of Open Access Journals (Sweden)

    Guangji Yu

    2014-01-01

    Full Text Available This paper is devoted to the study of axiomatic characterizations of IVF rough approximation operators. IVF approximation spaces are investigated. The fact that different IVF operators satisfy some axioms to guarantee the existence of different types of IVF relations which produce the same operators is proved and then IVF rough approximation operators are characterized by axioms.

  18. Truth Approximation, Social Epistemology, and Opinion Dynamics

    NARCIS (Netherlands)

    Douven, Igor; Kelp, Christoph

    This paper highlights some connections between work on truth approximation and work in social epistemology, in particular work on peer disagreement. In some of the literature on truth approximation, questions have been addressed concerning the efficiency of research strategies for approximating the

  19. Operator approximant problems arising from quantum theory

    CERN Document Server

    Maher, Philip J

    2017-01-01

    This book offers an account of a number of aspects of operator theory, mainly developed since the 1980s, whose problems have their roots in quantum theory. The research presented is in non-commutative operator approximation theory or, to use Halmos' terminology, in operator approximants. Focusing on the concept of approximants, this self-contained book is suitable for graduate courses.

  20. Approximate Nearest Neighbor Queries among Parallel Segments

    DEFF Research Database (Denmark)

    Emiris, Ioannis Z.; Malamatos, Theocharis; Tsigaridas, Elias

    2010-01-01

    We develop a data structure for answering efficiently approximate nearest neighbor queries over a set of parallel segments in three dimensions. We connect this problem to approximate nearest neighbor searching under weight constraints and approximate nearest neighbor searching on historical data...

  1. Recent Applications and Advances of Numerical Modeling and Wavefield Inversion in Nondestructive Testing

    Directory of Open Access Journals (Sweden)

    R. Marklein

    2005-01-01

    Full Text Available This paper presents recent advances and future challenges of the application of different linear and nonlinear inversion algorithms in acoustics, electromagnetics, and elastodynamics. The presented material can be understood as an extension of our previous work on this topic. The inversion methods considered in this presentation vary from linear schemes, like the Synthetic Aperture Radar (SAR applied electromagnetics and the Synthetic Aperture Focussing Technique (SAFT as its counterpart in ultrasonics, and the linearized Diffraction Tomography (DT, to nonlinear schemes, like the Contrast Source Inversion (CSI combined with different regularization approaches. Inversion results of the above mentioned inversion schemes are presented and compared for instance for time-domain ultrasonic data from the Fraunhofer-Institute for Nondestructive Testing (IZFP, Saarbrücken, Germany. Convenient tools for nondestructive evaluation of solids can be electromagnetic and/or elastodynamic waves; since their governing equations, including acoustics, exhibit strong structural similarities, the same inversion concepts apply. In particular, the heuristic SAFT algorithm can be and has been utilized for all kinds of waves, once a scalar approximation can be justified. Relating SAFT to inverse scattering in terms of diffraction tomography, it turns out that linearization is the most stringent inherent approximation. A comparison of the inversion results using the linear time-domain inversion scheme SAFT and well tested nonlinear frequency-domain inversion schemes demonstrates the considerable potential to extend and improve the ultrasonic imaging technique SAFT while consulting the mathematics of wavefield inversion, yet, in particular if the underlying effort is considered, the relatively simple and effective SAFT algorithm works surprisingly well. Since SAFT is a widely accepted imaging tool in ultrasonic NDE it seems worthwhile to check its formal restrictions and

  2. Recent Applications and Advances of Numerical Modeling and Wavefield Inversion in Nondestructive Testing

    Science.gov (United States)

    Marklein, R.; Langenberg, K. J.; Mayer, K.; Miao, J.; Shlivinski, A.; Zimmer, A.; Müller, W.; Schmitz, V.; Kohl, C.; Mletzko, U.

    2005-05-01

    This paper presents recent advances and future challenges of the application of different linear and nonlinear inversion algorithms in acoustics, electromagnetics, and elastodynamics. The presented material can be understood as an extension of our previous work on this topic. The inversion methods considered in this presentation vary from linear schemes, like the Synthetic Aperture Radar (SAR) applied electromagnetics and the Synthetic Aperture Focussing Technique (SAFT) as its counterpart in ultrasonics, and the linearized Diffraction Tomography (DT), to nonlinear schemes, like the Contrast Source Inversion (CSI) combined with different regularization approaches. Inversion results of the above mentioned inversion schemes are presented and compared for instance for time-domain ultrasonic data from the Fraunhofer-Institute for Nondestructive Testing (IZFP, Saarbrücken, Germany). Convenient tools for nondestructive evaluation of solids can be electromagnetic and/or elastodynamic waves; since their governing equations, including acoustics, exhibit strong structural similarities, the same inversion concepts apply. In particular, the heuristic SAFT algorithm can be and has been utilized for all kinds of waves, once a scalar approximation can be justified. Relating SAFT to inverse scattering in terms of diffraction tomography, it turns out that linearization is the most stringent inherent approximation. A comparison of the inversion results using the linear time-domain inversion scheme SAFT and well tested nonlinear frequency-domain inversion schemes demonstrates the considerable potential to extend and improve the ultrasonic imaging technique SAFT while consulting the mathematics of wavefield inversion, yet, in particular if the underlying effort is considered, the relatively simple and effective SAFT algorithm works surprisingly well. Since SAFT is a widely accepted imaging tool in ultrasonic NDE it seems worthwhile to check its formal restrictions and assumptions

  3. Time-lapse joint AVO inversion using generalized linear method based on exact Zoeppritz equations

    Science.gov (United States)

    Zhi, Longxiao; Gu, Hanming

    2018-03-01

    The conventional method of time-lapse AVO (Amplitude Versus Offset) inversion is mainly based on the approximate expression of Zoeppritz equations. Though the approximate expression is concise and convenient to use, it has certain limitations. For example, its application condition is that the difference of elastic parameters between the upper medium and lower medium is little and the incident angle is small. In addition, the inversion of density is not stable. Therefore, we develop the method of time-lapse joint AVO inversion based on exact Zoeppritz equations. In this method, we apply exact Zoeppritz equations to calculate the reflection coefficient of PP wave. And in the construction of objective function for inversion, we use Taylor series expansion to linearize the inversion problem. Through the joint AVO inversion of seismic data in baseline survey and monitor survey, we can obtain the P-wave velocity, S-wave velocity, density in baseline survey and their time-lapse changes simultaneously. We can also estimate the oil saturation change according to inversion results. Compared with the time-lapse difference inversion, the joint inversion doesn't need certain assumptions and can estimate more parameters simultaneously. It has a better applicability. Meanwhile, by using the generalized linear method, the inversion is easily implemented and its calculation cost is small. We use the theoretical model to generate synthetic seismic records to test and analyze the influence of random noise. The results can prove the availability and anti-noise-interference ability of our method. We also apply the inversion to actual field data and prove the feasibility of our method in actual situation.

  4. Neural Network Assisted Inverse Dynamic Guidance for Terminally Constrained Entry Flight

    OpenAIRE

    Zhou, Hao; Rahman, Tawfiqur; Chen, Wanchun

    2014-01-01

    This paper presents a neural network assisted entry guidance law that is designed by applying Bézier approximation. It is shown that a fully constrained approximation of a reference trajectory can be made by using the Bézier curve. Applying this approximation, an inverse dynamic system for an entry flight is solved to generate guidance command. The guidance solution thus gotten ensures terminal constraints for position, flight path, and azimuth angle. In order to ensure terminal velocity cons...

  5. Analysis of RAE-1 inversion

    Science.gov (United States)

    Hedland, D. A.; Degonia, P. K.

    1974-01-01

    The RAE-1 spacecraft inversion performed October 31, 1972 is described based upon the in-orbit dynamical data in conjunction with results obtained from previously developed computer simulation models. The computer simulations used are predictive of the satellite dynamics, including boom flexing, and are applicable during boom deployment and retraction, inter-phase coast periods, and post-deployment operations. Attitude data, as well as boom tip data, were analyzed in order to obtain a detailed description of the dynamical behavior of the spacecraft during and after the inversion. Runs were made using the computer model and the results were analyzed and compared with the real time data. Close agreement between the actual recorded spacecraft attitude and the computer simulation results was obtained.

  6. Validation of OSIRIS Ozone Inversions

    Science.gov (United States)

    Gudnason, P.; Evans, W. F.; von Savigny, C.; Sioris, C.; Halley, C.; Degenstein, D.; Llewellyn, E. J.; Petelina, S.; Gattinger, R. L.; Odin Team

    2002-12-01

    The OSIRIS instrument onboard the Odin satellite, that was launched on February 20, 2001, is a combined optical spectrograph and infrared imager that obtains profil sets of atmospheric spectra from 280 to 800 nm when Odin scans the terrestrial limb. It has been possible to make a preliminary analysis of the ozone profiles using the Chappuis absorption feature. Three algorithms have been developed for ozone profile inversions from these limb spectra sets. We have dubbed these the Gattinger, Von Savigny-Flittner and DOAS methods. These are being evaluated against POAM and other satellite data. Based on performance, one of these will be selected for the operational algorithm. The infrared imager data have been used by Degenstein with the tomographic inversion procedure to derive ozone concentrations above 60 km. This paper will present some of these initial observations and indicate the best algorithm potential of OSIRIS to make spectacular advances in the study of terrestrial ozone.

  7. Inverse problem in transformation optics

    OpenAIRE

    Novitsky, Andrey V.

    2011-01-01

    The straightforward method of transformation optics implies that one starts from the coordinate transformation and determines the Jacobian matrix, the fields and material parameters of the cloak. However, the coordinate transformation appears as an optional function: it is not necessary to know it. We offer the solution of some sort of inverse problem: starting from the fields in the invisibility cloak we directly derive the permittivity and permeability tensors of the cloaking shell. This ap...

  8. Fourier reconstruction with sparse inversions

    OpenAIRE

    Zwartjes, P.M.

    2005-01-01

    In seismic exploration an image of the subsurface is generated from seismic data through various data processing algorithms. When the data is not acquired on an equidistantly spaced grid, artifacts may result in the final image. Fourier reconstruction is an interpolation technique that can reduce these artifacts by generating uniformly sampled data from such non-uniformly sampled data. The method works by estimating via least-squares inversion the Fourier coefficients that describe the non-un...

  9. The Inverse of Banded Matrices

    Science.gov (United States)

    2013-01-01

    for reducing this burden, to Washington Headquarters Services, Directorate for Information Operations and Reports, 1215 Jefferson Davis Highway, Suite ...numbers of summed or subtracted terms in computing the inverse of a term of an upper (lower) triangular matrix are the generalized order-k Fibonacci ... Fibonacci numbers are the usual Fibonacci numbers, that is, f 2m = Fm (mth Fibonacci number). When also k = 3, c1 = c2 = c3 = 1, then the generalized order-3

  10. Inverse-magnetron mass spectrometer

    International Nuclear Information System (INIS)

    Pakulin, V.N.

    1979-01-01

    Considered is the operation of a typical magnetron mass spectrometer with an internal ion source and that of an inverse magnetron mass spectrometer with an external ion source. It is found that for discrimination of the same mass using the inverse design of mass spectrometers it is possible to employ either r 2 /r 1 times lesser magnetic fields at equal accelerating source-collector voltages, or r 2 /r 1 higher accelerating voltages at equal magnetic fields, as compared to the typical design (r 1 and r 2 being radii of the internal and external electrodes of the analyser, respectively). The design of an inverse-magnetron mass spectrometer is described. The mass analyzer is formed by a cylindrical electrode of 3 mm diameter and a coaxial tubular cylinder of 55 mm diameter. External to the analyzer is an ionizing chamber at the pressure of up to 5x10 -6 torr. The magnetic field along the chamber axis produced by a solenoid was 300 Oe. At the accelerating voltage of 100 V and mass 28, the spectrometer has a resolution of 30 at a half-peak height

  11. Parameter Estimation for Partial Differential Equations by Collage-Based Numerical Approximation

    Directory of Open Access Journals (Sweden)

    Xiaoyan Deng

    2009-01-01

    into a minimization problem of a function of several variables after the partial differential equation is approximated by a differential dynamical system. Then numerical schemes for solving this minimization problem are proposed, including grid approximation and ant colony optimization. The proposed schemes are applied to a parameter estimation problem for the Belousov-Zhabotinskii equation, and the results show that the proposed approximation method is efficient for both linear and nonlinear partial differential equations with respect to unknown parameters. At worst, the presented method provides an excellent starting point for traditional inversion methods that must first select a good starting point.

  12. Nonlinear approximation with dictionaries I. Direct estimates

    DEFF Research Database (Denmark)

    Gribonval, Rémi; Nielsen, Morten

    2004-01-01

    We study various approximation classes associated with m-term approximation by elements from a (possibly) redundant dictionary in a Banach space. The standard approximation class associated with the best m-term approximation is compared to new classes defined by considering m-term approximation...... with algorithmic constraints: thresholding and Chebychev approximation classes are studied, respectively. We consider embeddings of the Jackson type (direct estimates) of sparsity spaces into the mentioned approximation classes. General direct estimates are based on the geometry of the Banach space, and we prove...... that assuming a certain structure of the dictionary is sufficient and (almost) necessary to obtain stronger results. We give examples of classical dictionaries in L^p spaces and modulation spaces where our results recover some known Jackson type estimates, and discuss som new estimates they provide....

  13. Nonlinear approximation with dictionaries, I: Direct estimates

    DEFF Research Database (Denmark)

    Gribonval, Rémi; Nielsen, Morten

    We study various approximation classes associated with $m$-term approximation by elements from a (possibly redundant) dictionary in a Banach space. The standard approximation class associated with the best $m$-term approximation is compared to new classes defined by considering $m......$-term approximation with algorithmic constraints: thresholding and Chebychev approximation classes are studied respectively. We consider embeddings of the Jackson type (direct estimates) of sparsity spaces into the mentioned approximation classes. General direct estimates are based on the geometry of the Banach space......, and we prove that assuming a certain structure of the dictionary is sufficient and (almost) necessary to obtain stronger results. We give examples of classical dictionaries in $L^p$ spaces and modulation spaces where our results recover some known Jackson type estimates, and discuss som new estimates...

  14. Bounded-Degree Approximations of Stochastic Networks

    Energy Technology Data Exchange (ETDEWEB)

    Quinn, Christopher J.; Pinar, Ali; Kiyavash, Negar

    2017-06-01

    We propose algorithms to approximate directed information graphs. Directed information graphs are probabilistic graphical models that depict causal dependencies between stochastic processes in a network. The proposed algorithms identify optimal and near-optimal approximations in terms of Kullback-Leibler divergence. The user-chosen sparsity trades off the quality of the approximation against visual conciseness and computational tractability. One class of approximations contains graphs with speci ed in-degrees. Another class additionally requires that the graph is connected. For both classes, we propose algorithms to identify the optimal approximations and also near-optimal approximations, using a novel relaxation of submodularity. We also propose algorithms to identify the r-best approximations among these classes, enabling robust decision making.

  15. Multiple Scattering Model for Optical Coherence Tomography with Rytov Approximation

    KAUST Repository

    Li, Muxingzi

    2017-04-24

    Optical Coherence Tomography (OCT) is a coherence-gated, micrometer-resolution imaging technique that focuses a broadband near-infrared laser beam to penetrate into optical scattering media, e.g. biological tissues. The OCT resolution is split into two parts, with the axial resolution defined by half the coherence length, and the depth-dependent lateral resolution determined by the beam geometry, which is well described by a Gaussian beam model. The depth dependence of lateral resolution directly results in the defocusing effect outside the confocal region and restricts current OCT probes to small numerical aperture (NA) at the expense of lateral resolution near the focus. Another limitation on OCT development is the presence of a mixture of speckles due to multiple scatterers within the coherence length, and other random noise. Motivated by the above two challenges, a multiple scattering model based on Rytov approximation and Gaussian beam optics is proposed for the OCT setup. Some previous papers have adopted the first Born approximation with the assumption of small perturbation of the incident field in inhomogeneous media. The Rytov method of the same order with smooth phase perturbation assumption benefits from a wider spatial range of validity. A deconvolution method for solving the inverse problem associated with the first Rytov approximation is developed, significantly reducing the defocusing effect through depth and therefore extending the feasible range of NA.

  16. Inverse problems for difference equations with quadratic ...

    African Journals Online (AJOL)

    Inverse problems for difference equations with quadratic Eigenparameter dependent boundary conditions. Sonja Currie, Anne D. Love. Abstract. This paper inductively investigates an inverse problem for difference boundary value problems with boundary conditions that depend quadratically on the eigenparameter.

  17. Solution accelerators for large scale 3D electromagnetic inverse problems

    International Nuclear Information System (INIS)

    Newman, Gregory A.; Boggs, Paul T.

    2004-01-01

    We provide a framework for preconditioning nonlinear 3D electromagnetic inverse scattering problems using nonlinear conjugate gradient (NLCG) and limited memory (LM) quasi-Newton methods. Key to our approach is the use of an approximate adjoint method that allows for an economical approximation of the Hessian that is updated at each inversion iteration. Using this approximate Hessian as a preconditoner, we show that the preconditioned NLCG iteration converges significantly faster than the non-preconditioned iteration, as well as converging to a data misfit level below that observed for the non-preconditioned method. Similar conclusions are also observed for the LM iteration; preconditioned with the approximate Hessian, the LM iteration converges faster than the non-preconditioned version. At this time, however, we see little difference between the convergence performance of the preconditioned LM scheme and the preconditioned NLCG scheme. A possible reason for this outcome is the behavior of the line search within the LM iteration. It was anticipated that, near convergence, a step size of one would be approached, but what was observed, instead, were step lengths that were nowhere near one. We provide some insights into the reasons for this behavior and suggest further research that may improve the performance of the LM methods

  18. Fast computation of the inverse CMH model

    Science.gov (United States)

    Patel, Umesh D.; Della Torre, Edward

    2001-12-01

    A fast computational method based on differential equation approach for inverse Della Torre, Oti, Kádár (DOK) model has been extended for the inverse Complete Moving Hysteresis (CMH) model. A cobweb technique for calculating the inverse CMH model is also presented. The two techniques differ from the point of view of flexibility, accuracy, and computation time. Simulation results of the inverse computation for both methods are presented.

  19. LA INVERSION INMOBILIARIA INDIRECTA EN ESPANA.

    OpenAIRE

    Joan MONTLLOR-SERRATS; Anna M. PANOSA-GUBAU

    2013-01-01

    En este articulo se revisan los instrumentos de inversion indirecta inmobiliaria en Espana, desde la creacion en 1992 de los Fondos y Sociedades de Inversion inmobiliaria (FII y SII) hasta la creacion de la primera Sociedad de inversion del mercado inmobiliario (SOCIMI) en 2013. Se analizan las caracteristicas de los mismos y asimismo los motivos por los cuales estas figuras de inversion no han tenido mucha demanda hasta el momento, en comparacion con los REITs (Real Estate Investment Trusts)...

  20. Codimension zero laminations are inverse limits

    OpenAIRE

    Lozano Rojo, Álvaro

    2013-01-01

    The aim of the paper is to investigate the relation between inverse limit of branched manifolds and codimension zero laminations. We give necessary and sufficient conditions for such an inverse limit to be a lamination. We also show that codimension zero laminations are inverse limits of branched manifolds. The inverse limit structure allows us to show that equicontinuous codimension zero laminations preserves a distance function on transversals.

  1. Linearized versus non-linear inverse methods for seismic localization of underground sources

    DEFF Research Database (Denmark)

    Oh, Geok Lian; Jacobsen, Finn

    2013-01-01

    Difference elastic wave-field numerical method. In this paper, the accuracy and performance of the linear beamformer and nonlinear inverse methods to localize a underground seismic source are checked and compared using computer generated synthetic experimental data. © 2013 Acoustical Society of America......., and the Bayes nonlinear inversion method. The travel times used in the beamformer are derived from solving the Eikonal equation. In the linearized inversion method, we assume that the elastic waves are predominantly acoustic waves, and the acoustic approximation is applied. For the nonlinear inverse method, we...... apply the Bayesian framework where the misfit function is the posterior probability distribution of the model space. The model parameters are the location of the seismic source that we are interested in estimating. The forward problem solver applied for the nonlinear inverse method is a Finite...

  2. Three-Dimensional Inversion of Magnetotelluric Data for the Sediment–Basement Interface

    DEFF Research Database (Denmark)

    Cai, Hongzhu; Zhdanov, Michael

    2016-01-01

    and a resistive basement. Conventional inversions of MT data are aimed at determining the volumetric distribution of the conductivity within the inversion domain. The recovered distribution of the subsurface conductivity is typically diffusive, which makes it difficult to select the sediment-basement interface....... This letter develops a novel approach to 3-D MT inversion for the depth-to-basement estimate. The key to this approach is selection of the model parameterization, with the depth to basement being the major unknown parameter. In order to estimate the depth to the basement, the inversion algorithm recovers both...... the thickness and the conductivities of the sedimentary basin. The forward modeling is based on the integral equation approach. The inverse problem is solved using a regularized conjugate gradient method. The Fréchet derivative matrix is calculated based on quasi-Born approximation. The developed method...

  3. Inference of the bottom properties in shallow ice approximation models

    Science.gov (United States)

    Monnier, J.; des Boscs, P.-E.

    2017-11-01

    This study proposes a new inverse method to infer the bottom topography and the friction coefficient in the shallow ice approximation (SIA) model (lubrication type models for generalized Newtonian fluid flows). The method is based on the definition of three sub-regimes and an a priori slip ratio law. Next, explicit calculations provide a first depth estimation for each sub-regime, and this first estimation can be improved by solving an elliptic linear-quadratic optimal control problem (variational assimilation of the surface measurements e.g. by satellite). The friction field is a by-product of the depth inverse method—it can be explicitly deduced. Numerical results considering multi-regime numerical flows demonstrate the robustness of the method even in the presence of uncertain surface measurements, and independently of the depth measurement locations (the contrary is found, if inverting the regularized depth-averaged mass equation only). Moreover, the few derived depth estimations make it possible to determine the adequate slope scale in the SIA models.

  4. Moving Least Squares Method for a One-Dimensional Parabolic Inverse Problem

    Directory of Open Access Journals (Sweden)

    Baiyu Wang

    2014-01-01

    Full Text Available This paper investigates the numerical solution of a class of one-dimensional inverse parabolic problems using the moving least squares approximation; the inverse problem is the determination of an unknown source term depending on time. The collocation method is used for solving the equation; some numerical experiments are presented and discussed to illustrate the stability and high efficiency of the method.

  5. Ultra-Scalable Algorithms for Large-Scale Uncertainty Quantification in Inverse Wave Propagation

    Science.gov (United States)

    2016-03-04

    MCMC sampling methods for posteriors for Bayesian inverse wave propagation problems. We developed a so-called randomized maximum a posteriori (rMAP...method for generating approximate samples of posteriors in high dimensional Bayesian inverse problems governed by large-scale forward problems, with...equivalent for a linear parameter-to-observable map. Nu- merical results indicated the potential of the rMAP approach in posterior sampling of nonlinear

  6. Inversion: A Most Useful Kind of Transformation.

    Science.gov (United States)

    Dubrovsky, Vladimir

    1992-01-01

    The transformation assigning to every point its inverse with respect to a circle with given radius and center is called an inversion. Discusses inversion with respect to points, circles, angles, distances, space, and the parallel postulate. Exercises related to these topics are included. (MDH)

  7. Equilibrium of a high current electron beam of the THETA-pinch type in ap inverse coaxial magnetically insulated diode

    International Nuclear Information System (INIS)

    Agafonov, A.V.

    1982-01-01

    A possibility of uSing inverse coaxial magnetically insulated diodes for creating megagauss magnetic fields is discussed. In an inverse diode placed in an external magnetic field the beam behaves like a diamagnetic displacing the magnetic field inwards by the radius. It is shown that at the diode voltage approximately 10 MV ana anode-cathode radii relation < or aaproximately 0.1 magnetic fields approximately 1-10 MGs may be obtained

  8. Real-time inverse kinematics and inverse dynamics for lower limb applications using OpenSim.

    Science.gov (United States)

    Pizzolato, C; Reggiani, M; Modenese, L; Lloyd, D G

    2017-03-01

    Real-time estimation of joint angles and moments can be used for rapid evaluation in clinical, sport, and rehabilitation contexts. However, real-time calculation of kinematics and kinetics is currently based on approximate solutions or generic anatomical models. We present a real-time system based on OpenSim solving inverse kinematics and dynamics without simplifications at 2000 frame per seconds with less than 31.5 ms of delay. We describe the software architecture, sensitivity analyses to minimise delays and errors, and compare offline and real-time results. This system has the potential to strongly impact current rehabilitation practices enabling the use of personalised musculoskeletal models in real-time.

  9. Méthodes de réduction de modèle pour les équations paramétrées -- Applications à la quantification d’incertitude.

    OpenAIRE

    Zahm, Olivier

    2015-01-01

    Model order reduction has become an inescapable tool for the solution of high dimensional parameter-dependent equations arising in uncertainty quantification, optimization or inverse problems. In this thesis we focus on low rank approximation methods, in particular on reduced basis methods and on tensor approximation methods.The approximation obtained by Galerkin projections may be inaccurate when the operator is ill-conditioned. For projection based methods, we propose preconditioners built ...

  10. Multiparameter Elastic Full Waveform Inversion with Facies-based Constraints

    Science.gov (United States)

    Zhang, Zhen-dong; Alkhalifah, Tariq; Naeini, Ehsan Zabihi; Sun, Bingbing

    2018-03-01

    Full waveform inversion (FWI) incorporates all the data characteristics to estimate the parameters described by the assumed physics of the subsurface. However, current efforts to utilize full waveform inversion beyond improved acoustic imaging, like in reservoir delineation, faces inherent challenges related to the limited resolution and the potential trade-off between the elastic model parameters. Some anisotropic parameters are insufficiently updated because of their minor contributions to the surface collected data. Adding rock physics constraints to the inversion helps mitigate such limited sensitivity, but current approaches to add such constraints are based on including them as a priori knowledge mostly valid around the well or as a global constraint for the whole area. Since similar rock formations inside the Earth admit consistent elastic properties and relative values of elasticity and anisotropy parameters (this enables us to define them as a seismic facies), utilizing such localized facies information in FWI can improve the resolution of inverted parameters. We propose a novel approach to use facies-based constraints in both isotropic and anisotropic elastic FWI. We invert for such facies using Bayesian theory and update them at each iteration of the inversion using both the inverted models and a prior information. We take the uncertainties of the estimated parameters (approximated by radiation patterns) into consideration and improve the quality of estimated facies maps. Four numerical examples corresponding to different acquisition, physical assumptions and model circumstances are used to verify the effectiveness of the proposed method.

  11. Multiparameter Elastic Full Waveform Inversion with Facies-based Constraints

    KAUST Repository

    Zhang, Zhendong

    2018-03-20

    Full waveform inversion (FWI) incorporates all the data characteristics to estimate the parameters described by the assumed physics of the subsurface. However, current efforts to utilize full waveform inversion beyond improved acoustic imaging, like in reservoir delineation, faces inherent challenges related to the limited resolution and the potential trade-off between the elastic model parameters. Some anisotropic parameters are insufficiently updated because of their minor contributions to the surface collected data. Adding rock physics constraints to the inversion helps mitigate such limited sensitivity, but current approaches to add such constraints are based on including them as a priori knowledge mostly valid around the well or as a global constraint for the whole area. Since similar rock formations inside the Earth admit consistent elastic properties and relative values of elasticity and anisotropy parameters (this enables us to define them as a seismic facies), utilizing such localized facies information in FWI can improve the resolution of inverted parameters. We propose a novel approach to use facies-based constraints in both isotropic and anisotropic elastic FWI. We invert for such facies using Bayesian theory and update them at each iteration of the inversion using both the inverted models and a prior information. We take the uncertainties of the estimated parameters (approximated by radiation patterns) into consideration and improve the quality of estimated facies maps. Four numerical examples corresponding to different acquisition, physical assumptions and model circumstances are used to verify the effectiveness of the proposed method.

  12. Wave-equation Qs Inversion of Skeletonized Surface Waves

    KAUST Repository

    Li, Jing

    2017-02-08

    We present a skeletonized inversion method that inverts surface-wave data for the Qs quality factor. Similar to the inversion of dispersion curves for the S-wave velocity model, the complicated surface-wave arrivals are skeletonized as simpler data, namely the amplitude spectra of the windowed Rayleigh-wave arrivals. The optimal Qs model is the one that minimizes the difference in the peak frequencies of the predicted and observed Rayleigh wave arrivals using a gradient-based wave-equation optimization method. Solutions to the viscoelastic wave-equation are used to compute the predicted Rayleigh-wave arrivals and the misfit gradient at every iteration. This procedure, denoted as wave-equation Qs inversion (WQs), does not require the assumption of a layered model and tends to have fast and robust convergence compared to full waveform inversion (FWI). Numerical examples with synthetic and field data demonstrate that the WQs method can accurately invert for a smoothed approximation to the subsurface Qs distribution as long as the Vs model is known with sufficient accuracy.

  13. ANALYTIC APPROXIMATE SEISMOLOGY OF PROPAGATING MAGNETOHYDRODYNAMIC WAVES IN THE SOLAR CORONA

    Energy Technology Data Exchange (ETDEWEB)

    Goossens, M.; Soler, R. [Centre for Mathematical Plasma Astrophysics, Department of Mathematics, KU Leuven, Celestijnenlaan 200B, B-3001 Leuven (Belgium); Arregui, I. [Instituto de Astrofisica de Canarias, Via Lactea s/n, E-38205 La Laguna, Tenerife (Spain); Terradas, J., E-mail: marcel.goossens@wis.kuleuven.be [Solar Physics Group, Departament de Fisica, Universitat de les Illes Balears, E-07122 Palma de Mallorca (Spain)

    2012-12-01

    Observations show that propagating magnetohydrodynamic (MHD) waves are ubiquitous in the solar atmosphere. The technique of MHD seismology uses the wave observations combined with MHD wave theory to indirectly infer physical parameters of the solar atmospheric plasma and magnetic field. Here, we present an analytical seismological inversion scheme for propagating MHD waves. This scheme uses the observational information on wavelengths and damping lengths in a consistent manner, along with observed values of periods or phase velocities, and is based on approximate asymptotic expressions for the theoretical values of wavelengths and damping lengths. The applicability of the inversion scheme is discussed and an example is given.

  14. Two hybrid regularization frameworks for solving the electrocardiography inverse problem

    Energy Technology Data Exchange (ETDEWEB)

    Jiang Mingfeng; Xia Ling; Shou Guofa; Liu Feng [Department of Biomedical Engineering, Zhejiang University, Hangzhou 310027 (China); Crozier, Stuart [School of Information Technology and Electrical Engineering, University of Queensland, St. Lucia, Brisbane, Queensland 4072 (Australia)], E-mail: xialing@zju.edu.cn

    2008-09-21

    In this paper, two hybrid regularization frameworks, LSQR-Tik and Tik-LSQR, which integrate the properties of the direct regularization method (Tikhonov) and the iterative regularization method (LSQR), have been proposed and investigated for solving ECG inverse problems. The LSQR-Tik method is based on the Lanczos process, which yields a sequence of small bidiagonal systems to approximate the original ill-posed problem and then the Tikhonov regularization method is applied to stabilize the projected problem. The Tik-LSQR method is formulated as an iterative LSQR inverse, augmented with a Tikhonov-like prior information term. The performances of these two hybrid methods are evaluated using a realistic heart-torso model simulation protocol, in which the heart surface source method is employed to calculate the simulated epicardial potentials (EPs) from the action potentials (APs), and then the acquired EPs are used to calculate simulated body surface potentials (BSPs). The results show that the regularized solutions obtained by the LSQR-Tik method are approximate to those of the Tikhonov method, the computational cost of the LSQR-Tik method, however, is much less than that of the Tikhonov method. Moreover, the Tik-LSQR scheme can reconstruct the epcicardial potential distribution more accurately, specifically for the BSPs with large noisy cases. This investigation suggests that hybrid regularization methods may be more effective than separate regularization approaches for ECG inverse problems.

  15. Two hybrid regularization frameworks for solving the electrocardiography inverse problem

    Science.gov (United States)

    Jiang, Mingfeng; Xia, Ling; Shou, Guofa; Liu, Feng; Crozier, Stuart

    2008-09-01

    In this paper, two hybrid regularization frameworks, LSQR-Tik and Tik-LSQR, which integrate the properties of the direct regularization method (Tikhonov) and the iterative regularization method (LSQR), have been proposed and investigated for solving ECG inverse problems. The LSQR-Tik method is based on the Lanczos process, which yields a sequence of small bidiagonal systems to approximate the original ill-posed problem and then the Tikhonov regularization method is applied to stabilize the projected problem. The Tik-LSQR method is formulated as an iterative LSQR inverse, augmented with a Tikhonov-like prior information term. The performances of these two hybrid methods are evaluated using a realistic heart-torso model simulation protocol, in which the heart surface source method is employed to calculate the simulated epicardial potentials (EPs) from the action potentials (APs), and then the acquired EPs are used to calculate simulated body surface potentials (BSPs). The results show that the regularized solutions obtained by the LSQR-Tik method are approximate to those of the Tikhonov method, the computational cost of the LSQR-Tik method, however, is much less than that of the Tikhonov method. Moreover, the Tik-LSQR scheme can reconstruct the epcicardial potential distribution more accurately, specifically for the BSPs with large noisy cases. This investigation suggests that hybrid regularization methods may be more effective than separate regularization approaches for ECG inverse problems.

  16. Multilevel Monte Carlo in Approximate Bayesian Computation

    KAUST Repository

    Jasra, Ajay

    2017-02-13

    In the following article we consider approximate Bayesian computation (ABC) inference. We introduce a method for numerically approximating ABC posteriors using the multilevel Monte Carlo (MLMC). A sequential Monte Carlo version of the approach is developed and it is shown under some assumptions that for a given level of mean square error, this method for ABC has a lower cost than i.i.d. sampling from the most accurate ABC approximation. Several numerical examples are given.

  17. Approximate unitary equivalence of normaloid type operators

    OpenAIRE

    Zhu, Sen

    2015-01-01

    In this paper, we explore approximate unitary equivalence of normaloid operators and classify several normaloid type operators including transaloid operators, polynomial-normaloid operators and von Neumann operators up to approximate unitary equivalence. As an application, we explore approximation of transaloid operators with closed numerical ranges. Among other things, it is proved that those transaloid operators with closed numerical ranges are norm dense in the class of transaloid operators.

  18. Uniform analytic approximation of Wigner rotation matrices

    Science.gov (United States)

    Hoffmann, Scott E.

    2018-02-01

    We derive the leading asymptotic approximation, for low angle θ, of the Wigner rotation matrix elements, dm1m2 j(θ ) , uniform in j, m1, and m2. The result is in terms of a Bessel function of integer order. We numerically investigate the error for a variety of cases and find that the approximation can be useful over a significant range of angles. This approximation has application in the partial wave analysis of wavepacket scattering.

  19. Isomorphs in the phase diagram of a model liquid without inverse power law repulsion

    DEFF Research Database (Denmark)

    Veldhorst, Arnold Adriaan; Bøhling, Lasse; Dyre, J. C.

    2012-01-01

    scattering function are calculated. The results are shown to reflect a hidden scale invariance; despite its exponential repulsion the Buckingham potential is well approximated by an inverse power-law plus a linear term in the region of the first peak of the radial distribution function. As a consequence...... the dynamics of the viscous Buckingham liquid is mimicked by a corresponding model with purely repulsive inverse-power-law interactions. The results presented here closely resemble earlier results for Lennard-Jones type liquids, demonstrating that the existence of strong correlations and isomorphs does...... not depend critically on the mathematical form of the repulsion being an inverse power law....

  20. Inversion of seismic data: how to take the correlated nature of noise into account; Inversion de donnees sismiques: prise en compte de la nature correlee du bruit

    Energy Technology Data Exchange (ETDEWEB)

    Renard, F.

    2003-01-01

    The goal of seismic inversion is to recover an Earth model that best fits some observed data. To reach that goal, we have to minimize an objective function that measures the amplitude of the misfits according to a norm to be chosen in data space. In general, the used norm is the L2 norm. Unfortunately, such a norm is not adapted to data corrupted by correlated noise: the noise is in that case inverted as signal and the inversion results are unacceptable. The goal of this thesis is to obtain satisfactory results to the inverse problem in that situation. For this purpose, we study two inverse problems: reflection tomography and waveform inversion. In reflection tomography, we propose a new formulation of the continuum inverse problem which relies on a H1 norm in data space. This allows us to account for the correlated nature of the noise that corrupts the kinematic information. However, this norm does not give more satisfactory results than the ones obtained with the classical formalism. This is why, for sake of simplicity, we recommend to use this classical formalism. Then we try to understand how to properly sample the kinematic information so as to obtain an accurate approximation of the continuum inverse problem. In waveform inversion, we propose to directly invert data corrupted by some correlated noise. A first idea consists in rejecting the noise in the residues. In that goal, we can use a semi-norm to formulate the inverse problem. This technique gives very good results, except when the data are corrupted by random noise. Thus we propose a second method which consists in retrieving, by solving an inverse problem, the signal and the noise whose sum best fits the data. This technique gives very satisfactory results, even if some random noise pollutes the data, and is moreover solved, thanks to an original algorithm, in a very efficient way. (author)

  1. A Note on Generalized Approximation Property

    Directory of Open Access Journals (Sweden)

    Antara Bhar

    2013-01-01

    Full Text Available We introduce a notion of generalized approximation property, which we refer to as --AP possessed by a Banach space , corresponding to an arbitrary Banach sequence space and a convex subset of , the class of bounded linear operators on . This property includes approximation property studied by Grothendieck, -approximation property considered by Sinha and Karn and Delgado et al., and also approximation property studied by Lissitsin et al. We characterize a Banach space having --AP with the help of -compact operators, -nuclear operators, and quasi--nuclear operators. A particular case for ( has also been characterized.

  2. Local density approximations for relativistic exchange energies

    International Nuclear Information System (INIS)

    MacDonald, A.H.

    1986-01-01

    The use of local density approximations to approximate exchange interactions in relativistic electron systems is reviewed. Particular attention is paid to the physical content of these exchange energies by discussing results for the uniform relativistic electron gas from a new point of view. Work on applying these local density approximations in atoms and solids is reviewed and it is concluded that good accuracy is usually possible provided self-interaction corrections are applied. The local density approximations necessary for spin-polarized relativistic systems are discussed and some new results are presented

  3. Approximate maximum parsimony and ancestral maximum likelihood.

    Science.gov (United States)

    Alon, Noga; Chor, Benny; Pardi, Fabio; Rapoport, Anat

    2010-01-01

    We explore the maximum parsimony (MP) and ancestral maximum likelihood (AML) criteria in phylogenetic tree reconstruction. Both problems are NP-hard, so we seek approximate solutions. We formulate the two problems as Steiner tree problems under appropriate distances. The gist of our approach is the succinct characterization of Steiner trees for a small number of leaves for the two distances. This enables the use of known Steiner tree approximation algorithms. The approach leads to a 16/9 approximation ratio for AML and asymptotically to a 1.55 approximation ratio for MP.

  4. Inversion of GPS meteorology data

    Directory of Open Access Journals (Sweden)

    K. Hocke

    Full Text Available The GPS meteorology (GPS/MET experiment, led by the Universities Corporation for Atmospheric Research (UCAR, consists of a GPS receiver aboard a low earth orbit (LEO satellite which was launched on 3 April 1995. During a radio occultation the LEO satellite rises or sets relative to one of the 24 GPS satellites at the Earth's horizon. Thereby the atmospheric layers are successively sounded by radio waves which propagate from the GPS satellite to the LEO satellite. From the observed phase path increases, which are due to refraction of the radio waves by the ionosphere and the neutral atmosphere, the atmospheric parameter refractivity, density, pressure and temperature are calculated with high accuracy and resolution (0.5–1.5 km. In the present study, practical aspects of the GPS/MET data analysis are discussed. The retrieval is based on the Abelian integral inversion of the atmospheric bending angle profile into the refractivity index profile. The problem of the upper boundary condition of the Abelian integral is described by examples. The statistical optimization approach which is applied to the data above 40 km and the use of topside bending angle profiles from model atmospheres stabilize the inversion. The retrieved temperature profiles are compared with corresponding profiles which have already been calculated by scientists of UCAR and Jet Propulsion Laboratory (JPL, using Abelian integral inversion too. The comparison shows that in some cases large differences occur (5 K and more. This is probably due to different treatment of the upper boundary condition, data runaways and noise. Several temperature profiles with wavelike structures at tropospheric and stratospheric heights are shown. While the periodic structures at upper stratospheric heights could be caused by residual errors of the ionospheric correction method, the periodic temperature fluctuations at heights below 30 km are most likely caused by atmospheric waves (vertically

  5. Inverse problem in transformation optics

    DEFF Research Database (Denmark)

    Novitsky, Andrey

    2011-01-01

    . We offer the solution of some sort of inverse problem: starting from the fields in the invisibility cloak we directly derive the permittivity and permeability tensors of the cloaking shell. This approach can be useful for finding material parameters for the specified electromagnetic fields......The straightforward method of transformation optics implies that one starts from the coordinate transformation and determines the Jacobian matrix, the fields and material parameters of the cloak. However, the coordinate transformation appears as an optional function: it is not necessary to know it...... in the cloaking shell without knowing the coordinate transformation....

  6. Iterative optimization in inverse problems

    CERN Document Server

    Byrne, Charles L

    2014-01-01

    Iterative Optimization in Inverse Problems brings together a number of important iterative algorithms for medical imaging, optimization, and statistical estimation. It incorporates recent work that has not appeared in other books and draws on the author's considerable research in the field, including his recently developed class of SUMMA algorithms. Related to sequential unconstrained minimization methods, the SUMMA class includes a wide range of iterative algorithms well known to researchers in various areas, such as statistics and image processing. Organizing the topics from general to more

  7. Domain decomposition method for nonconforming finite element approximations of anisotropic elliptic problems on nonmatching grids

    Energy Technology Data Exchange (ETDEWEB)

    Maliassov, S.Y. [Texas A& M Univ., College Station, TX (United States)

    1996-12-31

    An approach to the construction of an iterative method for solving systems of linear algebraic equations arising from nonconforming finite element discretizations with nonmatching grids for second order elliptic boundary value problems with anisotropic coefficients is considered. The technique suggested is based on decomposition of the original domain into nonoverlapping subdomains. The elliptic problem is presented in the macro-hybrid form with Lagrange multipliers at the interfaces between subdomains. A block diagonal preconditioner is proposed which is spectrally equivalent to the original saddle point matrix and has the optimal order of arithmetical complexity. The preconditioner includes blocks for preconditioning subdomain and interface problems. It is shown that constants of spectral equivalence axe independent of values of coefficients and mesh step size.

  8. Traveltime approximations for transversely isotropic media with an inhomogeneous background

    KAUST Repository

    Alkhalifah, Tariq

    2011-05-01

    A transversely isotropic (TI) model with a tilted symmetry axis is regarded as one of the most effective approximations to the Earth subsurface, especially for imaging purposes. However, we commonly utilize this model by setting the axis of symmetry normal to the reflector. This assumption may be accurate in many places, but deviations from this assumption will cause errors in the wavefield description. Using perturbation theory and Taylor\\'s series, I expand the solutions of the eikonal equation for 2D TI media with respect to the independent parameter θ, the angle the tilt of the axis of symmetry makes with the vertical, in a generally inhomogeneous TI background with a vertical axis of symmetry. I do an additional expansion in terms of the independent (anellipticity) parameter in a generally inhomogeneous elliptically anisotropic background medium. These new TI traveltime solutions are given by expansions in and θ with coefficients extracted from solving linear first-order partial differential equations. Pade approximations are used to enhance the accuracy of the representation by predicting the behavior of the higher-order terms of the expansion. A simplification of the expansion for homogenous media provides nonhyperbolic moveout descriptions of the traveltime for TI models that are more accurate than other recently derived approximations. In addition, for 3D media, I develop traveltime approximations using Taylor\\'s series type of expansions in the azimuth of the axis of symmetry. The coefficients of all these expansions can also provide us with the medium sensitivity gradients (Jacobian) for nonlinear tomographic-based inversion for the tilt in the symmetry axis. © 2011 Society of Exploration Geophysicists.

  9. Computing Low-Rank Approximation of a Dense Matrix on Multicore CPUs with a GPU and Its Application to Solving a Hierarchically Semiseparable Linear System of Equations

    Directory of Open Access Journals (Sweden)

    Ichitaro Yamazaki

    2015-01-01

    of their low-rank properties. To compute a low-rank approximation of a dense matrix, in this paper, we study the performance of QR factorization with column pivoting or with restricted pivoting on multicore CPUs with a GPU. We first propose several techniques to reduce the postprocessing time, which is required for restricted pivoting, on a modern CPU. We then examine the potential of using a GPU to accelerate the factorization process with both column and restricted pivoting. Our performance results on two eight-core Intel Sandy Bridge CPUs with one NVIDIA Kepler GPU demonstrate that using the GPU, the factorization time can be reduced by a factor of more than two. In addition, to study the performance of our implementations in practice, we integrate them into a recently developed software StruMF which algebraically exploits such low-rank structures for solving a general sparse linear system of equations. Our performance results for solving Poisson's equations demonstrate that the proposed techniques can significantly reduce the preconditioner construction time of StruMF on the CPUs, and the construction time can be further reduced by 10%–50% using the GPU.

  10. Fast breeder reactor kinetics. An inverse problem - 135

    International Nuclear Information System (INIS)

    Seleznev, E.F.; Belov, A.A.; Mushkaterov, A.A.; Matveenko, I.P.; Zhukov, A.M.; Raskatch, K.F.

    2010-01-01

    An analysis of solution of the spatial reactor kinetics neutron-transfer equation using a fast reactor as an example is presented in this paper. To solve the spatial reactor kinetics equation in three-dimensional geometry in multi-energy group-diffusion approximation, a program calculated module TIMER was created. The number of groups of delayed neutron precursor concentrations varies from 6 to 8. When solving a transient neutron-transfer problem, two specific tasks are distinguished. The first of them is a direct problem wherein the neutron flux density and its derivatives such as reactor power etc. are determined at each time step. The second (inverse) problem exists for the point-kinetics equation where the reactor reactivity is calculated using the known dependence of reactor power on time. The paper presented focuses on solution of the inverse problem using experiment calculations for BFS-105 critical assembly. (authors)

  11. A variational Bayesian method to inverse problems with impulsive noise

    KAUST Repository

    Jin, Bangti

    2012-01-01

    We propose a novel numerical method for solving inverse problems subject to impulsive noises which possibly contain a large number of outliers. The approach is of Bayesian type, and it exploits a heavy-tailed t distribution for data noise to achieve robustness with respect to outliers. A hierarchical model with all hyper-parameters automatically determined from the given data is described. An algorithm of variational type by minimizing the Kullback-Leibler divergence between the true posteriori distribution and a separable approximation is developed. The numerical method is illustrated on several one- and two-dimensional linear and nonlinear inverse problems arising from heat conduction, including estimating boundary temperature, heat flux and heat transfer coefficient. The results show its robustness to outliers and the fast and steady convergence of the algorithm. © 2011 Elsevier Inc.

  12. LHC Report: 2 inverse femtobarns!

    CERN Multimedia

    Mike Lamont for the LHC Team

    2011-01-01

    The LHC is enjoying a confluence of twos. This morning (Friday 5 August) we passed 2 inverse femtobarns delivered in 2011; the peak luminosity is now just over 2 x1033 cm-2s-1; and recently fill 2000 was in for nearly 22 hours and delivered around 90 inverse picobarns, almost twice 2010's total.   In order to increase the luminosity we can increase of number of bunches, increase the number of particles per bunch, or decrease the transverse beam size at the interaction point. The beam size can be tackled in two ways: either reduce the size of the injected bunches or squeeze harder with the quadrupole magnets situated on either side of the experiments. Having increased the number of bunches to 1380, the maximum possible with a 50 ns bunch spacing, a one day meeting in Crozet decided to explore the other possibilities. The size of the beams coming from the injectors has been reduced to the minimum possible. This has brought an increase in the peak luminosity of about 50% and the 2 x 1033 cm...

  13. Inverse problems in systems biology

    International Nuclear Information System (INIS)

    Engl, Heinz W; Lu, James; Müller, Stefan; Flamm, Christoph; Schuster, Peter; Kügler, Philipp

    2009-01-01

    Systems biology is a new discipline built upon the premise that an understanding of how cells and organisms carry out their functions cannot be gained by looking at cellular components in isolation. Instead, consideration of the interplay between the parts of systems is indispensable for analyzing, modeling, and predicting systems' behavior. Studying biological processes under this premise, systems biology combines experimental techniques and computational methods in order to construct predictive models. Both in building and utilizing models of biological systems, inverse problems arise at several occasions, for example, (i) when experimental time series and steady state data are used to construct biochemical reaction networks, (ii) when model parameters are identified that capture underlying mechanisms or (iii) when desired qualitative behavior such as bistability or limit cycle oscillations is engineered by proper choices of parameter combinations. In this paper we review principles of the modeling process in systems biology and illustrate the ill-posedness and regularization of parameter identification problems in that context. Furthermore, we discuss the methodology of qualitative inverse problems and demonstrate how sparsity enforcing regularization allows the determination of key reaction mechanisms underlying the qualitative behavior. (topical review)

  14. Non-Linear Approximation of Bayesian Update

    KAUST Repository

    Litvinenko, Alexander

    2016-06-23

    We develop a non-linear approximation of expensive Bayesian formula. This non-linear approximation is applied directly to Polynomial Chaos Coefficients. In this way, we avoid Monte Carlo sampling and sampling error. We can show that the famous Kalman Update formula is a particular case of this update.

  15. Diagonal Pade approximations for initial value problems

    International Nuclear Information System (INIS)

    Reusch, M.F.; Ratzan, L.; Pomphrey, N.; Park, W.

    1987-06-01

    Diagonal Pade approximations to the time evolution operator for initial value problems are applied in a novel way to the numerical solution of these problems by explicitly factoring the polynomials of the approximation. A remarkable gain over conventional methods in efficiency and accuracy of solution is obtained. 20 refs., 3 figs., 1 tab

  16. Simultaneous approximation in scales of Banach spaces

    International Nuclear Information System (INIS)

    Bramble, J.H.; Scott, R.

    1978-01-01

    The problem of verifying optimal approximation simultaneously in different norms in a Banach scale is reduced to verification of optimal approximation in the highest order norm. The basic tool used is the Banach space interpolation method developed by Lions and Peetre. Applications are given to several problems arising in the theory of finite element methods

  17. Approximation properties of fine hyperbolic graphs

    Indian Academy of Sciences (India)

    2016-08-26

    Aug 26, 2016 ... In this paper, we propose a definition of approximation property which is called the metric invariant translation approximation property for a countable discrete metric space. Moreover, we use ... Department of Applied Mathematics, Shanghai Finance University, Shanghai 201209, People's Republic of China ...

  18. Nonlinear approximation with general wave packets

    DEFF Research Database (Denmark)

    Borup, Lasse; Nielsen, Morten

    2005-01-01

    We study nonlinear approximation in the Triebel-Lizorkin spaces with dictionaries formed by dilating and translating one single function g. A general Jackson inequality is derived for best m-term approximation with such dictionaries. In some special cases where g has a special structure, a complete...

  19. Quirks of Stirling's Approximation

    Science.gov (United States)

    Macrae, Roderick M.; Allgeier, Benjamin M.

    2013-01-01

    Stirling's approximation to ln "n"! is typically introduced to physical chemistry students as a step in the derivation of the statistical expression for the entropy. However, naive application of this approximation leads to incorrect conclusions. In this article, the problem is first illustrated using a familiar "toy…

  20. On approximating multi-criteria TSP

    NARCIS (Netherlands)

    Manthey, Bodo; Albers, S.; Marion, J.-Y.

    2009-01-01

    We present approximation algorithms for almost all variants of the multi-criteria traveling salesman problem (TSP), whose performances are independent of the number $k$ of criteria and come close to the approximation ratios obtained for TSP with a single objective function. We present randomized

  1. On approximating multi-criteria TSP

    NARCIS (Netherlands)

    Manthey, Bodo

    We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP). First, we devise randomized approximation algorithms for multicriteria maximum traveling salesman problems (Max-TSP). For multicriteria Max-STSP where the edge weights have to be

  2. Boundary Value Problems and Approximate Solutions ...

    African Journals Online (AJOL)

    In this paper, we discuss about some basic things of boundary value problems. Secondly, we study boundary conditions involving derivatives and obtain finite difference approximations of partial derivatives of boundary value problems. The last section is devoted to determine an approximate solution for boundary value ...

  3. Polynomial approximation approach to transient heat conduction ...

    African Journals Online (AJOL)

    This work reports polynomial approximation approach to transient heat conduction in a long slab, long cylinder and sphere with linear internal heat generation. It has been shown that the polynomial approximation method is able to calculate average temperature as a function of time for higher value of Biot numbers.

  4. Approximation algorithms for guarding holey polygons ...

    African Journals Online (AJOL)

    Guarding edges of polygons is a version of art gallery problem.The goal is finding the minimum number of guards to cover the edges of a polygon. This problem is NP-hard, and to our knowledge there are approximation algorithms just for simple polygons. In this paper we present two approximation algorithms for guarding ...

  5. Similarity based approximate reasoning: fuzzy control

    NARCIS (Netherlands)

    Raha, S.; Hossain, A.; Ghosh, S.

    2008-01-01

    This paper presents an approach to similarity based approximate reasoning that elucidates the connection between similarity and existing approaches to inference in approximate reasoning methodology. A set of axioms is proposed to get a reasonable measure of similarity between two fuzzy sets. The

  6. Improved Dutch Roll Approximation for Hypersonic Vehicle

    Directory of Open Access Journals (Sweden)

    Liang-Liang Yin

    2014-06-01

    Full Text Available An improved dutch roll approximation for hypersonic vehicle is presented. From the new approximations, the dutch roll frequency is shown to be a function of the stability axis yaw stability and the dutch roll damping is mainly effected by the roll damping ratio. In additional, an important parameter called roll-to-yaw ratio is obtained to describe the dutch roll mode. Solution shows that large-roll-to-yaw ratio is the generate character of hypersonic vehicle, which results the large error for the practical approximation. Predictions from the literal approximations derived in this paper are compared with actual numerical values for s example hypersonic vehicle, results show the approximations work well and the error is below 10 %.

  7. Approximate error conjugation gradient minimization methods

    Science.gov (United States)

    Kallman, Jeffrey S

    2013-05-21

    In one embodiment, a method includes selecting a subset of rays from a set of all rays to use in an error calculation for a constrained conjugate gradient minimization problem, calculating an approximate error using the subset of rays, and calculating a minimum in a conjugate gradient direction based on the approximate error. In another embodiment, a system includes a processor for executing logic, logic for selecting a subset of rays from a set of all rays to use in an error calculation for a constrained conjugate gradient minimization problem, logic for calculating an approximate error using the subset of rays, and logic for calculating a minimum in a conjugate gradient direction based on the approximate error. In other embodiments, computer program products, methods, and systems are described capable of using approximate error in constrained conjugate gradient minimization problems.

  8. Inverse problems and inverse scattering of plane waves

    CERN Document Server

    Ghosh Roy, Dilip N

    2001-01-01

    The purpose of this text is to present the theory and mathematics of inverse scattering, in a simple way, to the many researchers and professionals who use it in their everyday research. While applications range across a broad spectrum of disciplines, examples in this text will focus primarly, but not exclusively, on acoustics. The text will be especially valuable for those applied workers who would like to delve more deeply into the fundamentally mathematical character of the subject matter.Practitioners in this field comprise applied physicists, engineers, and technologists, whereas the theory is almost entirely in the domain of abstract mathematics. This gulf between the two, if bridged, can only lead to improvement in the level of scholarship in this highly important discipline. This is the book''s primary focus.

  9. A new parameterization for waveform inversion in acoustic orthorhombic media

    KAUST Repository

    Masmoudi, Nabil

    2016-05-26

    Orthorhombic anisotropic model inversion is extra challenging because of the multiple parameter nature of the inversion problem. The high number of parameters required to describe the medium exerts considerable trade-off and additional nonlinearity to a full-waveform inversion (FWI) application. Choosing a suitable set of parameters to describe the model and designing an effective inversion strategy can help in mitigating this problem. Using the Born approximation, which is the central ingredient of the FWI update process, we have derived radiation patterns for the different acoustic orthorhombic parameterizations. Analyzing the angular dependence of scattering (radiation patterns) of the parameters of different parameterizations starting with the often used Thomsen-Tsvankin parameterization, we have assessed the potential trade-off between the parameters and the resolution in describing the data and inverting for the parameters. The analysis led us to introduce new parameters ϵd, δd, and ηd, which have azimuthally dependent radiation patterns, but keep the scattering potential of the transversely isotropic parameters stationary with azimuth (azimuth independent). The novel parameters ϵd, δd, and ηd are dimensionless and represent a measure of deviation between the vertical planes in orthorhombic anisotropy. Therefore, these deviation parameters offer a new parameterization style for an acoustic orthorhombic medium described by six parameters: three vertical transversely isotropic (VTI) parameters, two deviation parameters, and one parameter describing the anisotropy in the horizontal symmetry plane. The main feature of any parameterization based on the deviation parameters, is the azimuthal independency of the modeled data with respect to the VTI parameters, which allowed us to propose practical inversion strategies based on our experience with the VTI parameters. This feature of the new parameterization style holds for even the long-wavelength components of

  10. The tendon approximator device in traumatic injuries.

    Science.gov (United States)

    Forootan, Kamal S; Karimi, Hamid; Forootan, Nazilla-Sadat S

    2015-01-01

    Precise and tension-free approximation of two tendon endings is the key predictor of outcomes following tendon lacerations and repairs. We evaluate the efficacy of a new tendon approximator device in tendon laceration repairs. In a comparative study, we used our new tendon approximator device in 99 consecutive patients with laceration of 266 tendons who attend a university hospital and evaluated the operative time to repair the tendons, surgeons' satisfaction as well as patient's outcomes in a long-term follow-up. Data were compared with the data of control patients undergoing tendon repair by conventional method. Totally 266 tendons were repaired by approximator device and 199 tendons by conventional technique. 78.7% of patients in first group were male and 21.2% were female. In approximator group 38% of patients had secondary repair of cut tendons and 62% had primary repair. Patients were followed for a mean period of 3years (14-60 months). Time required for repair of each tendon was significantly reduced with the approximator device (2 min vs. 5.5 min, ptendon repair were identical in the two groups and were not significantly different. 1% of tendons in group A and 1.2% in group B had rupture that was not significantly different. The new nerve approximator device is cheap, feasible to use and reduces the time of tendon repair with sustained outcomes comparable to the conventional methods.

  11. Hardness and Approximation for Network Flow Interdiction

    OpenAIRE

    Chestnut, Stephen R.; Zenklusen, Rico

    2015-01-01

    In the Network Flow Interdiction problem an adversary attacks a network in order to minimize the maximum s-t-flow. Very little is known about the approximatibility of this problem despite decades of interest in it. We present the first approximation hardness, showing that Network Flow Interdiction and several of its variants cannot be much easier to approximate than Densest k-Subgraph. In particular, any $n^{o(1)}$-approximation algorithm for Network Flow Interdiction would imply an $n^{o(1)}...

  12. Regression with Sparse Approximations of Data

    DEFF Research Database (Denmark)

    Noorzad, Pardis; Sturm, Bob L.

    2012-01-01

    We propose sparse approximation weighted regression (SPARROW), a method for local estimation of the regression function that uses sparse approximation with a dictionary of measurements. SPARROW estimates the regression function at a point with a linear combination of a few regressands selected...... by a sparse approximation of the point in terms of the regressors. We show SPARROW can be considered a variant of \\(k\\)-nearest neighbors regression (\\(k\\)-NNR), and more generally, local polynomial kernel regression. Unlike \\(k\\)-NNR, however, SPARROW can adapt the number of regressors to use based...

  13. Approximately Liner Phase IIR Digital Filter Banks

    Directory of Open Access Journals (Sweden)

    J. D. Ćertić

    2013-11-01

    Full Text Available In this paper, uniform and nonuniform digital filter banks based on approximately linear phase IIR filters and frequency response masking technique (FRM are presented. Both filter banks are realized as a connection of an interpolated half-band approximately linear phase IIR filter as a first stage of the FRM design and an appropriate number of masking filters. The masking filters are half-band IIR filters with an approximately linear phase. The resulting IIR filter banks are compared with linear-phase FIR filter banks exhibiting similar magnitude responses. The effects of coefficient quantization are analyzed.

  14. Mathematical analysis, approximation theory and their applications

    CERN Document Server

    Gupta, Vijay

    2016-01-01

    Designed for graduate students, researchers, and engineers in mathematics, optimization, and economics, this self-contained volume presents theory, methods, and applications in mathematical analysis and approximation theory. Specific topics include: approximation of functions by linear positive operators with applications to computer aided geometric design, numerical analysis, optimization theory, and solutions of differential equations. Recent and significant developments in approximation theory, special functions and q-calculus along with their applications to mathematics, engineering, and social sciences are discussed and analyzed. Each chapter enriches the understanding of current research problems and theories in pure and applied research.

  15. Approximation of the semi-infinite interval

    Directory of Open Access Journals (Sweden)

    A. McD. Mercer

    1980-01-01

    Full Text Available The approximation of a function f∈C[a,b] by Bernstein polynomials is well-known. It is based on the binomial distribution. O. Szasz has shown that there are analogous approximations on the interval [0,∞ based on the Poisson distribution. Recently R. Mohapatra has generalized Szasz' result to the case in which the approximating function is αe−ux∑k=N∞(uxkα+β−1Γ(kα+βf(kαuThe present note shows that these results are special cases of a Tauberian theorem for certain infinite series having positive coefficients.

  16. Statistical Inversion of Seismic Noise Inversion statistique du bruit sismique

    Directory of Open Access Journals (Sweden)

    Adler P. M.

    2006-11-01

    Full Text Available A systematic investigation of wave propagation in random media is presented. Spectral analysis, inversion of codas and attenuation of the direct wave front are studied for synthetic data obtained in isotropic or anisotropic, 2D or 3D media. A coda inversion process is developed and checked on two sets of real data. In both cases, it is possible to compare the correlation lengths obtained by inversion to characteristic lengths measured on seismic logs, for the full scale seismic survey, or on a thin section, for the laboratory experiment. These two experiments prove the feasibility and the efficiency of the statistical inversion of codas. Correct characteristic lengths can be obtained which cannot be determined by another method. Le problème de la géophysique est la recherche d'informations concernant le sous-sol, dans des signaux sismiques enregistrés en surface ou dans des puits. Ces informations sont habituellement recherchées sous forme déterministe, c'est-à-dire sous la forme de la donnée en chaque point d'une valeur du paramètre étudié. Notre point de vue est différent puisque notre objectif est de déduire certaines propriétés statistiques du milieu, supposé hétérogène, à partir des sismogrammes enregistrés après propagation. Il apparaît alors deux moyens de remplir l'objectif fixé. Le premier est l'analyse spectrale des codas ; cette analyse permet de déterminer les tailles moyennes des hétérogénéités du sous-sol. La deuxième possibilité est l'étude de l'atténuation du front direct de l'onde, qui conduit aussi à la connaissance des longueurs caractéristiques du sous-sol ; contrairement à la première méthode, elle ne semble pas pouvoir être transposée efficacement à des cas réels. Dans la première partie, on teste numériquement la proportionnalité entre le facteur de rétrodiffraction, relié aux propriétés statistiques du milieu, et le spectre des codas. Les distributions de vitesse, à valeur

  17. Solution for Ill-Posed Inverse Kinematics of Robot Arm by Network Inversion

    Directory of Open Access Journals (Sweden)

    Takehiko Ogawa

    2010-01-01

    Full Text Available In the context of controlling a robot arm with multiple joints, the method of estimating the joint angles from the given end-effector coordinates is called inverse kinematics, which is a type of inverse problems. Network inversion has been proposed as a method for solving inverse problems by using a multilayer neural network. In this paper, network inversion is introduced as a method to solve the inverse kinematics problem of a robot arm with multiple joints, where the joint angles are estimated from the given end-effector coordinates. In general, inverse problems are affected by ill-posedness, which implies that the existence, uniqueness, and stability of their solutions are not guaranteed. In this paper, we show the effectiveness of applying network inversion with regularization, by which ill-posedness can be reduced, to the ill-posed inverse kinematics of an actual robot arm with multiple joints.

  18. Inverse scattering theory foundations of tomography with diffracting wavefields

    International Nuclear Information System (INIS)

    Devaney, A.J.

    1987-01-01

    The underlying mathematical models employed in reflection and transmission computed tomography using diffracting wavefields (called diffraction tomography) are reviewed and shown to have a rigorous basis in inverse scattering theory. In transmission diffraction tomography the underlying wave model is shown to be the Rytov approximation to the complex phase of the wavefield transmitted by the object being probed while in reflection diffraction tomography the underlying wave model is shown to be the Born approximation to the backscattered wavefield from the object. In both cases the goal of the reconstruction process is the determination of the objects's complex index of refraction as a function of position r/sup →/ and, possibly, the frequency ω of the probing wavefield. By use of these approximations the reconstruction problem for both transmission and reflection diffraction tomography can be cast into the simple and elegant form of linearized inverse scattering theory. Linearized inverse scattering theory is shown to lead directly to generalized projection-slice theorems for both reflection and transmission diffraction tomography that provide a simple mathematical relationship between the object's complex index of refraction (the unknown) and the data (the complex phase of the transmitted wave or the complex amplitude of the reflected wave). The conventional projection-slice theorem of X-ray CT is shown to result from the generalized projection-slice theorem for transmission diffraction tomography in the limit of vanishing wavelength (in the absence of wave effects). Fourier based and back-projection type reconstruction algorithms are shown to be directly derivable from the generalized projection-slice theorems

  19. Wake Vortex Inverse Model User's Guide

    Science.gov (United States)

    Lai, David; Delisi, Donald

    2008-01-01

    NorthWest Research Associates (NWRA) has developed an inverse model for inverting landing aircraft vortex data. The data used for the inversion are the time evolution of the lateral transport position and vertical position of both the port and starboard vortices. The inverse model performs iterative forward model runs using various estimates of vortex parameters, vertical crosswind profiles, and vortex circulation as a function of wake age. Forward model predictions of lateral transport and altitude are then compared with the observed data. Differences between the data and model predictions guide the choice of vortex parameter values, crosswind profile and circulation evolution in the next iteration. Iterations are performed until a user-defined criterion is satisfied. Currently, the inverse model is set to stop when the improvement in the rms deviation between the data and model predictions is less than 1 percent for two consecutive iterations. The forward model used in this inverse model is a modified version of the Shear-APA model. A detailed description of this forward model, the inverse model, and its validation are presented in a different report (Lai, Mellman, Robins, and Delisi, 2007). This document is a User's Guide for the Wake Vortex Inverse Model. Section 2 presents an overview of the inverse model program. Execution of the inverse model is described in Section 3. When executing the inverse model, a user is requested to provide the name of an input file which contains the inverse model parameters, the various datasets, and directories needed for the inversion. A detailed description of the list of parameters in the inversion input file is presented in Section 4. A user has an option to save the inversion results of each lidar track in a mat-file (a condensed data file in Matlab format). These saved mat-files can be used for post-inversion analysis. A description of the contents of the saved files is given in Section 5. An example of an inversion input

  20. Accommodating chromosome inversions in linkage analysis.

    Science.gov (United States)

    Chen, Gary K; Slaten, Erin; Ophoff, Roel A; Lange, Kenneth

    2006-08-01

    This work develops a population-genetics model for polymorphic chromosome inversions. The model precisely describes how an inversion changes the nature of and approach to linkage equilibrium. The work also describes algorithms and software for allele-frequency estimation and linkage analysis in the presence of an inversion. The linkage algorithms implemented in the software package Mendel estimate recombination parameters and calculate the posterior probability that each pedigree member carries the inversion. Application of Mendel to eight Centre d'Etude du Polymorphisme Humain pedigrees in a region containing a common inversion on 8p23 illustrates its potential for providing more-precise estimates of the location of an unmapped marker or trait gene. Our expanded cytogenetic analysis of these families further identifies inversion carriers and increases the evidence of linkage.

  1. Optimization and inverse problems in electromagnetism

    CERN Document Server

    Wiak, Sławomir

    2003-01-01

    From 12 to 14 September 2002, the Academy of Humanities and Economics (AHE) hosted the workshop "Optimization and Inverse Problems in Electromagnetism". After this bi-annual event, a large number of papers were assembled and combined in this book. During the workshop recent developments and applications in optimization and inverse methodologies for electromagnetic fields were discussed. The contributions selected for the present volume cover a wide spectrum of inverse and optimal electromagnetic methodologies, ranging from theoretical to practical applications. A number of new optimal and inverse methodologies were proposed. There are contributions related to dedicated software. Optimization and Inverse Problems in Electromagnetism consists of three thematic chapters, covering: -General papers (survey of specific aspects of optimization and inverse problems in electromagnetism), -Methodologies, -Industrial Applications. The book can be useful to students of electrical and electronics engineering, computer sci...

  2. Pion-nucleus cross sections approximation

    International Nuclear Information System (INIS)

    Barashenkov, V.S.; Polanski, A.; Sosnin, A.N.

    1990-01-01

    Analytical approximation of pion-nucleus elastic and inelastic interaction cross-section is suggested, with could be applied in the energy range exceeding several dozens of MeV for nuclei heavier than beryllium. 3 refs.; 4 tabs

  3. Square well approximation to the optical potential

    International Nuclear Information System (INIS)

    Jain, A.K.; Gupta, M.C.; Marwadi, P.R.

    1976-01-01

    Approximations for obtaining T-matrix elements for a sum of several potentials in terms of T-matrices for individual potentials are studied. Based on model calculations for S-wave for a sum of two separable non-local potentials of Yukawa type form factors and a sum of two delta function potentials, it is shown that the T-matrix for a sum of several potentials can be approximated satisfactorily over all the energy regions by the sum of T-matrices for individual potentials. Based on this, an approximate method for finding T-matrix for any local potential by approximating it by a sum of suitable number of square wells is presented. This provides an interesting way to calculate the T-matrix for any arbitary potential in terms of Bessel functions to a good degree of accuracy. The method is applied to the Saxon-Wood potentials and good agreement with exact results is found. (author)

  4. Seismic wave extrapolation using lowrank symbol approximation

    KAUST Repository

    Fomel, Sergey

    2012-04-30

    We consider the problem of constructing a wave extrapolation operator in a variable and possibly anisotropic medium. Our construction involves Fourier transforms in space combined with the help of a lowrank approximation of the space-wavenumber wave-propagator matrix. A lowrank approximation implies selecting a small set of representative spatial locations and a small set of representative wavenumbers. We present a mathematical derivation of this method, a description of the lowrank approximation algorithm and numerical examples that confirm the validity of the proposed approach. Wave extrapolation using lowrank approximation can be applied to seismic imaging by reverse-time migration in 3D heterogeneous isotropic or anisotropic media. © 2012 European Association of Geoscientists & Engineers.

  5. Steepest descent approximations for accretive operator equations

    International Nuclear Information System (INIS)

    Chidume, C.E.

    1993-03-01

    A necessary and sufficient condition is established for the strong convergence of the steepest descent approximation to a solution of equations involving quasi-accretive operators defined on a uniformly smooth Banach space. (author). 49 refs

  6. Degree of Approximation and Green Potential

    Directory of Open Access Journals (Sweden)

    M. Simkani

    2009-03-01

    Full Text Available We will relate the degree of rational approximation of a meromorphic function f to the minimum value, on the natural boundary of f, of Green potential of the weak∗ limit of the normalized pole-counting measures

  7. Low Rank Approximation Algorithms, Implementation, Applications

    CERN Document Server

    Markovsky, Ivan

    2012-01-01

    Matrix low-rank approximation is intimately related to data modelling; a problem that arises frequently in many different fields. Low Rank Approximation: Algorithms, Implementation, Applications is a comprehensive exposition of the theory, algorithms, and applications of structured low-rank approximation. Local optimization methods and effective suboptimal convex relaxations for Toeplitz, Hankel, and Sylvester structured problems are presented. A major part of the text is devoted to application of the theory. Applications described include: system and control theory: approximate realization, model reduction, output error, and errors-in-variables identification; signal processing: harmonic retrieval, sum-of-damped exponentials, finite impulse response modeling, and array processing; machine learning: multidimensional scaling and recommender system; computer vision: algebraic curve fitting and fundamental matrix estimation; bioinformatics for microarray data analysis; chemometrics for multivariate calibration; ...

  8. Methods of Fourier analysis and approximation theory

    CERN Document Server

    Tikhonov, Sergey

    2016-01-01

    Different facets of interplay between harmonic analysis and approximation theory are covered in this volume. The topics included are Fourier analysis, function spaces, optimization theory, partial differential equations, and their links to modern developments in the approximation theory. The articles of this collection were originated from two events. The first event took place during the 9th ISAAC Congress in Krakow, Poland, 5th-9th August 2013, at the section “Approximation Theory and Fourier Analysis”. The second event was the conference on Fourier Analysis and Approximation Theory in the Centre de Recerca Matemàtica (CRM), Barcelona, during 4th-8th November 2013, organized by the editors of this volume. All articles selected to be part of this collection were carefully reviewed.

  9. APPROXIMATE DEVELOPMENTS FOR SURFACES OF REVOLUTION

    Directory of Open Access Journals (Sweden)

    Mădălina Roxana Buneci

    2016-12-01

    Full Text Available The purpose of this paper is provide a set of Maple procedures to construct approximate developments of a general surface of revolution generalizing the well-known gore method for sphere

  10. An overview on Approximate Bayesian computation*

    Directory of Open Access Journals (Sweden)

    Baragatti Meïli

    2014-01-01

    Full Text Available Approximate Bayesian computation techniques, also called likelihood-free methods, are one of the most satisfactory approach to intractable likelihood problems. This overview presents recent results since its introduction about ten years ago in population genetics.

  11. Approximation for the adjoint neutron spectrum

    International Nuclear Information System (INIS)

    Suster, Luis Carlos; Martinez, Aquilino Senra; Silva, Fernando Carvalho da

    2002-01-01

    The proposal of this work is the determination of an analytical approximation which is capable to reproduce the adjoint neutron flux for the energy range of the narrow resonances (NR). In a previous work we developed a method for the calculation of the adjoint spectrum which was calculated from the adjoint neutron balance equations, that were obtained by the collision probabilities method, this method involved a considerable quantity of numerical calculation. In the analytical method some approximations were done, like the multiplication of the escape probability in the fuel by the adjoint flux in the moderator, and after these approximations, taking into account the case of the narrow resonances, were substituted in the adjoint neutron balance equation for the fuel, resulting in an analytical approximation for the adjoint flux. The results obtained in this work were compared to the results generated with the reference method, which demonstrated a good and precise results for the adjoint neutron flux for the narrow resonances. (author)

  12. TMB: Automatic differentiation and laplace approximation

    DEFF Research Database (Denmark)

    Kristensen, Kasper; Nielsen, Anders; Berg, Casper Willestofte

    2016-01-01

    are automatically integrated out. This approximation, and its derivatives, are obtained using automatic differentiation (up to order three) of the joint likelihood. The computations are designed to be fast for problems with many random effects (approximate to 10(6)) and parameters (approximate to 10...... computations. The user defines the joint likelihood for the data and the random effects as a C++ template function, while all the other operations are done in R; e.g., reading in the data. The package evaluates and maximizes the Laplace approximation of the marginal likelihood where the random effects......(3)). Computation times using ADMB and TMB are compared on a suite of examples ranging from simple models to large spatial models where the random effects are a Gaussian random field. Speedups ranging from 1.5 to about 100 are obtained with increasing gains for large problems...

  13. Approximations of Stochastic Partial Differential Equations

    OpenAIRE

    Di Nunno, Giulia; Zhang, Tusheng

    2014-01-01

    In this paper we show that solutions of stochastic partial differ- ential equations driven by Brownian motion can be approximated by stochastic partial differential equations forced by pure jump noise/random kicks. Applications to stochastic Burgers equations are discussed.

  14. Saddlepoint approximation methods in financial engineering

    CERN Document Server

    Kwok, Yue Kuen

    2018-01-01

    This book summarizes recent advances in applying saddlepoint approximation methods to financial engineering. It addresses pricing exotic financial derivatives and calculating risk contributions to Value-at-Risk and Expected Shortfall in credit portfolios under various default correlation models. These standard problems involve the computation of tail probabilities and tail expectations of the corresponding underlying state variables.  The text offers in a single source most of the saddlepoint approximation results in financial engineering, with different sets of ready-to-use approximation formulas. Much of this material may otherwise only be found in original research publications. The exposition and style are made rigorous by providing formal proofs of most of the results. Starting with a presentation of the derivation of a variety of saddlepoint approximation formulas in different contexts, this book will help new researchers to learn the fine technicalities of the topic. It will also be valuable to quanti...

  15. Approximative solutions of stochastic optimization problem

    Czech Academy of Sciences Publication Activity Database

    Lachout, Petr

    2010-01-01

    Roč. 46, č. 3 (2010), s. 513-523 ISSN 0023-5954 R&D Projects: GA ČR GA201/08/0539 Institutional research plan: CEZ:AV0Z10750506 Keywords : Stochastic optimization problem * sensitivity * approximative solution Subject RIV: BA - General Mathematics Impact factor: 0.461, year: 2010 http://library.utia.cas.cz/separaty/2010/SI/lachout-approximative solutions of stochastic optimization problem.pdf

  16. Nonlinear approximation with nonstationary Gabor frames

    DEFF Research Database (Denmark)

    Ottosen, Emil Solsbæk; Nielsen, Morten

    2018-01-01

    We consider sparseness properties of adaptive time-frequency representations obtained using nonstationary Gabor frames (NSGFs). NSGFs generalize classical Gabor frames by allowing for adaptivity in either time or frequency. It is known that the concept of painless nonorthogonal expansions...... resolution. Based on this characterization we prove an upper bound on the approximation error occurring when thresholding the coefficients of the corresponding frame expansions. We complement the theoretical results with numerical experiments, estimating the rate of approximation obtained from thresholding...

  17. Lattice quantum chromodynamics with approximately chiral fermions

    Energy Technology Data Exchange (ETDEWEB)

    Hierl, Dieter

    2008-05-15

    In this work we present Lattice QCD results obtained by approximately chiral fermions. We use the CI fermions in the quenched approximation to investigate the excited baryon spectrum and to search for the {theta}{sup +} pentaquark on the lattice. Furthermore we developed an algorithm for dynamical simulations using the FP action. Using FP fermions we calculate some LECs of chiral perturbation theory applying the epsilon expansion. (orig.)

  18. On surface approximation using developable surfaces

    DEFF Research Database (Denmark)

    Chen, H. Y.; Lee, I. K.; Leopoldseder, s.

    1999-01-01

    We introduce a method for approximating a given surface by a developable surface. It will be either a G(1) surface consisting of pieces of cones or cylinders of revolution or a G(r) NURBS developable surface. Our algorithm will also deal properly with the problems of reverse engineering and produ...... robust approximation of given scattered data. The presented technique can be applied in computer aided manufacturing, e.g. in shipbuilding. (C) 1999 Academic Press....

  19. On surface approximation using developable surfaces

    DEFF Research Database (Denmark)

    Chen, H. Y.; Lee, I. K.; Leopoldseder, S.

    1998-01-01

    We introduce a method for approximating a given surface by a developable surface. It will be either a G_1 surface consisting of pieces of cones or cylinders of revolution or a G_r NURBS developable surface. Our algorithm will also deal properly with the problems of reverse engineering and produce...... robust approximation of given scattered data. The presented technique can be applied in computer aided manufacturing, e.g. in shipbuilding....

  20. Lattice quantum chromodynamics with approximately chiral fermions

    International Nuclear Information System (INIS)

    Hierl, Dieter

    2008-05-01

    In this work we present Lattice QCD results obtained by approximately chiral fermions. We use the CI fermions in the quenched approximation to investigate the excited baryon spectrum and to search for the Θ + pentaquark on the lattice. Furthermore we developed an algorithm for dynamical simulations using the FP action. Using FP fermions we calculate some LECs of chiral perturbation theory applying the epsilon expansion. (orig.)

  1. Nonlinear Stochastic PDEs: Analysis and Approximations

    Science.gov (United States)

    2016-05-23

    Approximation to Nonlinear SPDEs with Discrete Random Variables , SIAM J Scientific Computing, (08 2015): 1872. doi: R. Mikulevicius, B. Rozovskii. On...multiplicative discrete random variables , ( ) S. Lototsky, B. Rozovsky. Stochastic Partial Differential Equations, (09 2015) B. Rozovsky, R...B. Rozovsky and G.E. Karniadakis, "Adaptive Wick-Malliavin approximation to nonlinear SPDEs with discrete random variables ," SIAM J. Sci. Comput., 37

  2. Polynomial approximation of functions in Sobolev spaces

    International Nuclear Information System (INIS)

    Dupont, T.; Scott, R.

    1980-01-01

    Constructive proofs and several generalizations of approximation results of J. H. Bramble and S. R. Hilbert are presented. Using an averaged Taylor series, we represent a function as a polynomical plus a remainder. The remainder can be manipulated in many ways to give different types of bounds. Approximation of functions in fractional order Sobolev spaces is treated as well as the usual integer order spaces and several nonstandard Sobolev-like spaces

  3. Approximation properties ofλ-Bernstein operators.

    Science.gov (United States)

    Cai, Qing-Bo; Lian, Bo-Yong; Zhou, Guorong

    2018-01-01

    In this paper, we introduce a new type λ -Bernstein operators with parameter [Formula: see text], we investigate a Korovkin type approximation theorem, establish a local approximation theorem, give a convergence theorem for the Lipschitz continuous functions, we also obtain a Voronovskaja-type asymptotic formula. Finally, we give some graphs and numerical examples to show the convergence of [Formula: see text] to [Formula: see text], and we see that in some cases the errors are smaller than [Formula: see text] to f .

  4. Rough Sets Approximations for Learning Outcomes

    Science.gov (United States)

    Encheva, Sylvia; Tumin, Sharil

    Discovering dependencies between students' responses and their level of mastering of a particular skill is very important in the process of developing intelligent tutoring systems. This work is an approach to attain a higher level of certainty while following students' learning progress. Rough sets approximations are applied for assessing students understanding of a concept. Consecutive responses from each individual learner to automated tests are placed in corresponding rough sets approximations. The resulting path provides strong indication about the current level of learning outcomes.

  5. Approximations for the Erlang Loss Function

    DEFF Research Database (Denmark)

    Mejlbro, Leif

    1998-01-01

    Theoretically, at least three formulae are needed for arbitrarily good approximates of the Erlang Loss Function. In the paper, for convenience five formulae are presented guaranteeing a relative error <1E-2, and methods are indicated for improving this bound.......Theoretically, at least three formulae are needed for arbitrarily good approximates of the Erlang Loss Function. In the paper, for convenience five formulae are presented guaranteeing a relative error

  6. Identifiability Scaling Laws in Bilinear Inverse Problems

    OpenAIRE

    Choudhary, Sunav; Mitra, Urbashi

    2014-01-01

    A number of ill-posed inverse problems in signal processing, like blind deconvolution, matrix factorization, dictionary learning and blind source separation share the common characteristic of being bilinear inverse problems (BIPs), i.e. the observation model is a function of two variables and conditioned on one variable being known, the observation is a linear function of the other variable. A key issue that arises for such inverse problems is that of identifiability, i.e. whether the observa...

  7. Lectures on the inverse scattering method

    International Nuclear Information System (INIS)

    Zakharov, V.E.

    1983-06-01

    In a series of six lectures an elementary introduction to the theory of inverse scattering is given. The first four lectures contain a detailed theory of solitons in the framework of the KdV equation, together with the inverse scattering theory of the one-dimensional Schroedinger equation. In the fifth lecture the dressing method is described, while the sixth lecture gives a brief review of the equations soluble by the inverse scattering method. (author)

  8. Inverse kinematics of OWI-535 robotic arm

    OpenAIRE

    DEBENEC, PRIMOŽ

    2015-01-01

    The thesis aims to calculate the inverse kinematics for the OWI-535 robotic arm. The calculation of the inverse kinematics determines the joint parameters that provide the right pose of the end effector. The pose consists of the position and orientation, however, we will focus only on the second one. Due to arm limitations, we have created our own type of the calculation of the inverse kinematics. At first we have derived it only theoretically, and then we have transferred the derivation into...

  9. Automatic Flight Controller With Model Inversion

    Science.gov (United States)

    Meyer, George; Smith, G. Allan

    1992-01-01

    Automatic digital electronic control system based on inverse-model-follower concept being developed for proposed vertical-attitude-takeoff-and-landing airplane. Inverse-model-follower control places inverse mathematical model of dynamics of controlled plant in series with control actuators of controlled plant so response of combination of model and plant to command is unity. System includes feedback to compensate for uncertainties in mathematical model and disturbances imposed from without.

  10. Approximating centrality in evolving graphs: toward sublinearity

    Science.gov (United States)

    Priest, Benjamin W.; Cybenko, George

    2017-05-01

    The identification of important nodes is a ubiquitous problem in the analysis of social networks. Centrality indices (such as degree centrality, closeness centrality, betweenness centrality, PageRank, and others) are used across many domains to accomplish this task. However, the computation of such indices is expensive on large graphs. Moreover, evolving graphs are becoming increasingly important in many applications. It is therefore desirable to develop on-line algorithms that can approximate centrality measures using memory sublinear in the size of the graph. We discuss the challenges facing the semi-streaming computation of many centrality indices. In particular, we apply recent advances in the streaming and sketching literature to provide a preliminary streaming approximation algorithm for degree centrality utilizing CountSketch and a multi-pass semi-streaming approximation algorithm for closeness centrality leveraging a spanner obtained through iteratively sketching the vertex-edge adjacency matrix. We also discuss possible ways forward for approximating betweenness centrality, as well as spectral measures of centrality. We provide a preliminary result using sketched low-rank approximations to approximate the output of the HITS algorithm.

  11. Time-reversal and Bayesian inversion

    Science.gov (United States)

    Debski, Wojciech

    2017-04-01

    Probabilistic inversion technique is superior to the classical optimization-based approach in all but one aspects. It requires quite exhaustive computations which prohibit its use in huge size inverse problems like global seismic tomography or waveform inversion to name a few. The advantages of the approach are, however, so appealing that there is an ongoing continuous afford to make the large inverse task as mentioned above manageable with the probabilistic inverse approach. One of the perspective possibility to achieve this goal relays on exploring the internal symmetry of the seismological modeling problems in hand - a time reversal and reciprocity invariance. This two basic properties of the elastic wave equation when incorporating into the probabilistic inversion schemata open a new horizons for Bayesian inversion. In this presentation we discuss the time reversal symmetry property, its mathematical aspects and propose how to combine it with the probabilistic inverse theory into a compact, fast inversion algorithm. We illustrate the proposed idea with the newly developed location algorithm TRMLOC and discuss its efficiency when applied to mining induced seismic data.

  12. Chromatid Painting for Chromosomal Inversion Detection Project

    Data.gov (United States)

    National Aeronautics and Space Administration — We propose the continued development of a novel approach to the detection of chromosomal inversions. Transmissible chromosome aberrations (translocations and...

  13. Minimum mean square error estimation and approximation of the Bayesian update

    KAUST Repository

    Litvinenko, Alexander

    2015-01-07

    Given: a physical system modeled by a PDE or ODE with uncertain coefficient q(w), a measurement operator Y (u(q); q), where u(q; w) uncertain solution. Aim: to identify q(w). The mapping from parameters to observations is usually not invertible, hence this inverse identification problem is generally ill-posed. To identify q(w) we derived non-linear Bayesian update from the variational problem associated with conditional expectation. To reduce cost of the Bayesian update we offer a functional approximation, e.g. polynomial chaos expansion (PCE). New: We derive linear, quadratic etc approximation of full Bayesian update.

  14. Approximate Analytic Solutions for the Two-Phase Stefan Problem Using the Adomian Decomposition Method

    Directory of Open Access Journals (Sweden)

    Xiao-Ying Qin

    2014-01-01

    Full Text Available An Adomian decomposition method (ADM is applied to solve a two-phase Stefan problem that describes the pure metal solidification process. In contrast to traditional analytical methods, ADM avoids complex mathematical derivations and does not require coordinate transformation for elimination of the unknown moving boundary. Based on polynomial approximations for some known and unknown boundary functions, approximate analytic solutions for the model with undetermined coefficients are obtained using ADM. Substitution of these expressions into other equations and boundary conditions of the model generates some function identities with the undetermined coefficients. By determining these coefficients, approximate analytic solutions for the model are obtained. A concrete example of the solution shows that this method can easily be implemented in MATLAB and has a fast convergence rate. This is an efficient method for finding approximate analytic solutions for the Stefan and the inverse Stefan problems.

  15. A New Approach for Inversion of Large Random Matrices in Massive MIMO Systems

    Science.gov (United States)

    Anjum, Muhammad Ali Raza; Ahmed, Muhammad Mansoor

    2014-01-01

    We report a novel approach for inversion of large random matrices in massive Multiple-Input Multiple Output (MIMO) systems. It is based on the concept of inverse vectors in which an inverse vector is defined for each column of the principal matrix. Such an inverse vector has to satisfy two constraints. Firstly, it has to be in the null-space of all the remaining columns. We call it the null-space problem. Secondly, it has to form a projection of value equal to one in the direction of selected column. We term it as the normalization problem. The process essentially decomposes the inversion problem and distributes it over columns. Each column can be thought of as a node in the network or a particle in a swarm seeking its own solution, the inverse vector, which lightens the computational load on it. Another benefit of this approach is its applicability to all three cases pertaining to a linear system: the fully-determined, the over-determined, and the under-determined case. It eliminates the need of forming the generalized inverse for the last two cases by providing a new way to solve the least squares problem and the Moore and Penrose's pseudoinverse problem. The approach makes no assumption regarding the size, structure or sparsity of the matrix. This makes it fully applicable to much in vogue large random matrices arising in massive MIMO systems. Also, the null-space problem opens the door for a plethora of methods available in literature for null-space computation to enter the realm of matrix inversion. There is even a flexibility of finding an exact or approximate inverse depending on the null-space method employed. We employ the Householder's null-space method for exact solution and present a complete exposition of the new approach. A detailed comparison with well-established matrix inversion methods in literature is also given. PMID:24733148

  16. Efficient parallel iterative solvers for the solution of large dense linear systems arising from the boundary element method in electromagnetism

    International Nuclear Information System (INIS)

    Alleon, G.; Carpentieri, B.; Du, I.S.; Giraud, L.; Langou, J.; Martin, E.

    2003-01-01

    The boundary element method has become a popular tool for the solution of Maxwell's equations in electromagnetism. It discretizes only the surface of the radiating object and gives rise to linear systems that are smaller in size compared to those arising from finite element or finite difference discretizations. However, these systems are prohibitively demanding in terms of memory for direct methods and challenging to solve by iterative methods. In this paper we address the iterative solution via preconditioned Krylov methods of electromagnetic scattering problems expressed in an integral formulation, with main focus on the design of the pre-conditioner. We consider an approximate inverse method based on the Frobenius-norm minimization with a pattern prescribed in advance. The pre-conditioner is constructed from a sparse approximation of the dense coefficient matrix, and the patterns both for the pre-conditioner and for the coefficient matrix are computed a priori using geometric information from the mesh. We describe the implementation of the approximate inverse in an out-of-core parallel code that uses multipole techniques for the matrix-vector products, and show results on the numerical scalability of our method on systems of size up to one million unknowns. We propose an embedded iterative scheme based on the GMRES method and combined with multipole techniques, aimed at improving the robustness of the approximate inverse for large problems. We prove by numerical experiments that the proposed scheme enables the solution of very large and difficult problems efficiently at reduced computational and memory cost. Finally we perform a preliminary study on a spectral two-level pre-conditioner to enhance the robustness of our method. This numerical technique exploits spectral information of the preconditioned systems to build a low rank-update of the pre-conditioner. (authors)

  17. Laterally constrained inversion for CSAMT data interpretation

    Science.gov (United States)

    Wang, Ruo; Yin, Changchun; Wang, Miaoyue; Di, Qingyun

    2015-10-01

    Laterally constrained inversion (LCI) has been successfully applied to the inversion of dc resistivity, TEM and airborne EM data. However, it hasn't been yet applied to the interpretation of controlled-source audio-frequency magnetotelluric (CSAMT) data. In this paper, we apply the LCI method for CSAMT data inversion by preconditioning the Jacobian matrix. We apply a weighting matrix to Jacobian to balance the sensitivity of model parameters, so that the resolution with respect to different model parameters becomes more uniform. Numerical experiments confirm that this can improve the convergence of the inversion. We first invert a synthetic dataset with and without noise to investigate the effect of LCI applications to CSAMT data, for the noise free data, the results show that the LCI method can recover the true model better compared to the traditional single-station inversion; and for the noisy data, the true model is recovered even with a noise level of 8%, indicating that LCI inversions are to some extent noise insensitive. Then, we re-invert two CSAMT datasets collected respectively in a watershed and a coal mine area in Northern China and compare our results with those from previous inversions. The comparison with the previous inversion in a coal mine shows that LCI method delivers smoother layer interfaces that well correlate to seismic data, while comparison with a global searching algorithm of simulated annealing (SA) in a watershed shows that though both methods deliver very similar good results, however, LCI algorithm presented in this paper runs much faster. The inversion results for the coal mine CSAMT survey show that a conductive water-bearing zone that was not revealed by the previous inversions has been identified by the LCI. This further demonstrates that the method presented in this paper works for CSAMT data inversion.

  18. The Grammar of Approximating Number Pairs

    Science.gov (United States)

    Eriksson, Kimmo; Bailey, Drew H.; Geary, David C.

    2009-01-01

    We studied approximating pairs of numbers (a, b) used to estimate quantity in a single phrase (“two, three years ago”). Pollmann and Jansen (1996) found that only a few of the many possible pairs are actually used, suggesting an interaction between the ways in which people estimate quantity and their use of quantitative phrases in colloquial speech. They proposed a set of rules that describe which approximating pairs are used in Dutch phrases. We revisit this issue in an analysis of Swedish and American language corpora and in a series of three experiments in which Swedish and American adults rated the acceptability of various approximating pairs, and created approximating pairs of their own in response to various estimation tasks. We find evidence for Pollmann’s and Jansen’s rules in both Swedish and English phrases, but also identify additional rules and substantial individual and cross-language variation. We discuss implications for the origin of this loose “grammar” of approximating pairs. PMID:20234023

  19. 'LTE-diffusion approximation' for arc calculations

    International Nuclear Information System (INIS)

    Lowke, J J; Tanaka, M

    2006-01-01

    This paper proposes the use of the 'LTE-diffusion approximation' for predicting the properties of electric arcs. Under this approximation, local thermodynamic equilibrium (LTE) is assumed, with a particular mesh size near the electrodes chosen to be equal to the 'diffusion length', based on D e /W, where D e is the electron diffusion coefficient and W is the electron drift velocity. This approximation overcomes the problem that the equilibrium electrical conductivity in the arc near the electrodes is almost zero, which makes accurate calculations using LTE impossible in the limit of small mesh size, as then voltages would tend towards infinity. Use of the LTE-diffusion approximation for a 200 A arc with a thermionic cathode gives predictions of total arc voltage, electrode temperatures, arc temperatures and radial profiles of heat flux density and current density at the anode that are in approximate agreement with more accurate calculations which include an account of the diffusion of electric charges to the electrodes, and also with experimental results. Calculations, which include diffusion of charges, agree with experimental results of current and heat flux density as a function of radius if the Milne boundary condition is used at the anode surface rather than imposing zero charge density at the anode

  20. Approximate Bayesian evaluations of measurement uncertainty

    Science.gov (United States)

    Possolo, Antonio; Bodnar, Olha

    2018-04-01

    The Guide to the Expression of Uncertainty in Measurement (GUM) includes formulas that produce an estimate of a scalar output quantity that is a function of several input quantities, and an approximate evaluation of the associated standard uncertainty. This contribution presents approximate, Bayesian counterparts of those formulas for the case where the output quantity is a parameter of the joint probability distribution of the input quantities, also taking into account any information about the value of the output quantity available prior to measurement expressed in the form of a probability distribution on the set of possible values for the measurand. The approximate Bayesian estimates and uncertainty evaluations that we present have a long history and illustrious pedigree, and provide sufficiently accurate approximations in many applications, yet are very easy to implement in practice. Differently from exact Bayesian estimates, which involve either (analytical or numerical) integrations, or Markov Chain Monte Carlo sampling, the approximations that we describe involve only numerical optimization and simple algebra. Therefore, they make Bayesian methods widely accessible to metrologists. We illustrate the application of the proposed techniques in several instances of measurement: isotopic ratio of silver in a commercial silver nitrate; odds of cryptosporidiosis in AIDS patients; height of a manometer column; mass fraction of chromium in a reference material; and potential-difference in a Zener voltage standard.

  1. Semiclassical initial value approximation for Green's function.

    Science.gov (United States)

    Kay, Kenneth G

    2010-06-28

    A semiclassical initial value approximation is obtained for the energy-dependent Green's function. For a system with f degrees of freedom the Green's function expression has the form of a (2f-1)-dimensional integral over points on the energy surface and an integral over time along classical trajectories initiated from these points. This approximation is derived by requiring an integral ansatz for Green's function to reduce to Gutzwiller's semiclassical formula when the integrations are performed by the stationary phase method. A simpler approximation is also derived involving only an (f-1)-dimensional integral over momentum variables on a Poincare surface and an integral over time. The relationship between the present expressions and an earlier initial value approximation for energy eigenfunctions is explored. Numerical tests for two-dimensional systems indicate that good accuracy can be obtained from the initial value Green's function for calculations of autocorrelation spectra and time-independent wave functions. The relative advantages of initial value approximations for the energy-dependent Green's function and the time-dependent propagator are discussed.

  2. Trajectory averaging for stochastic approximation MCMC algorithms

    KAUST Repository

    Liang, Faming

    2010-10-01

    The subject of stochastic approximation was founded by Robbins and Monro [Ann. Math. Statist. 22 (1951) 400-407]. After five decades of continual development, it has developed into an important area in systems control and optimization, and it has also served as a prototype for the development of adaptive algorithms for on-line estimation and control of stochastic systems. Recently, it has been used in statistics with Markov chain Monte Carlo for solving maximum likelihood estimation problems and for general simulation and optimizations. In this paper, we first show that the trajectory averaging estimator is asymptotically efficient for the stochastic approximation MCMC (SAMCMC) algorithm under mild conditions, and then apply this result to the stochastic approximation Monte Carlo algorithm [Liang, Liu and Carroll J. Amer. Statist. Assoc. 102 (2007) 305-320]. The application of the trajectory averaging estimator to other stochastic approximationMCMC algorithms, for example, a stochastic approximation MLE algorithm for missing data problems, is also considered in the paper. © Institute of Mathematical Statistics, 2010.

  3. The grammar of approximating number pairs.

    Science.gov (United States)

    Eriksson, Kimmo; Bailey, Drew H; Geary, David C

    2010-04-01

    In the present article, we studied approximating pairs of numbers (a, b) that were used to estimate quantity in a single phrase ("two, three years ago"). Pollmann and Jansen (1996) found that only a few of the many possible pairs are actually used, suggesting an interaction between the ways in which people estimate quantity and their use of quantitative phrases in colloquial speech. They proposed a set of rules that describe which approximating pairs are used in Dutch phrases. We revisited this issue in an analysis of Swedish and American language corpora and in a series of three experiments in which Swedish and American adults rated the acceptability of various approximating pairs and created approximating pairs of their own in response to various estimation tasks. We found evidence for Pollmann and Jansen's rules in both Swedish and English phrases, but we also identified additional rules and substantial individual and cross-language variation. We will discuss implications for the origin of this loose "grammar" of approximating pairs.

  4. Multilevel weighted least squares polynomial approximation

    KAUST Repository

    Haji-Ali, Abdul-Lateef

    2017-06-30

    Weighted least squares polynomial approximation uses random samples to determine projections of functions onto spaces of polynomials. It has been shown that, using an optimal distribution of sample locations, the number of samples required to achieve quasi-optimal approximation in a given polynomial subspace scales, up to a logarithmic factor, linearly in the dimension of this space. However, in many applications, the computation of samples includes a numerical discretization error. Thus, obtaining polynomial approximations with a single level method can become prohibitively expensive, as it requires a sufficiently large number of samples, each computed with a sufficiently small discretization error. As a solution to this problem, we propose a multilevel method that utilizes samples computed with different accuracies and is able to match the accuracy of single-level approximations with reduced computational cost. We derive complexity bounds under certain assumptions about polynomial approximability and sample work. Furthermore, we propose an adaptive algorithm for situations where such assumptions cannot be verified a priori. Finally, we provide an efficient algorithm for the sampling from optimal distributions and an analysis of computationally favorable alternative distributions. Numerical experiments underscore the practical applicability of our method.

  5. Mantle conductivity obtained by 3-D inversion of magnetic satellite data

    DEFF Research Database (Denmark)

    Kuvshinov, A.; Olsen, Nils

    and perform the most consuming-time part of the IE forward simulations (the calculation of electric and magnetic tensor Green’s functions) only once. Approximate calculation of the data sensitivities also gives essential speed up of the inversion. We validate our inversion scheme using synthetic induction......We present an approach to determine the three-dimensional (3-D) conductivity distribution of the Earth’s upper mantle from magnetic satellite data. The approach is based on a minimization of the misfit between the measured and modeled (predicted) magnetic field using a quasi-Newton method, solving...... distributed geomagnetic observatories. Due to the high computational load of a 3-D inversion (requiring thousands of forward calculations), a comprehensive numerical framework is developed to increase the efficiency of the inversion.In particular, we take an advantage of specific features of the IE approach...

  6. Flame structure of methane inverse diffusion flame

    KAUST Repository

    Elbaz, Ayman M.

    2014-07-01

    This paper presents high speed images of OH-PLIF at 10. kHz simultaneously with 2D PIV (particle image velocimetry) measurements collected along the entire length of an inverse diffusion flame with circumferentially arranged methane fuel jets. For a fixed fuel flow rate, the central air jet Re was varied, leading to four air to fuel velocity ratios, namely Vr = 20.7, 29, 37.4 and 49.8. A double flame structure could be observed composed of a lower fuel entrainment region and an upper mixing and intense combustion region. The entrainment region was enveloped by an early OH layer, and then merged through a very thin OH neck to an annular OH layer located at the shear layer of the air jet. The two branches of this annular OH layer broaden as they moved downstream and eventfully merged together. Three types of events were observed common to all flames: breaks, closures and growing kernels. In upstream regions of the flames, the breaks were counterbalanced by flame closures. These breaks in OH signal were found to occur at locations where locally high velocity flows were impinging on the flame. As the Vr increased to 37.4, the OH layers became discontinuous over the downstream region of the flame, and these regions of low or no OH moved upstream. With further increases in Vr, these OH pockets act as flame kernels, growing as they moved downstream, and became the main mechanism for flame re-ignition. Along the flame length, the direction of the two dimensional principle compressive strain rate axis exhibited a preferred orientation of approximately 45° with respect to the flow direction. Moreover, the OH zones were associated with elongated regions of high vorticity. © 2013 Elsevier Inc.

  7. Package inspection using inverse diffraction

    Science.gov (United States)

    McAulay, Alastair D.

    2008-08-01

    More efficient cost-effective hand-held methods of inspecting packages without opening them are in demand for security. Recent new work in TeraHertz sources,1 millimeter waves, presents new possibilities. Millimeter waves pass through cardboard and styrofoam, common packing materials, and also pass through most materials except those with high conductivity like metals which block light and are easily spotted. Estimating refractive index along the path of the beam through the package from observations of the beam passing out of the package provides the necessary information to inspect the package and is a nonlinear problem. So we use a generalized linear inverse technique that we first developed for finding oil by reflection in geophysics.2 The computation assumes parallel slices in the packet of homogeneous material for which the refractive index is estimated. A beam is propagated through this model in a forward computation. The output is compared with the actual observations for the package and an update computed for the refractive indices. The loop is repeated until convergence. The approach can be modified for a reflection system or to include estimation of absorption.

  8. MODEL SELECTION FOR SPECTROPOLARIMETRIC INVERSIONS

    International Nuclear Information System (INIS)

    Asensio Ramos, A.; Manso Sainz, R.; Martínez González, M. J.; Socas-Navarro, H.; Viticchié, B.; Orozco Suárez, D.

    2012-01-01

    Inferring magnetic and thermodynamic information from spectropolarimetric observations relies on the assumption of a parameterized model atmosphere whose parameters are tuned by comparison with observations. Often, the choice of the underlying atmospheric model is based on subjective reasons. In other cases, complex models are chosen based on objective reasons (for instance, the necessity to explain asymmetries in the Stokes profiles) but it is not clear what degree of complexity is needed. The lack of an objective way of comparing models has, sometimes, led to opposing views of the solar magnetism because the inferred physical scenarios are essentially different. We present the first quantitative model comparison based on the computation of the Bayesian evidence ratios for spectropolarimetric observations. Our results show that there is not a single model appropriate for all profiles simultaneously. Data with moderate signal-to-noise ratios (S/Ns) favor models without gradients along the line of sight. If the observations show clear circular and linear polarization signals above the noise level, models with gradients along the line are preferred. As a general rule, observations with large S/Ns favor more complex models. We demonstrate that the evidence ratios correlate well with simple proxies. Therefore, we propose to calculate these proxies when carrying out standard least-squares inversions to allow for model comparison in the future.

  9. Inverse problem in radionuclide transport

    International Nuclear Information System (INIS)

    Yu, C.

    1988-01-01

    The disposal of radioactive waste must comply with the performance objectives set forth in 10 CFR 61 for low-level waste (LLW) and 10 CFR 60 for high-level waste (HLW). To determine probable compliance, the proposed disposal system can be modeled to predict its performance. One of the difficulties encountered in such a study is modeling the migration of radionuclides through a complex geologic medium for the long term. Although many radionuclide transport models exist in the literature, the accuracy of the model prediction is highly dependent on the model parameters used. The problem of using known parameters in a radionuclide transport model to predict radionuclide concentrations is a direct problem (DP); whereas the reverse of DP, i.e., the parameter identification problem of determining model parameters from known radionuclide concentrations, is called the inverse problem (IP). In this study, a procedure to solve IP is tested, using the regression technique. Several nonlinear regression programs are examined, and the best one is recommended. 13 refs., 1 tab

  10. Galactic cosmic rays in the periods of an inversion of the total solar magnetic field

    International Nuclear Information System (INIS)

    Krajnev, M.B.; Stozhkov, Yu.I.; Charakhch'yan, T.N.

    1984-01-01

    Anomalies in galactic cosmic ray (GCR) behaviour in the periods of the total solar magnetic field (TSMF) inversion are considered according to the data of neutron monitors and stratospheric measurements. These anomalies are interpreted as superpositions of two phenomena: phenomenon 1 and phenomenon 2. Phenomenon 1 is conditioned by the decrease and following strengthening of the regular interplanetary field strong strength in heliosphere in the periods of TSMF inversion. Phenomenon 2 consists in exess of GCR nuclei intensity over the expeited one, corresponding to the level of solar activity after TSMF inversion with dMsub(Z)/dt > 0 (inversion of 1969-1971) and also in decrease of observed GCR nuclei intensity as compared to the expected one after TSMF inversion with dMsub(Z)/dt < 0 (Msub(Z)-projection of magnetic field dipole moment on solar axis of rotation). The phenomenon 1 is slightly late in respect to TSMF inversion, as the phenomenon 2 takes part in the process only approximately 1 year after inversion completing

  11. Research on Joint Parameter Inversion for an Integrated Underground Displacement 3D Measuring Sensor

    Directory of Open Access Journals (Sweden)

    Nanying Shentu

    2015-04-01

    Full Text Available Underground displacement monitoring is a key means to monitor and evaluate geological disasters and geotechnical projects. There exist few practical instruments able to monitor subsurface horizontal and vertical displacements simultaneously due to monitoring invisibility and complexity. A novel underground displacement 3D measuring sensor had been proposed in our previous studies, and great efforts have been taken in the basic theoretical research of underground displacement sensing and measuring characteristics by virtue of modeling, simulation and experiments. This paper presents an innovative underground displacement joint inversion method by mixing a specific forward modeling approach with an approximate optimization inversion procedure. It can realize a joint inversion of underground horizontal displacement and vertical displacement for the proposed 3D sensor. Comparative studies have been conducted between the measured and inversed parameters of underground horizontal and vertical displacements under a variety of experimental and inverse conditions. The results showed that when experimentally measured horizontal displacements and vertical displacements are both varied within 0 ~ 30 mm, horizontal displacement and vertical displacement inversion discrepancies are generally less than 3 mm and 1 mm, respectively, under three kinds of simulated underground displacement monitoring circumstances. This implies that our proposed underground displacement joint inversion method is robust and efficient to predict the measuring values of underground horizontal and vertical displacements for the proposed sensor.

  12. Research on joint parameter inversion for an integrated underground displacement 3D measuring sensor.

    Science.gov (United States)

    Shentu, Nanying; Qiu, Guohua; Li, Qing; Tong, Renyuan; Shentu, Nankai; Wang, Yanjie

    2015-04-13

    Underground displacement monitoring is a key means to monitor and evaluate geological disasters and geotechnical projects. There exist few practical instruments able to monitor subsurface horizontal and vertical displacements simultaneously due to monitoring invisibility and complexity. A novel underground displacement 3D measuring sensor had been proposed in our previous studies, and great efforts have been taken in the basic theoretical research of underground displacement sensing and measuring characteristics by virtue of modeling, simulation and experiments. This paper presents an innovative underground displacement joint inversion method by mixing a specific forward modeling approach with an approximate optimization inversion procedure. It can realize a joint inversion of underground horizontal displacement and vertical displacement for the proposed 3D sensor. Comparative studies have been conducted between the measured and inversed parameters of underground horizontal and vertical displacements under a variety of experimental and inverse conditions. The results showed that when experimentally measured horizontal displacements and vertical displacements are both varied within 0~30 mm, horizontal displacement and vertical displacement inversion discrepancies are generally less than 3 mm and 1 mm, respectively, under three kinds of simulated underground displacement monitoring circumstances. This implies that our proposed underground displacement joint inversion method is robust and efficient to predict the measuring values of underground horizontal and vertical displacements for the proposed sensor.

  13. Topological inversion for solution of geodesy-constrained geophysical problems

    Science.gov (United States)

    Saltogianni, Vasso; Stiros, Stathis

    2015-04-01

    Geodetic data, mostly GPS observations, permit to measure displacements of selected points around activated faults and volcanoes, and on the basis of geophysical models, to model the underlying physical processes. This requires inversion of redundant systems of highly non-linear equations with >3 unknowns; a situation analogous to the adjustment of geodetic networks. However, in geophysical problems inversion cannot be based on conventional least-squares techniques, and is based on numerical inversion techniques (a priori fixing of some variables, optimization in steps with values of two variables each time to be regarded fixed, random search in the vicinity of approximate solutions). Still these techniques lead to solutions trapped in local minima, to correlated estimates and to solutions with poor error control (usually sampling-based approaches). To overcome these problems, a numerical-topological, grid-search based technique in the RN space is proposed (N the number of unknown variables). This technique is in fact a generalization and refinement of techniques used in lighthouse positioning and in some cases of low-accuracy 2-D positioning using Wi-Fi etc. The basic concept is to assume discrete possible ranges of each variable, and from these ranges to define a grid G in the RN space, with some of the gridpoints to approximate the true solutions of the system. Each point of hyper-grid G is then tested whether it satisfies the observations, given their uncertainty level, and successful grid points define a sub-space of G containing the true solutions. The optimal (minimal) space containing one or more solutions is obtained using a trial-and-error approach, and a single optimization factor. From this essentially deterministic identification of the set of gridpoints satisfying the system of equations, at a following step, a stochastic optimal solution is computed corresponding to the center of gravity of this set of gridpoints. This solution corresponds to a

  14. Numerical approximation of partial differential equations

    CERN Document Server

    Bartels, Sören

    2016-01-01

    Finite element methods for approximating partial differential equations have reached a high degree of maturity, and are an indispensible tool in science and technology. This textbook aims at providing a thorough introduction to the construction, analysis, and implementation of finite element methods for model problems arising in continuum mechanics. The first part of the book discusses elementary properties of linear partial differential equations along with their basic numerical approximation, the functional-analytical framework for rigorously establishing existence of solutions, and the construction and analysis of basic finite element methods. The second part is devoted to the optimal adaptive approximation of singularities and the fast iterative solution of linear systems of equations arising from finite element discretizations. In the third part, the mathematical framework for analyzing and discretizing saddle-point problems is formulated, corresponding finte element methods are analyzed, and particular ...

  15. Piecewise-Cubic Approximation in Autotracking Mode

    CERN Document Server

    Dikoussar, N D

    2004-01-01

    A method for piecewise-cubic approximation within the frame of four-point transforms is proposed. The knots of the segments are detected in autotracking mode using a digitized curve. A three-point cubic parametric spline (TPS) is used as a model of a local approximant. A free parameter $\\theta$ (a coefficient at $x^{3}$) is found in a line following mode, using step-by-step averaging. A formula for expression of the free parameter via a length of the segment and values of a function and derivatives in joining points is received. The $C^{1}$-smoothness depends on the accuracy of the $\\theta$-estimate. The stability of the method w.r.t. input errors is shown as well. The key parameters of the approximation are: the parameters of the basic functions, the variance of the input errors, and a sampling step. The efficiency of the method is shown by numerical calculations on test examples.

  16. The adiabatic approximation in multichannel scattering

    International Nuclear Information System (INIS)

    Schulte, A.M.

    1978-01-01

    Using two-dimensional models, an attempt has been made to get an impression of the conditions of validity of the adiabatic approximation. For a nucleon bound to a rotating nucleus the Coriolis coupling is neglected and the relation between this nuclear Coriolis coupling and the classical Coriolis force has been examined. The approximation for particle scattering from an axially symmetric rotating nucleus based on a short duration of the collision, has been combined with an approximation based on the limitation of angular momentum transfer between particle and nucleus. Numerical calculations demonstrate the validity of the new combined method. The concept of time duration for quantum mechanical collisions has also been studied, as has the collective description of permanently deformed nuclei. (C.F.)

  17. The binary collision approximation: Background and introduction

    International Nuclear Information System (INIS)

    Robinson, M.T.

    1992-08-01

    The binary collision approximation (BCA) has long been used in computer simulations of the interactions of energetic atoms with solid targets, as well as being the basis of most analytical theory in this area. While mainly a high-energy approximation, the BCA retains qualitative significance at low energies and, with proper formulation, gives useful quantitative information as well. Moreover, computer simulations based on the BCA can achieve good statistics in many situations where those based on full classical dynamical models require the most advanced computer hardware or are even impracticable. The foundations of the BCA in classical scattering are reviewed, including methods of evaluating the scattering integrals, interaction potentials, and electron excitation effects. The explicit evaluation of time at significant points on particle trajectories is discussed, as are scheduling algorithms for ordering the collisions in a developing cascade. An approximate treatment of nearly simultaneous collisions is outlined and the searching algorithms used in MARLOWE are presented

  18. Minimal entropy approximation for cellular automata

    International Nuclear Information System (INIS)

    Fukś, Henryk

    2014-01-01

    We present a method for the construction of approximate orbits of measures under the action of cellular automata which is complementary to the local structure theory. The local structure theory is based on the idea of Bayesian extension, that is, construction of a probability measure consistent with given block probabilities and maximizing entropy. If instead of maximizing entropy one minimizes it, one can develop another method for the construction of approximate orbits, at the heart of which is the iteration of finite-dimensional maps, called minimal entropy maps. We present numerical evidence that the minimal entropy approximation sometimes outperforms the local structure theory in characterizing the properties of cellular automata. The density response curve for elementary CA rule 26 is used to illustrate this claim. (paper)

  19. Three-dimensional inverse scattering: High-frequency analysis of Newton's Marchenko equation

    International Nuclear Information System (INIS)

    Cheney, M.; Rose, J.H.

    1985-01-01

    We obtain a high-frequency asymptotic expansion of Newton's Marchenko equation for three-dimensional inverse scattering. We find that the inhomogeneous term contains the same high-frequency information as does the Born approximation. We show that recovery of the potential via Newton's Marchenko equation plus the ''miracle'' depends on low-frequency information

  20. A two-step iterative method and its acceleration for outer inverses

    Indian Academy of Sciences (India)

    A two-step iterative method and its accelerated version for approximating outer inverse A2 T,S of an arbitrary matrix A are proposed. A convergence theorem for its existence is established. The rigorous error bounds are derived. Numerical experiments involving singular square, rectangular, random matrices and a sparse ...

  1. An inverse-scattering approach to the physics of transition metals ...

    African Journals Online (AJOL)

    A method is developed for the deduction of a transition metal ion potential from a knowledge of the phase-shift. The method used is based the distorted plane – wave scattering approximation for the deduction of non singular potentials from scattering phase shifts in an inverse scattering approach. The resulting electron ...

  2. A Highly Efficient Shannon Wavelet Inverse Fourier Technique for Pricing European Options

    NARCIS (Netherlands)

    Ortiz-Gracia, Luis; Oosterlee, C.W.

    2016-01-01

    In the search for robust, accurate, and highly efficient financial option valuation techniques, we here present the SWIFT method (Shannon wavelets inverse Fourier technique), based on Shannon wavelets. SWIFT comes with control over approximation errors made by means of sharp quantitative error

  3. A highly efficient Shannon wavelet inverse Fourier technique for pricing European options

    NARCIS (Netherlands)

    L. Ortiz Gracia (Luis); C.W. Oosterlee (Cornelis)

    2016-01-01

    htmlabstractIn the search for robust, accurate, and highly efficient financial option valuation techniques, we here present the SWIFT method (Shannon wavelets inverse Fourier technique), based on Shannon wavelets. SWIFT comes with control over approximation errors made by means of

  4. Well-posedness of inverse problems for systems with time dependent parameters

    DEFF Research Database (Denmark)

    Banks, H. T.; Pedersen, Michael

    2009-01-01

    on the data of the problem. We also consider well-posedness as well as finite element type approximations in associated inverse problems. The problem above is a weak formulation that includes models in abstract differential operator form that include plate, beam and shell equations with several important...

  5. APPROXIMATE INTEGRATION OF HIGHLY OSCILLATING FUNCTIONS

    Directory of Open Access Journals (Sweden)

    I. N. Melashko

    2017-01-01

    Full Text Available Elementary approximate formulae for numerical integration of functions containing oscillating factors of a special form with a parameter have been proposed in the paper. In this case general quadrature formulae can be used only at sufficiently small values of the parameter. Therefore, it is necessary to consider in advance presence of strongly oscillating factors in order to obtain formulae for numerical integration which are suitable in the case when the parameter is changing within wide limits. This can be done by taking into account such factors as weighting functions. Moreover, since the parameter can take values which cannot always be predicted in advance, approximate formulae for calculation of such integrals should be constructed in such a way that they contain this parameter in a letter format and they are suitable for calculation at any and particularly large values of the parameter. Computational rules with such properties are generally obtained by dividing an interval of integration into elementary while making successive approximation of the integral density at each elementary interval with polynomials of the first, second and third degrees and taking the oscillating factors as weighting functions. The paper considers the variant when density of the integrals at each elementary interval is approximated by a polynomial of zero degree that is a constant which is equal to the value of density in the middle of the interval. At the same time one approximate formula for calculation of an improper integral with infinite interval of the function with oscillating factor of a special type has been constructed in the paper. In this case it has been assumed that density of the improper integral rather quickly goes to zero when an argument module is increasing indefinitely. In other words it is considered as small to negligible outside some finite interval. Uniforms in parameter used for evaluation of errors in approximate formulae have been

  6. Reverse Universal Resolving Algorithm and inverse driving

    DEFF Research Database (Denmark)

    Pécseli, Thomas

    2012-01-01

    Inverse interpretation is a semantics based, non-standard interpretation of programs. Given a program and a value, an inverse interpreter finds all or one of the inputs, that would yield the given value as output with normal forward evaluation. The Reverse Universal Resolving Algorithm is a new v...

  7. Third Harmonic Imaging using a Pulse Inversion

    DEFF Research Database (Denmark)

    Rasmussen, Joachim; Du, Yigang; Jensen, Jørgen Arendt

    2011-01-01

    The pulse inversion (PI) technique can be utilized to separate and enhance harmonic components of a waveform for tissue harmonic imaging. While most ultrasound systems can perform pulse inversion, only few image the 3rd harmonic component. PI pulse subtraction can isolate and enhance the 3rd...

  8. Metaheuristic optimization of acoustic inverse problems.

    NARCIS (Netherlands)

    van Leijen, A.V.; Rothkrantz, L.; Groen, F.

    2011-01-01

    Swift solving of geoacoustic inverse problems strongly depends on the application of a global optimization scheme. Given a particular inverse problem, this work aims to answer the questions how to select an appropriate metaheuristic search strategy, and how to configure it for optimal performance.

  9. Inverse Filtering Techniques in Speech Analysis | Nwachuku ...

    African Journals Online (AJOL)

    inverse filtering' has been applied. The unifying features of these techniques are presented, namely: 1. a basis in the source-filter theory of speech production, 2. the use of a network whose transfer function is the inverse of the transfer function of ...

  10. Stopping Rules for Linear Stochastic Approximation

    Science.gov (United States)

    Wada, Takayuki; Itani, Takamitsu; Fujisaki, Yasumasa

    Stopping rules are developed for stochastic approximation which is an iterative method for solving an unknown equation based on its consecutive residuals corrupted by additive random noise. It is assumed that the equation is linear and the noise is independent and identically distributed random vectors with zero mean and a bounded covariance. Then, the number of iterations for achieving a given probabilistic accuracy of the resultant solution is derived, which gives a rigorous stopping rule for the stochastic approximation. This number is polynomial of the problem size.

  11. Computational topology for approximations of knots

    Directory of Open Access Journals (Sweden)

    Ji Li

    2014-10-01

    • a sum of total curvature and derivative. High degree Bézier curves are often used as smooth representations, where computational efficiency is a practical concern. Subdivision can produce PL approximations for a given B\\'ezier curve, fulfilling the above two conditions. The primary contributions are:        (i a priori bounds on the number of subdivision iterations sufficient to achieve a PL approximation that is ambient isotopic to the original B\\'ezier curve, and        (ii improved iteration bounds over those previously established.

  12. On the dipole approximation with error estimates

    Science.gov (United States)

    Boßmann, Lea; Grummt, Robert; Kolb, Martin

    2018-01-01

    The dipole approximation is employed to describe interactions between atoms and radiation. It essentially consists of neglecting the spatial variation of the external field over the atom. Heuristically, this is justified by arguing that the wavelength is considerably larger than the atomic length scale, which holds under usual experimental conditions. We prove the dipole approximation in the limit of infinite wavelengths compared to the atomic length scale and estimate the rate of convergence. Our results include N-body Coulomb potentials and experimentally relevant electromagnetic fields such as plane waves and laser pulses.

  13. Static correlation beyond the random phase approximation

    DEFF Research Database (Denmark)

    Olsen, Thomas; Thygesen, Kristian Sommer

    2014-01-01

    derived from Hedin's equations (Random Phase Approximation (RPA), Time-dependent Hartree-Fock (TDHF), Bethe-Salpeter equation (BSE), and Time-Dependent GW) all reproduce the correct dissociation limit. We also show that the BSE improves the correlation energies obtained within RPA and TDHF significantly...... for intermediate binding distances. A Hubbard model for the dimer allows us to obtain exact analytical results for the various approximations, which is readily compared with the exact diagonalization of the model. Moreover, the model is shown to reproduce all the qualitative results from the ab initio calculations...

  14. Faster and Simpler Approximation of Stable Matchings

    Directory of Open Access Journals (Sweden)

    Katarzyna Paluch

    2014-04-01

    Full Text Available We give a 3 2 -approximation algorithm for finding stable matchings that runs in O(m time. The previous most well-known algorithm, by McDermid, has the same approximation ratio but runs in O(n3/2m time, where n denotes the number of people andm is the total length of the preference lists in a given instance. In addition, the algorithm and the analysis are much simpler. We also give the extension of the algorithm for computing stable many-to-many matchings.

  15. An approximate analytical approach to resampling averages

    DEFF Research Database (Denmark)

    Malzahn, Dorthe; Opper, M.

    2004-01-01

    Using a novel reformulation, we develop a framework to compute approximate resampling data averages analytically. The method avoids multiple retraining of statistical models on the samples. Our approach uses a combination of the replica "trick" of statistical physics and the TAP approach for appr......Using a novel reformulation, we develop a framework to compute approximate resampling data averages analytically. The method avoids multiple retraining of statistical models on the samples. Our approach uses a combination of the replica "trick" of statistical physics and the TAP approach...

  16. APPROXIMATION OF PROBABILITY DISTRIBUTIONS IN QUEUEING MODELS

    Directory of Open Access Journals (Sweden)

    T. I. Aliev

    2013-03-01

    Full Text Available For probability distributions with variation coefficient, not equal to unity, mathematical dependences for approximating distributions on the basis of first two moments are derived by making use of multi exponential distributions. It is proposed to approximate distributions with coefficient of variation less than unity by using hypoexponential distribution, which makes it possible to generate random variables with coefficient of variation, taking any value in a range (0; 1, as opposed to Erlang distribution, having only discrete values of coefficient of variation.

  17. Approximate Controllability of Fractional Integrodifferential Evolution Equations

    Directory of Open Access Journals (Sweden)

    R. Ganesh

    2013-01-01

    Full Text Available This paper addresses the issue of approximate controllability for a class of control system which is represented by nonlinear fractional integrodifferential equations with nonlocal conditions. By using semigroup theory, p-mean continuity and fractional calculations, a set of sufficient conditions, are formulated and proved for the nonlinear fractional control systems. More precisely, the results are established under the assumption that the corresponding linear system is approximately controllable and functions satisfy non-Lipschitz conditions. The results generalize and improve some known results.

  18. Approximated Fractional Order Chebyshev Lowpass Filters

    Directory of Open Access Journals (Sweden)

    Todd Freeborn

    2015-01-01

    Full Text Available We propose the use of nonlinear least squares optimization to approximate the passband ripple characteristics of traditional Chebyshev lowpass filters with fractional order steps in the stopband. MATLAB simulations of (1+α, (2+α, and (3+α order lowpass filters with fractional steps from α = 0.1 to α = 0.9 are given as examples. SPICE simulations of 1.2, 1.5, and 1.8 order lowpass filters using approximated fractional order capacitors in a Tow-Thomas biquad circuit validate the implementation of these filter circuits.

  19. Approximate Inference and Deep Generative Models

    CERN Multimedia

    CERN. Geneva

    2018-01-01

    Advances in deep generative models are at the forefront of deep learning research because of the promise they offer for allowing data-efficient learning, and for model-based reinforcement learning. In this talk I'll review a few standard methods for approximate inference and introduce modern approximations which allow for efficient large-scale training of a wide variety of generative models. Finally, I'll demonstrate several important application of these models to density estimation, missing data imputation, data compression and planning.

  20. Approximation result toward nearest neighbor heuristic

    Directory of Open Access Journals (Sweden)

    Monnot Jér"me

    2002-01-01

    Full Text Available In this paper, we revisit the famous heuristic called nearest neighbor (N N for the traveling salesman problem under maximization and minimization goal. We deal with variants where the edge costs belong to interval Ša;taĆ for a>0 and t>1, which certainly corresponds to practical cases of these problems. We prove that NN is a (t+1/2t-approximation for maxTSPŠa;taĆ and a 2/(t+1-approximation for minTSPŠa;taĆ under the standard performance ratio. Moreover, we show that these ratios are tight for some instances.

  1. Inverse Mapping Structures onto Transparency

    Science.gov (United States)

    Ferris, Kim F.; Sun, Xin; Whitney, Paul A.

    2008-03-01

    Composite materials have continued to make a number of improvements in physical properties (mechanical moduli), but lag behind in optical responses such as transparency. The hybrid nature of the composite material, particle and host matrix, divides light scattering issues into particle size regimes, where the particle size d >> lambda and approximations such as anomalous dispersion have proven useful, and dceramic-polymer composite as a case example, we have used black box optimization methods to examine the practical bounds for each regime and to assess design rules. These guidelines suggest limitations for particle morphologies and the optical properties of the component materials.

  2. Inverse m-matrices and ultrametric matrices

    CERN Document Server

    Dellacherie, Claude; San Martin, Jaime

    2014-01-01

    The study of M-matrices, their inverses and discrete potential theory is now a well-established part of linear algebra and the theory of Markov chains. The main focus of this monograph is the so-called inverse M-matrix problem, which asks for a characterization of nonnegative matrices whose inverses are M-matrices. We present an answer in terms of discrete potential theory based on the Choquet-Deny Theorem. A distinguished subclass of inverse M-matrices is ultrametric matrices, which are important in applications such as taxonomy. Ultrametricity is revealed to be a relevant concept in linear algebra and discrete potential theory because of its relation with trees in graph theory and mean expected value matrices in probability theory. Remarkable properties of Hadamard functions and products for the class of inverse M-matrices are developed and probabilistic insights are provided throughout the monograph.

  3. Recurrent Neural Network for Computing Outer Inverse.

    Science.gov (United States)

    Živković, Ivan S; Stanimirović, Predrag S; Wei, Yimin

    2016-05-01

    Two linear recurrent neural networks for generating outer inverses with prescribed range and null space are defined. Each of the proposed recurrent neural networks is based on the matrix-valued differential equation, a generalization of dynamic equations proposed earlier for the nonsingular matrix inversion, the Moore-Penrose inversion, as well as the Drazin inversion, under the condition of zero initial state. The application of the first approach is conditioned by the properties of the spectrum of a certain matrix; the second approach eliminates this drawback, though at the cost of increasing the number of matrix operations. The cases corresponding to the most common generalized inverses are defined. The conditions that ensure stability of the proposed neural network are presented. Illustrative examples present the results of numerical simulations.

  4. Forward modeling. Route to electromagnetic inversion

    Energy Technology Data Exchange (ETDEWEB)

    Groom, R.; Walker, P. [PetRos EiKon Incorporated, Ontario (Canada)

    1996-05-01

    Inversion of electromagnetic data is a topical subject in the literature, and much time has been devoted to understanding the convergence properties of various inverse methods. The relative lack of success of electromagnetic inversion techniques is partly attributable to the difficulties in the kernel forward modeling software. These difficulties come in two broad classes: (1) Completeness and robustness, and (2) convergence, execution time and model simplicity. If such problems exist in the forward modeling kernel, it was demonstrated that inversion can fail to generate reasonable results. It was suggested that classical inversion techniques, which are based on minimizing a norm of the error between data and the simulated data, will only be successful when these difficulties in forward modeling kernels are properly dealt with. 4 refs., 5 figs.

  5. Stochastic Gabor reflectivity and acoustic impedance inversion

    Science.gov (United States)

    Hariri Naghadeh, Diako; Morley, Christopher Keith; Ferguson, Angus John

    2018-02-01

    To delineate subsurface lithology to estimate petrophysical properties of a reservoir, it is possible to use acoustic impedance (AI) which is the result of seismic inversion. To change amplitude to AI, removal of wavelet effects from the seismic signal in order to get a reflection series, and subsequently transforming those reflections to AI, is vital. To carry out seismic inversion correctly it is important to not assume that the seismic signal is stationary. However, all stationary deconvolution methods are designed following that assumption. To increase temporal resolution and interpretation ability, amplitude compensation and phase correction are inevitable. Those are pitfalls of stationary reflectivity inversion. Although stationary reflectivity inversion methods are trying to estimate reflectivity series, because of incorrect assumptions their estimations will not be correct, but may be useful. Trying to convert those reflection series to AI, also merging with the low frequency initial model, can help us. The aim of this study was to apply non-stationary deconvolution to eliminate time variant wavelet effects from the signal and to convert the estimated reflection series to the absolute AI by getting bias from well logs. To carry out this aim, stochastic Gabor inversion in the time domain was used. The Gabor transform derived the signal’s time–frequency analysis and estimated wavelet properties from different windows. Dealing with different time windows gave an ability to create a time-variant kernel matrix, which was used to remove matrix effects from seismic data. The result was a reflection series that does not follow the stationary assumption. The subsequent step was to convert those reflections to AI using well information. Synthetic and real data sets were used to show the ability of the introduced method. The results highlight that the time cost to get seismic inversion is negligible related to general Gabor inversion in the frequency domain. Also

  6. Quantum cognition based on an ambiguous representation derived from a rough set approximation.

    Science.gov (United States)

    Gunji, Yukio-Pegio; Sonoda, Kohei; Basios, Vasileios

    2016-03-01

    Over the last years, in a series papers by Arecchi and others, a model for the cognitive processes involved in decision making has been proposed and investigated. The key element of this model is the expression of apprehension and judgment, basic cognitive process of decision making, as an inverse Bayes inference classifying the information content of neuron spike trains. It has been shown that for successive plural stimuli this inference, equipped with basic non-algorithmic jumps, is affected by quantum-like characteristics. We show here that such a decision making process is related consistently with an ambiguous representation by an observer within a universe of discourse. In our work the ambiguous representation of an object or a stimuli is defined as a pair of maps from objects of a set to their representations, where these two maps are interrelated in a particular structure. The a priori and a posteriori hypotheses in Bayes inference are replaced by the upper and lower approximations, correspondingly, for the initial data sets that are derived with respect to each map. Upper and lower approximations herein are defined in the context of "rough set" analysis. The inverse Bayes inference is implemented by the lower approximations with respect to the one map and for the upper approximation with respect to the other map for a given data set. We show further that, due to the particular structural relation between the two maps, the logical structure of such combined approximations can only be expressed as an orthomodular lattice and therefore can be represented by a quantum rather than a Boolean logic. To our knowledge, this is the first investigation aiming to reveal the concrete logic structure of inverse Bayes inference in cognitive processes. Copyright © 2016. Published by Elsevier Ireland Ltd.

  7. Source rupture process inversion of the 2013 Lushan earthquake, China

    Directory of Open Access Journals (Sweden)

    Zhang Lifen

    2013-05-01

    Full Text Available The spatial and temporal slip distribution of the Lushan earthquake was estimated using teleseismic body wave data. To perform a stable inversion, we applied smoothing constraints and determined their optimal relative weights on the observed data using an optimized Akaike’s Bayesian Information Criterion (ABIC. The inversion generated the source parameters. Strike, dip and slip were 218°, 39° and 100. 8°, respectively. A seismic moment (M0 was 2. 1 × 1020 Nm with a moment magnitude (Mw of 6. 8, and a source duration was approximately 30 second. The rupture propagated along the dip direction, and the maximum slip occurred at the hypocenter. The maximum slip was approximately 2. 1 m, although this earthquake did not cause an apparent surface rupture. The energy was mainly released within 10 second. In addition, the Lushan earthquake was apparently related to the 2008 Wenchuan earthquake. However, the question of whether it was an aftershock of the Wenchuan earthquake requires further study.

  8. Using machine learning to accelerate sampling-based inversion

    Science.gov (United States)

    Valentine, A. P.; Sambridge, M.

    2017-12-01

    In most cases, a complete solution to a geophysical inverse problem (including robust understanding of the uncertainties associated with the result) requires a sampling-based approach. However, the computational burden is high, and proves intractable for many problems of interest. There is therefore considerable value in developing techniques that can accelerate sampling procedures.The main computational cost lies in evaluation of the forward operator (e.g. calculation of synthetic seismograms) for each candidate model. Modern machine learning techniques-such as Gaussian Processes-offer a route for constructing a computationally-cheap approximation to this calculation, which can replace the accurate solution during sampling. Importantly, the accuracy of the approximation can be refined as inversion proceeds, to ensure high-quality results.In this presentation, we describe and demonstrate this approach-which can be seen as an extension of popular current methods, such as the Neighbourhood Algorithm, and bridges the gap between prior- and posterior-sampling frameworks.

  9. Bayesian ISOLA: new tool for automated centroid moment tensor inversion

    Science.gov (United States)

    Vackář, Jiří; Burjánek, Jan; Gallovič, František; Zahradník, Jiří; Clinton, John

    2017-04-01

    Focal mechanisms are important for understanding seismotectonics of a region, and they serve as a basic input for seismic hazard assessment. Usually, the point source approximation and the moment tensor (MT) are used. We have developed a new, fully automated tool for the centroid moment tensor (CMT) inversion in a Bayesian framework. It includes automated data retrieval, data selection where station components with various instrumental disturbances and high signal-to-noise are rejected, and full-waveform inversion in a space-time grid around a provided hypocenter. The method is innovative in the following aspects: (i) The CMT inversion is fully automated, no user interaction is required, although the details of the process can be visually inspected latter on many figures which are automatically plotted.(ii) The automated process includes detection of disturbances based on MouseTrap code, so disturbed recordings do not affect inversion.(iii) A data covariance matrix calculated from pre-event noise yields an automated weighting of the station recordings according to their noise levels and also serves as an automated frequency filter suppressing noisy frequencies.(iv) Bayesian approach is used, so not only the best solution is obtained, but also the posterior probability density function.(v) A space-time grid search effectively combined with the least-squares inversion of moment tensor components speeds up the inversion and allows to obtain more accurate results compared to stochastic methods. The method has been tested on synthetic and observed data. It has been tested by comparison with manually processed moment tensors of all events greater than M≥3 in the Swiss catalogue over 16 years using data available at the Swiss data center (http://arclink.ethz.ch). The quality of the results of the presented automated process is comparable with careful manual processing of data. The software package programmed in Python has been designed to be as versatile as possible in

  10. Including geological information in the inverse problem of palaeothermal reconstruction

    Science.gov (United States)

    Trautner, S.; Nielsen, S. B.

    2003-04-01

    of geochemical data: the smoothest model approach, with synthetic examples. Geophysical Journal International, 109, 78-95. Nielsen, S.B, 1998. Inversion and sensitivity analysis in basin modelling. Geoscience 98. Keele University, UK, Abstract Volume, 56. Nielsen, S.B. and Gallagher, K., 1999. Efficient sampling of 3-D basin modelling scenarios. Extended Abstracts Volume, 1999 AAPG International Conference &Exhibition, Birmingham, England, September 12-15, 1999, p. 369 - 372. Trautner S. and Nielsen, S.B., 2003. 2-D inverse thermal modelling in the Norwegian shelf using Fast Approximate Forward (FAF) solutions. In R. Marzi and Duppenbecker, S. (Ed.), Multi-Dimensional Basin Modeling, AAPG, in press.

  11. Linear-scaling time-dependent density-functional theory beyond the Tamm-Dancoff approximation: Obtaining efficiency and accuracy with in situ optimised local orbitals

    Energy Technology Data Exchange (ETDEWEB)

    Zuehlsdorff, T. J., E-mail: tjz21@cam.ac.uk; Payne, M. C. [Cavendish Laboratory, J. J. Thomson Avenue, Cambridge CB3 0HE (United Kingdom); Hine, N. D. M. [Department of Physics, University of Warwick, Coventry CV4 7AL (United Kingdom); Haynes, P. D. [Department of Materials, Imperial College London, Exhibition Road, London SW7 2AZ (United Kingdom); Department of Physics, Imperial College London, Exhibition Road, London SW7 2AZ (United Kingdom); Thomas Young Centre for Theory and Simulation of Materials, Imperial College London, Exhibition Road, London SW7 2AZ (United Kingdom)

    2015-11-28

    We present a solution of the full time-dependent density-functional theory (TDDFT) eigenvalue equation in the linear response formalism exhibiting a linear-scaling computational complexity with system size, without relying on the simplifying Tamm-Dancoff approximation (TDA). The implementation relies on representing the occupied and unoccupied subspaces with two different sets of in situ optimised localised functions, yielding a very compact and efficient representation of the transition density matrix of the excitation with the accuracy associated with a systematic basis set. The TDDFT eigenvalue equation is solved using a preconditioned conjugate gradient algorithm that is very memory-efficient. The algorithm is validated on a small test molecule and a good agreement with results obtained from standard quantum chemistry packages is found, with the preconditioner yielding a significant improvement in convergence rates. The method developed in this work is then used to reproduce experimental results of the absorption spectrum of bacteriochlorophyll in an organic solvent, where it is demonstrated that the TDA fails to reproduce the main features of the low energy spectrum, while the full TDDFT equation yields results in good qualitative agreement with experimental data. Furthermore, the need for explicitly including parts of the solvent into the TDDFT calculations is highlighted, making the treatment of large system sizes necessary that are well within reach of the capabilities of the algorithm introduced here. Finally, the linear-scaling properties of the algorithm are demonstrated by computing the lowest excitation energy of bacteriochlorophyll in solution. The largest systems considered in this work are of the same order of magnitude as a variety of widely studied pigment-protein complexes, opening up the possibility of studying their properties without having to resort to any semiclassical approximations to parts of the protein environment.

  12. Radiation forces in the discrete dipole approximation

    NARCIS (Netherlands)

    Hoekstra, A.G.; Frijlink, M.O.; Waters, L.B.F.M.; Sloot, P.M.A.

    2001-01-01

    The theory of the discrete-dipole approximation (DDA) for light scattering is extended to allow for the calculation of radiation forces on each dipole in the DDA model. Starting with the theory of Draine and Weingartner [Astrophys. J. 470, 551 (1996)] we derive an expression for the radiation force

  13. Perturbation of operators and approximation of spectrum

    Indian Academy of Sciences (India)

    The pure linear algebraic approach is the main advantage of the results here. Keywords. Operator .... The paper is organized as follows. In §2, the approximation results are extended to the case of a one-parameter norm continuous family of operators. In §3, the spectral gap prediction results are proved with some examples.

  14. Isotopic Approximation of Implicit Curves and Surfaces

    NARCIS (Netherlands)

    Plantinga, Simon; Vegter, Gert

    2004-01-01

    Implicit surfaces are defined as the zero set of a function F: R3 → R. Although several algorithms exist for generating piecewise linear approximations, most of them are based on a user-defined stepsize or bounds to indicate the precision, and therefore cannot guarantee topological correctness.

  15. A rational approximation of the effectiveness factor

    DEFF Research Database (Denmark)

    Wedel, Stig; Luss, Dan

    1980-01-01

    A fast, approximate method of calculating the effectiveness factor for arbitrary rate expressions is presented. The method does not require any iterative or interpolative calculations. It utilizes the well known asymptotic behavior for small and large Thiele moduli to derive a rational function w...

  16. An approximate analytical approach to resampling averages

    DEFF Research Database (Denmark)

    Malzahn, Dorthe; Opper, M.

    2004-01-01

    Using a novel reformulation, we develop a framework to compute approximate resampling data averages analytically. The method avoids multiple retraining of statistical models on the samples. Our approach uses a combination of the replica "trick" of statistical physics and the TAP approach for appr...

  17. Approximate solutions to variational inequalities and applications

    Directory of Open Access Journals (Sweden)

    M. Beatrice Lignola

    1994-11-01

    Full Text Available The aim of this paper is to investigate two concepts of approximate solutions to parametric variational inequalities in topological vector spaces for which the corresponding solution map is closed graph and/or lower semicontinuous and to apply the results to the stability of optimization problems with variational inequality constrains.

  18. Nanostructures: Scattering beyond the Born approximation

    NARCIS (Netherlands)

    Grigoriev, S.V.; Syromyatnikov, A. V.; Chumakov, A. P.; Grigoryeva, N.A.; Napolskii, K.S.; Roslyakov, I. V.; Eliseev, A.A.; Petukhov, A.V.; Eckerlebe, H.

    2010-01-01

    The neutron scattering on a two-dimensional ordered nanostructure with the third nonperiodic dimension can go beyond the Born approximation. In our model supported by the exact theoretical solution a well-correlated hexagonal porous structure of anodic aluminum oxide films acts as a peculiar

  19. Large hierarchies from approximate R symmetries

    International Nuclear Information System (INIS)

    Kappl, Rolf; Ratz, Michael; Vaudrevange, Patrick K.S.

    2008-12-01

    We show that hierarchically small vacuum expectation values of the superpotential in supersymmetric theories can be a consequence of an approximate R symmetry. We briefly discuss the role of such small constants in moduli stabilization and understanding the huge hierarchy between the Planck and electroweak scales. (orig.)

  20. Approximability and Parameterized Complexity of Minmax Values

    DEFF Research Database (Denmark)

    Hansen, Kristoffer Arnsfelt; Hansen, Thomas Dueholm; Miltersen, Peter Bro

    2008-01-01

    We consider approximating the minmax value of a multi player game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with a precision of ε log n digits (for any constant ε > 0) is NP-hard, where n is the size of the game. On the other hand......, approximating the value with a precision of c log log n digits (for any constant c ≥ 1) can be done in quasi-polynomial time. We consider the parameterized complexity of the problem, with the parameter being the number of pure strategies k of the player for which the minmax value is computed. We show...... that if there are three players, k = 2 and there are only two possible rational payoffs, the minmax value is a rational number and can be computed exactly in linear time. In the general case, we show that the value can be approximated wigh any polynomial number of digits of accuracy in time n^O(k) . On the other hand, we...