Solving Burgers’ equation with quantum computing

نویسندگان

چکیده

Abstract Computational fluid dynamics (CFD) simulations are a vital part of the design process in aerospace industry. Although reliable CFD results can be obtained with turbulence models, direct numerical simulation complex bodies three spatial dimensions (3D) is impracticable due to massive amount computational elements. For instance, 3D turbulent boundary-layer over wing commercial jetliner that resolves all relevant length scales using serial solver on modern digital computer would take approximately 750 million years or roughly 20% earth’s age. Over past 25 years, quantum computers have become object great interest worldwide as powerful algorithms been constructed for several important, computationally challenging problems provide enormous speed-up best-known classical algorithms. In this paper, we adapt recently introduced algorithm partial differential equations Burgers’ equation and develop determines its solutions. We used our verify find flow solution when shockwave not present. The were compared to: (i) an exact analytical without shockwave; (ii) flows shockwave. Excellent agreement was found both cases, error comparable solver.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reproducing Kernel Space Hilbert Method for Solving Generalized Burgers Equation

In this paper, we present a new method for solving Reproducing Kernel Space (RKS) theory, and iterative algorithm for solving Generalized Burgers Equation (GBE) is presented. The analytical solution is shown in a series in a RKS, and the approximate solution u(x,t) is constructed by truncating the series. The convergence of u(x,t) to the analytical solution is also proved.

متن کامل

Solving Burgers' Equation Using Optimal Rational Approximations

Abstra t. We solve vis ous Burger's equation using a fast and a urate algorithm referred to here as the redu tion algorithm for omputing near optimal rational approximations. Given a proper rational fun tion with n poles, the redu tion algorithm omputes (for a desired L ∞ -approximation error) a rational approximation of the same form, but with a (near) optimally small number m ≪ n of poles. Al...

متن کامل

Solving Burgers’ equation using C-N scheme and RBF collocation

Burgers’ equations is one of the typical nonlinear evolutionary partial differential equations. In this paper, a mesh-free method is proposed to solve the Burgers’ equation numerically using the finite difference and collocation methods. After the temporal discretization of the equation using C-N Scheme, the solution is approximated spatially by Radial Basis Function (RBF). The numerical result...

متن کامل

Numerical Solution of Turbulence Problems by Solving Burgers' Equation

In this work we generate the numerical solutions of Burgers’ equation by applying the Crank-Nicholson method and different schemes for solving nonlinear systems, instead of using Hopf-Cole transformation to reduce Burgers’ equation into the linear heat equation. The method is analyzed on two test problems in order to check its efficiency on different kinds of initial conditions. Numerical solut...

متن کامل

Fourth-order finite difference method for solving Burgers' equation

In this paper, we present fourth-order finite difference method for solving nonlinear one-dimensional Burgers equation. This method is unconditionally stable. The convergence analysis of the present method is studied and an upper bound for the error is derived. Numerical comparisons are made with most of the existing numerical methods for solving this equation. 2005 Elsevier Inc. All rights res...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quantum Information Processing

سال: 2021

ISSN: ['1573-1332', '1570-0755']

DOI: https://doi.org/10.1007/s11128-021-03391-8