Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 190 for “"approximation error"”.

  1. A Study Of Approximation Error In Eulerian Hydrocodes

    In this study, we examine a number of approximations in the formulation of hydrocodes. These approximations were borne out of an original requirement for the code to run as fast as possible i.e. with accuracy being secondary to speed. Many of these approximations originated from the 1970’s when …

    uab Repository record for A Study Of Approximation Error In Eulerian Hydrocodes (opens in a new tab)

  2. Compensation of model uncertainties in damage identification by means of the approximation error approach

    This work presents an application of the Approximation Error Approach (AEA) in the context of Structural Health Monitoring (SHM). Based on the Bayesian framework of statistical inversion, this approach allows one to compensate for errors caused by incorrect modeling of a physical system while still …

    brazil-uerj Repository record for Compensation of model uncertainties in damage identification by means of the approximation error approach (opens in a new tab)

  3. Exponentially Convergent Generalized Finite Element Method for Multi-scale Problems

    … I work to identify a new class of local approximation spaces with good approximation properties. This is carried out for the equilibrium problem of linear elasticity. The choice of local approximation spaces is motivated by the kolmogorov n-width. Part of my thesis work develops an …

    lsu-thes Repository record for Exponentially Convergent Generalized Finite Element Method for Multi-scale Problems (opens in a new tab)

  4. DEEP NEURAL NETWORK APPROXIMATION VIA FUNCTION COMPOSITIONS

    … learning problems. This thesis focuses on the approximation theory of deep neural networks. We provide (nearly optimal) approximation error estimates in terms of the width and depth when constructing ReLU networks, via the idea of function compositions, to uniformly approximate polynomials, …

    nus Repository record for DEEP NEURAL NETWORK APPROXIMATION VIA FUNCTION COMPOSITIONS (opens in a new tab) Download file for DEEP NEURAL NETWORK APPROXIMATION VIA FUNCTION COMPOSITIONS (opens in a new tab)

  5. Kompiuterinis biojutiklių su fermento sluoksnio nelygumais modeliavimas /

    In this work approximation error of two-dimensional biosensor with rough surface model to one-dimensional model was analysed. Two-dimensional model was solved using altering directions implicit method, one-dimensional model - using implicit differences method. In order to decrease number of …

    vilnius Repository record for Kompiuterinis biojutiklių su fermento sluoksnio nelygumais modeliavimas / (opens in a new tab)

  6. Markov Approximations: The Characterization of Undermodeling Errors

    … a new perspective on different sources of errors to describe the impact of undermodeling. Our view is that modeling errors can be decomposed into two primary sources of errors: the approximation error and the estimation error. This thesis takes a first step towards exploring the …

    byu Repository record for Markov Approximations: The Characterization of Undermodeling Errors (opens in a new tab) Download PDF for Markov Approximations: The Characterization of Undermodeling Errors (opens in a new tab)

  7. Data-Driven Koopman Operator Approximations for Piezoelectric Composites with Hysteresis

    … a direct finite element model. Second, novel error bounds are derived for data-driven Koopman operator approximations in vector- valued reproducing kernel Hilbert spaces, explicitly decomposing the total prediction error into sample and approximation error terms. Third, an adaptive greedy …

    vt Repository record for Data-Driven Koopman Operator Approximations for Piezoelectric Composites with Hysteresis (opens in a new tab)

  8. A Collage-Based Approach to Inverse Optimal Control Problems with Unique Solutions

    … are often formulated as the minimization of an approximation error over a set of parameters. Collage-type methods bound the approximation error by a quantity that is computationally preferable to optimize. We demonstrate this method through a variety of example scenarios and discuss its efficacy …

    guelph Repository record for A Collage-Based Approach to Inverse Optimal Control Problems with Unique Solutions (opens in a new tab)

  9. Error Visualization in Comparison of B-Spline Surfaces

    … portion of the original surface. Typically, the approximation error in such cases is measured with a view to minimize it. The data associated with the error between two matching surfaces is large and needs to be filtered into meaningful information.This research looks at suitable norms for …

    vt Repository record for Error Visualization in Comparison of B-Spline Surfaces (opens in a new tab)

  10. Local Mixture Model in Hilbert Space

    … construct local mixture models. We analyze the approximation error asymptotically in the Hilbert space. After that, we will discuss the convexity structure of local mixture models. There are two forms of convexity conditions to consider, first due to positivity in the $-1$-affine structure and …

    waterloo Repository record for Local Mixture Model in Hilbert Space (opens in a new tab)

  11. A Collage-Based Approach to a Sturm-Liouville Boundary Value Inverse Problem with Boundary Data

    … [10]. Unlike it’s predecessors that minimize the approximation error directly, Collage methods bound the approximation error above by a function which is more readily minimizable. Here we focus on solving inverse problems for Sturm-Liouville BVPs using a collage-based approach. In addition to an …

    guelph Repository record for A Collage-Based Approach to a Sturm-Liouville Boundary Value Inverse Problem with Boundary Data (opens in a new tab)

  12. Multilevel Summation for the Fast Evaluation of Forces for the Simulation of Biomolecules

    … along with a precise operation count. The approximation error from the method is analyzed, with error bounds formulated in terms of the fundamental method parameters. The cost and error analyses enable the determination of optimal method parameters for a desired error tolerance. Various …

    uiuc Repository record for Multilevel Summation for the Fast Evaluation of Forces for the Simulation of Biomolecules (opens in a new tab)

  13. A Collage-Based Approach to Inverse Problems for Nonlinear Systems of Partial Differential Equations

    … theorem, the collage theorem, one can bound the approximation error above by the so-called collage distance, which is more readily minimizable. By minimizing the collage distance the approximation error can be controlled. In the case of nonlinear PDEs we consider the weak formulation of the PDE …

    guelph Repository record for A Collage-Based Approach to Inverse Problems for Nonlinear Systems of Partial Differential Equations (opens in a new tab)

  14. Low rank is in the eye of the beholder

    … machine learning rely extensively on low-rank approximations to extract structure from high-dimensional data. Yet determining when a matrix is well approximated by one of lower rank—and selecting appropriate rank and approximation error thresholds—is inherently context-dependent: the answer may …

    jhu Repository record for Low rank is in the eye of the beholder (opens in a new tab)

  15. Equalization of a Non-linear Phase of a Low-pass Filter

    … by solving the problem of minimizing the approximation error for the group delay by using a suitable optimization algorithm, the free parameters (poles and zeros) are varied in a way to minimize the approximation error according to the assumed error criterion. Those set of parameters found …

    portland-state Repository record for Equalization of a Non-linear Phase of a Low-pass Filter (opens in a new tab)

  16. Real-Time Detection of GPS Spoofing Attack with Hankel Matrix and Unwrapped Phase Angle Data

    … attacks. Previous researchers exploited low-rank approximation of Hankel Matrix to differentiate between FDIA and physical events. We have demonstrated that, together with angle unwrapping algorithm, low-rank approximation of Hankel Matrix can help us separating GPS-spoofing attack with FDIA. The …

    vt Repository record for Real-Time Detection of GPS Spoofing Attack with Hankel Matrix and Unwrapped Phase Angle Data (opens in a new tab)

  17. Post-Training Optimization of Cross-layer Approximate Computing for Edge Inference of Deep Learning Applications

    … are resilient to input noise and computational errors; therefore, a reasonable approach to decreasing such hardware requirements is to embrace DNN resiliency and utilize approximate computing techniques at different system design layers. This approach requires, however, constant monitoring as …

    qucosa-diss

  18. Two-dimensional zero-phase FIR filter design with nonuniform frequency sampling

    … desired filter frequency response such that the approximation error in the designed filter is reduced significantly and the shape performance is high. Three main types of two-dimensional zero-phase FIR filters that are most frequently used in practice have been considered: rectangular, circular, …

    concordia Download PDF for Two-dimensional zero-phase FIR filter design with nonuniform frequency sampling (opens in a new tab)

  19. An Improved Error-Diffusion Approach for Generating Mesh Models of Images

    … triangle-mesh models of images, known as the error diffusion (ED) method. Unfortunately, the ED method, which chooses triangulation connectivity via a Delaunay triangulation, typically yields triangulations in which many (triangulation) edges crosscut image edges (i.e., discontinuities in the …

    uvic Repository record for An Improved Error-Diffusion Approach for Generating Mesh Models of Images (opens in a new tab)

  20. An Interpolation-Based Approach to Optimal H<sub>∞</sub> Model Reduction

    … approach, and give a method for finding the approximation to a state-space symmetric dynamical system which is optimal over a family of interpolants to the full order system. This family of interpolants has a simple parameterization that simplifies a direct search for the optimal interpolant. …

    vt Repository record for An Interpolation-Based Approach to Optimal H<sub>∞</sub> Model Reduction (opens in a new tab)

Page 1 of 10