scholarly journals Quantum gate identification: Error analysis, numerical results and optical experiment

Automatica ◽  
2019 ◽  
Vol 101 ◽  
pp. 269-279 ◽  
Author(s):  
Yuanlong Wang ◽  
Qi Yin ◽  
Daoyi Dong ◽  
Bo Qi ◽  
Ian R. Petersen ◽  
...  
Keyword(s):  
Error Analysis ◽  
Numerical Results ◽  
Quantum Gate ◽  
Identification Error ◽  
Optical Experiment

A NEW INTERFACE CEMENT EQUILIBRATED MORTAR (NICEM) METHOD WITH ROBIN INTERFACE CONDITIONS: THE P1 FINITE ELEMENT CASE

2013 ◽  
Vol 23 (12) ◽  
pp. 2253-2292 ◽  
Author(s):  
CAROLINE JAPHET ◽  
YVON MADAY ◽  
FREDERIC NATAF
Keyword(s):  
Finite Element ◽  
Error Analysis ◽  
Domain Decomposition ◽  
Decomposition Method ◽  
Domain Decomposition Method ◽  
Numerical Results ◽  
New Method ◽  
Interface Conditions ◽  
Well Posed

We design and analyze a new non-conforming domain decomposition method, named the NICEM method, based on Schwarz-type approaches that allows for the use of Robin interface conditions on non-conforming grids. The method is proven to be well posed. The error analysis is performed in 2D and in 3D for P1 elements. Numerical results in 2D illustrate the new method.

scholarly journals A High Accurate and Stable Legendre Transform Based on Block Partitioning and Butterfly Algorithm for NWP

Mathematics ◽  
2019 ◽  
Vol 7 (10) ◽  
pp. 966
Author(s):  
Fukang Yin ◽  
Jianping Wu ◽  
Junqiang Song ◽  
Jinhui Yang
Keyword(s):  
Computational Complexity ◽  
Error Analysis ◽  
Numerical Stability ◽  
High Order ◽  
Numerical Results ◽  
Computational Time ◽  
Legendre Transform ◽  
Practical Application ◽  
Block Partitioning ◽  
Very High

In this paper, we proposed a high accurate and stable Legendre transform algorithm, which can reduce the potential instability for a very high order at a very small increase in the computational time. The error analysis of interpolative decomposition for Legendre transform is presented. By employing block partitioning of the Legendre-Vandermonde matrix and butterfly algorithm, a new Legendre transform algorithm with computational complexity O(Nlog2N /loglogN) in theory and O(Nlog3N) in practical application is obtained. Numerical results are provided to demonstrate the efficiency and numerical stability of the new algorithm.

scholarly journals A New Numerical Algorithm for Two-Point Boundary Value Problems

2014 ◽  
Vol 2014 ◽  
pp. 1-6
Author(s):  
Lihua Guo ◽  
Boying Wu ◽  
Dazhi Zhang
Keyword(s):  
Exact Solution ◽  
Error Analysis ◽  
Numerical Solution ◽  
Boundary Value Problems ◽  
Numerical Algorithm ◽  
Numerical Stability ◽  
Boundary Value ◽  
Numerical Results ◽  
Point Boundary ◽  
Stability And Error Analysis

We present a new numerical algorithm for two-point boundary value problems. We first present the exact solution in the form of series and then prove that then-term numerical solution converges uniformly to the exact solution. Furthermore, we establish the numerical stability and error analysis. The numerical results show the effectiveness of the proposed algorithm.

scholarly journals Numerical Algorithms for Computing Eigenvalues of Discontinuous Dirac System Using Sinc-Gaussian Method

2012 ◽  
Vol 2012 ◽  
pp. 1-13 ◽  
Author(s):  
A. H. Bhrawy ◽  
M. M. Tharwat ◽  
A. Al-Fhaid
Keyword(s):  
Error Analysis ◽  
Numerical Algorithms ◽  
High Accuracy ◽  
Transmission Conditions ◽  
Numerical Results ◽  
New Method ◽  
Dirac System ◽  
Sinc Method ◽  
Dirac Systems ◽  
Gaussian Method

The eigenvalues of a discontinuous regular Dirac systems with transmission conditions at the point of discontinuity are computed using the sinc-Gaussian method. The error analysis of this method for solving discontinuous regular Dirac system is discussed. It shows that the error decays exponentially in terms of the number of involved samples. Therefore, the accuracy of the new method is higher than the classical sinc-method. Numerical results indicating the high accuracy and effectiveness of these algorithms are presented. Comparisons with the classical sinc-method are given.

NUMERICAL ANALYSIS OF DEGENERATE CONNECTING ORBITS FOR MAPS

2004 ◽  
Vol 14 (10) ◽  
pp. 3385-3407 ◽  
Author(s):  
WOLF-JÜRGEN BEYN ◽  
THORSTEN HÜLS ◽  
YONGKUI ZOU
Keyword(s):  
Numerical Analysis ◽  
Dynamical Systems ◽  
Numerical Methods ◽  
Error Analysis ◽  
Error Estimates ◽  
Discrete Dynamical Systems ◽  
Numerical Results ◽  
Connecting Orbits ◽  
Theoretical Results ◽  
Degenerate Cases

This paper contains a survey of numerical methods for connecting orbits in discrete dynamical systems. Special emphasis is put on degenerate cases where either the orbit loses transversality or one of its endpoints loses hyperbolicity. Numerical methods that approximate the connecting orbits by finite orbit sequences are described in detail and theoretical results on the error analysis are provided. For most of the degenerate cases we present examples and numerical results that illustrate the applicability of the methods and the validity of the error estimates.

Higher order two-scale finite element error analysis for thermoelastic problem in quasi-periodic perforated structure

2017 ◽  
Vol 28 (07) ◽  
pp. 1750097
Author(s):  
Mingxiang Deng ◽  
Yongping Feng
Keyword(s):  
Finite Element Method ◽  
Finite Element ◽  
Error Analysis ◽  
Thermal Behavior ◽  
Higher Order ◽  
Numerical Results ◽  
Thermoelastic Problem ◽  
Asymptotic Expressions ◽  
Element Error ◽  
Element Method

In this paper, one new coupled higher order two-scale finite element method (TSFEM) for thermoelastic problem in composites is proposed. Firstly, some new two-scale asymptotic expressions and homogenization formulations for the problem are briefly given. Next, some high–low coupled approximate errors corresponding to TSFEM are analyzed. Finally, some numerical results of the displacement and the increment of temperature are presented, which show that TSFEM is an effective method for predicting the mechanical and the thermal behavior of composites in quasi-periodic perforated structure.

Kinematic Identification Method for Cable-Driven Rescue Robots in Unstructured Environments

2003 ◽  
Vol 15 (5) ◽  
pp. 571-578 ◽  
Author(s):  
Satoshi Tadokoro ◽  
◽  
Richard Verhoeven ◽  
Ulrike Zwiers ◽  
Manfred Hiller ◽  
...  
Keyword(s):  
Error Analysis ◽  
Reference Frame ◽  
Large Scale ◽  
Optimal Number ◽  
Parallel Robots ◽  
Kinematic Parameters ◽  
Identification Error ◽  
Unstructured Environments ◽  
Identification Method ◽  
Rescue Robots

Cable-driven parallel robots are being developed for rescue operations in large-scale earthquake disasters. This paper proposes an identification method of kinematic parameters for the installation, such as the position of cable fixture by initializing motion on site. This problem is unique to robots in natural fields, such as disaster sites because the environment is not structured. On the basis of identification error analysis and simulation, the optimal number of measurement points and the size of an identification reference frame are obtained.

scholarly journals A new mixed discontinuous Galerkin method for the electrostatic field

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Abdelhamid Zaghdani ◽  
Mohamed Ezzat
Keyword(s):  
Error Analysis ◽  
Electric Field ◽  
Error Estimate ◽  
Galerkin Method ◽  
Discontinuous Galerkin ◽  
Discontinuous Galerkin Method ◽  
Electrostatic Field ◽  
Mesh Size ◽  
Numerical Results

AbstractWe introduce and analyze a new mixed discontinuous Galerkin method for approximation of an electric field. We carry out its error analysis and prove an error estimate that is optimal in the mesh size. Some numerical results are given to confirm the theoretical convergence.

Sign in / Sign up

Export Citation Format

Share Document